الاثنين، 15 ديسمبر 2014

Solved MCQ on List and Linked List in Data Structure set-1

Posted on 4:45:00 مby with No comments

1) Linked lists are best suited .....

A. for relatively permanent collections of data.

B. for the size of the structure and the data in the structure are constantly changing.

C. data structure

D. for none of above situation


2) The operation of processing each element in the list is known as ......

A. sorting

B. merging

C. inserting

D. traversal


3) The situation when in a linked list START=NULL is ....

A. Underflow

B. Overflow

C. Houseful

D. Saturated


4) Each node in singly linked list has ........ fields.

A. 2

B. 3

C. 1

D. 4


5) Which of the following is two way lists?

A. Grounded header list

B. Circular header list

C. Linked list with header and trailer nodes

D. List traversed in two directions


6) Which is the pointer associated with the availability list?

A. FIRST

B. AVAIL

C. TOP

D. REAR


7) Value of first linked list index is ....

A. 0

B. 1

C. -1

D. 2


8) In linked lists there are no NULL links in

A. single linked list

B. linear doubly linked list

C. circular linked list

D. linked list


9) Each node in a linked list must contain at least .....

A. Three fields

B. Two fields

C. Four fields

D. Five fields


10) The dummy header in linked list contain .....

A. first record of the actual data

B. last record of the actual data

C. pointer to the last record of the actual data

D. middle record of the actual data


11) In a linked list the .......... field contains the address of next element in the list.

A. Link field

B. Next element field

C. Start field

D. Info field


12) LLINK is the pointer pointing to the ...

A. successor node

B. predecessor node

C. head node

D. last node


13) .......... refers to a linear collection of data items.

A. List

B. Tree

C. Graph

D. Edge


14) A run list is ......

A. small batches of records from a file

B. number of elements having same value

C. number of records

D. number of files in external storage


15) A ...... indicates the end of the list.

A. Guard

B. Sentinel

C. End pointer

D. Last pointer


16) A ........ is a linear list in which insertions and deletions are made to from either end of the structure.

A. circular queue

B. random of queue

C. priority

D. dequeue


17) Indexing the ........ element in the list is not possible in linked lists.

A. middle

B. first

C. last

D. any where in between


18) A linear list in which the pointer points only to the successive node is ......

A. singly linked list

B. circular linked list

C. doubly linked list

D. none of the above


19) .......... may take place only when there is some minimum amount(or) no space left in free storage list.

A. Memory management

B. Garbage collection

C. Recycle bin

D. Memory management


20) A linear list in which the last node points to the first node is ........

A. singly linked list

B. circular linked list

C. doubly linked list

D. none of the above

Answers:

1) B. for the size of the structure and the data in the structure are constantly changing.
2) D. traversal
3) A. Underflow
4) A. 2
5) D. List traversed in two directions
6) B. AVAIL
7) A. 0
8) C. circular linked list
9) B. Two fields
10) A. first record of the actual data
11) A. Link field
12) B. predecessor node
13) A. List
14) A. small batches of records from a file
15) B. Sentinel
16) D. dequeue
17) A. middle
18) A. singly linked list
19) B. Garbage collection
20) B. circular linked list


Related Posts

For other more Multiple Choice Questions (MCQs): Click Here

الأحد، 14 ديسمبر 2014

Objective Questions on Tree and Graph in Data Structure set-2

Posted on 9:23:00 مby with No comments

1) The post order traversal of binary tree is DEBFCA. Find out the pre order traversal.

A. ABFCDE

B. ADBFEC

C. ABDECF

D. ABDCEF


2) While converting binary tree into extended binary tree, all the original nodes in binary tree are .......

A. Internal nodes on extended tree

B. External nodes on extended tree

C. Vanished on extended tree

D. Intermediate nodes on extended tree


3) The in-order traversal of tree will yield a sorted listing of elements of tree in ........

A. binary trees

B. binary search trees

C. heaps

D. binary heaps


4) In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called .........

A. Leaf

B. Branch

C. Path

D. Thread


5) In a head tree .....

A. values in a node is greater than every value every value in left sub tree and smaller than right sub tree.

B. values in a node is greater than every value in children of it.

