1.

Telnet means(A):

(A) Permits your computer to log onto

another computer and use it as if you

were there.

(B) Allows your computer to rapidly retrieve

complex files intact from a remote

computer and view or save them on your

computer.

(C) An early, text-only method for accessing

Internet documents. It has been almost

2. Video files are too huge and takes several

minutes to download. A video file uses which

of the following format(s)(D)?

(A) AVI format (B) MPEG format

(C) Quick time format (D) All of these

(E) None of these

3.Match the following datatypes(D):

1. Text (A) 8 bytes

2. Memo (B) up to 255 characters

3. Date/Time (C) up to about 1 GB

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

(E) None of these

4. RDBMS is system software which retrieves,

modifies and stores the data in database on

request. Which one of the following is the

correct abbreviation of RDBMS(A)?

(A) Relational Data Maintaining System

(B) Request Database Maintaining Software

(C) Relational Data Management System

(D) Relational Database Management System

(E) None of these

5. Which one of the following

is an application of Stack Data Structure(D)?

(A) Managing function calls

(B) The stock span problem

(C) Arithmetic expression evaluation

(D) All of the above

6.Which of the followings statements are correct?(B)

(1) World Wide Web consists of files known

as Web pages.

(2) W3C Develops Web Standards and

Guidelines

(3) XML is a markup language.

(4) URL stands for Uniform Resource Location

(A) 1, 2, 3, 4

(B) 1, 2, 3

(C) 2, 3, 4

(D) 1, 4, 2

(E) None of these

7. Which of the following is not true about comparison based sorting algorithms?(D)

(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

(C) Counting Sort is not a comparison based sorting algorithm

(D) Heap Sort is not a comparison based sorting algorithm.

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)

(A) Inorder Successor is always a leaf node

(B) Inorder successor is always either a leaf node or a node with empty left child

(C) Inorder successor may be an ancestor of the node

(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)

(A) Root is visited before right subtree

(B) Left subtree is always visited before right subtree

(C) Root is visited after left subtree

(D) None of the above

(E) All of the above

10. How many distinct binary search trees can be created out of 4 distinct keys?(B)

(A) 4

(B) 14

(C) 24

(D) 42

11. Which of the following is not a backtracking algorithm? (B)

(A) Knight tour problem

(B) N queen problem

(C) Tower of Hanoi

(D) M coloring problem

12. In a village, people build houses in the same side of the road. A thief plans to loot the village. He
wants maximum amount of money without having any risk of getting caught. By some means, the
villagers know that their adjacent house is being looted or not and thus they become alert. So the
thief cannot loot contiguous two houses. Given that the thief knows the amount of money stored in
each house and the road is straight and there is no turning, which is the most efficient algorithmic
strategy to solve this problem? (B)

(A) Brute Force

(B) Dynamic Programming

(C) Backtracking

(D) Divide and Conquer

13. Which of the following is not an in-place algorithm? (C)

(A) Insertion sort

(B) Selection sort

(C) Merge sort

(D) Heap sort

14. HTML 5 is a ______________.(C)

(A) Netscape standard

(B) Microsoft standard

(C) W3C standard

(D) Search Engine Specification Standard

(E) None of these

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)

(A) Insertion Sort (D) Bubble Sort

(B) Merge Sort

(C) Quick Sort

17. Which of the following sorting algorithms in its typical implementation gives best performance
when applied on an array which is sorted or almost sorted (maximum 1 or two elements are
misplaced).(D)

(A) Quick Sort

(B) Heap Sort

(C) Merge Sort

(D) Insertion Sort

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)

(A) Heap Sort

(B) Selection Sort

(C) Insertion Sort

(D) Merge Sort

19. Which of the following standard algorithms is not Dynamic Programming based.(D)

(A) Bellman–Ford Algorithm for single source shortest path

(B) Floyd Warshall Algorithm for all pairs shortest paths

(C) 0-1 Knapsack problem

(D) Prim's Minimum Spanning Tree

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)

(A) Heap sort

(B) Merge sort

(C) Quick sort

(D) Insertion sort

21. Which sorting algorithms is most efficient to sort string consisting of ASCII characters?(D)

(A) Quick sort

(B) Heap sort

(C) Merge sort

(D) Counting sort

22. Which of the following points is/are true about Linked List data structure when it is compared
with array (E)

(A) Arrays have better cache locality that can make them better in terms of performance.

(B) It is easy to insert and delete elements in Linked List

(C) Random access is not allowed in a typical implementation of Linked Lists

(D) The size of array has to be pre-decided, linked lists can change their size any time.

(E) All of the above

23. The minimum number of stacks needed to implement a queue is (C)

(A) 1

(B) 4

(C) 2

(D) 3

24. Which of the following cannot generate the full binary tree?(D)

(A) Inorder and Preorder

(B) Inorder and Postorder

(C) Preorder and Postorder

(D) None of the above

25. EBCDIC Means (A)

(A) Extended Binary Coded Decimal

Interchange Code

(B) Ex-Person Binary Coded Decimal

Interchange Code

(C) Extensive Binary Coded Decimal

Interchange Code

(D) Expensive Binary Coded Decimal

Interchange Code

(E) None of these

26. Which of the following is a true about Binary Trees(E)

(A) Every binary tree is either complete or full.

(B) Every complete binary tree is also a full binary tree.

(C) Every full binary tree is also a complete binary tree.

(D) No binary tree is both complete and full.

(E) None of the above

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

(D) Level order

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

