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: C Review, Arrays and ComplexityUnit 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 · 23 topics
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
About this course
You will be able to
- Use pointers, structures and dynamic memory allocation in C
- Analyse the time complexity of simple algorithms using Big-O notation
- Implement stacks and queues and apply them to expression conversion and evaluation
- Implement singly, doubly and circular linked lists
- Build binary search trees, perform tree traversals and represent and traverse graphs
- Implement and compare searching and sorting algorithms
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.
