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 and ArraysUnit 2: Stacks and QueuesUnit 3: Linked Lists
- 3
Part 2 of the syllabusपाठ्यक्रम भाग 2Unit-wise coaching with notes and doubt classes.
Unit 4: TreesUnit 5: Graphs, 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 · 25 topics
01Unit 1: Introduction and Arrays
5 topics+
- Data structure - linear and non-linear
- Abstract data type
- Time and space complexity, Big-O
- Arrays - address calculation in row-major and column-major
- Sparse matrices
02Unit 2: Stacks and Queues
5 topics+
- Stack operations - push, pop
- Infix to postfix conversion
- Postfix evaluation
- Queue, circular queue, deque
- Priority queue
03Unit 3: Linked Lists
5 topics+
- Singly linked list - insert, delete, traverse
- Doubly linked list
- Circular linked list
- Linked stack and queue
- Polynomial representation
04Unit 4: Trees
5 topics+
- Tree terminology
- Binary tree and its properties
- Traversals - inorder, preorder, postorder
- Binary search tree
- AVL tree and heap basics
05Unit 5: Graphs, Searching and Sorting
5 topics+
- Graph representation - adjacency matrix and list
- BFS and DFS
- Linear and binary search
- Bubble, insertion, selection, quick and merge sort
- Hashing and collision resolution
About this course
You will be able to
- Explain data structure types, abstract data types and algorithm complexity
- Implement stacks and queues and use them for expression conversion and evaluation
- Implement singly, doubly and circular linked lists
- Build binary trees and binary search trees and perform traversals
- Represent graphs and apply BFS and DFS
- Implement and compare searching, sorting and hashing techniques
Who it is for
- BCA students of Semester 3 (UP state universities, Lucknow University pattern)
- Students preparing for coding interviews and MCA entrance
What you need
- Programming in C (BCA Semester 2) - arrays, pointers and structures
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 Data Structures Using C and C++ course follow?
It follows the common UP state university BCA syllabus (University of Lucknow pattern) for BCA Semester 3. If your own university's syllabus differs, the centre follows your university's syllabus and unit order.
Are programs written in C or C++?
Both are accepted. The trainer shows each structure in C and then as a C++ class, as most universities allow either.
Is this subject important for placements?
Yes. Data structures are asked in almost every software interview and coding test.