C. conditions.

D. terms.


6) The in order traversal of tree will yield a sorted listing of elements of tree in ....

A. Binary trees

B. Binary search trees

C. Merging

D. AVL Trees


7) In a graph if e=(u,v) means .......

A. u is adjacent to v but v is not adjacent to u.

B. e begins at u and ends at v

C. u is node and v is an edge.

D. both u and v are edges.


8) A binary tree whose every node has either zero or two children is called .........

A. Complete binary tree

B. Binary Search tree

C. Extended binary tree

D. E2 tree


9) If every node u in G is adjacent to every other node v in G,A graph is said to be ........

A. isolated

B. complete

C. finite

D. strongly connected.


10) The post order traversal of a binary tree is DEBFCA. Find out the pre order Traversal.

A. ABFCDE

B. ADBFEC

C. ABDECF

D. ABDCEF


11) In a graph if e=[u,v], then u and v are called

A. endpoints of e

B. adjacent nodes

C. neighbours

D. all of the above


12) In-order traversing a tree resulted E A C K F H D B G; the pre-order traversal would return.

A. FAEKCDBHG

B. FAEKCDHGB

C. EAFKHDCBG

D. FEAKDCHBG


13) A connected graph T without any cycles is called .

A. a tree graph

B. free tree

C. a tree

D. All of above


14) In linked representation of Binary trees LEFT[k] contains the ........ of at the node N, where k is the location.

A. Data

B. Location and left child

C. Right child address

D. Null value


15) If every node u in G adjacent to every other node v in G, A graph is said to be

A. isolated

B. complete

C. finite

D. strongly connected


16) Three standards ways of traversing a binary tree T with root R .......

A. Prefix, infix, postfix

B. Pre-process, in-process, post-process

C. Pre-traversal, in-traversal, post-traversal

D. Pre-order, in-order, post-order


17) A graph is said to be ....... if every node u in G is adjacent to every other node v in G.

A. Absolute

B. Entire

C. Inclusive

D. Complete


18) In threaded binary tree ......... points to higher nodes in tree.

A. Info

B. Root

C. Threads

D. Child


19) A graph is said to be ....... if its edges are assigned data.

A. Tagged

B. Marked

C. Lebeled

D. Sticked


20) If node N is a terminal node in a binary tree then its .........

A. Right tree is empty

B. Left tree is empty

C. Both left & right sub trees are empty

D. Root node is empty

Answers:

1) C. ABDECF
2) A. Internal nodes on extended tree
3) B. binary search trees
4) D. Thread
5) B. values in a node is greater than every value in children of it.
6) B. Binary search trees
7) B. e begins at u and ends at v
8) C. Extended binary tree
9) B. complete
10) C. ABDECF
11) D. all of the above
12) B. FAEKCDHGB
13) D. All of above
14) A. Data
15) B. complete
16) D. Pre-order, in-order, post-order
17) D. Complete
18) C. Threads
19) C. Lebeled
20) C. Both left & right sub trees are empty


Related Posts

For other more Multiple Choice Questions (MCQs): Click Here

السبت، 13 ديسمبر 2014

Solved MCQ on Tree and Graph in Data Structure set-1

Posted on 8:25:00 صby with No comments

1) The operation of processing each element in the list is known as ......

A. sorting

B. merging

C. inserting

D. traversal


2) Other name for directed graph is ..........

A. Direct graph

B. Digraph

C. Dir-graph

D. Digraph


3) Binary trees with threads are called as .......

A. Threaded trees

B. Pointer trees

C. Special trees

D. Special pointer trees


4) Graph G is .............. if for any pair u, v of nodes in G there is a path from u to v or path from v to u.

A. Leterally connected

B. Widely Connected

C. Unliterally connected

D. Literally connected


5) In Binary trees nodes with no successor are called ......

A. End nodes

B. Terminal nodes

C. Final nodes

D. Last nodes


6) A connected graph T without any cycles is called ........

A. free graph

B. no cycle graph

C. non cycle graph

D. circular graph


7) Trees are said .......... if they are similar and have same contents at corresponding nodes.

A. Duplicate

B. Carbon copy

C. Replica

