DATA STRUCTURE USING C
Program Highlights
Datasructure is unique offerings from Prema Computers focusing on using C which is the most popular programming language. The course has been structured to provide knowledge of programming techniques. The highlights include
The Data Structure program is positioned to cater to the IT requirements of large companies and software houses. It is ideally suited for the following category of candidates
  • Freshers developing careers in IT.
  • Professionals aspiring to launch their careers in software development.
  • Individuals with concrete plans to switch over to IT.
Course Curriculum
  • Introduction
  • Definition
  • Classification of Data Structures
  • Description of Various D.S
  • Memory Allocations in C
  • Introduction to Algorithms
  • Performance Analysis & Measurement
  • Big OH Notation
  • Introduction
  • Types of Recursion
  • Storage Classes
  • Recursion Essentials
  • Disadvantages of Recursion
  • Simple Recursive program
  • Tower of Hanoi
  • Recursion vs. Iterations
  • Introduction
  • One –Dimensional Arrays
  • Initializing One Dimensional Arrays
  • Accessing One Dimensional Arrays Element
  • Implementation One Dimensional Arrays in memory
  • Passing Array to function
  • Insertion One –Dimensional Arrays
  • Deleting an Element from One –Dimensional Arrays
  • Traversing Array Combing All Together
  • Merging two Array
  • Multi Dimensional Arrays
  • Initialization Multi Dimensional Arrays
  • Accessing Two Dimensional Arrays Element
  • Implementation Two Dimensional Arrays in memory
  • Pointer and Array
  • Array of Pointer
  • Array of Structures
  • Array Within Structures
  • Sparse Matrix
  • Limitation of Matrix
  • Introduction
  • Stacks Implementation
  • Operation on Stack
  • Stack Terminology
  • Algorithms For Push and pop
  • Implementing stack using Pointers
  • Applications Of stack
  • Algorithms For Converting Infix Expression to Postfix form
  • Algorithm Evaluate a Postfix Expression
  • Introduction
  • Queue Implementation
  • Operation on Queues
  • Algorithms For Insertion and Deletion in Queues (Using Arrays)
  • limitation of Simple Queues
  • Algorithms For Insertion and Deletion in Queues (Using pointers)
  • Variations in a Queues
  • Application of Queues
  • Introduction
  • Linked List
  • Key Terms
  • Representation of Linear Linked List
  • Operation on linked list
  • Types of linked list
  • Singly linked list
  • Circular linked list
  • Doubly linked list
  • Circular Doubly linked list
  • Application : Addition of Two Polynomials
  • Introduction
  • Tree Terminology
  • Binary tree
  • Binary tree Representation
  • Creation of Binary tree
  • Operation on Binary tree
  • Technique of Conversion of Expression into Binary tree
  • Binary Search Tree
  • Threaded Binary tree
  • Height Balanced tree
  • B-tree
  • Properties of Binary tree
  • Introduction
  • Sorting Array
  • Searching of Array Element
  • Hasing
  • Introduction
  • Defining Graph
  • Basic Terminology
  • Graph Representation
  • Graph Traversal
  • Shortest Path Problem
  • Minimal Spanning Tree
  • Introduction
  • Terminology
  • File Organisation
  • File Operation
  • Sequential Files
  • Indexed Sequential Files
  • Direct File Organisation
  • Multiple -Key Access
  • 6 weeks
  • 5 Days a week
  • 2 hr a day –including Theory and Practical
  • Rs.----------------