Scribd Logo
Upload

Welcome to Scribd!

  • DSA Assignments 4 & 5 Unit

    Uploaded by

    photos.schoolfriends
    4 views1 page
    This document contains two assignments related to data structures for a BTech II Year III Sem computer science class. Assignment IV contains questions about the differences between depth-first search (DFS) and breadth-first search (BFS), as well as explaining Prim's algorithm with an example. Assignment V contains questions about sorting data using quicksort, writing the binary search algorithm and its time complexity, and sorting a list of numbers using heap sort.

    Original Description:

    Original Title

    DSA Assignments 4 & 5 unit

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains two assignments related to data structures for a BTech II Year III Sem computer science class. Assignment IV contains questions about the differences between depth-first search (DFS) and breadth-first search (BFS), as well as explaining Prim's algorithm with an example. Assignment V contains questions about sorting data using quicksort, writing the binary search algorithm and its time complexity, and sorting a list of numbers using heap sort.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views1 page

    DSA Assignments 4 & 5 Unit

    Uploaded by

    photos.schoolfriends
    This document contains two assignments related to data structures for a BTech II Year III Sem computer science class. Assignment IV contains questions about the differences between depth-first search (DFS) and breadth-first search (BFS), as well as explaining Prim's algorithm with an example. Assignment V contains questions about sorting data using quicksort, writing the binary search algorithm and its time complexity, and sorting a list of numbers using heap sort.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    DEPARTMENT OF Computer Science & Information Technology

    IES IPS ACADEMY


    SESSION JULY-DEC 2023

    ASSIGNMENT
    CLASS- BTech II YEAR III SEM

    DATA STRUCTURE
    Date: 3/11/2023

    Submission Date: 22/11/2023

    ASSIGNMENT- IV

    Q.1 Differentiate between DFS and BFS?

    Q.2

    Q.3 Explain Prim’s algorithm with example.

    ASSIGNMENT- V

    Q.1 Sort the data using quick sort:

    35, 33, 42, 10, 14, 19, 27, 44, 26, 31

    Q.2 Write down the algorithm of Binary search and also write its run time complexity?

    Q.3 Consider the following list of unsorted numbers which are to be sort using heap sort.

    82, 90, 10, 12, 15, 77, 55, 23

    You might also like