D. Copies


8) A connected graph T without any cycles is called a ........

A. A tree graph

B. Free tree

C. A tree d

D. All of the above


9) Every node N in a binary tree T except the root has a unique parent called the ......... of N.

A. Antecedents

B. Predecessor

C. Forerunner

D. Precursor


10) In a graph if E=(u,v) means ......

A. u is adjacent to v but v is not adjacent to u

B. e begins at u and ends at v

C. u is processor and v is successor

D. both b and c



11) Sequential representation of binary tree uses ........

A. Array with pointers

B. Single linear array

C. Two dimentional arrays

D. Three dimentional arrays


12) In a graph if e=[u,v], Then u and v are called ........

A. End points of e

B. Adjacent nodes

C. Neighbours

D. All of the above


13) TREE[1]=NULL indicates tree is ........

A. Overflow

B. Underflow

C. Empty

D. Full


14) A binary tree whose every node has either zero or two children is called .......

A. complete binary tree

B. binary search tree

C. extended binary tree

D. data structure


15) Linked representation of binary tree needs ......... parallel arrays.

A. 4

B. 2

C. 3

D. 5


16) The depth of complete binary tree is given by ......

A. Dn = n log2n

B. Dn= n log2n+1

C. Dn = log2n

D. Dn = log2n+1


17) In a 2-tree, nodes with 0 children are called ............

A. Exterior node

B. Outside node

C. Outer node

D. External node


18) Which indicates pre-order traversal?

A. Left sub-tree, Right sub-tree and root

B. Right sub-tree, Left sub-tree and root

C. Root, Left sub-tree, Right sub-tree

D. Right sub-tree, root, Left sub-tree



19) In a extended-binary tree nodes with 2 children are called ........

A. Interior node

B. Domestic node

C. Internal node

D. Inner node


20) A terminal node in a binary tree is called ............

A. Root

B. Leaf

C. Child

D. Branch





Answers:


1) D. traversal
2) D. Digraph
3) A. Threaded trees
4) C. Unliterally connected
5) B. Terminal nodes
6) A. free graph
7) D. Copies
8) D. All of the above
9) B. Predecessor
10) D. both b and c
11) A. Array with pointers
12) D. All of the above
13) C. Empty
14) C. extended binary tree
15) C. 3
16) D. Dn = log2n+1
17) D. External node
18) C. Root, Left sub-tree, Right sub-tree
19) C. Internal node
20) B. Leaf


Related Posts

For other more Multiple Choice Questions (MCQs): Click Here

الجمعة، 12 ديسمبر 2014

Interview Questions on Stack and Queue in Data Structure set-2

Posted on 1:16:00 صby with No comments

1) The queue in which the insertion takes place in the first position after of last element is a ......

A. priority

B. dequeue

C. circular

D. linked


2) Before inserting into stack one must check the condition .........

A. Overflow

B. Underflow

C. Maximum elements

D. Existing elements


3) The another name of dequeue is .........

A. divided queue

B. distributed queue

C. double ended queue

D. design queue


4) Before deletion condition into stack ...... has to be checked.

A. Overflow

B. Underflow

C. Maximum elements

D. Existing elements


5) In dequeue, insertion and deletion takes place of ..........

A. front, rear end

B. only at rear end

C. only at front end

D. both the ends


6) When does Top value of stack change in insertion process?

A. Before insertion

B. After insertion

C. At the time of insertion

D. While checking overflow


7) A queue in which insertion and deletion takes places from any position is called ......

A. circular queue

B. random of queue

C. priority

D. dequeue


8) Deletion in the linked stack takes place by deleting ........

A. Node pointed by the start process.

B. End of the list

C. Beginning of the list

D. Middle of the list


9) Which of the following name does not relate to stacks?

A. FIFO lists

B. LIFO list

C. piles

D. push-down lists


10) The condition ........ indicate the queue is empty.

A. Front=Null

B. Null=Front

C. Front=Rear

D. Rear=Null



11) Which of the following is not the type of queue?

A. Ordinary queue

B. Special queue

C. Priority queue

D. Circular queue


12) The value of REAR is increased by 1 when .......

A. An element is deleted in a queue

