Data Structures using C (Diploma)

Arrays, stacks, queues, linked lists, trees, graphs, searching and sorting.

6 MonthsDuration 5Chapters24Topics

Syllabus · पाठ्यक्रम

Download PDF
01Unit 1: Introduction, Arrays and Pointers 5 topics
  1. Data structure classification and ADT
  2. Algorithm and complexity: Big O
  3. One and two dimensional arrays, address calculation
  4. Pointers and structures
  5. Dynamic memory: malloc, calloc, realloc, free
02Unit 2: Stacks and Queues 5 topics
  1. Stack operations: push, pop, peek
  2. Array implementation of stack
  3. Infix to postfix conversion and postfix evaluation
  4. Recursion
  5. Queue, circular queue, deque and priority queue
03Unit 3: Linked Lists 4 topics
  1. Singly linked list: insert, delete, traverse
  2. Doubly linked list
  3. Circular linked list
  4. Stack and queue using linked list
04Unit 4: Trees and Graphs 5 topics
  1. Tree terminology
  2. Binary tree and binary search tree
  3. Inorder, preorder and postorder traversal
  4. Graph terminology and representation
  5. BFS and DFS
05Unit 5: Searching and Sorting 5 topics
  1. Linear and binary search
  2. Bubble, selection and insertion sort
  3. Quick sort and merge sort
  4. Comparison of complexities
  5. Hashing basics

About

You will be able to

  • Explain data structures, abstract data types and time complexity (Big O)
  • Use arrays, pointers, structures and dynamic memory allocation in C
  • Implement stacks and queues and use them for expression conversion and evaluation
  • Implement singly, doubly and circular linked lists
  • Build binary search trees, perform traversals and represent graphs with BFS / DFS
  • Implement and compare searching and sorting algorithms

Who it is for

  • Diploma Computer Science & Engineering students of Semester 3 (BTEUP)
  • Polytechnic students of other boards studying the same subject who want unit-wise coaching

What you need

  • Programming in C of earlier semesters

Questions

Which syllabus does the Data Structures using C course follow?

It follows the BTEUP (Board of Technical Education, Uttar Pradesh) diploma syllabus for Data Structures using C (Computer Science & Engineering, Semester 3). If your own board's or institute's syllabus differs, the centre follows your own syllabus.

Will this help in the semester examination?

Yes. Teaching is unit-wise as per the BTEUP scheme, with previous-year question practice, MCQ tests and doubt sessions before the semester exam.

Are programs written in the lab?

Yes. Every data structure is implemented in C and run on Turbo C / GCC / Code::Blocks along with the theory.

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.