SUK · Second Year B.Tech. Computer Science and Engineering · NEP 2020
Data Structures Using C
CSE2102 · Semester III · 3 credits · ISE 10 + mid-semester 30 + ESE 60
The Data Structures Using C Lab (2 credits, ISE 50 + ESE 25) is separate.
Unit 1: Basics of Data Structures
7 hoursPointers, pointer arithmetic and dynamic memory allocation with malloc and calloc; arrays of structures, passing structures to functions, structures and pointers; the definition, types and operations of data structures; algorithm complexity in time and space.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Pointers
- Structures and unions
- Dynamic memory management and garbage collection
- Data structures and abstract data types
- Algorithm analysis: time and space complexity
Unit 2: Searching and Sorting
7 hoursLinear and binary search; bubble, selection, insertion, merge, quick and radix sort.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
Unit 3: Stacks and Queues
6 hoursStacks: operations, array representation and applications; queues: operations, array representation and applications; circular and priority queues.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
Unit 4: Linked Lists
7 hoursRepresentation, operations, implementation and applications of singly, doubly and circular linked lists; linked stacks and queues.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
Unit 5: Trees
6 hoursTerminology and representation; binary trees and traversals; binary search trees; AVL trees; B-trees and B+ trees; heaps, their operations and applications, heap sort.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Trees and binary trees
- Binary tree traversals: recursive and non-recursive
- Binary search trees
- AVL trees and rotations
- B-trees and B+ trees
- Heaps and balanced trees
Unit 6: Graphs
6 hoursBasic graph concepts and storage representation; BFS and DFS traversal; graph representation with sparse matrices.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
Unit contents are summarised from the official SUK syllabus . AiCanCode.org is not affiliated with Shivaji University, Kolhapur.