Solved MCQ on Routing algorithm in computer networks set-2

1) Alternate and adaptive routing algorithm belongs to ..........

A. static routing

B. permanent routing

C. standard routing

D. dynamic routing


2) .......... protocol is a popular example of a link state routing protocol.

A. SPF

B. BGP

C. RIP

D. OSPF


3) An example of routing algorithm is ...

A. TELNET

B. TNET

C. ARPANET

D. ARNET


4) The Enhanced Interior Gateway Routing Protocol(EIGRP) is categorized as a ........

A. Distance vector routing protocols

B. Link state routing protocols

C. Hybrid routing protocols

D. Automatic state routing protocols


5) In .......... routing, the routing table hold the address of just the next hop instead of complete route information.

A. next-hop

B. host-specific

C. network-specific

D. default


6) .......... was originally developed to provide a loop-free method of exchanging routing information between autonomous systems.

A. OSPF

B. EIGRP

C. BGP

D. RIP


7) In ............ routing, the destination address is a network address in the routing tables.

A. next-hop

B. host-specific

C. network-specific

D. default


8) Logical partitioning of the network, authentication and faster convergence rate are the advantages of ....

A. OSPF

B. EIGRP

C. BGP

D. RIP


9) The .......... flag indicates the availability of a router.

A. up

B. host specific

C. gateway

D. added by redirection


10) The types of autonomous system defined by BGP is/are ..

A. Stub

B. Multi-homed

C. Transit

D. All of the above


11) For a direct deliver, the ........ flag is on.

A. up

B. host specific

C. gateway

D. added by redirection


12) A .......... AS has connections to two or more autonomous systems and carries both local and transit traffic.

A. Stub

B. Multi-homed

C. Transit

D. All of the above


13) In unicast routing, each router in the domain has a table that defines a ......... path tree to possible destinations.

A. average

B. longest

C. shortest

D. very longest


14) .............. supports the simultaneous use of multiple unequal cost paths to a destination.

A. OSPF

B. EIGRP

C. BGP

D. RIP


15) In multicast routing, each involved router needs to construct a ......... path tree for each group.

A. average

B. longest

C. shortest

D. very longest


16) Which of the following is/are the benefits provided by EIGRP?

i) Faster convergence

ii) partial routing updates

iii) High bandwidth utilization

iv) Route summarization

A. i, iii and iv only

B. i, ii and iii only

C. ii, iii and iv only

D. i, ii and iv only


17) In OSPF, a .......... link is a network is connected to only one router.

A. point-to-point

B. transient

C. stub

D. multipoint


18) ......... is the process of consolidating multiple contiguous routing entries into a single advertisement.

A. Faster convergence

B. Partial routing updates

C. Route summarization

D. Multiple protocols


19) In OSPF, when the link between two routers is broken, the administration may create a ........ link between them using a longer path that probably goes through several routers.

A. point-to-point

B. transient

C. stub

D. multipoint


20) ........... is the process of introducing external routers into an OSPF network.

A. Route redistribution

B. Route summarization

C. Route reintroducing

D. Route recreation

Answers:

1) D. dynamic routing
2) D. OSPF
3) C. ARPANET
4) C. Hybrid routing protocols
5) A. next-hop
6) C. BGP
7) C. network-specific
8) A. OSPF
9) D. added by redirection
10) D. All of the above
11) C. gateway
12) C. Transit
13) C. shortest
14) B. EIGRP
15) C. shortest
16) D. i, ii and iv only
17) C. stub
18) C. Route summarization
19) D. multipoint
20) A. Route redistribution

Related Posts:

• Solved MCQ of Computer Networking test set-6

• MCQ of Computer networking test with answer set-7

• Computer Networks MCQ Interview Questions set-8

• Solved MCQ on Routing protocol in computer networks set-1

• Objective Questions on Routing protocol in computer networks set-3

• Solved MCQ on TCP/IP and UDP in Computer Networks set-1

