Introduction to Data Structures with C++

Categories: Trending
Wishlist Share
Share Course
Page Link
Share On Social Media

About Course

This course provides a comprehensive introduction to data structures using the C++ programming language. Data structures are fundamental components in computer science, crucial for organizing and manipulating data efficiently. Whether you’re a novice programmer or an experienced developer looking to enhance your understanding of data structures, this course is designed to cater to learners of all levels. We will cover a wide range of data structures and algorithms, empowering you to make informed decisions about data organization and manipulation in your software projects.

What Will You Learn?

  • Understand the foundational concepts and principles of data structures.
  • Gain proficiency in C++ programming and its application to data structures.
  • Learn to design, implement, and analyze various data structures such as arrays, linked lists, stacks, queues, trees, and graphs.
  • Master common algorithms for sorting, searching, and traversing data structures.
  • Develop problem-solving skills through hands-on programming assignments and projects.
  • Explore the trade-offs and considerations involved in selecting the right data structure for specific applications.
  • Prepare for advanced data structure courses or real-world software development challenges.

Course Content

Module 1: Introduction to C++ and Data Structures
Object oriented paradigm - Structured vs. Object Oriented Paradigm - Elements of Object Oriented Programming – Objects – Classes - Information and its Storage representation – Storage of Information – Data Structures – Types of Data Structures - Operations on data Structures.

  • Introduction to C++ and Data Structures
    03:00:00
  • Linear Data Structure Using Arrays and Pointers
    03:00:00
  • Sorting and Searching
    03:00:00

Stacks and Queues
Stacks – Definition – Applications of Stacks – Representation of Stack – Representation of Stack as an ADT - Array representation. Operations on Stacks - Recursion – Evaluation of Arithmetic Expressions – Conversion of Infix to Postfix Notation – Towers of Hanoi problem. Queues – Definition – Representation of queues - Array representation – Operations of queues - Types of Queues – Circular queue – Definition – Operations – Applications - Deque – Definition – Operations – Applications - Priority queue - Definition – Operations – Applications – Case Study.

Introduction to Linked Lists
Definitions – Types – Single Linked lists – Representation as an ADT - Operations - Circular Linked list – Operation - Double Linked Lists – Operations - Circular double linked lists - Operations – Applications of Linked lists – Sparse Matrix Manipulation – Polynomial Representation and Manipulation – Case Study

Non- linear Data Structures – Trees
Trees – Definitions and Concepts – Types of Binary trees - Operations on Binary trees – Storage Representation and manipulation of Binary Trees – Linear - Linked and Threaded Storage Representation for Binary trees – Conversion of General trees to Binary trees – Sequential and other Representation of trees – Applications – Manipulation of Arithmetic Expressions. AVL Trees – Single & Double Rotation – Case Study

Introduction to Graphs
Graphs and their Representation – Definition, Graph Terminology – Graph Abstract Data Types - Matrix Representation – List Structures – Other Representation - Operations – Traversals - Breadth First Search – Depth first Search – Spanning Trees – Applications – Topological Sorting – Case Study

Want to receive push notifications for all major on-site activities?

✕