Data Structure & Algorithm

Overview
Lecture Video
Instructor

What you will learn in this course

Describe array, pointer and string.
Explain Stack.
State Queue, De-queue.
Explain the concept of linked list.
Describe traversing, searching, insertion & deletion in linked list.
Explain tree structure.
Describe the operation of Searching.
Describe the operation of different types of Sorting.

Requirements

internet connection, computer, mobile or a smart device, pen-paper & other stuff for taking down notes

Syllabus

Data structures and algorithms are essential tools in computer science and engineering.
A well-designed data structure and algorithm can improve the performance of software
systems, reduce memory usage, and provide better user experiences. A data structure is
a way of organizing data in memory so that it can be accessed and used efficiently. The
most common data structures include arrays, linked lists, stacks, queues and trees. An
algorithm is a step-by-step procedure for solving a problem or performing a task. Some
common algorithms include searching, sorting, and path finding. By understanding the
different types of data structures and algorithms, developers can choose the best option
for a specific problem and optimize the performance of software systems.