Mentor

Anamika Pal

Program Chapters

Introduction

This section is an introduction about what is a data structure and why we are learning it. It also explains algorithms and how to write algorithms as a solution to problems

Array

This section covers all the concepts of the single and double dimensional array in detail. It explains the time complexity and sorting and searching techniques that help in reading and retrieving records from huge data sets.

Structures & Pointers

This section explains the use of pointers and structures in programming and how it is important in real-life applications. This chapter explains the basics of pointers which is important to understand the other parts of the data structure programming

Linked list

Linked list is a linear data structure where data can be stored dynamically anywhere in the computer memory and can be linked with each other using a pointer to the address of the next location. This section gives a detailed explanation of different types of linked lists and their usage.

Stack

Computer memory is based on stack. This section explains the use of stack in programming and how to work with static as well as dynamic stack

​

Learners from this course got placed in

84 more

Job & Internship titles include

Data Engineer, Data Architect, Engineering Manager

This program will enable you to

Understand the concepts of dynamic memory management, algorithms and time complexity

Understand basic data structure such as arrays, linked list, stack, and queues

Solve problems involving graphs and trees

Apply algorithms for solving problems like sorting, searching, insertion and deletion

Understand how to implement algorithms to solve real world problems

What's included?

2 Project Kit

Live projects provided by companies

Assured Internship

Internships accelerate your career

Certification of Program

Recognized by 10,000+ companies

Live Mentor Sessions

Not ordinary sessions, talk to our mentors 

Lifetime Recorded Course

Flexibility of learning anywhere, anytime