B. An element is traversed in a queue

C. An element is added in a queue

D. An element is merged in a queue


13) The operations that can be done in a circular queue is/are .....

A. Insert from the front end

B. Delete from front end

C. Display queue contents

D. All of the above


14) The term dequeue is the contraction of the name ........

A. Double ended queue

B. Double sided queue

C. Double headed queue

D. Double address queue


15) The various operations that can be performed on stacks is/are .....

A. Insert an item into the stack

B. Delete an item from the stack

C. Display the contents of the stack

D. All of the above


16) ............. is a collection of elements such that each element has been assigned a processing priority.

A. Priority queue

B. Procedure queue

C. Main queue

D. Interrupt queue


17) The deletion operation in stack is called ......

A. insert

B. push

C. pop

D. top


18) Link fields holds pointers to the .......... element in the linked representation of stack.

A. Neighbouring

B. Last

C. First

D. Middle


19) The pointer associated with the stack is ...........

A. front

B. rear

C. top

D. link


20) Reversing a great deal of space for each stack in memory will ...........

A. Decrease the numbers of times overflow may occur

B. Increase the numbers of times overflow may occur

C. Increase the number of times underflow may occur

D. Increase the number of times underflow may occur.





Answers:


1) C. circular
2) A. Overflow
3) C. double ended queue
4) B. Underflow
5) D. both the ends
6) A. Before insertion
7) C. priority
8) A. Node pointed by the start process
9) A. FIFO lists
10) A. Front=Null
11) B. Special queue
12) C. An element is added in a queue
13) D. All of the above
14) A. Double ended queue
15) D. All of the above
16) A. Priority queue
17) C. pop
18) A. Neighbouring
19) C. top
20) A. Decrease the numbers of times overflow may occur


Related Posts

For other more Multiple Choice Questions (MCQs): Click Here

الخميس، 11 ديسمبر 2014

Solved MCQ on Stack and Queue in Data Structure set-1

Posted on 9:35:00 مby with No comments

1) ......... form of access is used to add and remove nodes from a queue.

A. LIFO, Last In First Out

B. FIFO, First In First Out

C. Both a and b

D. None of these


2) In liked representation of stack ....... holds the elements of the stack.

A. INFO fields

B. TOP fields

C. LINK fields

D. NULL fields


3) ........ form of access is used to add remove nodes from a stack.

A. LIFO

B. FIFO

C. Both A and B

D. None of these


4) In the linked representation of the stack ......... behaves as the top pointer variable of stack.

A. Stop pointer

B. Begin pointer

C. Start pointer

D. Avail pointer


5) New nodes are added to the ......... of the queue.

A. Front

B. Back

C. Middle

D. Both A and B


6) In linked representation of stack the null pointer of the last node in the list signals ..........

A. Beginning of the stack

B. Bottom of the stack

C. Middle of the stack

D. In between some value


7) What happens when you push a new node onto a stack?

A. The new node is placed at the front of the linked list

B. The new node is placed at the back of the linked list

C. The new node is placed at the middle of the linked list

D. No Changes happens


8) A queue is a .........

A. FIFO

B. LIFO

C. FILO

D. LOFI


9) Which of the following name does not relate to stacks?

A. FIFO lists

B. LIFO lists

C. Piles

D. Push down lists


10) The retrieval of items in a stack is ........... operation.

A. push

B. pop

C. retrieval

D. access



11) The term push and pop is related to

A. Array

B. Lists

C. Stacks

D. Trees


12) Which is the pointer associated with the stack?

A. FIRST

B. FRONT

C. TOP

D. REAR


13) The elements are removal from a stack in .......... order.

A. Reverse

B. Hierarchical

C. Alternative

D. Sequential


14) The insertion operation in the stack is called .........

A. insert

B. push

C. pop

D. top


15) ...... is the term used to insert an element into stack.

A. Push

B. Pull

C. Pop

D. Pump


16) Stack follows the strategy of ........

A. LIFO

B. FIFO

C. LRU

D. RANDOM


17) .......... is the term used to delete an element from the stack.

A. Push

B. Pull

C. Pop

D. Pump


18) Deletion operation is done using ......... in a queue.