• Interview Questions on TCP/IP and UDP in Computer Networks set-2

• Solved MCQ on Physical Layer in OSI Reference Model set-1

• Solved MCQ on Network Layer in Computer Networks set-1

For more MCQ's on Computer Networks: Click Here

Solved MCQ on Routing protocol in computer networks set-1

1) Which of the following is not the requirement of routing function?

A. Correctness

B. Robustness

C. Delay time

D. Stability

2) The ......... protocol allows the administrator to assign a cost, called the metric, to each route.

A. OSPF

B. RIP

C. BGP

D. BBGP

3) If there is only one routing sequence for each source destination pair, the scheme is known as .....

A. static routing

B. fixed alternative routing

C. standard routing

D. dynamic routing

4) The Open Shortest Path First(OSPF) protocol is an intra domain routing protocol based on ........ routing.

A. distance vector

B. link state

C. path vector

D. non distance vector

5) An/A ..........routing scheme is designed to enable switches to react to changing traffic patterns on the network.

A. static routing

B. fixed alternative routing

C. standard routing

D. dynamic routing

6) The Routing Information Protocol(RIP) is an intra domain routing based on ........routing.

A. distance vector

B. link state

C. path vector

D. distance code

7) The term ........ refers to which node or nodes in the network are responsible for the routing decision.

A. decision place

B. routing place

C. node place

D. switching place

8) In ....... routing the least cost route between any two nodes is the minimum distance.

A. path vector

B. distance vector

C. link state

D. switching

9) For centralized routing the decision is made by some designated node called ......

A. designated center

B. control center

C. network center

D. network control center

10) For purposes of routing, the Internet is divided into .......

A. wide area networks

B. autonomous networks

C. local area networks

D. autonomous system

11) In .......... a route is selected for each destination pair of nodes in the network.

A. flooding

B. variable routing

C. fixed routing

D. random routing

12) To create a neighborhood relationship, a router running BGP sends an .......... message.

A. open

B. update

c. keep alive

D. close

13) The technique which requires no network information required is ....

A. flooding

B. variable routing

C. fixed routing

D. random routing

14) An area is ....

A. part of an AS

B. composed of at least two AS

C. another term for an AS

D. composed more than two AS

15) Which of the following produces high traffic network?

A. Variable routing

B. Flooding

C. Fixed routing

D. Random routing

16) In ........... routing, we assume that there is one node (or more) in each autonomous system that acts on behave of the entire autonomous system.

A. distant vector

B. path vector

C. link state

D. multipoint

17) When a direct delivery is made, both the deliverer and receiver have the same ....

A. routing table

B. host id

C. IP address

D. Net id

18) In OSPF, a ......... link is a network with several routers attached to it.

A. point-to-point

B. transient

C. stub

D. multipoint

19) In ....... routing, the mask and the destination address are both 0.0.0.0 in routing table.

A. next-hop

B. host-specific

C. network-specific

D. default

20) In .......... the router forwards the receive packet through only one of its interfaces.

A. unicasting

B. multicasting

C. broadcasting

D. point to point

Answers:

1) C. Delay time 

2) A. OSPF

3) B. fixed alternative routing

4) B. link state

5) C. standard routing 

6) A. distance  vector

7) A. decision place

8) B. distance vector

9) D. network control center

10) D. autonomous system

11) C. fixed routing

12) B. update

13) A. flooding

14) A. part of an AS

15) B. Flooding

16) B. path vector

17) D. Net id

18) B. transient

19) D. default  

20) B. multicasting

Related Posts:

• Solved MCQ of Computer Networking test set-6

• MCQ of Computer networking test with answer set-7

• Computer Networks MCQ Interview Questions set-8

• Solved MCQ on Routing protocol in computer networks set-1

• Objective Questions on Routing protocol in computer networks set-3

• Solved MCQ on TCP/IP and UDP in Computer Networks set-1

• Interview Questions on TCP/IP and UDP in Computer Networks set-2

