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.
Exp Group 1: Arrays and Linked ListsExp Group 2: Stacks and QueuesExp Group 3: Searching and SortingExp Group 4: TreesExp Group 5: GraphsExp Group 6: Algorithm Design Techniques
- 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 · 22 topics
01Exp Group 1: Arrays and Linked Lists
4 टॉपिक+
- Array insertion and deletion
- Singly linked list operations
- Doubly and circular linked lists
- Reversing a linked list
02Exp Group 2: Stacks and Queues
4 टॉपिक+
- Stack using array and linked list
- Infix to postfix and postfix evaluation
- Circular queue
- Priority queue
03Exp Group 3: Searching and Sorting
4 टॉपिक+
- Linear and binary search
- Insertion, selection and bubble sort
- Quick sort and merge sort
- Heap sort and timing comparison
04Exp Group 4: Trees
3 टॉपिक+
- Binary search tree insertion and deletion
- Recursive traversals
- Height and leaf count of a tree
05Exp Group 5: Graphs
4 टॉपिक+
- Adjacency matrix and list
- BFS and DFS
- Prim's and Kruskal's algorithms
- Dijkstra's algorithm
06Exp Group 6: Algorithm Design Techniques
3 टॉपिक+
- Fractional knapsack by greedy method
- 0/1 knapsack and LCS by dynamic programming
- N-Queens by backtracking
About this course
आप यह कर पाएँगे
- Implement linked lists, stacks and queues with arrays and pointers
- Convert and evaluate expressions using a stack
- Implement searching and sorting algorithms and compare their running times
- Build binary search trees and perform traversals
- Implement BFS, DFS, minimum spanning tree and shortest-path algorithms
- Solve knapsack, LCS and N-Queens problems by suitable design techniques
यह किसके लिए है
- MCA students of Semester 2 (AKTU, Lucknow)
- Students preparing for coding rounds of placement tests
आपको क्या चाहिए
- Data Structures & Analysis of Algorithms theory (studied alongside)
- C / C++ / Java compiler on the lab computer (provided at the centre)
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 this Data Structures & Analysis of Algorithms Lab course follow?
It follows the AKTU (Lucknow) MCA syllabus for Semester 2. If your own university's syllabus differs, the centre follows your university's syllabus and unit order.
What happens in the lab exam?
You perform one or two experiments given by the examiner, show the output, submit the lab record and answer viva questions.
Which language is used?
C is used by default as per AKTU; students may also use C++ or Java if their college allows it.
