Skip to content
Virtual Information Technology World
C++
Syntax for creating user defined manipulators in C++
Default arguments in C++ and its constraints
Template class in C++
Virtual function – Difference between a Virtual function and an Overloaded function
Use of manipulators in C++
Virtual Base class
‘inline’ keyword
Concept of Data hiding in a class in C++
Class Inheritance in C++
Concept of Polymorphism in C++
Pure Virtual Functions in C++
Difference between a Virtual function and Overloaded function in C++
Difference between a Virtual class and an Abstract class in C++
Scope resolution operator in C++
Inheritance in C++
Function scope and File scope in C++
Function Prototype & Function Overloading
Difference between containership and inheritance in C++
Constructors and Destructors in C++
Polymorphism in C++
Macro vs. Inline function in C++
Exception handling and its classification in C++
Advantages of reference variables over pointers in C++
How is polymorphism achieved at compile time in C++
Limitations on Constructors and Destructors in C++
Multiple choice questions in C++
‘TRUE’ OR ‘FALSE’ in C++
Fill up the blank in C++
DOEACC A LEVEL A6-R4 DATA STRUCTURE THROUGH C++ QUESTION PAPERS
Arrays
Introduction to Algorithm Design
Basic concepts of Data Representation
Array Representation – Column-major & Row-major
Binary Search Tree
Indexed Sequential Search
Search – Indexed Sequential Search
Hashing
Stacks
Conversion from Infix to Postfix
Conversion from Infix to Prefix
Conversion from Postfix to Infix
Conversion from Postfix to Prefix
Conversion from Prefix to Infix
Conversion from Prefix to Postfix
Evaluation of Infix expression
Evaluation of Postfix expression
Evaluation of Prefix expression
Graphs
Implementation of Adjacency List Representation for Graphs
Josephus Algorithm
Polish Notations
Parenthesis checker
Polynomial – Representation, Addition, Multiplication
Programs
Program for operations on a Doubly Linked List
Program for operations on a Singly Linked List
Program for representing multiple stacks in one array
Program to compute factorial of a given number
Program to compute GCD of given two numbers x and y
Program to compute power of a given number x raised to y
Program to create a Binary Search Tree
Program to create a FIFO Linked List
Program to create a LIFO Linked List
Program to create a Sorted Linked List
Program to delete a value from a given array from a given position
Program to delete a value from a given array such that array remains sorted
Program to implement a Queue using Array by incrementing front as well as rear
Program to implement a Queue using Array with front always at zero
Program to implement Dequeue (Double Ended Queues) using Arrays with front always at zero
Program to implement Graphs using Adjacency Matrix
Program to implement In-Threaded Binary Tree
Program to implement Left-In-Threaded Binary Tree
Program to implement Linear Queues using Linked List
Program to implement Linear Queues using Linked list using global front and rear pointers
Program to implement MAX Priority Queue
Program to implement MIN Priority Queue
Program to implement Right-In-Threaded Binary Tree
Program to implement Stack using Linked List
Program to implement Stack using structures
Program to implement various operations on a Binary Search Tree
Program to insert a value in an array at a given position
Program to insert a value in an array such that array remains sorted
Program to perform Binary Search
Program to perform Linear Search
Program to represent Sparse Matrix using arrays
Program to represent Sparse Matrix using singly linked list (One dimensional list)
Program to represent two polynomials using arrays and compute their sum
Program to sketch a Graph using Adjacency matrix
Program to solve Towers of Hanoi problem
Representing two stacks in an array
Recursion
Linked List
Singly Linked List
Singly Linked List – Creation (LIFO, FIFO, Sorted)
Doubly Linked List
Circular Linked List
Conversion of a Linked List into Array
Sorting
Sorting – Bubble sort
Sorting – Insertion sort
Sorting – Merge Sort
Sorting – Quick Sort (Partition Exchange Sort)
Sorting – Radix Sort
Sorting – Shell sort
Sorting – General Selection Sort
Sorting – Straight Selection Sort
Sorting – Address Calculation Sort (Hashing)
Sorting on multiple keys
Sparse Matrix
Sparse Matrix representation for polynomials
Sparse Polynomial representation and addition
Trees
Threaded Binary Trees
Advanced Trees
Contact
Video Category
Video Tag
Search Videos
User Videos
Player Embed
Virtual Information Technology World
Navigation Menu
Navigation Menu
C++
Syntax for creating user defined manipulators in C++
Default arguments in C++ and its constraints
Template class in C++
Virtual function – Difference between a Virtual function and an Overloaded function
Use of manipulators in C++
Virtual Base class
‘inline’ keyword
Concept of Data hiding in a class in C++
Class Inheritance in C++
Concept of Polymorphism in C++
Pure Virtual Functions in C++
Difference between a Virtual function and Overloaded function in C++
Difference between a Virtual class and an Abstract class in C++
Scope resolution operator in C++
Inheritance in C++
Function scope and File scope in C++
Function Prototype & Function Overloading
Difference between containership and inheritance in C++
Constructors and Destructors in C++
Polymorphism in C++
Macro vs. Inline function in C++
Exception handling and its classification in C++
Advantages of reference variables over pointers in C++
How is polymorphism achieved at compile time in C++
Limitations on Constructors and Destructors in C++
Multiple choice questions in C++
‘TRUE’ OR ‘FALSE’ in C++
Fill up the blank in C++
DOEACC A LEVEL A6-R4 DATA STRUCTURE THROUGH C++ QUESTION PAPERS
Arrays
Introduction to Algorithm Design
Basic concepts of Data Representation
Array Representation – Column-major & Row-major
Binary Search Tree
Indexed Sequential Search
Search – Indexed Sequential Search
Hashing
Stacks
Conversion from Infix to Postfix
Conversion from Infix to Prefix
Conversion from Postfix to Infix
Conversion from Postfix to Prefix
Conversion from Prefix to Infix
Conversion from Prefix to Postfix
Evaluation of Infix expression
Evaluation of Postfix expression
Evaluation of Prefix expression
Graphs
Implementation of Adjacency List Representation for Graphs
Josephus Algorithm
Polish Notations
Parenthesis checker
Polynomial – Representation, Addition, Multiplication
Programs
Program for operations on a Doubly Linked List
Program for operations on a Singly Linked List
Program for representing multiple stacks in one array
Program to compute factorial of a given number
Program to compute GCD of given two numbers x and y
Program to compute power of a given number x raised to y
Program to create a Binary Search Tree
Program to create a FIFO Linked List
Program to create a LIFO Linked List
Program to create a Sorted Linked List
Program to delete a value from a given array from a given position
Program to delete a value from a given array such that array remains sorted
Program to implement a Queue using Array by incrementing front as well as rear
Program to implement a Queue using Array with front always at zero
Program to implement Dequeue (Double Ended Queues) using Arrays with front always at zero
Program to implement Graphs using Adjacency Matrix
Program to implement In-Threaded Binary Tree
Program to implement Left-In-Threaded Binary Tree
Program to implement Linear Queues using Linked List
Program to implement Linear Queues using Linked list using global front and rear pointers
Program to implement MAX Priority Queue
Program to implement MIN Priority Queue
Program to implement Right-In-Threaded Binary Tree
Program to implement Stack using Linked List
Program to implement Stack using structures
Program to implement various operations on a Binary Search Tree
Program to insert a value in an array at a given position
Program to insert a value in an array such that array remains sorted
Program to perform Binary Search
Program to perform Linear Search
Program to represent Sparse Matrix using arrays
Program to represent Sparse Matrix using singly linked list (One dimensional list)
Program to represent two polynomials using arrays and compute their sum
Program to sketch a Graph using Adjacency matrix
Program to solve Towers of Hanoi problem
Representing two stacks in an array
Recursion
Linked List
Singly Linked List
Singly Linked List – Creation (LIFO, FIFO, Sorted)
Doubly Linked List
Circular Linked List
Conversion of a Linked List into Array
Sorting
Sorting – Bubble sort
Sorting – Insertion sort
Sorting – Merge Sort
Sorting – Quick Sort (Partition Exchange Sort)
Sorting – Radix Sort
Sorting – Shell sort
Sorting – General Selection Sort
Sorting – Straight Selection Sort
Sorting – Address Calculation Sort (Hashing)
Sorting on multiple keys
Sparse Matrix
Sparse Matrix representation for polynomials
Sparse Polynomial representation and addition
Trees
Threaded Binary Trees
Advanced Trees
Contact
Video Category
Video Tag
Search Videos
User Videos
Player Embed
Video Tag
No tags found
Post Views:
6
error:
Content is protected !!