NIT Srinagar Syllabus CSE 4th Sem Data Structures

NIT Srinagar Syllabus CSE 4th Sem Data Structures

NIT Srinagar Syllabus

4th Semester Syllabus

Data Structures

Introduction

Basic concept of data, structures and pointers.

Arrays
Representation, implementation, polynomial representation. Limitations.

Strings
Representation, String operations, Implementing String.h library functions.

Linked List
Static and dynamic implementation. Single, double, circular, multiple linked lists.

Stacks

Recursion and Stacks. Static and dynamic implementation. Expression evaluation. Infix, postfix expressions, multiple stacks.

Queues

Static and dynamic implementation, circular queues, and implementation.

Hash Tables

Hash tables implementation. Hashing techniques, single, double.

Storage Management

Memory Management techniques, garbage collection.

Trees

Binary trees, binary search trees, static and dynamic implementation. Tree operations, insert, delete, and search.

Heaps

Implementation, sorting etc.

Sorting and Searching

Different sorting techniques. Insertion sort, selection sort, bubble sort, radix sort, quick sort, merge sort, heap sort.

Graphs

Representation of graphs, BFS, DFS sort.

Books Recommended:

  1. Data Structures by Rajni Jindal
  2. Data Structures – Schaum’s Series
  3. Data Structures by Knuth
  4. Data Structures by Farouzan

Leave a Comment