Data Structure (B.Tech)

Arrays, stacks, queues, linked lists, trees, graphs, searching, sorting and hashing.

6 MonthsDuration 5Chapters31Topics

Enquire now

Syllabus · पाठ्यक्रम

Download PDF

01Unit 1: Introduction, Arrays and Linked Lists 7 topics

Basic terminology, data types, ADT
Algorithm efficiency, time-space trade-off
Asymptotic notations: Big-O, Omega, Theta
Arrays: 1-D, 2-D, n-D; row-major and column-major address formulas
Sparse matrices
Singly, doubly and circular linked lists and their operations
Polynomial representation and addition

02Unit 2: Stacks and Queues 5 topics

Stack ADT, array and linked implementation
Infix, prefix, postfix conversion and evaluation
Recursion, Tower of Hanoi, tail recursion
Queue ADT, array and linked implementation
Circular queue, deque and priority queue

03Unit 3: Searching, Hashing and Sorting 6 topics

Sequential, index-sequential and binary search
Hashing: hash functions and collision resolution
Insertion, selection and bubble sort
Quick sort and merge sort
Heap sort and radix sort
Comparison of sorting methods

04Unit 4: Graphs 6 topics

Graph terminology
Adjacency matrix, adjacency list and multilist
BFS and DFS traversal, connected components
Spanning trees, Prim's and Kruskal's algorithms
Transitive closure and Warshall's algorithm
Dijkstra's shortest path

05Unit 5: Trees 7 topics

Tree terminology, binary trees and their representation
Complete and extended binary trees
Inorder, preorder, postorder traversal; tree from traversals
Threaded binary trees
Binary search tree operations
AVL trees and rotations
B-trees, binary heaps and Huffman coding

About

You will be able to

Analyse algorithms using time and space complexity and asymptotic notations
Implement arrays, linked lists, stacks and queues and use them in applications
Convert and evaluate infix, prefix and postfix expressions and write recursive solutions
Apply searching, hashing and sorting techniques and compare their complexity
Represent graphs and apply BFS, DFS, minimum spanning tree and shortest path algorithms
Build and traverse binary trees, BSTs, AVL trees, B-trees and heaps

Who it is for

B.Tech Computer Science & Engineering, Information Technology students of Semester 3 (AKTU)
Students of other universities studying the same subject who want unit-wise coaching

What you need

Programming in C (Semester 1-2 Programming for Problem Solving)
Basic mathematics: logarithms, series

Questions

Which syllabus does the Data Structure course follow?

It follows the AKTU (Dr. A.P.J. Abdul Kalam Technical University, Lucknow) B.Tech syllabus for Data Structure. If your own university's syllabus differs, the centre follows your university syllabus.

Will this help in the university examination?

Yes. Teaching is unit-wise as per the AKTU scheme, with previous-year question practice, MCQ tests and doubt sessions before the semester exam.

Which language is used for programs?

C is used, as in the AKTU lab; the same logic is shown in C++ / Python when a student needs it.