Your roadmap · आपका रोडमैप
- 1
Admission & first meetingप्रवेश और पहली मुलाकातEnquire at your nearest NDSS centre, meet the teacher, fix the batch time and get your study material.
- 2
Semester 3 — subject classesसेमेस्टर 3 — विषयवार कक्षाएँEvery theory subject of the term, unit by unit, with notes, numericals and doubt classes.
Data Structures using C
- 3
Labs, practicals & project workलैब, प्रैक्टिकल और प्रोजेक्टExperiments / jobs / project work as in the syllabus, with practical file and viva preparation.
Data Structures Lab
- 4
Unit tests & mid-termयूनिट टेस्ट और मिड-टर्मA test after every unit and a mid-term in the university / board pattern.
- 5
Semester 3 mock testमॉक टेस्टA full mock test of all subjects before the exam, with analysis.
- 6
Semester 3 exam (university / board)सेमेस्टर / वार्षिक परीक्षाPrevious papers, important questions and full revision.
- 7
Online tests & resultऑनलाइन टेस्ट और रिज़ल्टTake the tests online; your marks and result show in your student login and at the centre.
Syllabus · पाठ्यक्रम
2 subjects · 10 chapters · 39 topics
Data Structures using C5 chapters · 6 Months
Subject page →+
01Unit 1: C Review, Arrays and Complexity
4 topics+
- Pointers and structures
- Dynamic memory: malloc, calloc, free
- One and two dimensional arrays, address calculation
- Time and space complexity, Big-O notation
02Unit 2: Stacks and Queues
5 topics+
- Stack operations using arrays
- Infix to postfix conversion and postfix evaluation
- Recursion and the stack
- Linear and circular queues
- Deque and priority queue
03Unit 3: Linked Lists
5 topics+
- Singly linked list operations
- Doubly linked list
- Circular linked list
- Linked stack and queue
- Polynomial representation
04Unit 4: Trees and Graphs
5 topics+
- Binary tree terminology and representation
- Preorder, inorder and postorder traversals
- Binary search tree operations
- Heap and AVL tree (introduction)
- Graph representation, BFS and DFS
05Unit 5: Searching and Sorting
4 topics+
- Linear and binary search
- Bubble, selection and insertion sort
- Quick sort and merge sort
- Hashing and collision resolution
Data Structures Lab5 chapters · 6 Months
Subject page →+
01Arrays and Pointers
4 topics+
- Insertion and deletion in an array
- Matrix addition and multiplication
- Pointers to structures
- Dynamic arrays with malloc
02Stacks and Queues
3 topics+
- Stack using array and linked list
- Infix to postfix conversion
- Linear queue and circular queue
03Linked Lists
3 topics+
- Singly linked list: insert, delete, display
- Doubly linked list
- Circular linked list
04Trees
3 topics+
- Binary search tree insertion
- Preorder, inorder and postorder traversal
- Searching in a BST
05Searching and Sorting
3 topics+
- Linear and binary search
- Bubble, selection and insertion sort
- Quick sort and merge sort
About this course
You will be able to
- Complete Data Structures using C syllabus with regular tests
- Complete Data Structures Lab syllabus with regular tests
Who it is for
- B.Sc Computer Science students of Semester 3 (UP State Universities NEP 2020 common minimum syllabus)
- Students preparing for MCA entrance, GATE basics and programming interviews
What you need
- B.Sc Computer Science Semesters 1-2
- Basic C programming
Online tests & result
Practice and unit tests online; marks and result show in your student login and at the centre.
Student login →
Questions
Which syllabus does this course follow?
It follows the UP State Universities NEP 2020 common minimum syllabus for B.Sc Computer Science, Semester 3. Where your own university's syllabus differs, the centre follows your university's syllabus and question pattern.
Is C taught again from scratch?
Unit 1 revises the C needed (pointers, structures, malloc) before data structures begin.
Is there a test after the course?
Yes. Unit-wise multiple-choice tests and a final exam paper are included for semester exam practice.
Which compiler is used?
GCC (Code::Blocks or the Linux terminal). Programs follow standard C so they work on your university's lab setup.
How are the practicals marked?
The trainer watches each experiment and marks it on a rubric; the viva questions here prepare you for the university practical exam.
