- Departments / Centres
OBJECTIVE: On completion of this course the students will be ale to know how information are stored in and retrieved from computer memory.
Development of Algorithms- Notation - Nature of information – transmission of information – primitive data structures : Integer, Real , Character – operation on data structures.
Terminology of non-primitive data structures – storage structures for arrays – structures and arrays of structures – stacks and queues – applications of stacks
Pointers and linked allocation – linked lists – singly linked list – Linked stacks and queues – operations on polynomials – linked dictionary - doubly linked lists - circular linked lists
Graphs - Representation of Graphs - Path Matrix - BFS,DFs - Shortest path problems. Strings - Representation - Manipulations - Pattern Matching
Binary Trees - General Trees - Tree Traversing - operations on Binary trees - Expressions Manipulations - Symbol Table Construction
Selection - Bubble - Merge – Quick,Radix - Linear searching - Binary Searching - Hash Table Methods