Home
About Us
Gallery
Blogs
Google Us
Our Courses
Data Analytics
Professional Digital Marketing Course
Web Technologies
Programming Courses
Graphic Designing Courses
Skill Development Courses
Financial Accounting with TallyPrime
CAD Courses
Student Corner
Book Demo Class
Verify Certificates
Student Projects
Fee Payment
Student Reviews
Shopping cart
+91 74900 08464
Mon - Fri: 09:00 AM - 08:00 PM
Follow Us:
Login / Register
Home
About Us
Gallery
Blogs
Google Us
Our Courses
Data Analytics
Professional Digital Marketing Course
Web Technologies
Programming Courses
Graphic Designing Courses
Skill Development Courses
Financial Accounting with TallyPrime
CAD Courses
Student Corner
Book Demo Class
Verify Certificates
Student Projects
Fee Payment
Student Reviews
Contact Us
Home
Programming Courses
Data Structures & Algorithms
Data Structures & Algorithms
Curriculum
19 Sections
49 Lessons
20 Days
Expand all sections
Collapse all sections
➢ Introduction to Data Structures
4
1.0
Importance of Data Structures in Problem Solving
1.1
Types of Data Structures: Linear vs Non-linear, Primitive vs non-primitive
1.2
Declaring and initializing variables
1.3
Arithmetic Calculations
➢ Arrays 1D
2
2.0
Introduction, Declaration, Initialization
2.1
Operations on Arrays (Traversal, Insertion, Deletion)
➢ Arrays 2D
2
3.0
Multidimensional Arrays
3.1
Applications of Arrays
➢ Functions
4
4.0
Predefined Functions
4.1
User defined Functions
4.2
Parameters and Returns
4.3
Recursive Function
➢ Pointers
5
5.0
Introduction to pointers and memory addresses
5.1
Dereferencing pointers
5.2
Pointer arithmetic
5.3
Pointers with arrays
5.4
Pointers to functions
➢ Structures
2
6.0
Declaring and using structures
6.1
Arrays of structures
➢ Stack - Part 1
3
7.0
Stack Introduction
7.1
Operations (Push, Pop, Peek)
7.2
Stack Implementation using Arrays
➢ Stack - Part 2
3
8.0
Applications of Stacks (Expression Evaluation, Balancing Parentheses, etc.)
8.1
Notation:(Infix, Postfix, Prefix)
8.2
Notation Conversion
➢ Queue - Part 1
3
9.0
Queue Introduction
9.1
Operations (Enqueue, Dequeue, Peek)
9.2
Types of Queue
➢ Queue - Part 2
2
10.0
Double Ended Queue (Deque)
10.1
Operations and implementation
➢ Queue - Part 3
2
11.0
Priority Queue
11.1
Operations and implementation
➢ Queue - Part 4
2
12.0
Priority (Deque)
12.1
Operations and implementation
➢ Linked List – Part 1
2
13.0
Singly Linked List
13.1
Structure, Operations (Insertion, Deletion, Traversal)
➢ Linked List – Part 2
2
14.0
Doubly Linked Lists
14.1
Structure and Operations
➢ Linked List – Part 3
2
15.0
Circular Linked Lists
15.1
Structure and Operations
➢ Trees
3
16.0
Introduction to Trees
16.1
Tree Terminology (Nodes, Edges, Root, Height, Depth)
16.2
Binary Trees: Structure, Traversal (In-order, Pre- order, post-order)
➢ Searching Algorithms
2
17.0
Linear Search
17.1
Binary Search
➢ Sorting Algorithms
3
18.0
Selection Sort
18.1
Insertion Sort
18.2
Bubble Sort
➢ Assignment
1
19.0
Practice using top online platforms
This content is protected, please
login
and
enroll
in the course to view this content!
Modal title
Main Content
