Data Structures using C

Build linked lists, trees, heaps, graphs and hash tables in C with step-by-step coding and lab practice.

0.0
(0 ratings) • Instructor: Dr. M. Sudhakara
Data Structures using C
Course Overview
Free

100% Free • Instant Full Access

This course includes:

  • Full on-demand video curriculum
  • Access on mobile, tablet & desktop
  • Verified Certificate of completion

What you'll learn

Choose a data structure based on the operations a program needs and explain the trade-offs.
Implement singly, doubly and circular linked lists, stacks and queues in C.
Traverse binary trees recursively and iteratively, implement BST search, insertion and deletion, and explain how AVL, Red-Black and Splay trees reorganize nodes.
Implement B-trees and B+ trees in lab exercises, compare binary, binomial and Fibonacci heaps, and apply jump search and interpolation search.
Represent graphs using adjacency matrices and lists, and implement breadth-first search and depth-first search.
Implement radix sort, heap sort, Shell sort and tree sort, and compare how they process input.
Implement four hash functions and resolve collisions using open addressing and chaining.
Perform basic text and binary file operations in C and explain how file organization and indexing affect record retrieval.

Course Content

1 section • 1 lecture

Topics to be covered
Lecture

Description

How do you choose a data structure for fast searching, frequent insertions or processing items in order? In this course, you’ll answer that question by tracing operations, writing C programs and testing your implementations.


You’ll start with abstract data types, linked lists, stacks and queues. Then you’ll work with binary search trees, balanced trees, multiway search trees, heaps and graphs. You’ll also implement searching and sorting algorithms, work through hash collisions, and learn how files are organized and indexed for record retrieval.


The course follows the five units of the B.Tech. Data Structures syllabus and integrates the ten laboratory experiments. You’ll see how concepts connect across units. For example, you’ll use a binary heap to understand heap sort and revisit binary search trees when implementing tree sort.


This course is designed for B.Tech. students taking Data Structures and for learners who know basic C and want practice implementing data structures from scratch.

Instructor

D

Dr. M. Sudhakara

Course Instructor • 3 Courses
Total Price Free