+1 and +2 Computer Science

Previous Question paper answered , and Questions from Textbook

+1 and +2 Computer Application

Previous Question paper answered , and Questions from Textbook

Diploma in Computer Application (DCA)

Previous Question paper answered , and Questions from Textbook.

Master of Computer Applications (MCA)

Previous Question paper answered , and Questions from Textbook

True IQ Computer Online Academy

Contact : +91 9036433020 , mail2trueiq@gmail.com

Pageviews

Tuesday 23 November 2021

UGC (computer application) net based questions from computer networks

                                       

                                               UGC net solved questions

                                                   Computer networks


1. The number of bits that can be transmitted over a network in a certain period of time 

   ans. Bandwidth

2. A network topology that combines features of linear bus and star topology

Ans. Tree

3.  The local area network technology used in ethernet

   Ans. CSMA/CD

4. A point to point link that supports data flowing in only one direction at a time

 Ans. Half duplex link

5. A networking device used to connect similar type of LANs

 Ans. bridge

6. Binary search algorithm employs the strategy of

  Ans. Divide and conquer technique

7. The worst case time complexity of merge sort algorithm for input size n.

   Ans. theeta(nlogn)

8. Time complexity of Prim's minimum spanning tree algorithm is

   Ans. theeta(nlogn)

9. Hidden terminals in a wireless network may cause 

 Ans. Collisions

10. DHCP stands for

  Ans. Dynamic Host Configuration Protocol

11. In a BST the traversal type which would print the values in the nodes in sorted order is

    Ans. Inorder

12. Which among the following searching technique takes O(1) time to locate  a data

    Ans. Hashing

13. Given a linked list with n elements. Then the time taken to insert an elementafter an element pointed to by some pointer is

  Ans. O(1)

14. Which one is used to connect two systems, specifically if the system use different protocols

   Ans. Gateways

15.  Which one of the following TCP/IP protocol is used for transferring email messages from one machine to another

  a)RPC b)FTP c)SMTP d)RTP

  Ans. SMTP

16. The device that is used to forward data packets from one network to another is called a -------------

     Ans. Switch

17. In order to sort a list L consisting of a sorted list followed by a few random elements, which one of the following sorting methods would be suitable?

     Ans. Insertion sort

18. Merging 4 sorted files containing 50,10,25 and 15 records respectively takes ------------- time.

   Ans. O(100)

19. Using bubble sort the no. of interchanges required to sort 5,1,6,2 and 4 in ascending order is 

    Ans. 5

20. The maximum length (in bytes) of an IP packet.

    Ans. 65535

21. Which among the following is not an HTTP request

  Ans. RELEASE

22. An RPC uses ------- to execute a routine on a remote system

   Ans. UDP

23. IPV6 uses ----- bit addresses.

   Ans. 128

24. Which of the following protocols is used to share the same IP address among different computers(as long as they are not simultaneously active

 Ans. DHCP

25. The port number used by SMTP

   Ans. 25

26. Which is not a comparison based sort?

     Ans. Radix sort

27. which of the following is the fastest sorting method?

     Ans. Heap sort

28. Which of the following is not an e-mail protocol?

      Ans. SNMP

29. Which of the following is not  valid IPv4 addresses 

     a) 192.10.14.3 b)201.172.275.33 c)65.90.11.00 d)193.20.250.10

    Ans. b

30. Address resource records are associated with

     Ans. DNS server

31. The sorting method which is used for external sort is

    Ans. Merge sort

32. The complexity of merge sort algorithm

    Ans. O(nlogn)

33. Worst case efficiency of binary search is

    Ans. log n

34. The time taken by NP-class sorting algorithm is

       Ans. O(n)

35. What is the type of algorithm used in solving the 8 Queens problem

      Ans. Backtracking

36. Prims algorithm is based on ------------- method

      Ans. Greedy method

37. How many nodes are there in a full state space tree with n=6

     Ans.  63

38. Graph coloring is which type of algorithm design strategy

  Ans. Backtracking

39. Recursive algorithm are based on

   Ans. Divide and conquer approach

40. The asymptotic notation for defining the average time complexity

   Ans. Equivalence

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

  Ans. UDP

42. Full binary tree with n leaves contain 

    Ans. 2n-1 nodes

43. Which device translates between data formats

    Ans. Gateways

44. The IP address 127.0.0.1 is names as

    Ans. Loop back address

45. Error correction in the data link layer is achieved by

    Ans. Hamming codes

46. File transfer protocol that uses UDP is

    Ans. TFTP

47. The complexity of linear search algorithm of an array of n elements

     Ans. O(n)

48. What is the worst case complexity of quick sort?

     Ans. O(n^2)

49. How many distinct binary trees are possible with n nodes?

      Ans. 2^n-n

50. Average case complexity of quick sort algorithm?

     Ans. O(n logn)

51. A binary tree with 20 nodes can have ---------- null branches

  Ans. 21

52. A common property of the selection sort and quick sort algorithm is

   Ans. An in place sorting method

53. Which algorithm has running time O(n^2) in the worst case but O(n log n)on average

     Ans. Quick sort

54. Minimum cost of spanning tree algorithm uses a technique of

   Ans. Greedy method

55. A binary tree with 8 nodes produced 1,2,3,4,5,6,7,8 as in the order reverse. What is the root node of the tree

   Ans. Can not determined

 56. Which among the devices interconnects networks and operate at the application layer

   Ans. Gateway

57. Port no assigned to FTP protocol is

   Ans. 21

58. Protocol of Wireless LAN

    Ans.  802.11

59. There is a diskless workstation on a TCP/IP LAN. Which will be the first protocol it will use?

   Ans. RARP

60. The protocol used in TCP/IP for dynamic address assignment is

    Ans. DHCP

61. Flow control in TCP/IP is handled using

   Ans. Checksum

62. The IP address of a node on a LAN based on TCP/IP is 191.168.10.1.Into which class does this address belong?

  Ans. Class B

63. The default payload among the following that is used for translating from physical address to Internet address

Ans. RARP

64. Which property among the ones given below is not possessed by the HTTP protocol?

   Ans. Non-cached

65. The protocol used in TCP/IP for dynamic address assignment is

  Ans. DHCP

66. The depth of a complete  binary tree with n nodes is

   Ans. log(n+1)-1

67. Packets of the same session may be routed through different paths in

   Ans. UDP but not TCP

68. The standards for packet switched communication

     Ans. CCIT X.25 and X.21

69. A standard Rs-232C signal is

   Ans. RTS,DSR,CTS

70. Which port is used by a TELNET communication session

    Ans. 23

71. -----------networking device is an example of network layer device(layer-3)

   Ans. Router

72. -------------application allows a user to access and change remote files without actual file transfer

   Ans. TELNET

73. Honeypot is 

   Ans. Intrusion detection technology

74. A sniffer is 

   Ans. A computer that configured to capture all traffic on a network

75. GPRS is

Ans. General packet radio service

76. --------------is the jacket  used in UTP cables.

  Ans. RJ 45

77. Packet f the same session may be routed through different paths in 

Ans. TCP and UDP

78. The address resolution protocol(ARP) is used for

   Ans. Finding the MAC address that corresponds to an IP address

79. The maximum Window size for data transmission used selective reject protocol with n-bit frame sequence is

 Ans. 2^n-1

80. An organisation has a class B network and wishes to form subnets for 64 departments. The subnet mask would be

   Ans. 255.255.64.0