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
Part 1 of the syllabusपाठ्यक्रम भाग 1Unit-wise coaching with notes and doubt classes.
Unit 1: Introduction, Arrays and PointersUnit 2: Stacks and QueuesUnit 3: Linked Lists
- 3
Part 2 of the syllabusपाठ्यक्रम भाग 2Unit-wise coaching with notes and doubt classes.
Unit 4: Trees and GraphsUnit 5: Searching and Sorting
- 4
Unit tests & assignmentsयूनिट टेस्टRegular tests in the university / board pattern.
- 5
Semester 3 exam (university / board)विश्वविद्यालय / बोर्ड परीक्षाPrevious papers and full revision before the exam.
- 6
Online tests & resultऑनलाइन टेस्ट और रिज़ल्टTake the tests online; your marks and result show in your student login and at the centre.
Syllabus · पाठ्यक्रम
1 subject · 5 chapters · 24 topics
01Unit 1: Introduction, Arrays and Pointers
5 topics+
- Data structure classification and ADT
- Algorithm and complexity: Big O
- One and two dimensional arrays, address calculation
- Pointers and structures
- Dynamic memory: malloc, calloc, realloc, free
02Unit 2: Stacks and Queues
5 topics+
- Stack operations: push, pop, peek
- Array implementation of stack
- Infix to postfix conversion and postfix evaluation
- Recursion
- Queue, circular queue, deque and priority queue
03Unit 3: Linked Lists
4 topics+
- Singly linked list: insert, delete, traverse
- Doubly linked list
- Circular linked list
- Stack and queue using linked list
04Unit 4: Trees and Graphs
5 topics+
- Tree terminology
- Binary tree and binary search tree
- Inorder, preorder and postorder traversal
- Graph terminology and representation
- BFS and DFS
05Unit 5: Searching and Sorting
5 topics+
- Linear and binary search
- Bubble, selection and insertion sort
- Quick sort and merge sort
- Comparison of complexities
- Hashing basics
About this course
You will be able to
- Explain data structures, abstract data types and time complexity (Big O)
- Use arrays, pointers, structures and dynamic memory allocation in C
- Implement stacks and queues and use them for expression conversion and evaluation
- Implement singly, doubly and circular linked lists
- Build binary search trees, perform traversals and represent graphs with BFS / DFS
- Implement and compare searching and sorting algorithms
Who it is for
- Diploma Computer Science & Engineering students of Semester 3 (BTEUP)
- Polytechnic students of other boards studying the same subject who want unit-wise coaching
What you need
- Programming in C of earlier semesters
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 the Data Structures using C course follow?
It follows the BTEUP (Board of Technical Education, Uttar Pradesh) diploma syllabus for Data Structures using C (Computer Science & Engineering, Semester 3). If your own board's or institute's syllabus differs, the centre follows your own syllabus.
Will this help in the semester examination?
Yes. Teaching is unit-wise as per the BTEUP scheme, with previous-year question practice, MCQ tests and doubt sessions before the semester exam.
Are programs written in the lab?
Yes. Every data structure is implemented in C and run on Turbo C / GCC / Code::Blocks along with the theory.
