Talk to an Admissions Advisor now. Your call starts in 10 seconds!

+91

You will receive a call from a number starting with +911824 shortly. Kindly wait for a few seconds after accepting the call to speak with our counsellor.

Counsellors are available from
8.00 A.M to 8.00 P.M

Schedule a Call

You’ll get a call from +911824-XXXXXX at your scheduled time. Please wait for a few seconds to connect.

Name

Mobile Number

Programme Interested

Select Date

Select Time

Summer Internship

Fundamentals of DSA

Overview Course Content Instructor

Course Description

This course provides a solid foundation in Data Structures and Algorithms (DSA). It covers fundamental concepts such as arrays, linked lists, stacks, queues, trees, graphs, sorting, and searching algorithms. Through hands-on coding exercises and problem-solving techniques, students will develop a strong understanding of how data is stored, manipulated, and optimized in real-world applications. By the end of this course, learners will be able to analyze algorithm efficiency and implement data structures efficiently. Outcomes: 1. Understand the Fundamentals of DSA. 2. Implement Basic Data Structures 3. Apply Trees and Graphs Concepts 4. Master Searching and Sorting Algorithms 5. Analyze Algorithm Complexity 6. Solve Real-World Problems Using DSA

Course Fee Seats Limited

₹2500.00

Course Details

Duration

50 HRS

Course Label

SDC

Course Language

English

Course Mode

Online

Timings

7 PM - 8 PM

Days

Monday to Sunday

Registration Till

25 May 2026

Tentative ClassStart Date

2nd Week of June

Eligible Schools:

1. School of Computer Science and Engineering 2. School of AI and Emerging Technologies 3. School of Computing and Artificial Intelligence

Certificate Criteria

75% attendance, 50% score in all Exams/CA

Curriculum Snapshot

Explore the comprehensive course modules

1 Introduction to DSA and Complexity Analysis

Overview of Data Structures and Algorithms Importance of Time and Space Complexity Big O, Big O, and Big T Notations

2 Introduction to Array

Algorithm Design Techniques: Greedy, Divide & Conquer, Dynamic Programming Recursion and its Applications Arrays: Definition, Operations, Applications Arrays: Definition, Operations, Applications Searching Algorithms: Linear Search, Binary Search Sorting Algorithms: Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort

3 Introduction to Linked List

Introduction to Linked Lists Types: Singly Linked List, Doubly Linked List, Circular Linked List Operations: Insertion, Deletion, Traversal, Reversal

4 Stack

Applications of Linked Lists Stack Stacks: Concepts, Implementation, Applications (e.g., Balancing Symbols, Postfix Evaluation)

5 Queue

Queues: Types (Simple Queue, Circular Queue, Priority Queue) Deque and Applications Real-World Use Cases

6 Tree

Introduction to Trees and Terminologies Binary Trees: Traversals (Inorder, Preorder, Postorder)

Instructor Spotlight

Learn from leading experts in stem cell research

Dr. Puneet Kumar

Associate Professor

Dr. 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.

Dr. Nishant Agnihotri

Associate Professor

Dr. Nishant is currently working as Assistant Professor in the School of Computer Science & Engineering at Lovely Professional University. He has done P.hD in Computer Science and Engineering and has 9+ years of 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.