• Solved MCQ on Physical Layer in OSI Reference Model set-1

• Solved MCQ on Network Layer in Computer Networks set-1

For more MCQ's on Computer Networks: Click Here

Solved MCQ on Searching and Sorting Algorithms in Data Structure set-2

1) The worst case occur in linear search algorithm when .......

A. Item is somewhere in the middle of the array

B. Item is not in the array at all

C. Item is the last element in the array

D. Item is the last element in the array or item is not there at all

2) If the number of records to be sorted is small, then ...... sorting can be efficient.

A. Merge

B. Heap

C. Selection

D. Bubble

3) The complexity of sorting algorithm measures the ...... as a function of the number n of items to be sorter.

A. average time

B. running time

C. average-case complexity

D. case-complexity

4) Which of the following is not a limitation of binary search algorithm?

A. must use a sorted array

B. requirement of sorted array is expensive when a lot of insertion and deletions are needed

C. there must be a mechanism to access middle element directly

D. binary search algorithm is not efficient when the data elements more than 1500.

5) The Average case occurs in linear search algorithm ..........

A. when item is somewhere in the middle of the array

B. when item is not the array at all

C. when item is the last element in the array

D. Item is the last element in the array or item is not there at all

6) Binary search algorithm cannot be applied to ...

A. sorted linked list

B. sorted binary trees

C. sorted linear array

D. pointer array

7) Complexity of linear search algorithm is .........

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)

8) Sorting algorithm can be characterized as ......

A. Simple algorithm which require the order of n2 comparisons to sort n items.

B. Sophisticated algorithms that require the O(nlog2n) comparisons to sort items.

C. Both of the above

D. None of the above

9) The complexity of bubble sort algorithm is .....

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)

10) State True or False for internal sorting algorithms.

i) Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory.

ii) The time required to read or write is considered to be significant in evaluating the performance of internal sorting.

A. i-True, ii-True

B. i-True, ii-False

C. i-False, ii-True

D. i-False, ii-False

11) The complexity of merge sort algorithm is ......

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)

12) .......... is putting an element in the appropriate place in a sorted list yields a larger sorted order list.

A. Insertion

B. Extraction

C. Selection

D. Distribution

13) ............order is the best possible for array sorting algorithm which sorts n item.

A. O(n logn)

B. O(n2)

C. O(n+logn)

D. O(logn)

14) ......... is rearranging pairs of elements which are out of order, until no such pairs remain.

A. Insertion

B. Exchange

C. Selection

D. Distribution

15) ............ is the method used by card sorter.

A. Radix sort

B. Insertion

C. Heap

D. Quick

16) Which of the following sorting algorithm is of divide and conquer type?

A. Bubble sort

B. Insertion sort

C. Merge sort

D. Selection sort

17) ........ sorting algorithm is frequently used when n is small where n is total number of elements.

A. Heap

B. Insertion

C. Bubble

D. Quick

18) Which of the following sorting algorithm is of priority queue sorting type?

A. Bubble sort

B. Insertion sort

C. Merge sort

D. Selection sort

19) Which of the following is not the required condition for binary search algorithm?

A. The list must be sorted

B. There should be the direct access to the middle element in any sub list

C. There must be mechanism to delete and/or insert elements in list.

D. Number values should only be present

20) Partition and exchange sort is ........

A. quick sort

B. tree sort

C. heap sort

D. bubble sort

Answers:

1) D. Item is the last element in the array or item is not there at all

2) C. Selection

3) B. running time 

4) D. binary search algorithm is not efficient when the data elements more than 1500.

5) A. when item is somewhere in the middle of the array

6) D. pointer array

7) A. O(n)

8) C. Both of the above

9) C. O(n2)

10) B. i-True, ii-False

11) D. O(n logn)

12) A. Insertion

13) C. O(n+logn)

14) B. Exchange

15) A. Radix sort

16) C. Merge sort

17) B. Insertion

18) D. Selection sort

