2024 - BCA [2nd Semester] - Data Structure - Purnea University

PU-2 BCA-2
B.C.A. (II-SEMESTER)
EXAMINATION, JUNE-2024
DATA STRUCTURE
Time: 3 Hours                                              Full Marks: 70

Note: The questions are equal value.
Answer any five questions.

  1. Multiple type questions.                                                                                       10 *2=20
    i. What is a data structure?
       A. A type of database
       B. A way to store and organize data
       C. A programming language
       D. An operating system
    ii. Which of the following is a linear data structure?
       A. Tree
       B. Graph
       C. Stack
       D. Hash Table
    iii. Which operation is not associated with stacks?
       A. Push
       B. Pop
       C. Peek
       D. Insert
    iv. Which of the following is not a stack application?
       A. Infix to postfix conversion
       B. Recursion
       C. Memory management
       D. Sorting algorithms
    V. Which of the following describes a queue?
       A. A linear list where elements are added and removed from the same end.
       B. A linear list where elements are added at one end and removed from the other
       C. A non-linear list
       D. A collection of nodes
    vi Which of the following is true about linked lists?
       A. They use contiguous memory allocation
       B. They are fixed in size
       C. They allow dynamic memory allocation
       D. They do not allow insertion and deletion of nodes
    vii. Which of the following is a type of linked list?
       A. Doubly linked list
       B. Circular linked list
       C. Singly linked list
       D. All of the above
    viii. Which of the following traversal methods is not used for binary trees?
       A. In-order
       B. Pre-order
       C. Post-order
       D. Top-order
    ix. What is a binary search tree (BST)?
       A. A tree in which each node has at most three children
       B. A tree in which the left subtree has nodes with values less than the parent node and the right subtree has nodes with values greater than the parent node
       C. A tree where all nodes are arranged in a sequential manner
       D. A tree used for sorting data
    x. Which sorting algorithm is not comparison based?
       A. Bubble sort
       B. Quick sort
       C. Heap sort
       D. Counting sort

  2. What do you mean by queue? Write about application of queue.
  3. Write a detailed notes on abstract data structure.
  4. Write a Note on Application of linked list.
  5. What do you mean by doubly linked list? Write diffrence between doubly linked list and circular linked list.
  6. Write a note on application of binary tree.
  7. Differentiate the term Insertion sort and Binary sort.
  8. What do you mean by sequential searching? Write a brief Note on it.
  9. Write a brief Note on collision resolution techniques.
***
Related Topics: 2024 2nd semester BCA Data Structure Purnea University
Home Papers Notes