Data Structures and Algorithms
12 Weeks
Online
Our 12-week curriculum covers all the essentials you need for domain mastery. We help you learn the essentials and move to building projects as soon as possible and assist you in building a compelling portfolio on a fastrack.
See what we offer
Certification
Post successful completion of course all learners will be awarded with Sqilco Certificates
Mentorship & Support
Guidance from experienced professionals to support learning and career development
Live Interactive Sessions
Weekly live interactive sessions on Google Meet by expert trainers
Placement Assistance
To help graduates find relevant job opportunities and prepare for the workforce
What You will Learn
Introduction to Problem Solving
Understanding problem-solving approaches (brute force, greedy, divide and conquer), Introduction to problem-solving strategies, Practice problems on basic problem-solving techniques
Basic Data Structures
Introduction to arrays (definition and basic operations), Introduction to linked lists (singly linked lists, doubly linked lists), Introduction to stacks (LIFO data structure), Introduction to queues (FIFO data structure), Practice problems on basic data structures
Advanced Data Structures
Introduction to trees (binary trees, binary search trees), Introduction to heaps (binary heaps, priority queues), Introduction to hash tables (hashing, collision resolution), Introduction to graphs (representation, traversal algorithms DFS, BFS), Practice problems on advanced data structures
Algorithmic Techniques
Sorting algorithms (bubble sort, insertion sort, selection sort, merge sort, quick sort), Searching algorithms (linear search, binary search), Introduction to dynamic programming (memoization, tabulation), Advanced dynamic programming topics (longest common subsequence, knapsack problem), Practice problems on algorithmic techniques
Advanced Algorithms
Introduction to graph algorithms (DFS, BFS), Shortest path algorithms (Dijkstra's algorithm, Bellman-Ford algorithm), Minimum spanning tree algorithms (Prim's algorithm, Kruskal's algorithm), Advanced graph algorithms (topological sort, strongly connected components), Introduction to advanced topics (segment trees, Fenwick trees), Practice problems on advanced algorithms
Review and Practice
Review of all topics covered so far, Mock interviews, Coding challenges, Final project or coding challenge, Final review, Preparation for technical interviews
This course is Mentored by