1402016 Related Question Answers

76. Let P be a singly linked list. Let Q be the pointer to an intermediate node X in the list. What is the worst case time complexity of the best known algorithm to delete the node X from the list?





77. A problem in NP is NP complete if





78. The maximum number of edges in an acyclic undirected graph with n vertices is:





79. In a binary tree, the number of internal nodes of degree 1 is 5 and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tree is :





80. Which of the following sequences of array elements forms a heap?





81. The binary relation r = {(1, 1), (2, 1), (2, 2), (2, 3), (2, 4), (3, 1), (3, 2), (3, 3), (3, 4)} on the set A = {1, 2, 3, 4,} is :





82. In a room containing 28 people .there are 18 people who speak English, 15 people who speak Hindi and 22 people who speak Kannada, 9 persons speak both English and Hindi, 11 persons speak both Hindi and Kannada where as 13 persons speak both Kannada and English. How many people speak all the three languages?





83. Which one of the following regular expressions is NOT equivalent to the regular expression ((ab) + c)?





84. Which of the following statements is TRUE about the regular expression 010?





85. Let L be a context free language and M a regular language. Then the language LnM is :





86. Consider a fully associative cache with 8 cache blocks (numbered 0-7) and the following sequence of memory block requests : 4, 3, 25, 8, 19, 6, 25, 8, 16, 35, 45, 22, 8, 3, 16, 25, 7 if LRU replacement policy is used ,which cache block will have memory block 7?





87. Two shared resources R1 and R2 are used by processes P1 and P2. Each process has a certain priority for accessing each resource. Let Tij denote the priority of Pi for accessing Rj. A process Pi can snatch a resource Rk from process Pj if Tik is greater than Tjk. Given the following:IT11 > T21IIT13 > T22IIIT11 < T21IVT12Which of the following conditions ensures that P1 and P2 can never deadlock?





88. Dijkstra’s banking algorithm in an OS, solves the problem of:





89. In real-time OS, which of the following is the most suitable scheduling scheme?





90. A linker:





91. A firewall:





92. A sender is employing public key cryptography to send a secret message to a receiver. Which one of the following statements is TRUE?





93. A host is connected to a departmpnt network which is part of a university network. The university network in turn, is part of the Internet. The largest network in which the Ethernet address of the host is unique is:





94. In a TCP/IP protocol suite, which one of the following is NOT part of the IP header?





95. Count to infinity is a problem associated with:





96. Which of the follwing statements is TRUE about CSMA/CD?





97. HELO and PORT, respectively are commands from the protocols :





98. A firewall is to be configured to allow hosts in a private network to freely open TCP connections and send packets on open connections. However, it will only allow external hosts to send packets on existing open TCP connections or connections that are being opened (by internal hosts) but not allow them to open TCP connections to hosts in the private network. To achieve this the minimum capability of the firewall should be that of:





99. In TCP, a unique sequence number is assigned to each :





100. What is XML?





Terms And Service:We do not guarantee the accuracy of available data ..We Provide Information On Public Data.. Please consult an expert before using this data for commercial or personal use
DMCA.com Protection Status Powered By:Omega Web Solutions
© 2002-2017 Omega Education PVT LTD...Privacy | Terms And Conditions