(2-1-2 4)
Syllabus
:
Basic Concepts:
Data Structures, Algorithms, Complexity of algorithms.
Basic data types, Lists, Stacks, Queues.
Trees:
Definition and Implementation; Binary trees, Tree
traversal, Postfix, Prefix notations.
Sets:
Implementation; Dictionary, Hash table, Priority
queues; Advanced Set Representation Methods - Binary search tree, AVL tree,
Balanced tree, Sets with Merge and Find operation.
Directed graphs:
Representation; Single source shortest path problem, All pair shortest path problem, Transitive closure.
Undirected graph :
Minimum spanning tree
Sort Algorithms:
Quick-sort, Heap-sort, Bin-sort, Selection
Memory management, Garbage Collection.
Evaluation Scheme :
Term Examination : 100
Mid-term Examination : 50
Assignments : 50
Some Important Points :
· Assignments will include both laboratory and written exercises. There will be at least five sets of laboratory assignments to be completed)
· Late submission will be penalized by 10% deduction per day.
· Group member will be changed in every assignment.
·
Laboratory work
:
· Set #1 ( Topic Arrays )
· Set #2 ( First part common for all group, second part is included )
· Set #3 ( Graph ) ( Schedule for final viva is included )
Study materials :
·
Includes distribution of marks, question types, and
some model questions.