Description : Which of the following routing algorithms can be used for network layer design? a. shortest path algorithm b. distance vector routing c. link state routing d. all of the mentioned
Last Answer : d. all of the mentioned
Description : A station in a network forwards incoming packets byplacing them on its shortest output queue. Whatrouting algorithm is being used? A. hot potatorouting B. flooding C. static routing D. delta routing E. None of the above
Last Answer : hot potatorouting
Description : Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk ... arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.
Last Answer : (B) The number of requests for disk service are not influenced by file allocation method.
Description : Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current ... ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm
Last Answer : (C) Greedy best first search algorithm
Description : Which of the following is not a congestion policy at network layer? (A) Flow Control Policy (B) Packet Discard Policy (C) Packet Lifetime Management Policy (D) Routing Algorithm
Last Answer : (A) Flow Control Policy
Description : In link state routing algorithm after construction of link state packets, new routes are computed using: (1) DES algorithm (2) Dijkstra's algorithm (3) RSA algorithm (4) Packets
Last Answer : Answer: 2
Description : Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ........... (1) automatically (2) by server (3) by exchanging information with neighbour nodes. (4) with back up database
Last Answer : Answer: 3
Description : Open Short Path First (OSPF) ii) Routing Information Protocol (RIP) iii) Border Gateway Protocol (BGP) A) i only B) i, and ii only C) i and iii only D) All i, ii and iii
Last Answer : B) i, and ii only
Description : The _________ routing uses the Dijkstra algorithm to build aroutingtable. A) distancevector B) link state C) path vector D) none of the above
Last Answer : link state
Description : Which algorithm is used to decide the path to transfer the packets from source to destination? (1) Routing (2) Pathing (3) Selecting (4) Directing
Last Answer : Routing
Description : RPF eliminates the ________ in theflooding process. A) forwarding B) backwarding C) flooding D) none of the above
Last Answer : none of the above
Description : ICMP is primarily used for __________ a. error and diagnostic functions b. addressing c. forwarding d. routing
Last Answer : a. error and diagnostic functions
Description : The methods or algorithms which are used to increase the performance of disk storage sub-system is called ............. A) Disk performing B) Disk scheduling C) Disk storing D) Disk extending
Last Answer : B) Disk scheduling
Description : ………… is not the component of data structure. A) Operations B) Storage Structures C) Algorithms D) None of above
Last Answer : D) None of above
Description : Which of the following algorithms has lowest worst case time complexity? a) Insertion sort b) Selection sort c) Quick sort d) Heap sort
Last Answer : d) Heap sort
Description : A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order: ABACABDBACD Assuming that a page interrupt occurs when a new page is brought in the main ... replacement algorithms are (A) 9 and 7 (B) 7 and 6 (C) 9 and 8 (D) 8 and 6
Last Answer : (C) 9 and 8
Description : Find the false statement: (A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption. (B) The Symmetric cipher DES (Data Encryption Standard) was widely used ... and 124 bits. (D) Public key algorithms use two different keys for Encryption and Decryption.
Last Answer : (C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits.
Description : Consider a disk queue with request for input/output to block on cylinders 98, 183, 37, 122, 14, 124, 65, 67 in that order. Assume that disk head is initially positioned at cylinder 53 and moving ... and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders
Last Answer : Answer: 236 and 208 cylinders Explanation: SSTF Initial head position =53 The closest queue to initial head position=65 head moves from 53 to 65=12 head moves from 65 to 67=2 head moves from 67 ... 122=24 head moves from 122 to 124=2 head moves from 124 to 183=59 Total head movement=208
Description : Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is : 1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 ... to fill available page frames with pages): (A) 9 and 6 (B) 10 and 7 (C) 9 and 7 (D) 10 and 6
Last Answer : (B) 10 and 7
Description : Code blocks allow many algorithms to be implemented with the following parameters : (A) clarity, elegance, performance (B) clarity, elegance, efficiency (C) elegance, performance, execution (D) execution, clarity, performance
Last Answer : (B) clarity, elegance, efficiency
Description : Which of the following algorithms sort n integers, having the range 0 to (n2 -1), in ascending order in O(n) time ? (A) Selection sort (B) Bubble sort (C) Radix sort (D) Insertion sort
Last Answer : (C) Radix sort
Description : Which of the following scheduling algorithms may cause starvation? a. First-come-first-served b. Round Robin c. Priority d. Shortest process next e. Shortest remaining time first (1) a, c and e (2) c, d and e (3) b, d and e (4) b, c and d
Description : General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms
Last Answer : d) MIN/MAX Algorithms
Description : List any two line drawing algorithms. Also, list two merits of any line drawing algorithm.
Last Answer : Line drawing algorithms: Digital Differential Analyzer (DDA) algorithm Bresenham's algorithm Merits of DDA algorithms: It is the simplest algorithm and it does not require special skills ... , and multiplication by 2, which can be accomplished by a simple arithmetic shift operation.
Description : Which of the following is not correct in relation to multi-destination routing? a. is same as broadcast routing b. contains the list of all destinations c. data is not sent by packets d. there are multiple receivers
Last Answer : c. data is not sent by packets
Description : Which of the following is/are the principle components of a memorytube display ? (a) Flooding gun (b) Collector (c) Phosphorus grains (d) Ground Codes : (A) (a) and (b) (B) (c) only (C) (d) only (D) All the above
Last Answer : (D) All the above
Description : Flooding is also a……... algorithm, usually generates ………... of duplicate packets. A. Static, vast number B. dynamic , vast number C. Static, less number D. dynamic , less number
Last Answer : A. Static, vast number
Description : ______ is a static algorithm in which every incoming packet is sent out on every outgoing line except the one it arrives on. This method usually generates vast number of duplicate packets.. A. Flooding B. Wait and watch C. congestion D. both a and c
Last Answer : A. Flooding
Description : Which is the main function of transport layer? A) Node to node delivery B) End to end delivery C) Synchronization d) Updating and maintaining routing tables
Last Answer : B) End to end delivery
Description : When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known as................. (A) handoff (B) mobile switching (C) mobile routing (D) cell switching
Last Answer : (A) handoff
Description : In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a three layer hierarchy? (A) 10 clusters, 24 regions and 20 routers (B ... (C) 16 clusters, 12 regions and 25 routers (D) 15 clusters, 16 regions and 20 routers
Last Answer : (D) 15 clusters, 16 regions and 20 routers Rooters minimum, then regions minimum, then clusters minimum.
Description : Which of the following is used in the options field of IPv4 ? (A) Strict source routing (B) Loose source routing (C) time stamp (D) All of the above
Last Answer : (D) All of the above
Description : Consider a subnet with 720 routers. If a three-level hierarchy is choosen with eight clusters, each containing 9 regions of 10 routers, then total number of entries in the routing table is ................... (A) 25 (B) 27 (C) 53 (D) 72
Last Answer : Answer: A Explanation: Each router needs 10 entries for local routers, 8 entries for routing to other regions within its own cluster, and 7 entries for distant clusters, for a total of 25 entries.
Description : Which of the following is not a congestion policy at network layer? a. Flow Control Policy b. Packet Discard Policy c. Packet Lifetime Management Policy d. Routing Algorithm
Last Answer : a. Flow Control Policy
Description : Which one of the following algorithm is not used for congestion control? a. traffic aware routing b. admission control c. load shedding d. routing information protocol
Last Answer : d. routing information protocol
Description : Distance Vector Routing is a……... routing algorithm, it consists of a data structure called a ……… A. Static , routing table B. Dynamic, look-up table C. Dynamic, routing table D. Static, look-up table
Last Answer : C. Dynamic, routing table
Description : The layer one of the OSI model is A) Physical layer B) Link layer C) Router layer D) Broadcast layer
Last Answer : A) Physical layer
Description : In a classful addressing, the IP addresses with 0 (zero) as network number: (A) refers to the current network (B) refers to broadcast on the local network (C) refers to broadcast on a distant network (D) refers to loopback testing
Last Answer : (A) refers to the current network
Description : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method
Last Answer : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method
Description : Which of the following sorting algorithm has the running time that is least dependant on the initial ordering of the input? a) Insertion sort b) Quick sort c) Merge sort d) Selection sort
Last Answer : d) Selection sort
Description : Which of the following sorting algorithm is in-place a) Counting sort b) Radix sort c) Bucket sort d) None
Last Answer : b) Radix sort
Description : Consider the situation in which assignment operation is very costly. Which of the following sorting algorithm should be performed so that the number of assignment operations is minimized in general? a) Insertion sort b) Selection sort c) Heap sort d) None
Last Answer : b) Selection sort
Description : Which of the following algorithm pays the least attention to the ordering of the elements in the input list? a) Insertion sort b) Selection sort c) Quick sort d) None
Description : If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance? a) Insertion sort b) Selection sort c) Quick sort d) Merge sort
Last Answer : a) Insertion sort
Description : Which of the following is not an in-place sorting algorithm? a) Selection sort b) Heap sort c) Quick sort d) Merge sort
Last Answer : merge sort
Description : Which of the following is a stable sorting algorithm? a) Merge sort b) Typical in-place quick sort c) Heap sort d) Selection sort
Last Answer : a) Merge sort
Description : Which of the following is not a stable sorting algorithm? a) Insertion sort b) Selection sort c) Bubble sort d) Merge sort
Description : In RSA algorithm,if p=5,q=7,e=7and message=3. What will be the value of ciphertext ?
Last Answer : 17
Description : For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to (A) ln|w| (B) |w| (C) |w|2 (D) |w|3
Last Answer : (D) |w|3
Description : Bresenham line drawing algorithm is attractive because it uses (A) Real arithmetic only (B) Integer arithmetic only (C) Floating point arithmetic (D) Real and integer arithmetic
Last Answer : (B) Integer arithmetic only