19) C. There must be mechanism to delete and/or insert elements in list.

20) A. quick sort

Related Posts

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

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

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

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

• Solved MCQ of Data Structure Set - 1

• Solved MCQ of Data Structure Set - 2

• Solved Objective questions of computer data structure set-3

• Solved MCQ of Data Structure and Algorithm set-4

• MCQ of Data Structure and Algorithm with Answer set-5

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

MCQ on Searching, Merging and Sorting Methods in Data Structure set-1

1) Finding the location of a given item in a collection of items is called ......

A. Discovering

B. Finding

C. Searching

D. Mining


2) Which of the following is an external sorting?

A. Insertion Sort

B. Bubble Sort

C. Merge Sort

D. Tree Sort


3) Very slow way of sorting is ..........

A. Insertion sort

B. Heap sort

C. Bubble sort

D. Quick sort


4) Which of the following is an internal sorting?

A. Tape Sort

B. 2-way Merge Sort

C. Merge Sort

D. Tree Sort


5) Sorting a file F usually refers to sorting F with respect to a particular key called .....

A. Basic key

B. Primary key

C. Starting key

D. Index key


6) The time complexity of quick sort is ........

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)


7) Selection sort first finds the .......... element in the list and put it in the first position.

A. Middle element

B. Largest element

C. Last element

D. Smallest element


8) Quick sort is also known as ........

A. merge sort

B. tree sort

C. shell sort

D. partition and exchange sort


9) The operation that combines the element is of A and B in a single sorted list C with n=r+s element is called ....

A. Inserting

B. Mixing

C. Merging

D. Sharing


10) A tree sort is also known as ......... sort.

A. quick

B. shell

C. heap

D. selection



11) .......... sorting is good to use when alphabetizing large list of names.

A. Merge

B. Heap

C. Radix

D. Bubble


12) The easiest sorting is ........

A. quick sort

B. shell sort

C. heap sort

D. selection sort


13) Which of the following sorting algorithm is of divide and conquer type?

A. Bubble sort

B. Insertion sort

C. Quick sort

D. Merge sort


14) Merging k sorted tables into a single sorted table is called ......

A. k way merging

B. k th merge

C. k+1 merge

D. k-1 merge


15) The function used to modify the way of sorting the keys of records is called ........

A. Indexing function

B. Hash function

C. Addressing function

D. All of the above


16) If the number of record to be sorted large and the key is short, then ...... sorting can be efficient.

A. Merge

B. Heap

C. Radix

D. Bubble


17) The total number of comparisons in a bubble sort is ....

A. O(n logn)

B. O(2n)

C. O(n2)

D. O(n)


18) If the number of record to be sorted large and the key is long, then ...... sorting can be efficient.

A. Merge

B. Heap

C. Quick

D. Bubble


19) The time complexity of heap sort is ....

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)


20) The complexity of selection sort is .......

A. O(n)

B. O(n2)

C. O(n logn)

D. O(logn)

Answers:

1) C. Searching
2) C. Merge Sort
3) A. Insertion sort
4) D. Tree Sort
5) B. Primary key
6) D. O(n logn)
7) D. Smallest element
8) D. partition and exchange sort
9) C. Merging
10) C. heap
11) C. Radix
12) D. selection sort
13) C. Quick sort
14) A. k way merging
15) B. Hash function
16) C. Radix
17) A. O(n logn)
18) C. Quick
19) D. O(n logn)
20) B. O(n2) 

Related Posts

• Solved MCQ on Stack and Queue in Data Structure set-1
• Interview Questions on Stack and Queue in Data Structure set-2
• Solved MCQ on Tree and Graph in Data Structure set-1
• Objective Questions on Tree and Graph in Data Structure set-2
• Solved MCQ of Data Structure Set - 1
• Solved MCQ of Data Structure Set - 2
• Solved Objective questions of computer data structure set-3
• Solved MCQ of Data Structure and Algorithm set-4
• MCQ of Data Structure and Algorithm with Answer set-5

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

