Data Structure Through Object Oriented Programming Language

Overview

Course Description

This course covers data structures and algorithms, such as arrays, linked lists, and queues. Each of these data structures has a different function and can be used in different situations. In the course, students will learn how to create and organize data elements, search for them, and perform operations on them.

What you'll learn

How arrays and linked lists allow you to store data in the appropriate format.
How to perform various functions such as inserting, searching, and deleting data. Linked lists are also useful and can be used to sort data using the merge sort algorithm.
How to use sorting.

How to use data structures that contain data, in the form of fields (or attributes) and code, in the form of procedures, (or methods).
How data structure is used for essential part of any programming language, and this course will cover the fundamentals of data structures.

Course Content

Object Oriented Concepts

Lecture 1.1 Object Oriented Programming

02:53
Lecture 1.2 OOP concepts

02:53

Basics of C++, classes and objects

Lecture 2.1 Features of C++, Tokens, keywords, Data types, Operators

02:53
Lecture 2.2 Manipulators, Consol input, output, Control statements

02:53
Lecture 2.3 Functions, Classes, Instantiation, Destructor, constructor

02:53
Lecture 2.4 Polymorphism

02:53

Analysis of Algorithms

Lecture 3.1 Introduction to algorithm design and Data Structures

02:53
Lecture 3.2 Comparison of Algorithms

02:53
Lecture 3.3 Complexity in terms of space and Time

02:53
Lecture 3.4 Calculation of O- notation

02:53
Lecture 3.5 Abstract Data type and its implementation

02:53

Sorting and Searching

Lecture 4.1 Searching

02:53
Lecture 4.2 Sorting

02:53

Elementary Data Structures- Arrays, Linked Lists

Lecture 5.1 Representation of arrays-single and Multidimensional

02:53
Lecture 5.2 Address calculation using row major ordering

02:53
Lecture 5.3 Various operations on arrays, Linked Lists-Singly Linked List

02:53
Lecture 5.4 Double linked List, Circular Linked List- traversing, deleting

02:53
Lecture 5.5 Inserting, searching, counting, reversing, printing of nodes

02:53

Stack and Queue

Lecture 6.1 Stack ADT, Implementation of stack using array and linked list

02:53
Lecture 6.2 Application of Stack

02:53
Lecture 6.3 Implementation of Queue using Array and Linked List

02:53

Trees

Lecture 7.1 Definition and notations, Binary Search Trees Implementation

02:53
Lecture 7.2 Traversals using Stacks and Recursion

02:53
Lecture 7.3 Threaded binary tree, B-trees with implementation of 2-3 trees.

02:53

Graphs

Lecture 8.1 Definition and notations, Components of Graphs

02:53
Lecture 8.2 Types of Graphs

02:53
Lecture 8.3 Graph Implementation using Adjacency Matrix & List Algorithms

02:53
Lecture 8.4 Graph Traversal Methods

02:53

About Us

TECHINAUT

A LEVEL

4.5 Instructor Rating

100+ Courses

20+ Faculty

Industry Expert

45000+ students enrolled

UI/UX Designer, with 7+ Years Experience. Guarantee of High Quality Work.

Skills: Web Design, UI Design, UX/UI Design, Mobile Design, User Interface Design, Sketch, Photoshop, GUI, Html, Css, Grid Systems, Typography, Minimal, Template, English, Bootstrap, Responsive Web Design, Pixel Perfect, Graphic Design, Corporate, Creative, Flat, Luxury and much more.

Available for:

1. Full Time Office Work
2. Remote Work
3. Freelance
4. Contract
5. Worldwide

Reviews

Nicole Brown

UX/UI Designer

4.5 Instructor Rating

“ This is the second Photoshop course I have completed with Cristian. Worth every penny and recommend it highly. To get the most out of this course, its best to to take the Beginner to Advanced course first. The sound and video quality is of a good standard. Thank you Cristian. “