Solved MCQ on Network Layer in Computer Networks set-1

1. The ........ layer links the network support layers and the user support layers.

A. transport

B. network

C. data link

D. session

2) The ............. layer changes bits into electromagnetic signals.

A. physical

B. data link

C. transport

D. network

3) The .......... layer coordinates the functions required to transmit a bit stream over a physical medium.

A. transport

B. network

C. data link

D. physical

4) Which of the following is an application layer service?

A. remote log-in.

B. file transfer and access.

C. mail service

D. all of the above

5) The ......... layer is responsible for the source-to-destination delivery of a packet across multiple network links.

A. transport

B. network

C. data link

D. session

6) The .......... layer is the layer closest to the transmission medium.

A. physical

B. data link

C. network

D. transport

7) The ...........layer is responsible for the process-to-process delivery of th entire message.

A. transport

B. network

C. data link

D. physical

8) Mail services are available to network users through the .......... layer.

A. data link

B. physical

C. transport

D. application

9) The ........... layer establishes, maintains, and synchronizes the interactions between communicating devices.

A. transport

B. network

C. session

D. physical

10) The .......... layer lies between the network layer and the application layer.

A. physical

B. data link

C. transport

D. session

11) The .......... layer ensures interoperability between communicating devices through transformation of data into a mutually agreed upon format.

A. transport

B. network

C. data link

D. presentation

12) Transmission media lies below the .........layer.

A. physical

B. network

C. transport

D. application

13) The ........... layer enables the users to access the network.

A. session

B. application

C. data link

D. physical

14) Circuit switching takes place at the .......... layer.

A. data link

B. physical

C. network

D. transport

15) The ............ layer is responsible for moving frames form one node to the next.

A. physical

B. data link

C. transport

D. session

16) The routing processor of a router performs the ........ layer functions of the router.

A. physical and data link

B. network

C. transport

D. session

17) The ............. layer adds a header to the packet coming from the upper layer that includes the logical address of the sender and receiver.

A. physical

B. data link

C. network

D. transport

18) Network layer lies on .......... layer.

A. physical

B. data link

C. network

D. transport

19) The ...........layer is responsible for the delivery of a message from one process to another.

A. physical

B. transport

C. network

D. session

20) The data link layer takes the packet it gets from the network layer and encapsulates them into ......

A. cells

B. frames

C. packet

D. trailer

Answers:

1) A. transport

2) A. physical

3) D. physical

4) D. all of the above

5) B. network

6) A. physical

7) A. transport

8) D. application

9) C. session

10) C. transport

11) D. presentation

12) A. physical

13) B. application

14) B. physical

15) B. data link

16) B. network

17) C. network

18) A. physical

19) B. transport

20) B. frames

Related Posts:

• Solved MCQ of Computer networking set-1

• MCQ of Computer Networking with answer set-2

• Solved MCQ of Computer networking set-3

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

• Solved MCQ on Routing algorithm in computer networks set-2

• 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

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

1) UDP needs the ........... address to deliver the user datagram to the correct application process

A. port

B. application

C. internet

D. intranet

2) The ........ was originally developed as a mechanism to enable disk-less hosts to be remotely booted over a network as workstations, routers, terminal concentrators and so on.

A. ICMP

B. BOOTP

C. UDP

D. ARP

3) Which of the following does UDP guarantee?

A. Flow control

B. Connection-oriented delivery

C. Data control

D. None of the above

4) .......... provides a framework for passing configuration information to hosts on a TCP/IP network.

A. Dynamic Host Configuration Protocol(DHCP)

B. Address Resolution Protocol(ARP)

C. Internet Protocol(IP)

D. Internet Control Message Protocol(ICMP)

5) The source port address on the UDP user datagram header defines .........

A. the sending computer

B. the receiving computer

C. the process running on the sending computer

D. the process running on the receiving computer

6) The mechanisms supported by DHCP for IP address allocation on a TCP/IP network is/are ...

A. Automatic allocation

B. Dynamic allocation

C. Manual allocation

D. All of th above

7) UDP is called a .......... transport protocol.

A. connection-oriented, unreliable

B. connectionless, reliable

C. connectionless, unreliable

D. connection, reliable

8) DHCP in TCP/IP network assigns an IP address for a limited period of time. Such a network address is called a ......

A. lease

B. limited network

C. timed network

D. assigned network

9) UDP does not add anything to the services of IP except for providing .......... communication.

A. node to node

B. process to process

C. host to host

D. interface to interface

10) The use of ......... allows centralized configuration of multiple clients.

A. ICMP

B. BOOTP

C. UDP

D. ARP

11) UDP is an acronym for ............

A. User Delivery Protocol

B. User Datagram Procedure

C. User Datagram Protocol

D. User Delivery Procedure

12) ............ is where users typically interact with the TCP/IP network.

A. Link layer

B. Network layer

C. Transport layer

D. Application layer

13) The local host and the remote host are defined using IP addresses. To define the processes, we need second identifiers called .........

A. UDP addresses

B. transport addresses

