Skip to main content
E-mail : info@staloysiuscollege.ac.in
  • You are currently using guest access (Log in)
sacelectures

Paper I-Data Structures using C++

  1. Home
  2. Courses
  3. Paper I-Data Structures using C++

Topic outline

  • Advantages of oops

  • Array Part I

  • Array Part II

  • Basics of Functions

  • Control Structure-I

  • Control Structure-II

  • Data types in cpp

  • Defining member functions

  • Formatted unformatted io operations in cpp

  • Input output in cpp

  • Operators in cpp

  • Structure of cpp program

  • Tokens

  • Type Casting

  • Abstract Data Types

  • Applications of Stack

  • INSERT BEGINING AND END IN CIRCULAR LINKED LIST

  • Circular Queue

  • Classification of Data Structures

  • Classification of DS

  • Creation of Circular linked list

  • Data Structures and Algorithms

  • Inserting after and before node in singly linked list

  • Program of doubly linked list

  • Program of Stack

  • Queue data structure

  • Recursion

  • Searching elements in singly linked list

  • Stack-POP operation

  • Stack-PUSH operation

  • BINARY SEARCH ITERATIVE PROCEDURE

  • Graph Traversal

  • Introduction to Searching-binary search

  • Abstraction & Encapsulation

  • Classes , Objects and Access Modifiers

  • Constructors in C++

  • Library functions & Virtual Function

  • Polymorphism

  • POINTERS

  • Inheritance in C++

  • VIRTUAL AND PURE VIRTUAL FUNCTION

  • Operator In C++( Other Operator & Operator Pre

  • Operator In C++ (Bitwise and Ternary)

  • Function overloading and inline Function

  • ARRAY (Multidimensional Array)

  • Paper I-Data Structures using C++
  • Advantages of oops
  • Array Part I
  • Array Part II
  • Basics of Functions
  • Control Structure-I
  • Control Structure-II
  • Data types in cpp
  • Defining member functions
  • Formatted unformatted io operations in cpp
  • Input output in cpp
  • Operators in cpp
  • Structure of cpp program
  • Tokens
  • Type Casting
  • Abstract Data Types
  • Applications of Stack
  • INSERT BEGINING AND END IN CIRCULAR LINKED LIST
  • Circular Queue
  • Classification of Data Structures
  • Classification of DS
  • Creation of Circular linked list
  • Data Structures and Algorithms
  • Inserting after and before node in singly linked list
  • Program of doubly linked list
  • Program of Stack
  • Queue data structure
  • Recursion
  • Searching elements in singly linked list
  • Stack-POP operation
  • Stack-PUSH operation
  • BINARY SEARCH ITERATIVE PROCEDURE
  • Graph Traversal
  • Introduction to Searching-binary search
  • Abstraction & Encapsulation
  • Classes , Objects and Access Modifiers
  • Constructors in C++
  • Library functions & Virtual Function
  • Polymorphism
  • POINTERS
  • Inheritance in C++
  • VIRTUAL AND PURE VIRTUAL FUNCTION
  • Operator In C++( Other Operator & Operator Pre
  • Operator In C++ (Bitwise and Ternary)
  • Function overloading and inline Function
  • ARRAY (Multidimensional Array)
  • Home
  • Calendar

About St. Aloysius College

St. Aloysius College is the pioneer educational institution in the town as well as in the state. It is affiliated to the Rani Durgavati Vishwavidalaya , Jabalpur.  St. Aloysius College was founded in 1951 and is situated in the Jabalpur Cantonment area.  It is a Christian College owned and established by the Catholic Diocese of Jabalpur, which belongs to the minority community of Catholics and is administered by the said Diocese through the St. Aloysius College Society.

  • Moodle community
  • Moodle Docs
  • Moodle support

Contact us

St. Aloysius College, 1, Ahilya Bai Marg, Pentinaka Chowk, Sadar, Jabalpur, Madhya Pradesh, India-482001
E-mail : info@staloysiuscollege.ac.in

Follow us

Copyright @ St. Aloysius College(Autonomous) Jabalpur, Madhya Pradesh.