Udemy – Data Structures and Algorithms-Part-1 2022-11

Apr 18, 2025 - 19:05

0 0

Data Structures and Algorithms-Part-1 Course. This course deals with the concepts and implementations of linear data structures like Array, Stack, Queue and Linked List. For better understanding, examples related to visual representation are provided. Differences between static and dynamic data structures are discussed with practical implementations. Stack applications like Infix to Postfix conversion, Postfix evaluation, Decimal to Binary conversion and Palindrome checking are discussed in detail with suitable simple coding. Similarly, Queue applications like Stack implementation using Single Queue and Double Queue are discussed in detail. Introduction to Linked List and its variants like Singly Linked List, Circularly Linked List, Doubly Linked List and Doubly Circular Linked List and its operations, creation of Node, insertion of Node at different positions of Linked List, removal of Node from different positions, traversal of Linked List are explained with easy to understand code. This course also covers the basics of object-oriented programming such as writing Functions, passing Parameters to Functions, and calling them. It also emphasizes writing Default Constructors and Parameterized Constructors.

What you will learn:

Basics of linear data structures such as Array, Stack, Queue, and Linked List and the differences between static and dynamic data structures
1D, 2D and multi-dimensional arrays and writing code for a given problem that uses arrays
Stack data structure and its implementations with examples
Stack applications that help to derive an idea of where to use the Stack data structure for a given problem
Queue data structure, its implementations and applications with examples and proper coding
Linked Lists such as Singly LL, Doubly LL, Circularly Linked List and Doubly Circularly Linked List
Students will be able to write the logic for any given problem that uses linear data structures.