Data Structures & Algorithms using C – 2024 Edition

Categories Data Structures, Featured

Course level:Intermediate

0 (0 Ratings)

Last Updated:22/06/2024

About Course

The Data Structures & Algorithms using C course is designed to provide participants with a solid foundation in fundamental data structures and algorithms, implemented using the C programming language. This course focuses on the principles of organizing and manipulating data efficiently, as well as developing algorithms for problem-solving. Understanding data structures and algorithms is crucial for designing efficient and optimized software solutions. This course begins with an introduction to basic concepts of data structures, covering arrays, linked lists, stacks, queues, trees, and graphs. Participants will learn algorithmic techniques such as searching, sorting, and recursive algorithms. The course emphasizes the implementation of these data structures and algorithms in C, enabling participants to gain practical programming skills. Real-world examples and problem-solving exercises will be used to reinforce theoretical concepts. Learn software skills with real experts, either in live classes with videos or without videos, whichever suits you best.

Fundamental Data Structures: Provide a thorough understanding of fundamental data structures, including arrays, linked lists, stacks, and queues.
Trees and Graphs: Cover tree structures, including binary trees and balanced trees, as well as graph structures for representing relationships between data elements.
Algorithmic Techniques: Introduce algorithmic techniques for searching, sorting, and traversal of data structures.
Complexity Analysis: Teach participants how to analyze the time and space complexity of algorithms for evaluating their efficiency.
Dynamic Programming: Explore dynamic programming as an algorithmic paradigm for solving optimization problems.
Recursion: Cover recursive algorithms and their applications in problem-solving.
Hashing: Introduce hashing techniques and their application in data retrieval.
Graph Algorithms: Explore graph algorithms, including depth-first search (DFS) and breadth-first search (BFS).
Problem-Solving Skills: Enhance problem-solving skills by applying data structures and algorithms to real-world scenarios.
C Programming Integration: Emphasize the implementation of data structures and algorithms using the C programming language.

Course Curriculum

Introduction to Data Structures and Algorithms Through C In Depth

Introduction to Data Structures and Algorithms Through C In Depth

Introduction to Data Structures and Algorithms

Data Structures and Algorithms
Measuring Running time of Algorithms
Asymptotic Analysis
Big O Notation
Finding Big O
Tight and Loose Upper Bounds
Big O analysis of Algorithms
Finding Time Complexity
Big O analysis of Algorithms: Examples
Worst case, Best case and Average Case Analysis
Common Complexities
Abstract Data Types

Linked List

Introduction to Linked List in C
Traversing and Searching a Single Linked List
Finding pointers in a Single Linked List
Insertion in a Single Linked List
Insertion in a Single Linked List..contd
Deletion in a Single Linked List
Reversing a Single Linked List
Doubly linked list
Insertion in a doubly linked List
Deletion from doubly linked list
Reversing a doubly linked list
Circular linked list
Insertion in a circular Linked List
Deletion in a circular linked list
Concatenation
Linked List with Header Node
Sorted linked list
Merging of sorted Linked lists
Sorting a Linked list using Bubble Sort
Sorting a Linked list using Merge Sort
Finding and Removing a cycle in a Linked list

Stack and Queue

Introduction
Stack
Array Implementation of Stack
Linked List Implementation of Stack
Queue
Array Implementation of Queue
Linked List implementation of Queue
Queue through Circular Linked List
Circular Queue
Deque
Priority Queue
Checking validity of an expression containing nested parentheses
Function calls
Evaluating Arithmetic Expressions
Polish Notations
Converting infix expression to postfix expression
Evaluation of postfix expression

Recursion

Introduction
Flow of control in Recursive functions
Winding and unwinding phase
Factorial
Printing numbers from 1 to n
Sum of digits of an integer
Base conversion
Finding nth power of a number
Euclids Algorithm
Fibonacci Series
Tower of Hanoi
Tail recursion
Recursion vs. Iteration

Binary Tree

Introduction to Trees
Binary Tree
Strictly Binary Tree and Extended Binary Tree
Full binary tree and Complete Binary Tree
Array Representation of Binary trees
Linked Representation of Binary Trees
Traversal in Binary Tree
Preorder Traversal
Inorder Traversal
Postorder Traversal
Level order traversal
Finding height of a Binary tree
Binary Tree in C
Constructing Binary tree from Traversals
Constructing binary tree from inorder and preorder traversals
Constructing binary tree from postorder and inorder traversals

Binary Search Tree

Heap

Sorting

Introduction to Sorting Algorithms
Sort Stability
Selection Sort
Selection Sort Example
Selection Sort in C
Analysis of Selection Sort
Bubble Sort
Bubble Sort Example
Bubble Sort in C
Improvement in Bubble Sort
Analysis of Bubble Sort
Insertion Sort
Insertion Sort Example
Insertion Sort in C
Analysis of Insertion sort
Shell Sort
Shell Sort Example
Shell Sort in C
Analysis of Shell Sort
Merging two Sorted Arrays
Recursive Merge Sort
Recursive Merge Sort in C
Analysis of Merge Sort
Iterative Merge Sort
Iterative Merge Sort in C
Quick Sort
Quick Sort in C
Analysis of Quick Sort
Binary tree sort
Binary Tree Sort in C
Analysis of Binary Tree Sort
Heap Sort
Heap Sort : C implementation and Analysis
Radix Sort
Radix Sort : C implementation and Analysis
Address Calculation Sort
Address Calculation Sort in C
Analysis of Address Calculation Sort
Sorting Records

Searching

Hashing

Direct Addressing
Hashing
Collisions
Hash Functions
Open Addressing : Linear Probing
Open Addressing : Quadratic Probing
Open Addressing : Double Hashing
Deletion in Open Addressed Tables
Implementation of Open Addressing
Separate Chaining
Implementation of Separate Chaining

Student Ratings & Reviews

No Review Yet

Enroll for Bright Career

Programmers and Developers: Professionals aiming to strengthen their foundation in data structures and algorithms using C.
Computer Science Students: Students pursuing degrees in computer science or related fields with an interest in algorithms and data structures.
Software Engineers: Individuals looking to deepen their understanding of efficient data organization and algorithmic problem-solving.
Competitive Programmers: Enthusiasts participating in programming competitions aiming to enhance their algorithmic skills.
System Architects: Professionals involved in designing and optimizing systems where efficient algorithms are crucial.
Interview Preparation: Individuals preparing for technical interviews that often include questions related to data structures and algorithms.