InsideEdgeInsideEdge
Semester 2BCI203

Data Structures using C (BCI203) crash course, Online BCA, Semester 2:

This subject covers how data is organised in C programs using arrays, stacks, queues, linked lists, trees and graphs, along with standard searching and sorting…

  • 24 video lessons
  • 8h 31m
  • Study notes
  • 120 quiz questions
  • Assignment
Enroll nowSee the lessons
Data Structures using C crash course

24 lessons in Data Structures using C

Each lesson pairs one topic with a hand-picked video, trimmed to the part that teaches it.

About this subject

This subject covers how data is organised in C programs using arrays, stacks, queues, linked lists, trees and graphs, along with standard searching and sorting algorithms. After it, you will be able to implement these data structures in C, trace their operations, and choose a suitable structure or algorithm for a given problem.

  1. 1

    Abstract Data Types and Data Types in C

    Module I, Basic concepts of data representation: Abstract data types: Fundamental and derived data types

    Data Types vs. Abstract Data Types· Neso Academy· 8 min

    Study notes 5 quiz questionsWatch lesson
  2. 2

    Data Representation and Primitive Data Structures

    Module I, Basic concepts of data representation: Representation, Primitive Data Structures

    Data Structure and Its Type | In Hindi· codeitup· 13 min

    Study notes 5 quiz questionsWatch lesson
  3. 3

    Single and Multi-Dimensional Arrays

    Module II, Arrays: Representation of arrays single and multi dimensional arrays

    Lec-4: Types of Array | One dimensional & Multi-dimensional Array by #Naina Mam· Gate Smashers· 9 min

    Study notes 5 quiz questionsWatch lesson
  4. 4

    Row Major and Column Major Address Calculation

    Module II, Arrays: Address calculation using column and rows major ordering

    Data Structure | Row Major & Column Major Representation of 2-D Array | BCS301 | AKTU | Lecture 08· University Academy· 15 min

    Study notes 5 quiz questionsWatch lesson
  5. 5

    Array Operations and Vectors

    Module II, Arrays: Various operations on arrays, Vector

    Operations on Arrays in Data Structures: Traversal, Insertion, Deletion and Searching· CodeWithHarry· 29 min

    Study notes 5 quiz questionsWatch lesson
  6. 6

    Matrix Multiplication and Sparse Polynomial Addition

    Module II, Arrays: Application of arrays: matrix multi multiplication, sparse polynomial and addition

    10.3 : Polynomial Representation, Evaluation & Addition | DSA [Abdul Bari]· Hacktrickz· 41 min

    Study notes 5 quiz questionsWatch lesson
  7. 7

    Stacks and Queues Using Arrays and Linked Lists

    Module III, Stacks and Queues: Representation of stacks and queues using arrays and linked list

    Implementing Stack Using Array in Data Structures· CodeWithHarry· 22 min

    Study notes 5 quiz questionsWatch lesson
  8. 8

    Circular Queue, Priority Queue and Deque

    Module III, Stacks and Queues: Circular queues, priority queue and D-queue

    Queue Data Structure | Circular Queue | Priority Queue | Deque | Java DSA Placement | FAANG· ShashCode· 41 min

    Study notes 5 quiz questionsWatch lesson
  9. 9

    Infix to Postfix Conversion and Postfix Evaluation

    Module III, Stacks and Queues: Application of stacks: conversion from infix to postfix expression, Evaluation of postfix expression using stacks

    Lec-40: Infix to postfix Conversion using Stack | Infix➡️Postfix Conversion with examples· Gate Smashers· 15 min

    Study notes 5 quiz questionsWatch lesson
  10. 10

    Singly Linked List Operations in C

    Module IV, Linked List: Singly linked list; operations on list

    2.5 Insertion of a Node in Linked List(at Beginning,End,Specified Position)with Code | DSA Tutorials· Jenny's Lectures CS IT· 27 min

    Study notes 5 quiz questionsWatch lesson
  11. 11

    Linked Stack and Linked Queue

    Module IV, Linked List: Linked stacks and queue

    3.3 Stack implementation using Linked List | Data Structures and Algorithm Tutorials· Jenny's Lectures CS IT· 27 min

    Study notes 5 quiz questionsWatch lesson
  12. 12

    Doubly Linked List

    Module IV, Linked List: doubly linked list

    Doubly Linked Lists Explained With Code in C Language· CodeWithHarry· 13 min

    Study notes 5 quiz questionsWatch lesson
  13. 13

    Polynomial Addition Using Linked List

    Module IV, Linked List: Polynomial representations and manipulation using linked lists, addition of two polynomial list

    Application of Linked List (Addition of Two Polynomials)· Neso Academy· 17 min

    Study notes 5 quiz questionsWatch lesson
  14. 14

    Binary Tree Traversals: Preorder, Inorder, Postorder

    Module V, Trees: Binary trees traversal method: preorder, in-order, post-ordered traversal

    5.5 Binary Tree Traversals (Inorder, Preorder and Postorder) | Data structures and algorithms· Jenny's Lectures CS IT· 11 min

    Study notes 5 quiz questionsWatch lesson
  15. 15

    Recursive and Non-Recursive Tree Traversal

    Module V, Trees: Recursive and non-recursive algorithm for above mentioned Traversal methods

    Binary Tree: PreOrder Traversal Iterative | PostOrder Traversal Iterative | InOrder Traversal· Coder Army· 47 min

    Study notes 5 quiz questionsWatch lesson
  16. 16

    Tree Representation and Binary Search Tree

    Module V, Trees: Representation of trees and its application: Binary tree representation of a tree, Binary search tree

    Representation of a Binary Tree· CodeWithHarry· 20 min

    Study notes 5 quiz questionsWatch lesson
  17. 17

    AVL Tree (Height Balanced Tree)

    Module V, Trees: height balanced (AVL) tree

    5.13 AVL Tree - Insertion, Rotations(LL, RR, LR, RL) with Example | Data Structure Tutorials· Jenny's Lectures CS IT· 25 min

    Study notes 5 quiz questionsWatch lesson
  18. 18

    Linear, Binary and Indexed Search

    Module VI, Searching, sorting and complexity: Searching: Sequential and binary search, indexed search

    Data Structure Searching (Linear & Binary) | Learn Coding· Learn Coding· 20 min

    Study notes 5 quiz questionsWatch lesson
  19. 19

    Insertion, Selection and Bubble Sort

    Module VI, Searching, sorting and complexity: Sorting: insertion, selection, bubble

    Sorting Algorithms | Bubble Sort, Selection Sort & Insertion Sort | DSA Series by Shradha Ma'am· Apna College· 32 min

    Study notes 5 quiz questionsWatch lesson
  20. 20

    Quick Sort and Merge Sort

    Module VI, Searching, sorting and complexity: quick, merge

    2.8.1 QuickSort Algorithm· Abdul Bari· 14 min

    Study notes 5 quiz questionsWatch lesson
  21. 21

    Heap Sort

    Module VI, Searching, sorting and complexity: heap sort

    L-3.18: Heap sort with Example | Heapify Method· Gate Smashers· 14 min

    Study notes 5 quiz questionsWatch lesson
  22. 22

    Graph Representation: Adjacency Matrix and List

    Module VII, Graphs: Graph representation: adjacency list, adjacency multicasts, adjacency lists

    6.1 Graph Representation in Data Structure(Graph Theory)|Adjacency Matrix and Adjacency List· Jenny's Lectures CS IT· 12 min

    Study notes 5 quiz questionsWatch lesson
  23. 23

    DFS and BFS Graph Traversal

    Module VII, Graphs: Traversal scheme: Depth first search, Breadth first search

    5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search· Abdul Bari· 19 min

    Study notes 5 quiz questionsWatch lesson
  24. 24

    Minimum Spanning Tree: Prim's and Kruskal's

    Module VII, Graphs: Spanning tree: definition, minimal spanning tree algorithms

    3.5 Prims and Kruskals Algorithms - Greedy Method· Abdul Bari· 20 min

    Study notes 5 quiz questionsWatch lesson

