Skip to content
CampusPrep
AD-303 · Data Structures/Official Syllabus

Data Structures (AD-303) - Official Syllabus

1
Unit 1

Introduction to Data Structure

  • Concepts of Data and Information
  • Classification of Data structures
  • Abstract Data Types
  • Implementation aspects: Memory representation
  • Data structures operations and its cost estimation
  • Introduction to linear data structures- Arrays
  • Linked List: Representation of linked list in memory
  • different implementation of linked list
  • Circular linked list
  • doubly linked list, etc
  • Application of linked list: polynomial manipulation using linked list, etc
2
Unit 2

Stacks and Queue

  • Stacks as ADT
  • Different implementation of stack
  • multiple stacks
  • Application of Stack: Conversion of infix to postfix notation using stack
  • evaluation of postfix expression
  • Recursion
  • Queues: Queues as ADT
  • Different implementation of queue
  • Circular queue
  • Concept of Dqueue and Priority Queue
  • Queue simulation
  • Application of queues
3
Unit 3

Tree

  • Definitions - Height, depth, order, degree etc
  • Binary Search Tree - Operations, Traversal, Search
  • AVL Tree
  • Heap
  • Applications and comparison of various types of tree
  • Introduction to forest
  • multi-way Tree
  • B tree
  • B+ tree
  • B* tree and red-black tree
4
Unit 4

Graphs

  • Introduction
  • Classification of graph: Directed and Undirected graphs, etc
  • Representation
  • Graph Traversal: Depth First Search (DFS)
  • Breadth First Search (BFS)
  • Graph algorithm: Minimum Spanning Tree (MST)-Kruskal, Prim’s algorithms
  • Dijkstra’s shortest path algorithm
  • Comparison between different graph algorithms
  • Application of graphs
5
Unit 5

Sorting and Searching

  • Introduction
  • Sort methods like: Bubble Sort
  • Quick sort
  • Selection sort
  • Heap sort
  • Insertion sort
  • Shell sort
  • Merge sort
  • Radix sort
  • comparison of various sorting techniques
  • Searching: Basic Search Techniques: Sequential search
  • Binary search
  • Comparison of search methods
  • Hashing & Indexing
  • Case Study: Application of various data structures in operating system, DBMS etc

Reference Books

  • Data Structures and Algorithms — Aho, Hopcroft, Ullman — Pearson Education
  • Algorithms + Data Structure = Programs — N. Wirth — Prentice Hall
  • An Introduction to Data Structure with application — Jean – Paul Trembly, Paul Sorenson — TMH
  • Data structure – A Pseudocode Approach with C — Richard, GilbergBehrouz, Forouzan — Thomson press
  • Data structure using C and C++ — AM Tanenbaum, Y Langsam, MJ Augustein — Prentice Hall India
  • Data structures & Program Design in C — Robert Kruse, Bruse Leung — Pearson Education
Go to where you left off?

Quick Add to Notes

Save questions, your own notes and screenshots into notes filed by unit. It takes a free account.

Create free account

Have an account? Log in