Diploma Student: Previous year question for Computer Science and Engineering semester 4 data structure using C year 2018

Sub Code: - 1618401

2018(Even)

Time : 3Hrs

Sem. IV(New)

Data structure using C

Full Marks : 70

Pass marks : 28

Group A

Choose the most suitable answer from the following options: - (1*20=20)

(i) Assuming int is if 4 bytes, what is the size if int arr[15]?
(a) 15
(b) 19
(c) 11
(d) 60

(ii) What are the advantages to arrays?
(a) Easier to store elements of some data type
(b) Used to implement other data structures like stack and queue.
(c) Convenient way to represent matrices and a 2D array
(d) All of the mentioned

(iii) Which of the following are the uses of matrices?
(a) In solving linear equations
(b) Image processing
(c) Graph theory
(d) All of the mentioned

(iv) Process of removing an element from stack is called ________________
(a) Create
(b) Push
(c) Evaluation
(d)   Pop

(v) Which data structure is used for implementing recursion?
(a) Queue
(b) Stack
(c) Array
(d) List

(vi) Which of the following is not an inherit application of stack?
(a) Reversing a string
(b) Evaluation of postfix expression
(c) Implementation of recursion
(d) Job scheduling

(vii) The data structure required for Breadth First Traversal on a graph is?
(a) Stack
(b) Array
(c) Queue
(d) Tree

(viii)In linked list each node contain minimum of two fields. One field is data field to store the data second field is?
(a) Pointer to character
(b) Pointer to integer
(c) Point to node
(d) Node

(ix) What is memory efficient double linked list?
(a) Each node has only one pointer to traverse the list back and forth
(b) The list has break points for traversal
(c) An auxiliary singly linked list acts as a helper list to traverse through the doubly linked list
(d) None of the mentioned

(x)  Which of the following is false about a circular linked list?
(a) Every node has successor
(b) Time complexity of inserting a new node of the head of the list is O(1)
(c) Time complexity for deleting last node is O(n)
(d) None of the above

(xi) What is the complexity of searching for a particular element in a singly linked list
(a) O(n)
(b) O(1)
(c) log(n)
(d) n log n

(xii) Can a tree stored in an array using either one of in-order or post-order or preorder traversal be again reformed?
(a) Yes just traverse through the array and from the tree
(b) No we need one more traversal to form a tree
(c) No in case of spares trees
(d) None of the mentioned

(xiii) What is the space complexity of the post-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)
(a) O(1)
(b) O(n log d)
(c) O(log d)
(d) O(d)

(xiv) What is the specialty about the in-order transversal of a binary search tree?
(a) It traverses in a non-increasing order
(b) It traverses in an increasing order
(c) It traverses in a random fashion
(d) None of the mentioned

(xv) What is an internal sorting algorithm?
(a) Algorithm that uses tape or disk during the sort
(b) Algorithm that uses main memory during sort
(c) Algorithm that involves swapping
(d) Algorithm that are considered ‘in place’

(xvi) What is the worst case complexity of quick sort?
(a) O (n log n)
(b) O (log n)
(c) O (n)
(d) O (n2)

(xvii) Which of the following statements for a simple graph is correct?
(a) Every path is a trail
(b) Every trail is a path
(c) Every trail is a path as well as every path is a trail
(d) None of the above

(xviii) A connected planner graph having 6 vertices, 7 edges contains ___________ regions.
(a) 15
(b) 3
(c) 1
(d) 11

(xix) The depth first search traversal of a graph will result into?
(a) Linked list
(b) Tree
(c) Graph with back edges
(d) None of the above

(xx) The numbers of elements in the adjacency matrix of a graph having 7 vertices?
(a)   7
(b) 14
(c) 36
(d) 49

Answer (You tube link)

Group:-"B"

➥ Answer all Five Questions: - (5*4=20)

2. List out the notation that used to expressed time complexity of algorithm.

What are the Average Best and Worst Case Complexity?

3. Write formula to calculate address of elements in one-dimensional and two-dimensional array.

Define Array. List out application of Array

4. Define Stack. Give real world example of stack.

Define push or pop operation on stack.

5. List out operations performed in doubly linked list? List application of linked list?

What is the difference between circular linked list and linear linked list?

6. Explain in brief in-order and pre-order traversal with examples.

Explain in-order traversal with examples.

Group:- "C"

➥ Answer all Five Questions: - (5*6=30)

7. Write a note on bubble sort with algorithm and example.

Write detail note on merge sort with algorithm and example.

8. Write down procedure for depth first search with examples.

Write down procedure for breath first search with examples.

9. Create a binary tree using in-order and post-order traversal:

In-order : D B H E A I F J C G
Post-order : D H E B I J F G C A

Explain application of binary tree and create a binary tree from the following sequence:
14, 34, 22, 44, 11, 24, 33

10. Write a pseudo code for implementing queue using linked queue.

Convert the following infix express to prefix expression:

(a) (( a+b ) / d-(( e-f ) +g ))

(b) 12 / 3 * 6 + 6 + 6 + 8 / 2

11. Explain any one method to calculate memory location for different position in two-dimensional array.

What do you mean by Time and Space Complexity and how to represent these complexities?

(Note:- Update available soon, comment for any type of help)

Diploma Student

Pages

12/31/19

Previous year question for Computer Science and Engineering semester 4 data structure using C year 2018

1 comment:

Latest Update

Key Components of XML

Popular Posts

About Me