Saturday, October 22, 2011

DFS mid Sem -2 Syllabus


Ms. B.R.Bhatt

Ø  Algorithm Infix to Postfix,
Ø  Algorithm evalution of postfix Notations
Ø  Algorithm string belongs to grammers
Ø  Algorithm for stack operations(Push ,POP,PEEP & change)
Ø  Sparse Matrix
Ø  Recursion
Ø  Tree-Definitions and Concepts
Ø  Representation of binary tree
Ø  Binary tree traversal (Inorder, postorder, preorder)
Ø  Threaded binary tree
Ø  Binary search trees
Ø  Construct tree from traversal Sequence

Mrs. D.R.Chaudhari:-

LINKED LIST

Ø  Insertion and deletion Doubly Linked list

GRAPH

Ø  Graph-Matrix Representation Of Graphs
Ø  Elementary Graph operations,(Breadth First Search, Depth First Search,Spanning Trees, Shortest path, Minimal spanning tree )

Hashing

Ø  The symbol table
Ø  Hashing Functions
Ø  Collision-Resolution Techniques
Ø  File Structure:
o   Concepts of fields
o   records and files
o   Sequential, Indexed and Relative/Random File Organization
o   Indexing structure for index files
o   hashing for direct files
o   Multi-Key file organization and access methods.


No comments:

Post a Comment