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
Work planकार्य योजनाStep by step with your guide / trainer.
Arrays and SearchingSortingLinked ListsStacks and QueuesTreesGraphs
- 3
File, report & vivaफ़ाइल, रिपोर्ट और वाइवाPractical file / report checked, mock viva before the final one.
- 4
Online tests & resultऑनलाइन टेस्ट और रिज़ल्टTake the tests online; your marks and result show in your student login and at the centre.
सिलेबस · पाठ्यक्रम
1 subject · 6 chapters · 26 topics
01Arrays and Searching
4 टॉपिक+
- Insertion and deletion in an array
- Linear search
- Binary search (iterative and recursive)
- Matrix operations and sparse matrix
02Sorting
6 टॉपिक+
- Bubble sort
- Selection sort
- Insertion sort
- Quick sort
- Merge sort
- Heap sort
03Linked Lists
4 टॉपिक+
- Singly linked list: insert, delete, display, reverse
- Doubly linked list operations
- Circular linked list
- Polynomial addition using linked list
04Stacks and Queues
5 टॉपिक+
- Stack using array and linked list
- Infix to postfix conversion
- Postfix evaluation
- Linear and circular queue
- Queue using linked list
05Trees
3 टॉपिक+
- Binary search tree: insert, search, delete
- Inorder, preorder and postorder traversal
- Counting nodes and height
06Graphs
4 टॉपिक+
- Adjacency matrix and list representation
- BFS and DFS traversal
- Prim's / Kruskal's minimum spanning tree
- Dijkstra's shortest path
About this course
आप यह कर पाएँगे
- Write C programs for array operations, linear and binary search
- Implement and compare bubble, selection, insertion, quick, merge and heap sort
- Implement singly, doubly and circular linked lists with dynamic memory
- Implement stacks and queues using arrays and linked lists and use them for expression conversion
- Build binary search trees and perform traversals
- Implement BFS, DFS and minimum spanning tree algorithms on graphs
यह किसके लिए है
- B.Tech Computer Science & Engineering, Information Technology students of Semester 3 (AKTU)
- Students of other universities studying the same subject who want unit-wise coaching
आपको क्या चाहिए
- C programming (pointers, structures, functions)
- Data Structure theory of the same semester (taught together)
Online tests & result
Practice and unit tests online; marks and result show in your student login and at the centre.
Student login →
सवाल
Which syllabus does the Data Structure Lab course follow?
It follows the AKTU (Dr. A.P.J. Abdul Kalam Technical University, Lucknow) B.Tech syllabus for Data Structure Lab. If your own university's syllabus differs, the centre follows your university syllabus.
Will this help in the university examination?
Yes. Teaching is unit-wise as per the AKTU scheme, with previous-year question practice, MCQ tests and doubt sessions before the semester exam.
Which compiler is used?
GCC on Linux or Code::Blocks / Dev-C++ on Windows, the same as most AKTU college labs.
