NIT Srinagar Syllabus CSE 4th Sem Data Structures
NIT Srinagar Syllabus
4th Semester Syllabus
Basic concept of data, structures and pointers.
Representation, implementation, polynomial representation. Limitations.
Representation, String operations, Implementing String.h library functions.
Static and dynamic implementation. Single, double, circular, multiple linked lists.
Recursion and Stacks. Static and dynamic implementation. Expression evaluation. Infix, postfix expressions, multiple stacks.
Static and dynamic implementation, circular queues, and implementation.
Hash tables implementation. Hashing techniques, single, double.
Memory Management techniques, garbage collection.
Binary trees, binary search trees, static and dynamic implementation. Tree operations, insert, delete, and search.
Implementation, sorting etc.
Sorting and Searching
Different sorting techniques. Insertion sort, selection sort, bubble sort, radix sort, quick sort, merge sort, heap sort.
Representation of graphs, BFS, DFS sort.
- Data Structures by Rajni Jindal
- Data Structures – Schaum’s Series
- Data Structures by Knuth
- Data Structures by Farouzan