BSc CSIT · Semester III
Data Structures and Algorithms syllabus
Official TU syllabus for Data Structures and Algorithms (CSC211): 8 units, 27 topics, 3 credit hours. Every unit links to its notes and solved questions.
1
Introduction to Data Structures & Algorithms
4h · 10 Q- Data types, Data structure and Abstract date type
- Dynamic memory allocation in C
- Introduction to Algorithms
- Asymptotic notations and common functions
2
Stack
4h · 11 Q- Basic Concept of Stack, Stack as an ADT, Stack Operations, Stack Applications
- Conversion from infix to postfix/prefix expression, Evaluation of postfix/ prefix expressions
3
Queue
4h · 8 Q- Basic Concept of Queue, Queue as an ADT, Primitive Operations in Queue
- Linear Queue, Circular Queue, Priority Queue, Queue Applications
4
Recursion
3h · 7 Q- Principle of Recursion, Comparison between Recursion and Iteration, Tail Recursion
- Factorial, Fibonacci Sequence, GCD, Tower of Hanoi(TOH)
- Applications and Efficiency of Recursion
5
Lists
8h · 11 Q- Basic Concept, List and ADT, Array Implementation of Lists, Linked List
- Types of Linked List: Singly Linked List, Doubly Linked List, Circular Linked List.
- Basic operations in Linked List: Node Creation, Node Insertion and Deletion from Beginning, End and Specified Position
- Stack and Queue as Linked List
6
Sorting
8h · 10 Q- Introduction and Types of sorting: Internal and External sort
- Comparison Sorting Algorithms: Bubble, Selection and Insertion Sort, Shell Sort
- Divide and Conquer Sorting: Merge, Quick and Heap Sort
- Efficiency of Sorting Algorithms
7
Searching and Hashing
6h · 10 Q- Introduction to Searching, Search Algorithms: Sequential Search, Binary Search
- Efficiency of Search Algorithms
- Hashing: Hash Function and Hash Tables, Collision Resolution Techniques
8
Trees and Graphs
8h · 18 Q- Concept and Definitions, Basic Operations in Binary Tree, Tree Height, Level and Depth
- Binary Search Tree, Insertion, Deletion, Traversals, Search in BST
- AVL tree and Balancing algorithm, Applications of Trees
- Definition and Representation of Graphs, Graph Traversal, Minimum Spanning Trees: Kruskal and Prims Algorithm
- Shortest Path Algorithms: Dijksrtra Algorithm
Textbooks and references
- Y Langsam, MJ Augenstein and A.M, Tanenbaum Data Structures using C and C++, Prentice Hall India, Second Edition 2015
- Leen Ammeral, Programmes and Data Structures in C, Wiley Professional Computting
- G.W Rowe, Introduction to Data Structure and Algroithms with C and C++, prentice Hall India
- R.L Kruse, B.P. Leung, C.L. Tondo, Data Structure and Program Design in C Prentice-Hall India
Study CSC211 the smart way
Solved questions, flashcards & practice