Verify Account

SYLLABUS

Unit - 1 :

Linear Data Structures – List Abstract Data Types (ADTs) – List ADT – Array-based implementation – Linked list implementation – Singly linked lists-Circularly linked lists- Doubly-linked lists – Applications of lists – Polynomial Manipulation – All operations (Insertion, Deletion, Merge, Traversal).

Unit - 2 :

Linear Data Structures – Stacks, Queues Stack ADT – Operations – Applications – Evaluating arithmetic expressions – Conversion of Infix to postifix expression – Queue ADT – Operations – Circular Queue – Priority Queue – deQueue – Applications of queues.

Unit - 3 :

Non Linear Data Structures – Trees Tree ADT – Tree traversals – Binary Tree ADT – Expression trees – Applications of trees – Binary search tree ADT – Threaded Binary Trees – AVL Trees – B-Tree - B+ Tree – Heap – Applications of heap.

Unit - 4 :

Non Linear Data Structures – Graphs Definition – Representation of Graph – Types of graph – Breadth-first traversal – Depth-first traversal – Topological Sort – Bi-connectivity – Cut vertex – Euler circuits – Applications of graphs.

Unit - 5 :

Searching, Sorting And Hashing Techniques Searching – Linear Search – Binary Search. Sorting – Bubble sort – Selection sort – Insertion sort – Shell sort – Radix sort. Hashing – Hash Functions – Separate Chaining – Open Addressing – Rehashing – Extendible Hashing.