skilldevelopment.cpe@lpu.co.in

What you'll learn

Description: This course is designed to: • Help students in attempting competitive exams related to programming in an effective manner. • Students will have in depth clarity of the basics of Data structures, use of data structures and solving of problems using it. • Help students to crack programming based placement exams. Learning Outcome: • Students will be well - versed with type of questions for various competitive exams and Hackathons. • Students will be able to apply strategies while solving programming related questions in the paper. • Learning data structures and its applications • Students will be well equipped while attending interviews • Bolster the chances of getting success in the placement drives.

  • • Overview of Data Structures and Algorithms • Importance of Data Structures and Algorithms in Programming • Basic concepts of Time Complexity and Space Complexity • Introduction to Big O (O), Omega (O), and Theta (T) notation
  • • Introduction to Arrays: Basic operations, advantages, and limitations • Introduction to Linked Lists: Singly Linked Lists, Doubly Linked Lists, Circular Linked Lists • Comparison between Arrays and Linked Lists
  • • Introduction to Stacks and Queues: Operations, Implementation, and Applications • Introduction to Recursion: Basic concepts and examples • Understanding recursion vs. iteration
  • • Introduction to Trees: Basic terminology and properties • Binary Trees: Introduction and operations • Binary Search Trees: Properties and operations • Balanced Binary Trees: AVL Trees
  • • Graphs: Introduction and representation • Graph Traversal Algorithms: Breadth-First Search (BFS), Depth-First Search (DFS) • Heap Data Structure: Min-Heap, Max-Heap, Heap Operations • Hashing: Introduction, Hash Functions, Collision Resolution Techniques
  • • Searching Algorithms: Linear Search, Binary Search • Sorting Algorithms: Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort • Analysis of Sorting and Searching Algorithms: Time Complexity and Space Complexity • Projects: To-Do List Manager, Maze Solver, Contact Management System

Avatar
Sudha Shanker Prasad
Assistant Professor

Mr. Sudha is currently working as Assistant Professor in the School of Computer Science & Engineering at Lovely Professional University. He has done Master’s in Computer Science and Engineering and has 7+ years experience as a Data Structure and Algorithms tutor in various colleges. He have conducted lots of workshops and skill development courses on programming languages, data structures and algorithms.


Avatar
Puneet Kumar
Assistant Professor

Mr. Puneet is currently working as Assistant Professor in the School of Computer Science & Engineering at Lovely Professional University. He has done Master’s in Computer Science and Engineering and has 11+ years experience as a Data Structure and Algorithms tutor in various colleges. He have conducted lots of workshops and skill development courses on programming languages, data structures and algorithms.