Objective Questions on List and Linked List in Data Structure set-2

1) To insert a new node in linked list free node will be available in ........

A. Available list

B. Avail list

C. Free node list

D. Memory space list

2) A singly linked list is also called as ........

A. linked list

B. one way chain

C. two way chain

D. right link

3) A ..... list is a header list where the node points back to the header node.

A. Circular header

B. Grounded header

C. Two way header

D. One way header

4) A doubly linked list has .......... pointers with each node.

A. 0

B. 1

C. 2

D. 3

5) Header linked lists are frequently used for maintaining ........ in memory.

A. Polynomials

B. Binomial

C. Trinomial

D. Quadratic equation

6) The pointer that points to the first node in the list is ........

A. FIRST

B. AVAIL

C. TOP

D. REAR

7) Two-way list may be maintained in memory by means of .............

A. Queues

B. Linear arrays

C. Non linear arrays

D. Stacks

8) A doubly linked list is also called as ..........

A. linked list

B. one way chain

C. two way chain

D. right link

9) The list that requires two pointer variables FIRST and LAST is called ........

A. Circular list

B. Header list

C. One way list

D. Two way list

10) If the availability list is null, then the condition is said to be .........

A. nil block

B. availability list underflow

C. availability list overflow

D. memory loss

11) The list which has its own pointer is called ........

A. pointer list

B. self pointer

C. free pool

D. own pointer

12) 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. None of the above

13) A .......... is a header list where the last node contains the null pointer.

A. grounded header list

B. bottom header list

C. down header list

D. dropped header list

14) RLINK is the pointer pointing to the ...

A. successor node

B. predecessor node

C. head node

D. last node

15) A ............. is a header list where the last node points back to the header node.

A. rounded header list

B. circular header list

C. common header list

D. forward header list

16) In a linked list, insertion can be done as .........

A. beginning

B. end

C. middle

D. all of the above

17) In a two-way lists each node is divided into .......parts.

A. 1

B. 2

C. 3

D. 4

18) The disadvantage in using a circular linked list is .......

A. it is possible to get into infinite loop

B. last node points to fist node.

C. time consuming

D. requires more memory space.

19) Which of the following conditions checks available free space in avail list?

A. Avail=Null

B. Null=Avail

C. Avail=Max stack

D. Avail=Top

20) A linear list in which each node has point to the predecessor and successors nodes is called ........

A. singly linked list

B. circular linked list

C. doubly linked list

D. linear linked list

Answers:

1) B. Avail list

2) B. one way chain

3) A. Circular header

4) C. 2

5) A. Polynomials

6) A. FIRST

7) B. Linear arrays

8) C. two way chain

9) D. Two way list

10) B. availability list underflow

11) C. free pool

12) D. None of the above

13) A. grounded header list

14) A. successor node

15) B. circular header list

16) D. all of the above

17) C. 3

18) A. it is possible to get into infinite loop

19) A. Avail=Null

20) C. doubly linked list

Related Posts

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

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

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

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

• Solved MCQ of Data Structure Set - 1

• Solved MCQ of Data Structure Set - 2

• Solved Objective questions of computer data structure set-3

• Solved MCQ of Data Structure and Algorithm set-4

• MCQ of Data Structure and Algorithm with Answer set-5

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

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

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

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

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

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

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

• Solved MCQ of Data Structure Set - 1

• Solved MCQ of Data Structure Set - 2

• Solved Objective questions of computer data structure set-3

• Solved MCQ of Data Structure and Algorithm set-4

• MCQ of Data Structure and Algorithm with Answer set-5

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

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

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

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

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

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

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

• Solved MCQ of Data Structure Set - 1

• Solved MCQ of Data Structure Set - 2

• Solved Objective questions of computer data structure set-3

• Solved MCQ of Data Structure and Algorithm set-4

• MCQ of Data Structure and Algorithm with Answer set-5

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