Assignment

Data Structures in C: Mixed Problem Set and Mini Program

Free login to open
What you get

Less scrolling. More passing.

  • Free

    Hand-picked video lessons

    24 short lessons, each with the best YouTube explanation we could find, trimmed to the part that matters.

  • Free login

    Study notes

    24 lessons come with a summary, key points, key terms and takeaways for quick revision.

  • Free login

    Quizzes

    120 questions across the course, with the right answer and why, the moment you pick.

  • Free login

    Assignments

    1 subject assignments with clear tasks, so you practise what each subject actually asks of you.

  • Free login

    Notebook

    Write notes beside the video, stamped with the exact time, and jump back to that moment later.

  • Free login

    Progress that follows you

    Completed lessons, quiz scores and where you stopped, saved to your account on every device.

  • Live chat pass

    Live chat

    A members-only live chat beside every lesson: doubts, tips, stickers and GIFs with your batch. One ₹19 pass opens every live chat.

Members only

The Online BCA live chat. Study together, live.

A live chat right beside the video, shared by everyone studying Online BCA. Ask a Data Structures using C doubt mid-lesson, share a shortcut, celebrate a finished semester.

  • Live chat beside every lesson
  • One live chat for all of Online BCA
  • Members-only stickers & GIFs
  • One ₹19 pass opens every live chat
