A graph G is said to be n-colourable, if it has n different colours in such a way that two adjacent nodes have different colors. The chromatic number of graph G is the minimum number n needed for n-colouring of the graph G. So, the chromatic number of C15, K15 and K15, 3 are respectively
In TCP,a unique sequence number is assigned to each
-
Solution
In TCP sequence number is assigned to each packet which is message
A subnet has been assigned a subnet mask of 255.255.255.192. What is the maximum number of hosts that can belong to this subnet ………..?
-
Solution
The subnet mask is of class E, which can take value upto 255.255.255.255
So number of host that belong to this subnet
= 254 – 192 = 62.
A sender is employing public key cryptography to send a secret message to a receiver.Which one of the following statements is TRUE?
-
Solution
If sender is employing public key cryptography to send a secret message to receiver the sender encrypts using receiver’s public key.
Which level of locking provides the highest degree of concurrency in a relational database?
-
Solution
Highest degree of concurrency is related database provided at the ROW level locking.
What is the hit ratio of cache,……… if a system performs memory access at 35 ns with the cache and 200 ns without it? Assume that the average access time of memory is 45ns………..
-
Solution
A certain population of ALOHA user manage 60 requests/s.If the channel load is 3. Find the slot time in ms…….
-
Solution
Given Number of requests = 60 /s, Channel load = 3
To find Slot time
Let x bean integer which can take a value of 0 or 1. The statement:if (x = = 0) x = 1; else x = 0; is equivalent to which one of the following?
-
Solution
Given Pseduo code is
if (x = 0)
x = 1
else
x = 0
If x is zero than set x = 1 else set x which is same as x = 1 –x.
Hence the correct answer is (b).
Which one of the following is NOT shared by the threads of the same process?
-
Solution
A thread sometime called light weight process (LWP) is the public unit of CPU utilization,and consist of Program counter register set and stack space. It shares with peer threads its code section, data section and operating system.Hence the answer is (a).
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?
-
Solution
In the Worst case X could be last or second last Node, In that case full traversal of the list is required. Therefore Deleting the tail element from the linkes then the worst cose time complexity is O(n).