+919145369717
info@amksunbeam.com
+919145369717
info@amksunbeam.com
shape
shape

Data Structure using C

Data Structure using C

About The Course

Data Structure using C

A data structure is a specialized format for organizing and storing data. In computer science, a data structure is a particular way of organizing data in a computer so that it can be used efficiently. Data structure types include the array, the file, the record, the table, the tree, and so on. Any data structure is designed to organize data to suit a specific purpose so that it can be accessed and worked with in appropriate ways. Sunbeam Computer Class Is Specialised Class Of Data Structure using C 

Data structures provide a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services. Usually, efficient data structures are key to designing efficient algorithms. Data structures can be used to organize the storage and retrieval of information stored in both main memory and secondary memory.

Data Structure using C Course Syllabus

  • Basic Terminology
  • Elementary Data Organization
  • Data Structure Operations
  • Algorithm Complexity
  • Time Space trade off

  • Array Definition
  • Representation and Analysis
  • Single and Multi-dimensional Arrays
  • Address Calculation
  • Application of Arrays
  • Character String in C
  • Character String Operation
  • Array as Parameters

  • Array Representation
  • Implementation of Stack
  • Operations on Stack
  • Push and Pop
  • Array Representation of Stack
  • Linked Representation of Stack
  • Operations Associated with Stacks
 

  • Recursive definitions and processes
  • Recursion in C
  • Example of Recursion
  • Tower of Hanoi Problem
  • Simulating Recursion
  • Backtracking
  • Recursive Algorithms

  • Array and Linked Representation
  • Implementation of Queues
  • Operations on Queue
    • Create
    • Add
    • Delete
    • Full
    • Empty
  • Circular Queue
  • Deque
  • Priority Queue

  • Array and Linked Representation
  • Implementation of Queues
  • Operations on Queue
    • Create
    • Add
    • Delete
    • Full
    • Empty
  • Circular Queue
  • Deque
  • Priority Queue

  • Basic Terminology
  • Binary Trees
  • Binary Tree Representation
  • Algebraic Expressions
  • Complete Binary Tree
  • Extended Binary Trees
  • Array and Linked Representation of Binary Trees
  • Traversing Binary Trees

  • Sequential Search
  • Binary Search
  • Comparison and Analysis
  • Hash Table
  • Hash Functions
  • Collision Resolution Strategies
  • Hash Table Implementation

  • Insertion Sort
  • Bubble Sorting
  • Quick Sort
  • Two Way Merge Sort
  • Heap Sort
  • Sorting on Different Keys
  • Practical Consideration for Internal Sorting
 

  • Binary Search Trees
  • Insertion and Deletion in BST
  • Complexity of search Algorithm
  • Path Length
  • AVL Trees
  • B-trees
 

  • Terminology and Representations
  • Graphs and Multi-Graphs
  • Directed Graphs
  • Sequential Representations of Graphs
  • Adjency Matrices
  • Traversal
  • Connected Component and Spanning Trees
  • Minimum Cost Spanning Trees

The Course Curriculam
ce7d6624a6402c0de3bf8dc54af1f43901f9238db7ef779960ca405ade70f449?s=96&d=mm&r=g

Sunbeam Computer Classes

42 Courses 0 Student
3bf161ae27adfaecf9086d4b8d37cac2647ffe33cbfaf14da094c6e1fb0c8fa7?s=96&d=mm&r=g

Kiran Shinde

42 Courses 0 Student
×