RELATED RECENT PLACEMENTS
Kirankrishna M
advance technologies
SDM Institute of Technology Institute of technology in Ujire, Karnataka
MUJTABA HILAL
Amit Bangre Consulting Limited
Swami Vivekananda Institute of Science & Technology
ARJUN PP
Altener Solutions Private Limited
Government Polytechnic College Kannur Polytechnic college in Kerala
Smita Suryavanshi
Deloitte
KLE Dr. M.S. Sheshgiri College of Engineering and Technology
Jitendra kumar Vishwakarma
Mando Softtech India Pvt. Ltd.
Ambition institute of technology
Meganath Prabu S
Tech Mahindra
C K College of Engineering and Technology
SRITHARAN N
Tata Technologies
SNS College of Technology
AnilKumar Hubballi
Aakruthi3D pvt ltd
KLE Polytechnic Bailhongal
Syllabus
This course is full of best-in-class content by leading faculty and industry experts in the form of videos and projects
Course Overview
- This course encloses the basic and advanced topics of Data Structures and Algorithms along with code implementation and problem solving sessions.
- By taking up this course from SKILL-LYNC, you will clock in 200+ hours of coding for a wide range of problems.
- You will also be taught how scalable programs are built and will be exposed to the skills that top tech companies expect from programmers
- This course will help in developing the necessary problem-solving coding skills, to crack the coding interviews for most software companies
- This course is designed to help a new developer explore the theoretical and practical aspects of coding
Course Syllabus in Chennai
On a daily basis we talk to companies in the likes of Tata Elxsi and Mahindra to fine tune our curriculum.
Week - 01 Introduction
- Abstract data type and Data Structure
- Complexity Analysis
- Asymptotic analysis
- Comparison of functions
- Recurrence Relations
- Time complexity
- Space complexity
- Iteration
- Recursion
Week - 02 Lists
- Arrays
- Static arrays
- Dynamic arrays
- 2D arrays
- Strings
- Linked List
- Singly Linked List and its operations
- Doubly Linked List and its operations
- Circular Linked List and its operations
Week - 03 Stacks and Queues
- Stacks
- Implementations- using arrays, using linked lists
- Operations
- Applications
- Queues
- Implementations- using arrays, using linked list, using two stacks
- Circular queues
- Priority queues
- Amortized Analysis
- Stacks and Queues in Python
Week -04 Trees
- Binary Trees:
- Representations
- Pre-order, In-order
- Post-order traversals
- Expression trees
- Successor and Predecessor
- Binary Search Trees and their operations
- AVL Trees and their operations
- Red-Black trees, Interval trees, Segment trees, B-trees, B+ trees
Week - 05 Heaps and Tries
- Heaps
- Min Heap
- Max Heap
- Implementation
- Operations
- Priority Queues
- Implementations
- Uses
- Tries
- Implementations
- Uses
Week - 06 Graphs
- Graphs
- Representation
- Implementation
- Types of Graphs
- Minimum cost spanning tree problem
- Traversing Graph
- Depth First Search
- Breadth-First Search
- Single-Source Shortest path problem
- Dijkstra's algorithm
- Bellman-Ford algorithm
- Disjoint Sets
- Union by rank
- Path compression
- Applications
Week - 07 Sorting
- Types of sorting techniques
- Bubble Sort
- Insertion Sort
- Selection Sort
- Quick Sort
- Merge Sort
- Heap Sort
- Count Sort
- Bucket Sort
- Radix Sort
- Shell Sort
- Topological Sort
Week - 08 Searching and Hashing
- Searching
- Linear Search
- Binary Search
- Hashing
- Hash function
- Collision handling
- Chaining
- Open addressing
- Linear probing, primary clustering
- Quadratic probing, secondary clustering
- Double hashing
- Hash Tables
- Collection Module in Python
Week - 09 Greedy Algorithms
- Optimization Problems
- Types of algorithms
- Greedy Algorithms
- The strategies of Greedy Algorithms
- Elements of Greedy Algorithms
- Advantages of Greedy Algorithms
- Disadvantages of Greedy Algorithms
- Applications of Greedy Algorithms
Week - 10 Divide and Conquer
- Divide and Conquer Techniques
- Strategies
- Advantages
- Disadvantages
- Master theorem
- Applications
- Special types of problems
- Bit Manipulation problems
- Two pointer problems
- Sliding Window problems
- Merge Intervals problems
Week - 11 Backtracking
- Backtracking
- Brute Force Approach
- N Queens Problem
- String matching Algorithms
- Brute Force Method
- KMP
- Rabin Karp
- Data Structures for storing strings
Week - 12 Dynamic Programming
- Dynamic Programming
- Approaches of Dynamic Programming
- Top-down approach
- Bottom-up approach
- Properties of Dynamic Programming
- Comparison of Algorithmic Techniques learned
- Regular Expressions
- Pattern matching algorithm
- Complexity Classes
- P, NP, NP-Hard, NP-Complete
- Is P==NP?
- Problem Solving Summary
Our courses have been designed by industry experts to help students achieve their dream careers
Ratings & Reviews by Learners
Skill-Lync has received honest feedback from our learners around the globe.
Flexible Pricing
Talk to our career counsellors to get flexible payment options.
INR 40,000
Inclusive of all charges
Become job ready with our comprehensive industry focused curriculum for freshers & early career professionals
5 Years Accessto Skill-Lync’s Learning Management System (LMS)
Personalized Pageto showcase Projects & Certifications
Live Individual & Group Sessionsto resolve queries, Discuss Progress and Study Plans.
Personalized & Hands-OnSupport over Mail, Telephone for Query Resolution & Overall Learner Progress.
Job-Oriented Industry Relevant Curriculumavailable at your fingertips curated by Global Industry Experts along with Live Sessions.
Instructors profiles
Our courses are designed by leading academicians and experienced industry professionals.
1 industry expert
Our instructors are industry experts along with a passion to teach.
10 years in the experience range
Instructors with 10 years extensive industry experience.
Areas of expertise
- Full Stack development
Find Data Structures and Algorithms using Python in other cities
Pune
Delhi
Hyderabad
Mumbai
Bangalore
Similar Courses
Got more questions?
Talk to our Team Directly
Please fill in your number & an expert from our team will call you shortly.