Subcribe and Access : 5200+ FREE Videos and 21+ Subjects Like CRT, SoftSkills, JAVA, Hadoop, Microsoft .NET, Testing Tools etc..

Batch Date: Sept 20th @5:00PM

Faculty: Mr. Akshay (12+ Yrs of Exp,.. & Real Time Expert)

Duration: 2 Months 15 Days

Venue :
DURGA SOFTWARE SOLUTIONS at Maitrivanam
Plot No : 202, IInd Floor ,
HUDA Maitrivanam,
Ameerpet, Hyderabad-500038.

Ph.No: +91 - 9246212143, 80 96 96 96 96

Syllabus:

Data Structures with C

1. Getting Started

• Introduction
• Programming Languages
• Data type, variables, expression
• Operators
  • Arithmetic operators
  • Relational operators
  • Logical operators
  • Assignment operators
  • Increment & decrement operators
  • Conditional operator
  • Comma operator
• Type Casting
• Precedence and Associativity
• Control Statement
  • if-else
  • switch-case-default
  • for loop
  • while loop
  • do-while loop
• Defining a function
• Calling a function
• Return statement
• Function Declaration/Function Prototype
• Category of functions
• Programming Examples Using Functions
• MCQ

2. Arrays

• Introduction
• One Dimensional Array
  • Definition
  • Declaration
  • Initialization
  • Processing with array
  • Memory representation of array
• Basic Operations of 1-D array
  • Traversing
  • Insertion
  • Deletion
  • Searching
  • Sorting
  • Merging
• Two-Dimensional array
  • Address Calculation in 2-D array
  • Row major order
  • Column major order
• Matrix Addition
• Sparse Matrix
• Polynomial Representation
• MCQ

3. Pointer and Structures

• Introduction
• Pointer Variable declaration
• The & and * operator and sizeof operator
• Pointers and Functions
• Call by Value and Call by Address
• Pointers and array
• Dynamic Memory Allocation
• What is structure
• Initialization of structure
• Typedef
• Pointer tstructure
• Self-referential structure
• MCQ

4. Introduction tData Structure

• What is Data, Information, Program, Software
• What is Data Structure
• Types of Data Structure
  • Linear Data Structure
  • Non-Linear Data Structure
• Data Structure Operations
• Need of Data Structure
• Application of Data Structure
• What is Algorithm
• Characteristics of Algorithm
• Difference between Program and Algorithm
• Algorithm Analysis
  • Best Case Time Complexity
  • Worst-Case Time Complexity
  • Average-Case Time Complexity
• MCQs

5. Linked List

• Definition
• Advantages and Disadvantages
• Types of Linked List
• Single Linked List
  • Traversing a single linked list
  • Insertion at beginning
  • Insertion at end
  • Insertion at specific position
  • Delete from begin
  • Delete from end
  • Delete from any specific position
  • Reverse single linked list
  • Count the nof nodes
  • Searching in a single linked list
  • Merging of twlinked list
  • Sorting in a single linked list
  • Polynomial Addition
• Double linked list
  • Traversing a double linked list
  • Insertion at beginning
  • Insertion at end
  • Insertion at specific position
  • Delete from begin
  • Delete from end
  • Delete from any specific position
• Circular linked list
  • Traversing a Circular linked list
  • Insertion at beginning
  • Insertion at end
  • Insertion at specific position
  • Delete from begin
  • Delete from end
  • Delete from any specific position
• MCQs

6. Stack

• Stack Introduction
• Array Implementation of Stack
  • Push Operation
  • Pop Operation
• Linked List Implementation
  • Push Operation of Stack
  • Pop Operation of Stack
• Application of Stack
  • Reversal of string
  • Checking validity of an expression containing Nested parenthesis
  • Decimal tBinary Conversion
• Polish Notation
• Converting Infix expression intPostfix expression
• Evaluation of Postfix expression
• ADT(Abstract data type)
• Stack ADT
• MCQs

7. Queue

• Queue Introduction
• Array Implementation of Queue
  • Add Operation in Queue
  • Delete Operation in Queue
• Linked List Implementation
  • Add Operation in Queue
  • Delete Operation in Queue
• Circular Queue
  • Add Operation in Queue
  • Delete Operation in Queue
• Priority Queue
  • Add Operation in Queue
  • Delete Operation in Queue
• Dequeue
  • Add Operation in Queue
  • Delete Operation in Queue
• Queue ADT
• MCQs

8. Recursion

• Definition
• Iteration vs Recursion
• Types of Recursion
• Programming Examples Using Recursion
  • Factorial of a number
  • Fibonacci Sequence
  • GCD of twnumbers
• Tower of Hanoi Problem
• Ackerman Function
• Tail Recursion
• MCQ

9. Trees

• Definition
• Application of Trees
• Basic Terminologies
• Binary Tree
  • Properties of Binary Tree
  • Strictly Binary Tree
  • Complete Binary Tree
  • Almost Complete Binary Tree
• Memory Representation of Binary Tree
  • Array representation of Binary Tree
  • Linked representation of Binary Tree
• Binary Tree Traversal
  • Preorder Traversal
  • Inorder Traversal
  • Postorder Traversal
• Non recursive traversal
• Level order traversal
• Construction of Binary Tree
• Expression Tree
  • Construction of tree from Postfix expression
• Binary Search Tree
  • Searching a node in BST
  • Insertion of a node in BST
  • Deletion of a node in BST
• Threaded Binary Tree
  • Finding inorder successor of a node
  • Finding inorder predecessor of anode
• AVL Tree(Balanced Tree)
• Insertion in AVL Tree
  • Left tLeft rotation
  • Right tRight rotation
  • Left tRight rotation
  • Right tLeft rotation
• Deletion from AVL Tree
• B-Tree
  • Insertion in B-Tree
  • Deletion in B-Tree
• Programming Examples
• MCQs

10. Sorting

• What is Sorting
• Types of Sorting
• Stable Sort
• Performance Analysis
  • Time Complexity
  • Space Complexity
• Asymptotic Notations
  • Big Oh(O) Notation
  • Omega(Ω) Notation
  • Theta(Ɵ) Notation
• Bubble Sort
• Selection Sort
• Insertion Sort
• Quick Sort
• Merge Sort
• Heap Sort
• Radix Sort
• Comparison study of different sorting
• MCQs

11. Graph

• Definition
• Basic Terminologies
• Directed Graph, Undirected Graph
• Representation of Graph
  • Adjacency Matrix
  • Adjacency List
• Traversal in Graph
  • Breadth First Search
  • Depth First Search
• Spanning Tree
• Shortest Path Algorithm
• Prim’s Algorithm
• Kruskal's Algorithm
• MCQs

12. Searching, Hashing

• Linear Search
  • Analysis
• Binary Search
  • Analysis
• Hashing
• Choosing a hash function
  • Truncating Method
  • Mid square Method
  • Folding Method
  • Modular Method
• Collision Resolution (Open Hashing)
  • Separate Chaining
• Closed Hashing (Open Addressing)
  • Linear Probing
  • Quadratic Probing
  • Double Hashing
• Rehashing
• MCQs