C. port addresses

D. TCP addresses

14) The ............. is responsible for communicating with the actual network hardware.

A. Link layer

B. Network layer

C. Transport layer

D. Application layer

15) UDP packets are encapsulated in .......

A. an Ethernet frame

B. an TCP segment

C. an IP datagram

D. an Ethernet packets

16) ............ is the protocol suite for the current Internet.

A. TCP/IP

B. NCP

C. UDP

D. ACM

17) UDP uses ........ to handle outgoing user datagrams from multiple processes on one host.

A. flow control

B. multiplexing

C. demultiplexing

D. data control

18) .......... provides full transport layer services to applications.

A. TCP

B. UDP

C. IP

D. ARP

19) UDP uses ...... to handle incoming user datagrams that go to different processes on the same host.

A. flow control

B. multiplexing

C. demultiplexing

D. data control

20) In the sending computer, UDP receives a data unit from the ......... layer.

A. application

B. transport

C. IP

D. interface

Answers:

1) A. port

2) B. BOOTP

3) D. None of the above

4) A. Dynamic Host Configuration Protocol(DHCP)

5) C. the process running on the sending computer

6) D. All of th above 

7) C. connectionless, unreliable

8) A. lease

9) B. process to process

10) B. BOOTP

11) C. User Datagram Protocol

12) D. Application layer

13) C. port addresses

14) A. Link layer

15) C. an IP datagram

16) A. TCP/IP

17) B. multiplexing

18) A. TCP

19) C. demultiplexing

20) A. application

Related Posts:

• Solved MCQ of Computer networking set-1

• MCQ of Computer Networking with answer set-2

• Solved MCQ of Computer networking set-3

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

• Solved MCQ on Routing algorithm in computer networks set-2

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

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

• 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 TCP/IP and UDP in Computer Networks set-1

1) TCP is a .......... protocol.

A. stream-oriented

B. message-oriented

C. block-oriented

D. packet-oriented


2) Which of the following is not the layer of TCP/IP protocol.

A. Physical layer

B. link layer

C. network layer

D. transport layer.


3) TCP groups a number of bytes together into a packet called a ....

A. user datagram

B. segment

C. datagram

D. packet


4) The .......... of TCP/IP protocol is responsible for figuring out how to get data to its destination.

A. application layer

B. link layer

C. network layer

D. transport layer.


5) TCP is a(n) ........... transport protocol.

A. protocol delivery

B. reliable

C. best-effort delivery

D. effortless delivery


6) ......... is the protocol that hides the underlying physical network by creating a virtual network view.

A. Internet Protocol(IP)

B. Internet Control Message Protocol(ICMP)

C. Address Resolution Protocol(ARP)

D. Bootstrap Protocol(BOOTP)


7) To use the services of UDP, we need ......... socket addresses.

A. four

B. two

C. three

D. four


8) Which of the following is not the name of Regional Internet Registries(RIR) to administer the network number portion of IP address.

A. American Registry for Internet Numbers(ARIN)

B. Reseaux IP Europeans(RIPE)

C. Europeans Registry for Internet Numbers(ERIN)

D. Asia Pacific Network Information Center(APNIC)


9) UDP packets are called .......

A. user datagrams

B. segments

C. frames

D. packets


10) ............ addresses use 21 bits for the and 8 bits for the portion of the IP address for TCP/IP network.

A. Class A

B. Class B

C. Class C

D. Class D


11) UDP packets have fixed-size header of .......... bytes.

A. 16

B. 8

C. 32

D. 64


12) .......... messages are never sent in response to datagrams with a broadcast or a multicast destination address.

A. ICMP

B. ARP

C. IP

D. BOOTP


13) TCP assigns a sequence number to each segment that is being sent. The sequence number for each segment is number of the ....... byte carried in that segment.

A. first

B. last

C. middle

D. zero


14) .......... is responsible for converting the higher level protocol address (IP addresses) to physical network addresses.

A. Internet Protocol(IP)

B. Internet Control Message Protocol(ICMP)

C. Address Resolution Protocol(ARP)

D. Bootstrap Protocol(BOOTP)


15) UDP and TCP are both ......... layer protocols.

A. data link

B. network

C. transport

D. interface


16) ........... is a process-to-process protocol that adds only port addresses, checksum error control, and length information to the data from upper layer.

A. TCP

B. UDP

C. IP

D. ARP


17) Which of the following functions does UDP perform?

A. Process-to-process communication

B. Host-to-host communication

C. End-to-end reliable data delivery

D. Interface-to-interface communication.


18) A port address in TCP/IP is .........bits long.

A. 32

B. 48

C. 16

D. 64


19) When the IP layer of a receiving host receives a datagram, .....

A. delivery is complete

B. a transport layer protocol takes over

C. a header is added

D. a session layer protocol takes over


20) TCP/IP is a .......... hierarchical protocol suite developed before the OSI model.

A. seven-layer

B. five-layer

C. six-layer

D. four-layer

Answers:

