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 StringsStacks and QueuesLinked ListsTreesSearching and SortingGraphs
- 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.
Syllabus · पाठ्यक्रम
1 subject · 6 chapters · 21 topics
01Arrays and Strings
3 topics+
- Traversal, insertion and deletion in a 1-D array
- Matrix addition and multiplication using 2-D arrays
- String operations without library functions
02Stacks and Queues
4 topics+
- Stack using array - push, pop, peek
- Infix to postfix conversion
- Evaluation of a postfix expression
- Linear queue and circular queue using array
03Linked Lists
4 topics+
- Singly linked list - create, insert, delete, display
- Stack and queue using linked list
- Doubly linked list operations
- Circular linked list
04Trees
3 topics+
- Create a binary search tree
- Inorder, preorder and postorder traversal
- Search and delete a node in a BST
05Searching and Sorting
4 topics+
- Linear search and binary search
- Bubble sort, selection sort and insertion sort
- Quick sort and merge sort
- Counting comparisons and comparing algorithms
06Graphs
3 topics+
- Adjacency matrix and adjacency list representation
- Breadth First Search
- Depth First Search
About this course
You will be able to
- Implement array operations - traversal, insertion, deletion - in C
- Implement stacks and queues using arrays and linked lists
- Write C programs for singly, doubly and circular linked lists
- Build a binary search tree and perform inorder, preorder and postorder traversal
- Implement linear search, binary search and common sorting algorithms and compare them
- Represent a graph and perform BFS and DFS traversal
Who it is for
- Diploma Computer Science & Engineering students of Semester 3 (BTEUP)
- Diploma IT students who need practice for the Data Structures practical exam
What you need
- C programming including pointers, structures and dynamic memory (malloc / free)
- A computer with GCC / Code::Blocks or Turbo C
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 is followed?
The BTEUP Diploma CSE Semester 3 Data Structures Lab list. If your college list differs, the centre follows your own lab syllabus.
Which language is used?
C language, as prescribed for the BTEUP practical exam.
Will I get help with the lab file and viva?
Yes. Each experiment is written up with aim, algorithm, program and output, and viva questions are practised.
