• No products in the cart.

Objective of Data Structure Through Object-Oriented Programming Language Introduction to Data Structure Through Object-Oriented Programming Language

Created by

Last updated:

April 12, 2022

Share on facebook
Share on twitter
Share on linkedin
Share on whatsapp
900.00
This course includes:
Hours of videos

5 days

Units & Quizzes
Unlimited Lifetime access
Access on mobile app
Certificate of Completion

Objective of Data Structure Through Object-Oriented Programming Language

Introduction to Data Structure Through Object-Oriented Programming Language

Course Currilcum

    • 1.0 OBJECTIVES Unlimited
    • 1.1 Object Oriented Programming- a new paradigm 00:20:00
    • 1.2 Abstraction, forms of Abstraction 00:20:00
    • 1.3 OOP concepts- Classes 00:20:00
    • 1.4 Objects, Polymorphism 00:20:00
    • 1.5 Data Encapsulation 00:20:00
    • 1.6 Data Hiding 00:20:00
    • 1.7 Inheritance 00:20:00
    • ASSIGNMENT AND QUESTION TO SOLVE 5 days
    • PRACTICLE 03:00:00
    • ONLINE MCQ’S 00:05:00
    • 2.0 OBJECTIVES Unlimited
    • 3.1 Features of C++ 00:30:00
    • 3.2 Tokens, keywords 00:30:00
    • 3.3 Data types 00:30:00
    • 3.4 Operators 00:30:00
    • 3.5 Manipulators 00:30:00
    • 3.6 Console input 00:30:00
    • 3.7 Output 00:30:00
    • 3.8 Control statements (conditional and loops) 00:30:00
    • 3.9 Functions 00:30:00
    • 3.10 Classes 00:30:00
    • 3.11 Instantiation 00:30:00
    • 3.12 Destructor 00:30:00
    • 3.13 Constructor 00:30:00
    • 3.14 Polymorphism – Operator Overloading 00:30:00
    • 3.15 Function Overloading 00:30:00
    • 3.16 Inheritance-Single 00:30:00
    • 3.17 Multiple 00:30:00
    • 3.18 Multilevel 00:30:00
    • 3.19 Pointers 00:30:00
    • ASSIGNMENT AND QUESTION TO SOLVE 00:00:00
    • PRACTICLE 15:00:00
    • ONLINE MCQ’S 00:05:00
    • 3.0 OBJECTIVES Unlimited
    • 3.1 Introduction to algorithm design and Data structures 00:30:00
    • 3.2 Comparison of Algorithms 00:30:00
    • 3.3 Complexity in terms of space and time 00:30:00
    • 3.4 Calculation of O- notation 00:30:00
    • ASSIGNMENT AND QUESTION TO SOLVE 00:00:00
    • PRACTICLE 03:00:00
    • ONLINE MCQ’S 00:05:00
    • 4.0 OBJECTIVES Unlimited
    • 4.1 Searching- Linear and Binary Search 01:00:00
    • 4.2 Sorting- Bubble Sort 01:00:00
    • 4.3 Selection Sort 01:00:00
    • 4.4 Insertion Sort 01:00:00
    • 4.5 Quick Sort 01:00:00
    • 4.6 Merge Sort 01:00:00
    • 4.7 Comparison of various searching and sorting techniques in terms of time complexity 01:00:00
    • ASSIGNMENT AND QUESTION TO SOLVE 00:00:00
    • PRACTICLE 12:00:00
    • ONLINE MCQ’S 00:05:00
    • 5.0 OBJECTIVES Unlimited
    • 5.1 Representation of arrays-single and multidimensional 00:40:00
    • 5.2 Address calculation using row major ordering 00:40:00
    • 5.3 Various operations on arrays 3 years, 4 months
    • 5.4 Linked Lists-Singly Linked List 00:40:00
    • 5.5 Double linked List 00:40:00
    • 5.6 Circular Linked List- traversing 00:40:00
    • 5.7 Inserting 00:40:00
    • 5.8 Searching 00:40:00
    • 5.9 Counting 00:40:00
    • 5.10 Reversing 00:40:00
    • 5.11 Printing of nodes 00:40:00
    • ASSIGNMENT AND QUESTION TO SOLVE 00:00:00
    • PRACTICLE 12:00:00
    • ONLINE MCQ’S 00:05:00
    • 6.0 OBJECTIVES Unlimited
    • 6.1 Stack ADT 01:20:00
    • 6.2 Implementation of stack using array and linked list 01:20:00
    • 6.3 Application of Stack- Evaluation of postfix/prefix expression 01:20:00
    • 6.4 Queue ADT 01:20:00
    • 6.5 Implementation of queue using Array and Linked List 01:20:00
    • ASSIGNMENT AND QUESTION TO SOLVE 00:00:00
    • PRACTICLE 09:00:00
    • ONLINE MCQ’S 00:05:00
    • 7.0 OBJECTIVES Unlimited
    • 7.1 Definition and notations 01:00:00
    • 7.2 Binary Search Trees Implementation 01:00:00
    • 7.3 Traversals using stacks and recursion – In-order 01:00:00
    • 7.4 Post-order 01:00:00
    • 7.5 Pre-order techniques 01:00:00
    • 7.6 Threaded binary tree 01:00:00
    • 7.7 B-trees with implementation of 2-3 trees 01:00:00
    • ASSIGNMENT AND QUESTION TO SOLVE 00:00:00
    • PRACTICLE 12:00:00
    • ONLINE MCQ’S 00:05:00
    • 8.0 OBJECTIVES Unlimited
    • 8.1 Definition and notations 00:40:00
    • 8.2 Components of Graphs 00:40:00
    • 8.3 Types of Graphs 00:40:00
    • 8.4 Graph Implementation using Adjacency Matrix and Adjacency List algorithms and programs 00:40:00
    • 8.5 Graph Traversal Methods: Depth First Search and Breadth First Search 00:40:00
    • ASSIGNMENT AND QUESTION TO SOLVE 00:00:00
    • PRACTICLE 06:00:00
    • ONLINE MCQ’S 00:05:00

COURSE REVIEWS

N.A

0 ratings
  • 5 stars0
  • 4 stars0
  • 3 stars0
  • 2 stars0
  • 1 stars0

No Reviews found for this course.

Share on facebook
Facebook
Share on twitter
Twitter
Share on linkedin
LinkedIn
Share on whatsapp
WhatsApp