1) A. stream-oriented
2) A. Physical layer
3) B. segment
4) C. network layer
5) B. reliable
6) A. Internet Protocol(IP)
7) B. two
8) C. Europeans Registry for Internet Numbers(ERIN)
9) A. user datagrams
10) C. Class C
11) B. 8
12) A. ICMP
13) A. first
14) C. Address Resolution Protocol(ARP)
15) C. transport
16) B. UDP
17) A. Process-to-process communication
18) C. 16
19) B. a transport layer protocol takes over
20) B. five-layer

Related Posts:

• Solved MCQ of Computer networking set-1

• MCQ of Computer Networking with answer set-2

• Solved MCQ of Computer networking set-3

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

• Solved MCQ on Routing algorithm in computer networks set-2

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

• 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

Objective Questions on Routing protocol in computer networks set-3

1) The principle of ...........states that the routing table is stored from the longest mask to the shortest mask.

A. first mask matching

B. shortest mask matching

C. longest mask matching

D. very shortest mask matching

2) ............ are two popular examples of distance vector routing protocols.

A. OSPF and RIP

B. RIP and BGP

C. BGP and OSPF

D. BGP and SPF

3) ...... deals with the issues of creating and maintaining routing tables.

A. Forwarding

B. Routing

C. Directing

D. None directing

4) During an adverse condition, the length of time for every device in the network to produce an accurate routing table is called the ..........

A. accurate time

B. integrated time

C. convergence time

D. average time

5) A ......... routing table contains information entered manually.

A. static

B. dynamic

C. hierarchical

D. non static

6) Which of the following is/are the uses of static routing methods.

A. To manually define a default route.

B. To provide more secure network environment.

C. To provide more efficient resource utilization.

D. All of the above

7) A .......... routing table is updated periodically using one of the dynamic routing protocols.

A. static

B. dynamic

C. hierarchical

D. non static

8) Which of the following is not the category of dynamic routing algorithm.

A. Distance vector protocols

B. Link state protocols

C. Hybrid protocols

D. Automatic state protocols

9) In ......... forwarding, the full IP address of a destination is given in the routing table.

A. next-hop

B. network-specific

C. host-specific

D. default

10) To build the routing table, ........... algorithms allow routers to automatically discover and maintain awareness or the paths through the network.

A. Static routing

B. Dynamic routing

C. Hybrid routing

D. Automatic routing

11) In .......... forwarding, the mask and destination addresses are both 0.0.0.0 in the routing table.

A. next-hop

B. network-specific

C. host-specific

D. default

12) To build the routing table, ........... method use preprogrammed definitions representing paths through the network.

A. Static routing

B. Dynamic routing

C. Hybrid routing

D. Automatic routing

13) In .......... forwarding, the destination addresses is a network address in the routing table.

A. next-hop

B. network-specific

C. host-specific

D. default

14) ......... allow routers to exchange information within an AS.

A. Interior Gateway Protocol(IGP)

B. Exterior Gateway Protocol(EGP)

C. Border Gateway Protocol(BGP)

D. Static Gateway Protocol(SGP)

15) In .......... forwarding, the routing table holds the address of just the next hop instead of complete route information.

A. next-hop

B. network-specific

C. host-specific

D. default

16) Which of the following is an example of Exterior Gateway Protocol.

A. Open Short Path First(OSPF)

B. Border Gateway Protocol(BGP)

C. Routing Information Protocol(RIP)

D. All of the above

17) A one-to-all communication between one source and all hosts on a network is classified as a .........

A. unicast

B. multicast

C. broadcast

D. point to point

18) ........ allow the exchange of summary information between autonomous systems.

A. Interior Gateway Protocol(IGP)

B. Exterior Gateway Protocol(EGP)

C. Border Gateway Protocol(BGP)

D. Dynamic Gateway Protocol(DGP)

19) A robust routing protocol provides the ability to ......... build and manage the information in the IP routing table.

A. dynamically

B. statically

C. hierarchically

D. All of the above

20) State True of False for definition of an autonomous system(AS).

i) An AS is defined as a physical portion of a larger IP network.

ii) An AS is normally comprised of an internetwork within an organization.

A. i-True, ii-True

B. i-True, ii-False

C. i-False, ii-True

D. i-False, ii-False

   

Answers:

1) C. longest mask matching

2) B. RIP and BGP

3) B. Routing

4) C. convergence time

5) A. static

6) D. All of the above

7) B. dynamic

8) D. Automatic state protocols

9) C. host-specific

10) B. Dynamic routing

11) D. default

12) A. Static routing

13) B. network-specific

14) A. Interior Gateway Protocol(IGP)

15) A. next-hop

16) B. Border Gateway Protocol(BGP)

17) C. broadcast

18) B. Exterior Gateway Protocol(EGP)

19) A. dynamically

20) C. i-False, ii-True

Related Posts:

• Solved MCQ of Computer networking set-1

• MCQ of Computer Networking with answer set-2

• Solved MCQ of Computer networking set-3

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

• Solved MCQ on Routing algorithm in computer networks set-2

• 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 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