Data Structures and Algorithms
DSA (Data Structures and Algorithms) refers to techniques for organizing data (like arrays, linked lists, stacks) and solving problems efficiently (using algorithms like sorting, searching, etc.). It's essential for writing optimized, scalable code.
₹500
34 Videos
71 Assessments
Register now to explore our products and services
Have a coupon code? Add it here to activate the product
Use Coupon
Key Highlights
-
📘
Detailed Test Info: Comprehensive insights into test formats, question types, and evaluation criteria.
-
📖
Preparation Tips: Dive into key topics with focused resources and clear explanations to strengthen core concepts, master important areas, and build confidence for your preparation.
-
📝
Practice Tests: Enhance preparation with realistic simulations to improve accuracy and time management.
What is a Computer
Data Types
Pointers
Loops
Arrays & Pointers
Functions in programming
Input & Output in programming
Precedence
Memory Allocation
Structures
Unions
Linear Search
Basic Computers - Practice Test
C Datatypes - Practice Test
C - Pointers - practice set
C - Loops - practice set
C - Arrays and Pointers - practice set
C - Functions - practice set
C - Input/Output - practice set
C - Precedence - practice set
C - Dynamic Memory Allocation - practice set
C - Structures - practice set
C - Unions - practice set
C - Linear Search - practice set
Linked List
Linked List - II
Stack
Queue
Iteration & Recursion
Storage Classes
Time Complexity
Space Complexity
header Files
Command Line Arguments
Trees Introduction
HashTable
Tree Traversals -1
Tree Traversals - 2
C - Linked List - practice set
C - Linked List Insertion,Deletion - practice set
C - Stacks - practice set
C - Queues - practice set
C - Iteration and Recursion - practice set
C - Storage Classes-Scope and Visibility - practice set
C - Time Complexity - practice set
C - Space Complexity - practice set
C - Header Files - practice set
C - Command Line Arguments - practice set
C - Trees Introduction - practice set
C - Tree Traversals - practice set 1
C - Tree Traversals - practice set 2
C - Hash Tables - practice set
Dynamic Programming
OOPS Concepts
Binary Search
Bubble Sort
Selection Sort
Quick Sort
Merge Sort
Micellaneous
C - Dynamic Programming - practice set
C - Binary Search - practice set
C - Selection Sort - practice set
C - Bubble Sort - practice set
C - Merge Sort - practice set
C - Quick Sort - practice set
C - Micellaneous - practice set
C - Programming - Practice set 1
C - Programming - Practice set 2
C - Programming - Practice set 3
C - Input, Output, Comments - practice set
C - Variables, Constants, Literals - practice set
C - Datatypes - practice set
C - Operators - practice set
C - If, else - practice set
C - Nested if else - practice set
C - Switch - practice set
C - break, continue, goto - practice set
C - For Loop - practice set
C - Do while - practice set
C - Nested Loops - practice set
C - functions - practice set
C - User Defined functions - practice set
C - Recursion - practice set
C - One Dimentional Arrays - practice set
C - Multi Dimentional Arrays - practice set
C - Pointers, Relations to Arrays - practice set
C - Pass by value, Pass by reference - practice set
C - Dynamic Memory Allocation - practice set
C - Strings set
C - String Manipulations - practice set
C - Strings in depth - practice set
C - Structs - practice set
C - Unions - practice set
C - File Handling - practice set
C - Precedence & Associativity - practice set
C - Bitwise Operators - practice set
C - Preprocessors & Macros - practice set
C - Standard Library Functions - practice set
C - Enums - practice set
Practice Paper 1
Practice Paper 2
Practice Paper 3
Practice Paper 4
Practice Paper 5