KICIT & KSET Pvt Ltd, Nagpur India

  • Home
  • Quest Courses
    • All Courses
    • Comp. Sci. Foundations
    • .NET Foundations
    • Web Programming
    • Advanced .NET
    • Desktop Prog.
    • Other Courses
    • Purchase Online
    • Purchase Product Keys Online
    • Help
    • Quest Certification
    • Quest Dealers
  • Books
    • All Books
    • C Programming
    • Data Structures
    • C++ Programming
    • .NET Series
    • Embedded Systems
    • Other Books
    • Visual C++
    • Written Test Series
  • Courses@Nagpur
    • C Programming
    • C++ Programming
    • Embedded Systems
    • Java Programming
  • Start a QLC
  • Seminars
    • Seminar/Workshop
    • Corporate Training
    • Send Enquiry
  • About Us
    • Contact Us
    • Blogs
      • Asang Dani
      • Yashavant Kanetkar
Home » Quest - Data Structures

Quest - Data Structures

by Asang Dani,Yashavant Kanetkar
Quest - Data Structures

Why Students Love Quest

Click here to find out...

Contents

Data Structures is a fundamental subject in modern Computer Science. Every programmer and developer must be well versed with it. This course helps you understand the design, implementation and analysis of Data Structures Thro. C.

  • C Programming Revision - I
  • C Programming Revision - II
  • Searching
  • Searching & Frequency Count
  • Analysis of Searching Methods
  • Hashing
  • Sorting
  • Sorting & Recursion
  • Quicksort
  • Structures
  • Structures & Polynomials
  • 2D Arrays
  • Sparse Matrices
  • Transpose of Sparse Matrices
  • Addition of Sparse Matrices
  • Multiplication of Sparse Matrices
  • Storage
  • Dynamic Memory Allocation
  • Linked List
  • Operations of Linked List - I
  • Operations of Linked List - II
  • Operations of Linked List - III
  • Operations of Linked List - IV
  • Circular Linked List
  • Doubly Linked List
  • Sparse Matrices as Linked List - I
  • Sparse Matrices as Linked List - II
  • Linked List Using Recursion
  • Linked List Using Unions
  • Generalized Linked List
  • Stack
  • Stack as a Linked List
  • Stack and Expressions
  • Stack Operations
  • Postfix Evaluation
  • Infix To Prefix
  • Postfix To Prefix
  • Postfix To Infix
  • More Conversions
  • Queues - I
  • Queues - II
  • Dequeue & Priority Queue
  • Trees
  • Tree Traversal
  • BST - I
  • BST - II
  • Binary Tree
  • Threaded Binary Tree
  • Heap
  • AVL & B-Trees
  • Graphs
  • Adjacency Multilist
  • Depth First Search
  • Breadth First Search
  • Spanning Tree
  • Dijkstra's Algorithm
  • Memory Management - I
  • Memory Management - II
  • GarbageCollection
  • File Organization

 

 

Product Details

1st Edition
978-81-909696-2-8
Each pack contains
  • 1 DVD
  • Product Key
  • User Guide
System Requirements
  • Windows 8 / 7 /Vista/XP SP2 (32/64-bit)
  • Windows Media Player 9.0 or later
  • Color Monitor 1024x768

You will also like

Java Programming
Quest - Java Programming (Image)
C Programming
Quest - C Programming
C++ Programming
Quest - C++ Programming
Data Structures Thro...
Quest - Data Structures Thro. C++
Mysteries Of Pointers...
Quest - Mysteries of Pointers In C
51 C Programs
Quest - 51 C Programs
  •  
  • 1 of 2
  • ››

AddThis

Copyright © 2014-2017 KSET & KICIT Pvt Ltd.