
Description About
Data Structure & Algorithms
This course includes the basic foundations in of data structures and
algorithms. This course covers concepts of various data structures like
stack, queue, list, tree and graph. Additionally, the course includes idea
of sorting and searching.
What this Program offers
Get the freedom to choose what, where and when to start your learning journey
You will now be able to finish your targets on your own learning pace
Now its time to get equip yourself with the lessons, mentored, by The Tech Destiny Mentors
Your hard work and dedication will be awarded by certificates that will be recognized by The Tech Destiny
Topics will be Covered In this Course
- Data types, Data structure and Abstract date type
- Dynamic memory allocation in C
- Introduction to Algorithms
- Asymptotic notations and common functions
- Basic Concept of Stack
- Stack as an ADT
- Stack Operations
- Stack Applications
- Conversion from infix to postfix/prefix expression
- Evaluation of postfix/ prefix expressions
- Basic Concept of Queue
- Queue as an ADT
- Primitive Operations in Queue
- Linear Queue
- Circular Queue
- Priority Queue
- Queue Applications
- Principle of Recursion
- Comparison between Recursion and Iteration
- Tail Recursion
- Factorial
- Fibonacci Sequence
- GCD
- Tower of Hanoi(TOH)
- Applications and Efficiency of Recursion
- Basic Concept
- List and ADT
- Array Implementation of Lists
- Linked List
- Types of Linked List: Singly
- Linked List
- Doubly Linked List
- Circular Linked List
- Basic operations in Linked List: Node
Creation - Node Insertion and Deletion from
Beginning - End and Specified Position
- Stack and Queue as Linked List
- Introduction and Types of sorting: Internal and External sort
- Comparison Sorting Algorithms: Bubble
- Selection and Insertion Sort
- Shell Sort
- Divide and Conquer Sorting: Merge
- Quick and Heap Sort
- Efficiency of Sorting Algorithms
- Introduction to Searching
- Search Algorithms: Sequential Search
- Binary Search
- Efficiency of Search Algorithms
- Hashing : Hash Function and Hash Tables
- Collision Resolution Techniques
- Concept and Definitions
- Basic Operations in Binary Tree
- Tree Height
- Level and Depth
- Binary Search Tree
- Insertion
- Deletion
- Traversals, Search in BST
- AVL tree and Balancing algorithm
- Applications of Trees
- Definition and
- Representation of Graphs
- Graph Traversal
- Minimum Spanning Trees:
- Kruskal and
- Prims Algorithm
- Shortest Path Algorithms: Dijksrtra
Algorithm
Choose Your Plan
Industry Expert
Session
Redirect Your Destiny
₹ 11,999
Live Class
Problem Solving Assessments
Doubt Session
Certification
Letter of Recommendation
LMS access
Capstone Projects 2
Placement Assistance
Resume Building
Personality Development
Self Expert
Session
Redirect Your Destiny
₹ 7,999
45+ Recorded Sessions
Problem Solving Assessments
Doubt Session
Certification
Letter of Recommendation
LMS access
Capstone Projects 2
Certified Courses
Industry Verified Certificates
Upgrade your Resume
Performance-Based Recognition
Achieve Domain Excellence



Our Hiring Partners





Testimonials
What Students Say About us

Riddhi Khandelwal
Digital Marketing

Usha Bhargavi
Digital Marketing

Azra Zainab Kazmi
Finance

Wandhekar Sourabh Bhagwan
Autocad

Boddu Chandramouli
Autocad

Ajay Karwasara
Data Science

Duggireddy Iswarya
Human Resource Management
