SGBAU · Second Year B.E. Artificial Intelligence and Data Science · NEP 2020
Data Structures
3AD202PC · Semester III · 3 credits · IE 40 + ESE 60
Unit 1: Introduction to Data Structures
7 hoursData structures and their operations, algorithmic notation and the complexity of algorithms; string processing — storing strings, the character type, string operations, word processing and pattern-matching algorithms.
Examined in the 60-mark end-semester paper
- Data structures and their types
- Abstract data types
- Time and space complexity
- Asymptotic notations
- String processing and pattern matching
Unit 2: Arrays and Record Structures
7 hoursLinear arrays — memory representation, traversal, insertion and deletion; bubble sort, linear and binary search; multidimensional arrays, pointer arrays and record structures.
Examined in the 60-mark end-semester paper
- Arrays and sparse matrices
- Insertion, bubble and selection sort
- Sequential and binary search
Unit 3: Linked Lists
7 hoursMemory representation of linked lists, traversal and search; memory allocation and garbage collection; insertion and deletion; header linked lists and two-way linked lists.
Examined in the 60-mark end-semester paper
- Static and dynamic memory allocation
- Singly linked lists
- Circular linked lists
- Doubly linked lists
- Garbage collection
Unit 4: Stacks and Queues
7 hoursSequential representation of stacks, arithmetic expressions and Polish notation, quick sort, recursion and the Tower of Hanoi; sequential representation of queues, deques and priority queues.
Examined in the 60-mark end-semester paper
- Stack ADT and operations
- Expression conversion and evaluation
- Recursion
- Queue ADT and operations
- Deques and priority queues
Unit 5: Trees
7 hoursBinary trees and their memory representation, traversals and header nodes; binary search trees; heaps and heap sort; path length and Huffman's algorithm.
Examined in the 60-mark end-semester paper
- Tree terminology and representation
- Binary tree traversals
- Binary search trees
- Heaps
- Prefix codes and Huffman coding
Unit 6: Graphs and Sorting Algorithms
7 hoursGraphs and their memory representation, Warshall's algorithm, operations on graphs, breadth-first and depth-first search; insertion, selection, radix and merge sort.
Examined in the 60-mark end-semester paper
- Graph representation
- Warshall's algorithm for transitive closure
- DFS and BFS
- Merge sort and quick sort
- Radix sort
Unit contents are summarised from the official SGBAU syllabus . AiCanCode.org is not affiliated with Sant Gadge Baba Amravati University (SGBAU).