Scribd Logo
Upload

Welcome to Scribd!

  • 85 views

    13A05301 Data Structures PDF

    Uploaded by

    ManojKarthik
    This document contains an exam for a Data Structures course, including: 1) 10 short answer questions covering topics like data structures applications, linked lists, sorting algorithms, tree traversals, dictionaries, priority queues, and B-Trees. 2) 5 longer answer questions choosing between topics like system life cycles, linked lists, queues, heap sort, binary search trees, arrays, sorting, graphs, hashing, and Red-Black and B- trees. 3) The exam has two parts - part A contains the 10 short questions and part B contains the 5 longer answer questions choosing from topics related to data structures.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    13A05301 Data Structures PDF

    Uploaded by

    ManojKarthik
    85 views1 page
    This document contains an exam for a Data Structures course, including: 1) 10 short answer questions covering topics like data structures applications, linked lists, sorting algorithms, tree traversals, dictionaries, priority queues, and B-Trees. 2) 5 longer answer questions choosing between topics like system life cycles, linked lists, queues, heap sort, binary search trees, arrays, sorting, graphs, hashing, and Red-Black and B- trees. 3) The exam has two parts - part A contains the 10 short questions and part B contains the 5 longer answer questions choosing from topics related to data structures.

    Original Title

    13A05301 Data Structures.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains an exam for a Data Structures course, including: 1) 10 short answer questions covering topics like data structures applications, linked lists, sorting algorithms, tree traversals, dictionaries, priority queues, and B-Trees. 2) 5 longer answer questions choosing between topics like system life cycles, linked lists, queues, heap sort, binary search trees, arrays, sorting, graphs, hashing, and Red-Black and B- trees. 3) The exam has two parts - part A contains the 10 short questions and part B contains the 5 longer answer questions choosing from topics related to data structures.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    85 views1 page

    13A05301 Data Structures PDF

    Uploaded by

    ManojKarthik
    This document contains an exam for a Data Structures course, including: 1) 10 short answer questions covering topics like data structures applications, linked lists, sorting algorithms, tree traversals, dictionaries, priority queues, and B-Trees. 2) 5 longer answer questions choosing between topics like system life cycles, linked lists, queues, heap sort, binary search trees, arrays, sorting, graphs, hashing, and Red-Black and B- trees. 3) The exam has two parts - part A contains the 10 short questions and part B contains the 5 longer answer questions choosing from topics related to data structures.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    Code: 13A05301

    R13

    B.Tech II Year I Semester (R13) Regular Examinations December 2014


    DATA STRUCTURES
    (Computer Science and Engineering)
    Time: 3 hours Max. Marks: 70
    PART – A
    (Compulsory Question)
    *****
    1 Answer the following: (10 X 02 = 20 Marks)
    (a) Define data structure. Mention any two applications of data structures.
    (b) What is a double linked list? Name the three fields of double linked list.
    (c) What is the best case and worst case time complexity of bubble sort and insertion sort?
    (d) List the steps in pre-order traversal.
    (e) Define adjacent nodes.
    (f) What is a dictionary?
    (g) List the applications of priority queues.
    (h) Define Max heap.
    (i) What is a splay tree?
    (j) Mention the purpose of B-Trees.
    PART – B
    (Answer all five units, 5 X 10 = 50 Marks)
    UNIT – I
    2 (a) Explain system life cycle with a neat diagram.
    (b) Write an algorithm to perform the following operations on a single linked list.
    (i) Insert new node at the beginning of list. (ii) Count the number of nodes.
    OR
    3 Explain how queues can be implemented using arrays.
    UNIT – II
    4 State and explain the algorithm to perform Heap sort. Also analyze the time complexity of the
    algorithm.
    OR
    5 Define binary search tree. Explain the various operations with an example.
    UNIT – III
    6 (a) How to pass array elements as arguments to function? Explain with one example.
    (b) Write a C program to read names, marks of a class and calculate the total marks, average and
    percentage.
    OR
    7 What is meant by sorting? Write the algorithm for Selection sort and illustrate with an example.
    UNIT – IV
    8 Explain the path and adjacency multi-list representations of a graph with example.
    OR
    9 (a) Differentiate between static and dynamic hashing.
    (b) With an example, explain how skip list can be represented.
    UNIT – V
    10 Explain Red-Black trees in detail.
    OR
    +
    11 Explain the operations on B - tree with examples.
    *****

    You might also like