Scribd Logo
Upload

Welcome to Scribd!

  • 142 views

    CST201 DATA STRUCTURES, December 2020

    Uploaded by

    Anas Ansar
    This document contains the questions from a Data Structures exam for a third semester B.Tech degree. It covers topics related to data structures including stacks, queues, linked lists, trees, graphs, sorting, and hashing. The exam contains 20 multiple choice and written response questions across 5 modules related to data structures and algorithms.

    Copyright:

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

    CST201 DATA STRUCTURES, December 2020

    Uploaded by

    Anas Ansar
    142 views2 pages
    This document contains the questions from a Data Structures exam for a third semester B.Tech degree. It covers topics related to data structures including stacks, queues, linked lists, trees, graphs, sorting, and hashing. The exam contains 20 multiple choice and written response questions across 5 modules related to data structures and algorithms.

    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 the questions from a Data Structures exam for a third semester B.Tech degree. It covers topics related to data structures including stacks, queues, linked lists, trees, graphs, sorting, and hashing. The exam contains 20 multiple choice and written response questions across 5 modules related to data structures and algorithms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    142 views2 pages

    CST201 DATA STRUCTURES, December 2020

    Uploaded by

    Anas Ansar
    This document contains the questions from a Data Structures exam for a third semester B.Tech degree. It covers topics related to data structures including stacks, queues, linked lists, trees, graphs, sorting, and hashing. The exam contains 20 multiple choice and written response questions across 5 modules related to data structures and algorithms.

    Copyright:

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

    B

    0800csT2 01122005

    Reg No.:
    Name:
    APJ ABDI]L KALAM TECHNOLOGICAL
    Third Semester B.Tech Degree Examination
    Decembe r 2020 (20rg

    Course Code: CST2OI


    Course Name: DATA STRUCTURES
    i.Max. Marks: 100
    Duration:3 Hours

    PART A
    \ Answer all questions. Eoch question corries
    3 morks Marks
    I What is frequency count? Explain with
    an example.
    (3)
    2 Derive the Big O notation for (n): 3n3+2n+7.
    I
    (3)
    J Write any three applications of Stack.
    (3)
    4 Explain PUSH and pOp operations in stack.
    (3)
    5 What is dynamic memory allocation? List
    any two advantages of dynamic (3)
    memory allocation.
    6 write an algorithm to count number of nodes
    in a singry rinked rist. (3)
    7 the output of inorder, preorder & postorder traversars on the foilowing
    il:: (3)

    Differentiate between comprete binary


    tree and fuil binary tree. Give exampres (3)
    for each.
    9 Explain Max Heap with an example.
    (3)
    l0 What is hashing? List any two applications
    of hashing. (3)

    Answer any onefull questionfrom


    Each question ca*ies 14 marks
    "*tffforr^
    Modute I
    l l a) Explain the System Life Cycle in detail.
    (10)
    b) What are asymptotic notations? Give examples.
    (4)

    Page I of2
    080(rcsT20tr22ao5

    l2a) How the performance of an algorithm is evaluated? Explain the best, worst (10)
    and average oase analysis of an algorithm with the help of an example.

    b) What is the difference between algorithm and pseudocode? (4)


    Module 2
    13a) What is sparse matrix? Write an algorithm to add two sparse matrices. (10)
    b) Write an algorithm to insert an element to a circular queue using array (4)
    l4a) Convert P*{Q+RyS to postfix notation. Write algorithm and step-by-step (10)
    conversion using the stack.
    b) Write an algorithm to search an element using binary search. Discuss its time (4)
    qr complexity.

    Module 3
    15 a) Write an algorithm to insert a node in the beginning and end of a doubly (10)
    linked list. Demonstiate with an example.
    b) Explain the advantages and disadvantages of First-fit and Best-fit memory ()
    allocation schemes.
    16a) How can a linked list used to represent the polynomial 3xa+2*+5. Write an (10)
    algorithm to add two polynomials represented using linked list.
    b) Write an algorithm to delete a given node in a singly linked list. (4)
    Module 4
    l7 a) Write an algorithm to inseft an element to a binary search tree. Explain with (10)
    an example.

    b) Explain any two graph representation methods with example for each. (4)
    l8 a) write algorithm to perform DFS in a graph. Explain with an example. (10)
    b) Show the structure of the binary search tree after adding each of the following (4)
    values in that order: 2,5,1,7,10,9,11,6. What is the height of the created
    tree?

    Module 5
    19 a) Explain Quick sort algorithm with an example: (10)
    b) What is meant by collision? Give an example. (4)
    20 a) Explain the four different hashing'functions with examples. (8)
    b) Illustrate the differences between selection sort and insertion sort with (6)
    example.
    ***

    Page2 of2

    You might also like