A. front

B. rear

C. top

D. list


19) A pointer variable which contains the location at the top element of the stack is called .....

A. Top

B. Last

C. Final

D. End


20) Which of the following is an application of stack?

A. finding factorial

B. tower of Hanoi

C. infix to postfix

D. all of the above


Answers:

1) B. FIFO, First In First Out
2) A. INFO fields
3) A. LIFO
4) C. Start pointer
5) B. Back
6) B. Bottom of the stack
7) A. The new node is placed at the front of the linked list
8) A. FIFO
9) A. FIFO lists
10) B. pop
11) C. Stacks
12) C. TOP
13) A. Reverse
14) B. push
15) A. Push
16) A. LIFO
17) C. Pop
18) A. front
19) A. Top
20) D. all of the above


Related Posts

For other more Multiple Choice Questions (MCQs): Click Here

Solved MCQ on Database Backup and Recovery in DBMS set-1

Posted on 12:22:00 صby with No comments

1) Which of the following is not a recovery technique?

A. Deferred update

B. Immediate update

C. Two-phase commit

D. Recovery management


2)Checkpoints are a part of

A. Recovery measures

B. Security measures

C. Concurrency measures

D. Authorization measures


3) ....... deals with soft errors, such as power failures.

A. system recovery

B. media recovery

C. database recovery

D. failure recovery


4) ........... is an essential part of any backup system.

A. Filter

B. Recovery

C. Security

D. Scalability


5) Media recovery deals with ...........

A. disk errors

B. hard errors

C. system errors

D. power failures


6) For a backup/restore system, ............. is a prerequisite for service in a enterprise.

A. Filter

B. Recovery

C. Security

D. Scalability


7) Failure recovery and media recovery fall under ........

A. transaction recovery

B. database recovery

C. system recovery

D. value recovery


8) The .......... consists of the various applications and database that play a role in a backup and recovery strategy.

A. Recovery Manager environment

B. Recovery Manager suit

C. Recovery Manager file

D. Recovery Manager database


9) In which the database can be restored up to the last consistent state after the system failure?

A. Backup

B. Recovery

C. Both

D. None



10) A ........... is a block of Recovery Manager(RMAN)job commands that is stored in the recovery catalogue.

A. recovery procedure

B. recovery block

C. stored block

D. stored script


11) In log based recovery, the log is sequence of .........

A. filter

B. records

C. blocks

D. numbers


12) The enrolling of a database in a recovery catalogue is called .........

A. set up

B. registration

C. start up

D. enrolment



13) .......... is an alternative of log based recovery.

A. Disk recovery

B. Shadow paging

C. Dish shadowing

D. Crash recovery



14) Most backup and recovery commands in ........... are executed by server sessions.

A. Backup Manager

B. Recovery Manager

C. Backup and Recovery Manager

D. Database Manager


15) ........ systems typically allows to replace failed disks without stopping access to the system.

A. RAM

B. RMAN

C. RAD

D. RAID



16) An ......... is an exact copy of a single datafile, archived redo log file, or control file.

A. image copy

B. datafile copy

C. copy log

D. control copy



17) .......... known as memory-style error correcting-code(ECC) organization, employs parity bits.

A. RAID level 1

B. RAID level 2

C. RAID level 3

D. RAID level 4



18) The remote backup site is sometimes called the .......... site.

A. primary

B. secondary

C. ternary

D. None of the above



19) EXP command is used ...........

A. to take Backup of the Oracle Database

B. to import data from the exported dump file

C. to create Rollback segments

D. to create Schedule.



20) The simplest approach to introducing redundancy is to duplicate every disk is called .....

A. mirroring

B. imaging

C. copying

D. All of the above

Answers:

1) C. Two-phase commit
2) A. Recovery measures
3) D. failure recovery
4) C. Security
5) A. disk errors
6) D. Scalability
7) C. system recovery
8) A. Recovery Manager environment
9) B. Recovery
10) D. stored script
11) B. records
12) B. registration
13) B. Shadow paging
14) B. Recovery Manager
15) D. RAID
16) A. image copy
17) B. RAID level 2
18)  B. secondary
19) A. to take Backup of the Oracle Database 
20) A. mirroring


