Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 40 views

    Semester 3 - Paper Code:BCA 302: Unit-I

    Uploaded by

    Anupam Gupta
    This document outlines the units and topics covered in the 3rd semester BCA 302 paper. Unit 1 discusses lists and their implementations including linked lists, doubly linked lists, and circular linked lists. Unit 2 covers stacks, queues, their implementations and applications. Unit 3 discusses graphs, graph traversal algorithms, binary trees, and binary search trees. Unit 4 presents various searching and sorting techniques like sequential search, binary search, insertion sort, bubble sort, quick sort, and merge sort.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd

    Semester 3 - Paper Code:BCA 302: Unit-I

    Uploaded by

    Anupam Gupta
    40 views1 page
    This document outlines the units and topics covered in the 3rd semester BCA 302 paper. Unit 1 discusses lists and their implementations including linked lists, doubly linked lists, and circular linked lists. Unit 2 covers stacks, queues, their implementations and applications. Unit 3 discusses graphs, graph traversal algorithms, binary trees, and binary search trees. Unit 4 presents various searching and sorting techniques like sequential search, binary search, insertion sort, bubble sort, quick sort, and merge sort.

    Original Description:

    302 LB BCA

    Original Title

    302 LB BCA

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines the units and topics covered in the 3rd semester BCA 302 paper. Unit 1 discusses lists and their implementations including linked lists, doubly linked lists, and circular linked lists. Unit 2 covers stacks, queues, their implementations and applications. Unit 3 discusses graphs, graph traversal algorithms, binary trees, and binary search trees. Unit 4 presents various searching and sorting techniques like sequential search, binary search, insertion sort, bubble sort, quick sort, and merge sort.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    40 views1 page

    Semester 3 - Paper Code:BCA 302: Unit-I

    Uploaded by

    Anupam Gupta
    This document outlines the units and topics covered in the 3rd semester BCA 302 paper. Unit 1 discusses lists and their implementations including linked lists, doubly linked lists, and circular linked lists. Unit 2 covers stacks, queues, their implementations and applications. Unit 3 discusses graphs, graph traversal algorithms, binary trees, and binary search trees. Unit 4 presents various searching and sorting techniques like sequential search, binary search, insertion sort, bubble sort, quick sort, and merge sort.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    You are on page 1of 1

    Semester 3rdPaper Code:BCA 302

    Unit-Ist Structure, definition, and application, Lists, Basic Terminology, Static Implementation of Lists, Pointer Implementation of Lists, Insertion in a list, Deletion from a list, Storage of Sparse, Arrays using Linked List, Doubly Linked Lists, Circular Linked List. Unit-IInd Defining Stack and Queue, Stack Operations and Implementation, Array Implementation, Pointer Implementation, Stack Applications, Convert Number Bases by Using Stacks, Infix to Postfix Conversion, Queue Application, Priority Queues. Unit-IIIrd Defining Graph, Basic Terminology, Graph Traversal, Depth First Search (DFS), Breadth First Search (BFS), Shortest Path Problem, Minimal Spanning Tree, Binary Trees, In order Traversal, Post order Traversal, Preorder order Traversal, Binary Search Trees, Operations on a BST, Insertion in Binary Search Tree, Deletion of a node in BST, Search for a key in BST, Heigth Balanced Tree. Unit-IVth Searching and Sorting techniques, Sequential Search, Binary Search, Internal Sort, Insertion Sort, Bubble Sort, Quick Sort, 2-way Merge Sort, Heap Sort.

    You might also like