Course Details

TECHNICAL APTITUDE

Autoscroll

The Technical Aptitude part of the unified course covers following modules:

DATA STRUCTURES

  1. Introduction
  • Array Basics, Stack Basics
  • Difference between Arrays and Stacks
  • Program to Push,Pop and Display operation on Stacks
  • Queue basics
  • Program to Insert an element at rear of Queue
  • Program to Delete an element at the beginning of Queue
  • Program to display elements in Queue
  • Circular Queue
  • Program to Insert an element in a circular queue
  • Program to delete an element in a circular queue
  • Program to display elements in a circular queue
  • Program to insert, delete and display elements in a circular queue using pointers
  • Structures
  1. Singly Linked Lists
  • Singly LinkedLists
  • Basics of singly LinkedList
  • Program to insert an element at front in singly linked list
  • Program to insert an element at rear in singly linked list
  • Program to delete an element from front in singly linked list
  • Program to delete an element from rear in singly linked list
  • Program to display elements in a singly linked list
  1. Doubly Linked Lists
  • Basics of Doubly LinkedList
  • Program to insert an element at front in doubly linked list
  • Program to insert an element at rear in doubly linked list
  • Program to delete an element from front in doubly linked list
  • Program to delete an element from rear in doubly linked list
  • Program to display elements in a doubly linked list
  1. Circular Linked Lists
  • Circular Linked Lists, Basics of Circular LinkedList
  • Program to insert an element at front in Circular linked list
  • Program to insert an element at rear in Circular linked list
  • Program to delete an element from front in Circular linked list
  • Program to delete an element from rear in Circular linked list
  • Program to display elements in a Circular linked list
  1. Stacks and queues
  • Program to concatenate two linked lists
  • Program to count the number of nodes in the linked list
  • Program to add the data nodes of in the linked list
  • Program to reverse a linked list
  • Program to search an element in a linked list
  • Program to delete a node in the linked list
  • Program to insert an element towards the left of data node in linked list
  • Program to insert an element towards the right of data node in linked list
  • Program to find minimum element in the linked list
  • Program to find maximum  element in the linked list
  • Program to count the number of even and odd number of elements in a linked list
  1. Static and Dynamic memory Location
  • Program to compare two linked lists
  • Program to delete duplicate element in a linked list
  1. Tree Basics
  • Pre order traversal, Post order traversal, In order traversal
  • Program to create a Binary Search Tree
  • Program to find a minimum element in a Binary Search Tree
  • Program to find a maximum element in a Binary Search Tree


copyright © 2017 | abc for technology training