Scribd Logo
Upload

Welcome to Scribd!

  • Institute of Road and Transport Technology-Erode Department of Information Technology Internal Test - Iii

    Uploaded by

    anurekhar
    28 views2 pages
    1. The document contains an internal test for a Data Structures and Algorithms class with questions covering hashing, graphs, trees, and graph algorithms. 2. It asks students to define key terms like hashing, hashing functions, graphs, connected graphs, and minimum spanning trees. Students are also asked to explain algorithms like depth-first search, topological sort, Dijkstra's shortest path, and minimum spanning tree algorithms. 3. The test contains multiple choice and short answer questions to assess students' understanding of data structures and common graph algorithms.

    Original Description:

    dsa question paper

    Original Title

    DSA QP IT3

    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?

    Report this Document
    1. The document contains an internal test for a Data Structures and Algorithms class with questions covering hashing, graphs, trees, and graph algorithms. 2. It asks students to define key terms like hashing, hashing functions, graphs, connected graphs, and minimum spanning trees. Students are also asked to explain algorithms like depth-first search, topological sort, Dijkstra's shortest path, and minimum spanning tree algorithms. 3. The test contains multiple choice and short answer questions to assess students' understanding of data structures and common graph algorithms.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    28 views2 pages

    Institute of Road and Transport Technology-Erode Department of Information Technology Internal Test - Iii

    Uploaded by

    anurekhar
    1. The document contains an internal test for a Data Structures and Algorithms class with questions covering hashing, graphs, trees, and graph algorithms. 2. It asks students to define key terms like hashing, hashing functions, graphs, connected graphs, and minimum spanning trees. Students are also asked to explain algorithms like depth-first search, topological sort, Dijkstra's shortest path, and minimum spanning tree algorithms. 3. The test contains multiple choice and short answer questions to assess students' understanding of data structures and common graph algorithms.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    of 2

    INSTITUTE OF ROAD AND TRANSPORT TECHNOLOGY-ERODE DEPARTMENT OF INFORMATION TECHNOLOGY INTERNAL TEST III SUBJECT: DATA STRUCTURES AND

    D ALGORITHMS IT CLASS: II YEAR / III SEM 14.10.10 Part A (10 x 2 = 20) 1. 2. 3. 4. 5. 6. 7. 8. 9. What is hashing? List the various techniques used. When is a graph said to be bi-connected? What do you mean by hashing function? Give an example. Define graph. What is a connected graph State the algorithm to perform DFS on a given graph List any two differences between Graph and a Tree. What are the different ways by which a graph can be represented? List any two applications of Graphs. Part B (3 x 10 = 30) (ANSWER ANY THREE QUESTIONS) 11. Briefly explain about various collision resolution techniques used when performing hashing. 12. a. Explain Topological sort algorithm. b. Explain briefly about Bi-connectivity. 13. With an example explain about Dijkstras shortest path algorithm. 14. Explain in detail about two algorithms used to find the Minimum Spanning Tree. 15. Explain Dijkstras algorithm using the following graph. Find the shortest path from v1 to all nodes. DATE: BRANCH:

    10. What is a Minimum Spanning Tree?

    You might also like