Future Institute of Technology
Department of Computer Science & Engineering
LABORATORY NUMBER: CSE LAB 2
LOCATION: 2ND FLOOR [ ROOM NO. B318(B) ]
DEPARTMENT: CSE [3RD YEAR]
TEACHER-IN-CHARGE: Mr. SANDIP GUPTA, Asst. Prof., CSE
STREAM
& DAY TIME FACULTY LAB ASSISTANT
GROUP
CSE(GR.-A) THURSDAY 9.45 AM – 12:15 PM SANDIP GUPTA DIBYA JYOTI PAL
CSE(GR.-B) FRIDAY 9.45 AM – 12:15 PM SANDIP GUPTA DIBYA JYOTI PAL
UNIVERSITY PRACTICAL EXAMINATION EVALUATION PROCESS
Attendance, Regularity (10)
INTERNAL
Lab Assignment (15) Total=40
The exam will ASSESSMENT
Lab Performance (15)
be conducted
Lab Answer Script with
for 100 marks. EXTERNAL
experiment (40) Total=60
ASSESSMENT
Viva-voce (20)
Total = 100
SUBJECT AREA DESIGN & ANALYSIS OF ALGORITHM [CS591]
PREREQUISITE Familiarity with any operating systems.
In particular:
Entering system.
Using a mouse, keyboard, all computer accessories
etc.
Accessing an application.
Leaving system.
Managing files within system (locating files, opening files,
editing files, saving files, copying files, moving files, deleting
files, etc.).
A strong knowledge in C programming.
Clear concept in data structure like array, linked list, graph,
tree etc.
Future Institute of Technology
Department of Computer Science & Engineering
COURSE OBJECTIVES To design and analysis of algorithms in an effective
and methodologically correct manner.
To understanding about writing algorithms and step
by step approach in solving problems with the help of
fundamental data structures
To acquire knowledge of general techniques for the
design and analysis of algorithms and will be provided
with a collection of significant examples of
representative problems.
COURSE OUTCOMES Upon completion of the subject, students will be able to:
Manipulate the data contained in these data
structures.
Handle operations like searching, insertion, deletion,
traversing mechanism etc. on various data structures
Apply concepts learned in various domains like DBMS,
compiler construction etc.
Use linear and non-linear data structures like stacks,
queues, linked list etc.
Evaluate algorithms and data structures in terms of
time and memory complexity of basic operations.
Design, implement, test, and debug programs using a
variety of data structures including buffer pools, hash
tables, binary and general tree structures, search
trees, tries, heaps, graphs, and B-trees.
Minimum requirement Software:
of Software & Any version of windows operating System + any C compiler
Hardware software or any flavour of UNIX/LINUX OS with gcc Compiler
Hardware:
Intel Pentium 4 or higher microprocessor, 1 GB RAM, 16GB
HDD, VGA 640 x 480 or higher-resolution screen.
References:
1. Ellis Horowitz, Sartaj Sahni, Fundamentals of Computer Algorithms.
2. T. H. Cormen, C. L. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms.
3. J. Kleinberg and E. Tardos, Algorithm Design.
4. Christos Papadimitriou, Sanjoy Dasgupta, and Umesh Vazirani, Algorithms
5. Sara Baase and Allen Van Gelder, Computer Algorithms: Introduction to Design and
Analysis.
Future Institute of Technology
Department of Computer Science & Engineering
INDEX
Assignment Date of Title of Page No. Remarks Teacher’s
No./Expt. No. Performance Assignment/Expt. Signature
Future Institute of Technology
Department of Computer Science & Engineering
LIST OF ASSIGNMENTS
ASSIGNMENT –I (Divide and Conquer Method ) :
1. Write a C Program to find Minimum & Maximum element from an array
of integer.
2. Write a C Program to Implement Binary Search.
3. Write C Program to implement Merge Sort
4. Write a C Program to Implement Quick Sort
ASSIGNMENT –II (Dynamic Programming):
5. Write a C Program to find out the minimum number of scalar
multiplication needed for Matrix Chain Multiplication.
6. Write a C Program to implement All pair shortest path problem (Floyd-
Warshal Algorithm).
7. Write a C Program to implement Single source shortest path problem
(Dijkstra Algorithm).
8. . Write a C Program to implement Single source shortest path problem
(Bellman Ford Algorithm).
9. Write a C Program to implement Travelling Salesman Problem.
ASSIGNMENT –III (Backtracking):
10. Write a C Program to implement 8 Queen’s Problem.
11. Write a C Program to implement Graph Coloring Problem.
Future Institute of Technology
Department of Computer Science & Engineering
ASSIGNMENT –IV (Greedy Method) :
12. Write a C to implement Knapsack Problem.
13. Write a C program to implement Job Sequencing with Deadline
Problem.
14. Write a C program to implement Minimum Cost Spanning Tree (Prim’s
Algorithm).
15. Write a C program to implement Minimum Cost Spanning Tree
(Kruskal’s Algorithm).
ASSIGNMENT –V (Graph Traversal Algorithm) :
16. Write a C Program to Implement Breadth First Search (BFS).
17. Write a C Program to Implement Depth First Search (DFS).
ASSIGNMENT –VI (Branch and Bound) :
18. Write a C Program to Implement 15 puzzle problem.
Future Institute of Technology
Department of Computer Science & Engineering
REPORT ON:………………………………………………..……………………………………………
NAME:……………………………………………………………………..………………………………
DEPARTMENT:………………………………..…………………………………………………………
ROLL NO.…………… SEMESTER:…..………. YEAR:……………..
EXPT. NO.:………………………………………………………..………………..
…………………………………
TITLE:………………………………………………………………………………………………………
………………………………………………………………………………………………………
………………………………………………………………………………………………………
OBJECTIVE:……………………………………………………………………………………………….
………………………………………………………………………………………………………
………………………………………………………………………………………………………
CO-WORKERS:
1 ………………………………………..
2 ……………………………………….. DATE OF PERFORMANCE: …………………
3 ………………………………………. DATE OF SUBMISSION: …………………..
MARKS/GRADE:………………… TEACHER’S SIGNATURE:
…………………………
Future Institute of Technology
Department of Computer Science & Engineering
DATE:
……………………….
