Purnea University - BCA (2nd Semester) Data Structure 2020

 B.C.A. (Sem-II)
END SEMESTER EXAMINATION - 2020
DATA STRUCTURE
2BCA-2
TIME: 3 HOURS                                                                                   MAXIMUM MARKS: 70

NOTE: Candidates are required to give answer in their own words as far as practicable.
The questions are of equal value

Answer any five questions.

Q-1 Choose the correct alternative from the following

    (i) Which of these best describe an array?

  1. A data structure that shows a hierarchical behaviour
  2. Container of objects of similar types
  3. Arrays are immutable once intialised
  4. Array is not a data structure
    (ii) Which of the following concepts make extensive use of arrays?

  1. Binary trees
  2. Scheduling of processes
  3. Caching
  4. Spatial locality

    (iii) What are the disadvantages of arrays?

  1. Data structure like queue or stack cannot be implemented
  2. There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated size
  3. Index value of an array can be negative
  4. Elements are sequentially accessed

    (iv) Process of inserting an element in stack is called

  1. Create
  2. Push
  3. Evaluation
  4. Pop

    (v) Pushing an element into stack already having five elements and stack size of 5, then stack becomes

  1. Overflow
  2. Crash
  3. Underflow
  4. Userflow
    (vi) The postfix from of the expression (A + B) (CD-E)*F/G is

  1. AB + CD*E - FG/**
  2. AB + CD*E - F**G/
  3. AB + CD*E -*F*G/
  4. AB + CDE* - F*G/
    (vii) What data structure would you mostly likely see in a non recursive Implementation of a recursive algorithm?
  1. Linked List
  2. Stack
  3. Queue
  4. Tree
    (viii) The data structure required for Breadth First Traversal on a graph is?
  1. Stack
  2. Array
  3. Queue
  4. Tree
    (ix) Circular Queue is also known as
  1. Ring Buffer
  2. Square Buffer
  3. Reactangle Buffer
  4. Curve Buffer
    (x) A Linear collection of data elements where the linear node is given by means of pointer is called?
  1. Linked List
  2. Node list
  3. Primitive list
  4. Unordered list
    (xi) Linked lists are not suitable to for the implemetation of?
  1. Insertion sort
  2. Radix sort
  3. Polynomial manipulation
  4. Binary search
    (xii) How many children does a binary tree have?
  1. 2
  2. any number of children
  3. 0 or 1 or 2
  4. 0 or 1
    (xiii) The number of edges from the root to the note is called of the tree
  1. Height
  2. Depth
  3. Length
  4. Width
    (xiv) What is an AVL tree?
  1. a tree which is balanced and is a height balanced tree
  2. a tree which is unbalanced and is a height balanced tree
  3. a tree with three children
  4. a tree with atmost 3 children
Q-2     Write the algorithm to convert given infix expression to prefix expression.
Q-3     Write a function to remove last node of singly linked list and add it at the begining.
Q-4     What is the double circular linked list? Explain its node structure.
Q-5     What is the graph? Explain its representation techniques.
Q-6     What is an algorithm? How to measure its perfomance?
Q-7     Write a program to perform quick sort
Q-8     Discuss the preorder, in order and post order traversing with suitable example.
Q-9     Write a C program for the addition of two polynomials.
Q10     Write the short notes in the following
  1. Weighted Graph
  2. Spanning Tree
  3. B and B Tree
  4. Circular Linked List
--x--
Related Topics: 2020 2nd semester BCA Data Structure Purnea University
Home Papers Notes