1) Inorder 2) Preorder 3) Postorder (B)

(A) Any one of the given three traversals is sufficient

(B) Either 2 or 3 is sufficient

(C) 2 and 3

(D) 1 and 3

31. Which one of the following is an application of Queue Data Structure?(D)

(A) When a resource is shared among multiple consumers.

(B) When data is transferred asynchronously (data not necessarily received at same rate as sent)
between two processes

(C) Load Balancing

(D) All of the above

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)

(A) Deleting a node whose location is given

(B) Searching an unsorted list for a given item

(C) Inserting a node after the node with a given location

(D) Traversing the list to process each node

34. MIDI stands for : (C)

(A) Music In Digital Interface

(B) Musical Instrument Disney Interface

(C) Musical Instrument Digital Interface

(D) Man In Digit Interface

(E) None of these

35. Identify the advantages of magnetic tapes.(C)

1. Economical

2. Fast input/output

3. Very huge capacity

4. Reusable

(A) 1, 2, 3

(B) 1, 2, 4

(C) 1, 3, 4
(D) 1,2, 3, 4

(E) None of these

36. Which of the following is true (A)

(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.

37.Which of the following practice is Ethical?(A)

(A)Buying links from the link farms

(B) Having The Same Page Twice - Once In Html, Once In Pdf.

(C) Stuffing The Metatags With Keywords

(D) Using Hidden Text That Users Dont See But Spiders Can Read

38. Which of the following statements are true

about Hard disk?(B)

(1) The Hard disk is a temporary storage media.

(2) It is used to store huge volume of data.

(3) It is the most important and commonly

used storage device.

(A) 1, 2, 3 (B) 2, 3

(C) 1, 3 (D) 1, 2

(E) None of these

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.

(C)Both of the above

(D) None of the above

40.(B)

41. If Tree-1 and Tree-2 are the trees indicated

below :   

Which traversals of Tree-1 and Tree-2, respectively, will produce the same sequence?(B)

(A) Preorder, postorder

(B) Postorder, inorder
(C) Postorder, preorder
(D) Inorder, preorder

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)

(A) Delete the last element of the list

(B) Delete the first element of the list

(C) Add an element after the last element of the list

(D) Interchange the first two elements of the list

43. Set of programs which consist of full set of documentations is termed as (D)

(A) Database packages

(B) File packages

(C) Bus packages

(D) Software packages

44.Which of the following is/are the levels of implementation of Data Structure (D)

(A) Abstract level

(B) Application level

(C) Implementation level

(D) All of the above

45.Stack is also called as (A)

(A) Last in first out

(B) First in last out

(C) Last in last out

(D) First in first out

46.________ is not the component of Data Structure (D)

(A) Operations

(B) Storage Structures

(C) Algorithms

(D) None of the above

47.Which of the following data structure can’t store the non-homogeneous data elements? (A)

(A) Arrays

(B) Records

(C) Pointers

(D) Stacks

47.Which of the following is non-liner data structure?(D)

(A) Stacks
(B) List

(C) Strings

(D) Trees

48. Which of the following statement is true?(C)

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

D) Binary Tree search

50. Which of the following data structures are indexed structures?(A)

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

52. Operations on a data structure may be ….. (D)

A. creation

B. destruction
C. selection

D. all of the above

53. Which of the following are the operations applicable an primitive data structures? (D)

A. create

B. destroy

C. update

D. all of the above

54. Which of the following statement is false? (C)

A. Arrays are dense lists and static data structure.

B. Data elements in linked list need not be stored in adjacent space in memory

C. Pointers store the next data element of a list.

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

56. Arrays are best data structures ………… (A)

A) For relatively permanent collections of data.

B) For the size of the structure and the data in the structure are constantly changing

C) For both of above situation

D) For none of the above

57. When does top value of the stack changes? (D)

A) Before deletion

B) While checking underflow

C) At the time of deletion

D) After deletion

58. Linear arrays are also called ………………. (B)

A) Straight line array

B) One-dimensional array

C) Vertical array

D) Horizontal array

59. The disadvantage in using a circular linked list is ……………………. (A)

A) It is possible to get into infinite loop.

B) Last node points to first node.

C) Time consuming

D) Requires more memory space

60. Which of the following is true about the characteristics of abstract data types?(C)

i) It exports a type.

ii) It exports a set of operations

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

C) Both of the above

D) None of the above

62. Herder node is used as sentinel in ….. (C)

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

64. ………… is not the operation that can be performed on queue.(D)

A) Insertion

B) Deletion

C) Retrieval

D) Traversal

65. The property of binary tree is (D)

A) The first subset is called left subtree

B) The second subtree is called right subtree

C) The root cannot contain NULL

D) The right subtree can be empty

66. Each node in a linked list has two pairs of ………….. and ………………. (A)

A) Link field and information field

B) Link field and avail field

C) Avail field and information field

D) Address field and link field

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)

A) front, rear end

B) only at rear end

C) only at front end

D) any position

69. Two main measures for the efficiency of an algorithm are (A)
A. Time and space

B. Processor and memory

C. Complexity and capacity

D. Data and space

70. Which is the best data structure for round robin algorithm for CPU scheduling? (C)

A. Stack implemented using queues

B. Doubly linked list

C. Circular queue

D. Queue implemented using stacks

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)

A. the name of array

B. the data type of array

C. the first data from the set to be stored

D. the index set of the array

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

74. Two dimensional arrays are also called (C)

A. tables arrays

B. matrix arrays
C. both of the above

D. none of the above