Data Structures (DS)

Learn Data Structures (DS) the exam way—clear concepts, worked examples, and 67 focused lessons in computer science core.

Instructor: DAKALA SREENIVASULU

Last updated Aug 2026 en

26 learners enrolled

all-levels

This course includes

— on-demand video
Access on mobile & desktop
Full lifetime access
Certificate of completion

Course content

11 sections · 67 lectures · 9 total hours

Lec-01 : Introduction Preview
Lec-02 : Programming Methodologies : Introduction
Lec-03 : Programming Methodologies-1
Lec-04 : Programming Methodologies-2
Lec-05 : Abstract Data Type

Lec-06 : Arrays : Declare, Create & Initialization Preview
Lec-07 : Array representation : Row & Column major order
Lec-08 : 1-D Array representation
Lec-09 : 2-D Array representation

Lec-10 : Stack : PUSH & POP Preview
Lec-11 : Stack : Abstract Data Type
Lec-12 : Queues : FIFO
Lec-13 : Queue as ADT

Lec-14 : Infix Prefix and Postfix : Notations Preview
Lec-15 : Infix to Postfix Conversion
Lec-16 : Infix to Prefix conversion
Lec-17 : Postfix to Infix Conversion
Lec-18 : Prefix to Infix Conversion
Lec-19 : Evaluation of Postfix Expression
Lec-20 : Evaluation of Postfix Expression
Lec-21 : Evaluation of Prefix expression

Lec-22 : Linked list introduction Preview
Lec-23 : Linked list : Single, Double & Circular
Lec-24 : Sparse Matrix : Array representation
Lec-25 : Sparse Matrix : Linked list representation

Lec-26 : What is Tree Preview
Lec-27 : Binary tree : Recursive & Properties
Lec-28 : Trees : Recursive, Application & implementation
Lec-29 : Binary Tree Traversal
Lec-30 : Preorder : Binary Tree Traversal
Lec-31 : Inorder : Binary Tree Traversal
Lec-32 : Postorder : Binary Tree Traversal

Lec-33 : Binary Search Tree (BST) part-1 Preview
Lec-34 : Binary Search Tree (BST) part-2
Lec-35 : Expression Tree
Lec-36 : In, Pre & Post Order : Binary Search Tree Traversal
Lec-37 : Searching : Binary Search Tree
Lec-38 : Insertion : Binary Search Tree
Lec-39 : Deletion : Binary Search Tree

Lec-40 : AVL Tree introduction Preview
Lec-41 : AVL left-left rotation
Lec-42 : AVL Left-Right rotation
Lec-43 : AVL RR & RL rotation
Lec-44 : AVL insertion example
Lec-45 : Heap tree

Lec-46 : Graph terminology Preview
Lec-47 : Adjacency Matrices
Lec-48 : Incidence matrix
Lec-49 : Adjacency list
Lec-50 : Depth First Search
Lec-51 : Breadth First Search

Lec-52 : Sorting methods Preview
Lec-53 : Selection Sort example | Straight
Lec-54 : Selection sort algorithm | Straight
Lec-55 : Heap sort example
Lec-56 : Heap sorting algorithm
Lec-57 : Insertion sort example | Straight
Lec-58 : Shell sort example | Insertion
Lec-59 : Bubble sort Example | Exange Sort
Lec-60 : Quicksort algorithm | Divide & Conquer
Lec-61 : Quick Sort Example | Divide & Conquer

Lec-62 : What is Hashing Preview
Lec-63 : Hashing methods introduction
Lec-64 : Direct & Modulo Division : Hashing methods
Lec-65 : Digit extractrion & Mid square : Hashing methods
Lec-66 : Folding,Rotation & Random : Hashing methods
Lec-67 : Collision Resolution : Linear & Quadratic probing

Explore related topics

Computer Science all-levels

Description

Data Structures (DS) is an exam-focused computer science core programme designed for B.Tech / MCA learners and anyone revising CS subjects for semester exams (all levels). Lessons are paced for semester revision and competitive practice, with clear explanations you can replay anytime.

You will connect definitions to exam-style problems in Data Structures (DS), so you can write clearer answers, dry-run code mentally, and revise units in order. Syllabus highlights include Methodologies, Arrays, Stacks & Queues, Infix, Prefix & Postfix, Linked list & Sparse Matrix, and Binary Tree. Across 67 lessons, you will move from foundations to problem-solving patterns that show up in university papers and placement tests.

Taught by DAKALA SREENIVASULU, this course keeps theory short and practice heavy—so you can revise faster, spot examiner cues, and build confidence before mocks and finals.