Scribd Logo
Upload

Welcome to Scribd!

  • 14 views

    Model Examination Web

    Uploaded by

    kalai p
    question paper

    Copyright:

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

    Model Examination Web

    Uploaded by

    kalai p
    14 views2 pages
    question paper

    Original Title

    model examination Web

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    question paper

    Copyright:

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

    Model Examination Web

    Uploaded by

    kalai p
    question paper

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 2

    Subject Code: 33A

    (For the candidates admitted from 2023-2024 onwards)


    B.C.A DEGREE/ MODEL EXAMINATION
    NOVEMBER–2024
    Third Semester
    DEPARTMENT OF COMPUTER SCIENCE/APPLICATIONS
    SUBJECT NAME: DATA STRUCTURE
    Time:Three hours
    Maximum:75Marks
    SECTIONA-(10x1= 10Marks)
    AnswerALLQuestions
    1 ……………… refers to the symbols that represent people, events, things, and ideas.
    A Data B List
    C Tree D All of the above
    2 Which of these best describes an array?

    A A data structure that shows a hierarchical B


    Container of objects of similar types
    C Arrays
    behaviorare immutable once initialized D
    Array is not a data structure.
    3 What is the time complexity to count the number of elements in the linked list?

    A O(1) B O(n)
    C O(logn) D O(n2)
    4 A queue follows __________

    A FIFO (First In First Out) principle B


    LIFO (Last In First Out) principle
    C Ordered array D
    Linear tree.
    5 Process of inserting an element in stack is called ____________
    A Create B Push
    C Pop D Evaluation
    6 Which of the following highly uses the concept of an array?

    A Binary Search Tree B Caching


    C Spital Locality D None
    7 The number of edges from the root to the node is called __________ of the tree.
    A Height B Length
    C Width D Depth
    8 What is the speciality about the in order traversal of a binary search tree?
    A It traverses in a non increasing B It traverses in an increasing order
    C It traverses in a random fashion D It traverses based on priority of the node
    9 What is the speciality about the in order traversal of a binary search tree?
    AIt traverses in a non increasing B It traverses in an increasing order
    CIt traverses in a random fashion D It traverses based on priority of the node
    10 What is an internal sorting algorithm?
    A Algorithm that uses tape B Algorithm that uses main memory during
    C Algorithm that involves swapping D Algorithm that are considered ‘in place
    SECTION B - Answer All questions (5 x 5 = 25)

    11 A Write short note on data Representations?


    OR
    B List out the Arrays?
    12 A Explain about Linked list?
    OR
    B Write short note on Manipulation of polynomial using linked list?

    13 A Discuss with Representation of stack?


    OR
    B Write short note on application of stacks and queues?
    14 A Write a program to demonstrate associative array in PHP
    OR
    B What is Tree Structure? Explain it?
    15 A What is the step involved hashing functions?
    OR
    B Explain about Spanning of graphs?
    SECTION C - Answer ALL Questions (5 x 8 = 40)

    16 A Write briefly about Data Types?


    OR
    B Explain about Pointers and arrays?
    17 A What are the Procedure to implement of linked list?
    OR
    B Discuss with linked stack and queues?
    18 A Write in briefly Representations of stacks?
    OR
    B List out the Priorrity Queue?
    19 A Discuss with binary tree Representations
    OR
    B Explain about binary Search tree?
    20 A Explain the following
    i) Quick sort ii) Merge sort?
    OR
    B Write briefly in Graph Representations?

    *****

    You might also like