Open the live chat
Pass₹19

More from Online BCA Semester 2

All subjects

Data Structures using C: common questions

This subject covers how data is organised in C programs using arrays, stacks, queues, linked lists, trees and graphs, along with standard searching and sorting algorithms. After it, you will be able to implement these data structures in C, trace their operations, and choose a suitable structure or algorithm for a given problem. It's the Data Structures using C subject of Online BCA, Semester 2, in 24 lessons: Abstract Data Types and Data Types in C; Data Representation and Primitive Data Structures; Single and Multi-Dimensional Arrays; Row Major and Column Major Address Calculation; Array Operations and Vectors; Matrix Multiplication and Sparse Polynomial Addition; Stacks and Queues Using Arrays and Linked Lists; Circular Queue, Priority Queue and Deque; Infix to Postfix Conversion and Postfix Evaluation; Singly Linked List Operations in C; Linked Stack and Linked Queue; Doubly Linked List; Polynomial Addition Using Linked List; Binary Tree Traversals: Preorder, Inorder, Postorder; Recursive and Non-Recursive Tree Traversal; Tree Representation and Binary Search Tree; AVL Tree (Height Balanced Tree); Linear, Binary and Indexed Search; Insertion, Selection and Bubble Sort; Quick Sort and Merge Sort; Heap Sort; Graph Representation: Adjacency Matrix and List; DFS and BFS Graph Traversal; Minimum Spanning Tree: Prim's and Kruskal's.

Yes. Every video lesson is free to watch without an account. A free login unlocks study notes, quizzes, the assignment, a notebook and progress that syncs across devices.

About 8h 31m of video across 24 lessons, plus time for notes and quizzes. Go at your own pace; your place is saved.

Yes: “Data Structures in C: Mixed Problem Set and Mini Program”. It comes after the last lesson, with a brief, clear tasks and how the work is judged.

A members-only live chat beside the video, shared by everyone studying Online BCA, where learners ask doubts, share tips and react with stickers and GIFs. One ₹19 pass, paid once from your InsideEdge wallet, opens the live chat for every degree.

No. It's a crash course to help you understand and revise the subject quickly. Use it alongside your official study material and assignments.

Enroll now