You can keep up to 10 CVs here -- delete one you don't need.
You can keep up to 10 CVs here -- delete one you don't need.
You can keep up to 10 CVs here -- delete one you don't need.
You can keep up to 10 CVs here -- delete one you don't need.
You can keep up to 10 CVs here -- delete one you don't need.

Data Structures Lab (Diploma)

Implementing data structures and algorithms in C.

6 MonthsDuration 6Chapters21Topics

Syllabus · पाठ्यक्रम

Download PDF
01Arrays and Strings 3 topics
  1. Traversal, insertion and deletion in a 1-D array
  2. Matrix addition and multiplication using 2-D arrays
  3. String operations without library functions
02Stacks and Queues 4 topics
  1. Stack using array - push, pop, peek
  2. Infix to postfix conversion
  3. Evaluation of a postfix expression
  4. Linear queue and circular queue using array
03Linked Lists 4 topics
  1. Singly linked list - create, insert, delete, display
  2. Stack and queue using linked list
  3. Doubly linked list operations
  4. Circular linked list
04Trees 3 topics
  1. Create a binary search tree
  2. Inorder, preorder and postorder traversal
  3. Search and delete a node in a BST
05Searching and Sorting 4 topics
  1. Linear search and binary search
  2. Bubble sort, selection sort and insertion sort
  3. Quick sort and merge sort
  4. Counting comparisons and comparing algorithms
06Graphs 3 topics
  1. Adjacency matrix and adjacency list representation
  2. Breadth First Search
  3. Depth First Search

About

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

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.

Download the syllabus (PDF)

Tell us who you are — your copy is made with your name, and our counsellor can help you choose the right course and centre.

Want to join right away? Enquire now — our centre will call you.