Scribd Logo
Upload

Welcome to Scribd!

  • II BSC

    Uploaded by

    Vignana Deepthi
    7 views1 page
    This document contains exam questions for a Data Structures course. The exam has two parts: Part A contains 5 short answer questions worth 5 marks each on topics like abstract data types, linked lists, queues, binary search, and tree traversal techniques. Part B contains 5 longer answer questions worth 10 marks each, with one question chosen from each of the 5 course units on topics such as linear/non-linear data structures, stacks, priority queues, binary search trees, graph representations, and sorting algorithms. Students must answer any 5 questions from Part A and any 5 questions from Part B, one from each unit.

    Original Description:

    Original Title

    II Bsc

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains exam questions for a Data Structures course. The exam has two parts: Part A contains 5 short answer questions worth 5 marks each on topics like abstract data types, linked lists, queues, binary search, and tree traversal techniques. Part B contains 5 longer answer questions worth 10 marks each, with one question chosen from each of the 5 course units on topics such as linear/non-linear data structures, stacks, priority queues, binary search trees, graph representations, and sorting algorithms. Students must answer any 5 questions from Part A and any 5 questions from Part B, one from each unit.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    7 views1 page

    II BSC

    Uploaded by

    Vignana Deepthi
    This document contains exam questions for a Data Structures course. The exam has two parts: Part A contains 5 short answer questions worth 5 marks each on topics like abstract data types, linked lists, queues, binary search, and tree traversal techniques. Part B contains 5 longer answer questions worth 10 marks each, with one question chosen from each of the 5 course units on topics such as linear/non-linear data structures, stacks, priority queues, binary search trees, graph representations, and sorting algorithms. Students must answer any 5 questions from Part A and any 5 questions from Part B, one from each unit.

    Copyright:

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

    SRI VIGNANA DEEPTHI DEGREE

    II B.sc COLLEGE
    Terminal Examinations – March - 2017 Semester - IV
    Data Structures
    Time: 3 Hours Max Marks:75

    Part - A
    Answer any FIVE questions 5X5=25M

    1. Define ADT
    2. How do you PUSH and POP elements in a linked list
    3. Explain different types of Queues
    4. Write an algorithm on Binary Search
    5. Explain Tree Traversal Techniques
    6. Explain about Threaded Binary Search Trees
    7. Explain about Time and Space Complexity
    8. Explain the procedure to convert a directed graph into matrix
    Part - B
    Answer any Five questions. Choosing ONE from each unit 5X10=50M
    Unit-I
    9. a) Explain Linear data structures and Non Linear Data Structures
    (Or)
    b) Explain different types of Linked Lists
    Unit-II
    10.a) What is Stack? Explain operations on Stack.
    (Or)
    b) Explain Concepts of Priority Queues.
    Unit-III
    11.a) What is Binary Search Trees? Explain
    (Or)
    b) Give a brief description on applications of BST?
    Unit-IV
    12 a) What is Graph? How to represent Graph Traversal?
    (Or)
    b) Explain Basic Searching Techniques
    Unit-V
    13 a) Explain Insertion Sort
    (Or)
    b) Explain Quick Sort

    You might also like