Professional Documents
Culture Documents
STF 2019 Test Questions
STF 2019 Test Questions
STF 2019 Test Questions
Telnet means(A):
were there.
computer.
4. Yes/No (D) up to 4 GB
(E) 1 bit
(A) 1 = B, 2 = D, 3 = A, 4 = E
(B) 1 = B, 2 = C, 3 = D, 4 = E
(C) 1 = B, 2 = C, 3 = A, 4 = D
(D) 1 = B, 2 = C, 3 =A, 4 = E
as Web pages.
Guidelines
(A) 1, 2, 3, 4
(B) 1, 2, 3
(C) 2, 3, 4
(D) 1, 4, 2
(A) The minimum possible time complexity of a comparison based sorting algorithm is O(nLogn) for a
random input array
(B) Any comparison based sorting algorithm can be made stable by using position as a criteria when
two elements are compared
8. In delete operation of BST, we need inorder successor (or predecessor) of a node when the node to
be deleted has both left and right child as non-empty. Which of the following is true about inorder
successor needed in delete operation?(B)
(B) Inorder successor is always either a leaf node or a node with empty left child
(D) Inorder successor is always either a leaf node or a node with empty right child
9. What is common in three different types of traversals (Inorder, Preorder and Postorder)?(B)
10. How many distinct binary search trees can be created out of 4 distinct keys?(B)
(A) 4
(B) 14
(C) 24
(D) 42
(C) Backtracking
15. What is the minimum number of gates required to implement the Boolean function (AB+C) if we
have to use only 2-input NOR gates? (B)
(A) 2
(B) 3
(C) 4
(D) 1
16. Which of the following is not a stable sorting algorithm in its typical implementation.(C)
18. Consider a situation where swap operation is very costly. Which of the following sorting
algorithms should be preferred so that the number of swap operations are minimized in general?(B)
19. Which of the following standard algorithms is not Dynamic Programming based.(D)
20. You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting
technique will be most appropriate?(B)
21. Which sorting algorithms is most efficient to sort string consisting of ASCII characters?(D)
(A) Arrays have better cache locality that can make them better in terms of performance.
(D) The size of array has to be pre-decided, linked lists can change their size any time.
(A) 1
(B) 4
(C) 2
(D) 3
24. Which of the following cannot generate the full binary tree?(D)
Interchange Code
Interchange Code
Interchange Code
Interchange Code
27. The maximum number of binary trees that can be formed with three unlabeled nodes is: (B)
(A) 1
(B) 5
(C) 4
(D) 3
28. Which of the following traversal outputs the data in sorted order in a BST(Binary Search Trees)?(B)
(A) Preorder
(B) Inorder
(C) Postorder
29. Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty
binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the in-
order traversal sequence of the resultant tree?(C)
(A) 7 5 1 0 3 2 4 6 8 9
(B) 0 2 4 3 1 6 5 9 8 7
(C) 0 1 2 3 4 5 6 7 8 9
(D) 9 8 6 4 2 3 0 1 5 7
30. Which of the following traversals is sufficient to construct BST from given traversals
(C) 2 and 3
(D) 1 and 3
32. How many stacks are needed to implement a queue. Consider the situation where no other data
structure like arrays, linked list is available to you.(B)
(A) 1
(B) 2
(C) 3
(D) 4
33. Which of the following operations is performed more efficiently by doubly linked list than by linear
linked list?(A)
1. Economical
2. Fast input/output
4. Reusable
(A) 1, 2, 3
(B) 1, 2, 4
(C) 1, 3, 4
(D) 1,2, 3, 4
(A) The AVL trees are more balanced compared to Red Black Trees, but they may cause more rotations
during insertion and deletion.
(B) Heights of AVL and Red-Black trees are generally same, but AVL Trees may cause more rotations
during insertion and deletion.
(C) Red Black trees are more balanced compared to AVL Trees, but may cause more rotations during
insertion and deletion.
(D) Heights of AVL and Red-Black trees are generally same, but Red Black rees may cause more
rotations during insertion and deletion.
(B) Having The Same Page Twice - Once In Html, Once In Pdf.
(D) Using Hidden Text That Users Dont See But Spiders Can Read
(A) 1, 2, 3 (B) 2, 3
(C) 1, 3 (D) 1, 2
39. Which of the following is true about linked list implementation of queue?(C)
(A) In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation,
nodes must be removed from end.
(B) In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be
removed from the beginning.
40.(B)
below :
Which traversals of Tree-1 and Tree-2, respectively, will produce the same sequence?(B)
42. Consider a singly linked list of the form where F is a pointer to the first element in the linked list
and L is the pointer to the last element in the list. The time of which of the following operations
depends on the length of the list?(A)
43. Set of programs which consist of full set of documentations is termed as (D)
44.Which of the following is/are the levels of implementation of Data Structure (D)
(A) Operations
(C) Algorithms
47.Which of the following data structure can’t store the non-homogeneous data elements? (A)
(A) Arrays
(B) Records
(C) Pointers
(D) Stacks
(A) Stacks
(B) List
(C) Strings
(D) Trees
i) Using singly linked lists and circular list, it is not possible to transverse the list backwards.
ii) To find the predecessor ,it is required to transverse the list from the first node in case of singly
linked list
(A) i) only
(B) ii) only
(C) Both i) and ii)
(D) None of the above
49. In ……………, search start at the beginning of the list and check every element in the list.(A)
A) Linear search
B) Binary search
C) Hash Search
A. Linear arrays
B. Linked lists
C. Queue
D. Stack
51. When new data are to be inserted into a data structure, but there is not available space; this
situation is usually called …. (B)
A. Underflow
B. overflow
C. houseful
D. saturated
A. creation
B. destruction
C. selection
53. Which of the following are the operations applicable an primitive data structures? (D)
A. create
B. destroy
C. update
B. Data elements in linked list need not be stored in adjacent space in memory
D. Linked lists are collection of the nodes that contain information part and next pointer.
55. The logical or mathematical model of a particular organization of data is called a ……… (A)
A) Data structure
B) Data arrangement
C) Data configuration
D) Data formation
B) For the size of the structure and the data in the structure are constantly changing
A) Before deletion
D) After deletion
C) Vertical array
D) Horizontal array
C) Time consuming
60. Which of the following is true about the characteristics of abstract data types?(C)
i) It exports a type.
A) True, False
B) False, True
C) True, True
D) False, False
61. Which of the following is not the part of ADT(Abstract Data Type) description? (D)
A) Data
B) Operations
A) Graphs
B) Stacks
C) Binary tree
D) Queues
63. A directed graph is ………………. if there is a path from each vertex to every other vertex in the
digraph.(B)
A) Weakly connected
B) Strongly Connected
C) Tightly Connected
D) Linearly Connected
A) Insertion
B) Deletion
C) Retrieval
D) Traversal
66. Each node in a linked list has two pairs of ………….. and ………………. (A)
67. A ……………….. is a linear list in which insertions and deletions are made to from either end of the
structure. (D)
A) circular queue
B) random of queue
C) priority
D) dequeue
68. In a priority queue, insertion and deletion takes place at ……………… (D)
D) any position
69. Two main measures for the efficiency of an algorithm are (A)
A. Time and space
70. Which is the best data structure for round robin algorithm for CPU scheduling? (C)
C. Circular queue
71. The extra key inserted at the end of the array is called a (C)
A. End key.
B. Stop key.
C. Sentinel.
D. Transposition.
72. Each array declaration need not give, implicitly or explicitly, the information about (C)
73. The elements of an array are stored successively in memory cells because (A)
A. by this way computer can keep track only the address of the first element and the addresses of
other elements can be calculated
B. the architecture of computer memory does not allow arrays to store other than serially
C. both of above
D. none of above
A. tables arrays
B. matrix arrays
C. both of the above