UP/BCA/2019/3/03
search
  • UP/BCA/2019/3/03
  • UP/BCA/2019/3/03

Data Structure Using C & C++

₹175.00
Tax excluded

ISBN- 978-93-89516-30-2

Mr. Munish Kumar & Mr. Abhishek Km. Maheshwari

Quantity

BCA, Third Semester, According to ‘UP Unified Syllabus’
Syllabus
 
BCA-S202T: DATA STRUCTURE USING C AND C++
 
Unit-I: Introduction to Data Structure and its Characteristics
Array
Representation of Single and Multidimensional Arrays; Sparse Arrays – Lower and Upper Triangular Matrices and Tri-diagonal Matrices with Vector Representation also.
 
Unit-II: Stacks and Queues
Introduction and Primitive Operations on Stack; Stack Application; Infix, Postfix, Prefix Expressions; Evaluation of Postfix Expression; Conversion between Prefix, Infix and Postfix, Introduction and Primitive Operation on Queues, D-queues and Priority Queues.
 
Unit-III: Lists
Introduction to Linked Lists; Sequential and Linked Lists, Operations such as Traversal, Insertion, Deletion Searching,Two WayLists and Use of Headers.
 
Unit-IV: Trees
Introduction and Terminology; Traversal of Binary Trees; Recursive Algorithms for Tree Operations such as Traversal, Insertion, Deletion; Binary Search Tree.
 
Unit-V: B-Trees
Introduction, The Invention of B-Tree; Statement of the Problem; Indexing with Binary Search Trees; a Better Approach to Tree Indexes; B-Trees; Working-up from the Bottom; Example for Creating a B-Tree.
 
Unit-VI
Sorting Techniques; Insertion Sort, Selection Sort, Merge Sort, Heap Sort, Searching Techniques: Linear Search, Binary Search and Hashing.
UP/BCA/2019/3/03
94 Items

Specific References

isbn
978-93-89516-30-2
New
Comments (0)
No customer reviews for the moment.