Related Posts

For other more Multiple Choice Questions (MCQs): Click Here

الأربعاء، 10 ديسمبر 2014

Solved MCQ on Distributed Database Transaction Management set-4

Posted on 9:14:00 مby with No comments

1) Commit and rollback are related to ..........

A. data integrity

B. data consistency

C. data sharing

D. data security


2) The transaction wants to edit the data item is called as .......

A. Exclusive Mode

B. Shared Mode

C. Inclusive Mode

D. Unshared Mode


3) For committing a transaction, the DBMS might discard all the records.

A. after image

B. before image

C. log

D. redo log


4) A sophisticated locking mechanism known as 2-phase locking which includes Growing phase and .......

A. Shrinking Phase

B. Release phase

C. Commit phase

D. Acquire Phase


5) A Transaction ends

A. only when it is Committed.

B. only when it is Rolled-back

C. when it is Committed or Rolled-back

D. only when it is initialized


6) In .........., each transactions there is a first phase during which new lock are acquired.

A. Shrinking Phase

B. Release phase

C. Commit phase

D. Growing Phase


7) A transaction processing system is also called as .......

A. processing monitor

B. transaction monitor

C. TP monitor

D. monitor


8) The transactions are always ......... if it always locks a data item in shared mode before reading it.

A. well formed

B. well distributed

C. well locked

D. well shared


9) .......... servers which is widely used in relational database systems.

A. Data servers

B. Transaction servers

C. Query servers

D. Client servers


10) If a distributed transactions are well-formed and 2-phasedlocked, then ................ is the correct locking mechanism in distributed transaction as well as in centralized databases.

A. two phase locking

B. three phase locking

C. transaction locking

D. well-formed locking


11) ......... property will check whether all the operation of a transaction completed or none.

A. Atomicity

B. Consistency

C. Isolation

D. Durability


12) The total ordering of operations across groups ensures ...........of transactions.

A. serializability

B. synchronizability

C. atomicity

D. durability


13) In which state, the transaction will wait for the final statement has been executed?

A. Active

B. Failed

C. Aborted

D. partially committed


14) The ORDER concurrency control technique is based on the property.

A. ordering mechanism

B. inherent ordering

C. total ordering

D. partial ordering


15) Transactions per rollback segment is derived from .....

A. Db_Block_Buffers

B. Processes

C. shared_Pool_size

D. buffers


16) The ............is responsible for ensuring correct execution in the presence of failures.

A. Database Manager

B. Transaction Manager

C. Recovery Manager

D. Executive Manager


17) A distributed transaction can be ............. if queries are issued at one or more nodes.

A. fully read-only

B. partially read-only

C. fully read-write

D. partially read-write


18) The distributed transaction can be completely read-only and the transaction is started with a .......... READ ONLY statement.

A. DISTRIBUTED_TRANSACTIONS

B. TRANSACTION

C. SET TRANSACTION

D. READ TRANSACTION


19) The initialization parameter ................. controls the number of possible distributed transactions in which a given instance can concurrently participate, both as a client and a server.

A. DISTRIBUTED_TRANSACTIONS

B. TRANSACTION

C. SET TRANSACTION

D. CONTROL TRANSACTION


20) A database administrator can manually force the COMMIT or ROLLBACK of a local ............ distributed transaction.

A. in-force

B. in-doubt

C. in-local

D. in-manual

Answers:

1) B. data consistency
2) A. Exclusive Mode
3) B. before image
4) A. Shrinking Phase
5) C. when it is Committed or Rolled-back
6) D. Growing Phase
7) C. TP monitor
8) A. well formed
9) B. Transaction servers
10) A. two phase locking
11) A. Atomicity
12) A. serializability
13) D. partially committed
14) C. total ordering
15) B. Processes
16) A. Database Manager
17) B. partially read-only
18) C. SET TRANSACTION
19) A. DISTRIBUTED_TRANSACTIONS
20) B. in-doubt


Related Posts

For other more Multiple Choice Questions (MCQs): Click Here

الاشتراك في: الرسائل (Atom)
يتم التشغيل بواسطة Blogger.