Computer (Data Structure 1)

Computer (Data Structure 1)

Q-1 A value or set of values is called-------?
(a) File (b) Entity (c) Data (d) Key

Q-2 A data item in a record that takes unique values and can be used to distinguish
a record from other record is called---------?
(a) Key (b) Information
(c) Data time (d) Record

Q-3 What is information?
(a) Set of values (b) A processed data
(c) A collection of record (d) None of these

Q-4 Which amongst the following is definition of record?
(a) A collection of similar entities (b) A collection of related records
(c) A collection of related items (d) None of these

Q-5 A collection of values and a set of operations that act on those values is called---------?
(a) Abstract data type (b) Primitive data type
(c) Polymorphic (d) Data type

Q-6 A primitive data type is a data type that is--------?
(a) Predefined (b) Post defined
(c) Abstract (d) None of these

Q-7 The pre defined data type is also known as--------?
(a) Set of values (b) Built – in data type
(c) Polymorphic (d) Abstract data type

Q-8 A data type that is organized in such a way that the specification of the values and
the specification of the operation on those values are separated from the
representation of the values and the implementation of the operation is called-------?
(a) Primitive data type (b) Polymorphic data type
(c) Abstract data type (d) None of these

Q-9 What is a list?
(a) A collection of record which can be ordered or unordered
(b) A collection of data type which can be ordered or unordered
(c) A collection of different values
(d) A collection of elements which can be ordered or unordered

Q-10 ---------- Is important because it supplies two essential pieces of information.
(a) Data typing (b) Data hiding
(c) Data typing (d) None of these

Q-11 A data structure is a ---------of a particular organization of data.
(a) Algorithm (b) Logical model
(c) Analytical (d) None of these

Q-12 What is a linear data structure?
(a) The records form a sequence (b) The files form a sequence
(c) The elements from a sequence (d) The logic form a sequence

Q-13 A list of finite number of elements of same data type is called-----------?
(a) Arrays (b) Data type
(c) Record of file (d) None of these

Q-14 -------- that requires only one index to access an individual element of the array?
(a) Two-dimensional array (b) One- dimenstrional array
(c) Multi dimensional array (d) Single ten arrays

Q-15 A linked list is a liner collection of data elements is----?
(a) Array (b) Station
(c) nodes (d) None of these

Q-16 In liner linked list each node is dinded into how many parts?
(a) 5 (b) 4
(c) 3 (d) 2

Q-17 In liner linked list first part contains the information of the element and second
called------ contains the address of the node in the list?
(a) The linked field or next pointer field (b) The pervious pointer field
(c) The information of the element (d) None of these
Q-18 In doubly linked list each node is dinded in to how many parts?
(a) 4 (b) 3
(c) 5 (d) 6

Q-19 LIFO stands for-------?
(a) Left-in-first-off (b) Long- inbox- from- on
(c) Last-in-first-out (d) Last-in-from-open
Q-20 What is a stack?
(a) LIFO (b) FILO
(c) LOFT (d) FOLI

Q-21 FIFO stands for---------?
(a) First-out-first-in (b) First-inner-from-out
(c) First-inter-for-offer (d) First-in-first-out

Q-22 A data structure that represents hierarchical relationship between various elements
is called?
(a) Trees (b) Queues
(c) Heaps (d) Shape

Q-23 How many children are there in a binary tree?
(a) 3 (b) 2
(c) 4 (d) 5

Q-24 Finding the location of a given element is called----?
(a) Sorting (b) Deletion
(c) Searching (d) In serration

Q-25 Combining the elements of two similar sorted structures in to a single structure
are called------?
(a) Traversal (b) Heaps
(c) Sorting (d) Merging

Answers With Reasons:-

1 (c) Data
2 (a) Key
3 (b) A processed data
4 (c) A collection of related items
5 (d) Data type
6 (a) Predefined
7 (b) Built – in data type
8 (c) Abstract data type
9 (d) A collection of elements which can be ordered
10 (a) Data typing
11 (b) Logical model
12 (b) Logical model
13 (a) Arrays
14 (b) One- dimensional array
15 (c) Nodes
16 (d) 2
17 (a) The linked field or next pointer field
18 (b) 3
19 (c) Last-in-first-out
20 (a) LIFO
21 (d) First-in-first-out
22 (a) Trees
23 (b) 2
24 (c) Searching
25 (d) Merging