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

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 
by

1 Answer

Answer :

Answer: 2
by

Related questions

Dijkstra’s algorithm is based on (1) Divide and conquer paradigm (2) Dynamic Programming (3) Greedy Approach (4) Backtracking paradigm

Description : Dijkstra’s algorithm is based on (1) Divide and conquer paradigm (2) Dynamic Programming (3) Greedy Approach (4) Backtracking paradigm

Last Answer : 3

Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE (A) BUTAEEZ (B) SUZANNE (C) XYZABCD (D) ABCDXYZ

Description : Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE (A) BUTAEEZ (B) SUZANNE (C) XYZABCD (D) ABCDXYZ

Last Answer : (A) BUTAEEZ

Using p=3, q=13, d=7 and e=3 in the RSA algorithm, what is the value of ciphertext for a plain text 5? (A) 13 (B) 21 (C) 26 (D) 33

Description : Using p=3, q=13, d=7 and e=3 in the RSA algorithm, what is the value of ciphertext for a plain text 5? (A) 13 (B) 21 (C) 26 (D) 33

Last Answer : Answer: Marks to all Explanation: p=3, q=13, d=7, e=3, M=5, C=? C = Me mod n n = p*q  = 3*13 = 39 C = 53 mod 39 = 8 Answer is 8.

Which of the following assertions is FALSE about the Internet Protocol (IP)? a. It is possible for a computer to have multiple IP addresses b. IP packets from the same source to the same destination can take different routes in the network c. IP ensures that a packet is discarded if it is unable to reach its destination within a given number of hops d. The packet source cannot set the route of an outgoing packets; the route is determined only by the routing tables in the routers on the way

Description : Which of the following assertions is FALSE about the Internet Protocol (IP)? a. It is possible for a computer to have multiple IP addresses b. IP packets from the same source to the same ... outgoing packets; the route is determined only by the routing tables in the routers on the way

Last Answer : d. The packet source cannot set the route of an outgoing packets; the route is determined only by the routing tables in the routers on the way

In RSA algorithm,if p=5,q=7,e=7and message=3. What will be the value of ciphertext ?

Description : In RSA algorithm,if p=5,q=7,e=7and message=3. What will be the value of ciphertext ?

Last Answer : 17

How many distinct stages are there in DES algorithm, which is parameterized by a 56-bit key ? (A) 16 (B) 17 (C) 18 (D) 19

Description : How many distinct stages are there in DES algorithm, which is parameterized by a 56-bit key ? (A) 16 (B) 17 (C) 18 (D) 19

Last Answer : (D) 19

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

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

Which algorithm is used to decide the path to transfer the packets from source to destination? (1) Routing (2) Pathing (3) Selecting (4) Directing

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

Which of the following algorithms is not a broadcast routing algorithm ? (A) Flooding (B) Multidestination routing (C) Reverse path forwarding (D) All of the above

Description : Which of the following algorithms is not a broadcast routing algorithm ? (A) Flooding (B) Multidestination routing (C) Reverse path forwarding (D) All of the above

Last Answer : (D) All of the above

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

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

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

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

How do you implement Dijkstra's algorithm in c language?

Description : How do you implement Dijkstra's algorithm in c language?

Last Answer : /* Dijkstra's Algorithm in C *//* Source: w w w . c o d e w i t h c . c o m / d i j k s t r a s- a l g o r i t h m - i n - c#include#include#include#include#include#define IN 99#define N 6int ... [j++] = start+65;start = prev[start];}path[j]='\0';strrev(path);printf("%s", path);return dist[target];}

Algorihtm used for path planning is A : Dijkstra's Algorithm B : DFS Algorithm C : BFS Algorithm D : Searching Algorithm

Description : Algorihtm used for path planning is A : Dijkstra's Algorithm B : DFS Algorithm C : BFS Algorithm D : Searching Algorithm

Last Answer : A : Dijkstra's Algorithm

Which one is an encryption technique? a. RSA b. DES c. AES d. All of the above

Description : Which one is an encryption technique? a. RSA b. DES c. AES d. All of the above

Last Answer : d. All of the above

Which one is not an encryption technique? a. RSA b. DES c. AES d. FTP

Description : Which one is not an encryption technique? a. RSA b. DES c. AES d. FTP

Last Answer : d. FTP

Which one is not a encryption technique a. RSA b. DES c. AES d. NONE OF THE ABOVE

Description : Which one is not a encryption technique a. RSA b. DES c. AES d. NONE OF THE ABOVE

Last Answer : d. NONE OF THE ABOVE

The _________ routing uses the Dijkstra algorithm to build aroutingtable. A) distancevector B) link state C) path vector D) none of the above

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

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

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

Using the RSA public key crypto system, if p=13, q=31 and d=7, then the value of e is (A) 101 (B) 105 (C) 103 (D) 107

Description : Using the RSA public key crypto system, if p=13, q=31 and d=7, then the value of e is (A) 101 (B) 105 (C) 103 (D) 107

Last Answer : (C) 103 Explanation: Basic RSA Algorithm: 1. Choose two primes, p & q. 2. Compute n=p*q and z=(p-1)*(q-1). 3. Choose a number relatively prime to z and call it d. 4. Find e such that e*d= ... each of these in turn by 7 to see which is divisible by 7, we find that 721/7 = 103, hence e = 103. 

DES and public key algorithm are combined (i) to speed up encrypted message transmission (ii)to ensure higher security by using different key for each transmission (iii) as a combination is always better than individual system (iv) as it is required in e-Commerce a. i and ii b. ii and iii c. iii and iv d. i and iv

Description : DES and public key algorithm are combined (i) to speed up encrypted message transmission (ii)to ensure higher security by using different key for each transmission (iii) as a combination is always better than individual system (iv ... e-Commerce a. i and ii b. ii and iii c. iii and iv d. i and iv  

Last Answer : a. i and ii

Message can be sent more securely using DES by a. encrypting plain text by a different randomly selected key for each transmission b. encrypting plain text by a different random key for each message transmission and sending the key to the receiver using a public key system c. using an algorithm to implement DES instead of using hardware d. designing DES with high security and not publicizing algorithm used by it

Description : Message can be sent more securely using DES by a. encrypting plain text by a different randomly selected key for each transmission b. encrypting plain text by a different random key for each ... instead of using hardware d. designing DES with high security and not publicizing algorithm used by it  

Last Answer : b. encrypting plain text by a different random key for each message transmission and sending the key to the receiver using a public key system

ripple DES a. Cannot be broken in reasonable time using presently available computers. b. Can be broken only if the algorithm is known using even slow computer. c. Can be broken with presently available high performance computers. d. It is impossible to break ever.

Description : ripple DES a. Cannot be broken in reasonable time using presently available computers. b. Can be broken only if the algorithm is known using even slow computer. c. Can be broken with presently available high performance computers. d. It is impossible to break ever. 

Last Answer : a. Cannot be broken in reasonable time using presently available computers.  

DES using 56 bit keys a. Cannot be broken in reasonable time using presently available computers b. Can be broken only if the algorithm is known using even slow computers. c. Can be broken with presently available high performance computers. d. It is impossible to break ever.

Description : DES using 56 bit keys a. Cannot be broken in reasonable time using presently available computers b. Can be broken only if the algorithm is known using even slow computers. c. Can be broken with presently available high performance computers. d. It is impossible to break ever.

Last Answer : c. Can be broken with presently available high performance computers. 

State weather the following statement is true or false for IPV6 Addressing 1). IPV6 is a routable protocol that addresses, routes, fragments, and reassembles packets 2).IPV6 is a connectionless, unreliable datagram protocol. 3). An IPV6 packet consists of an IPV6 header and an IPV6 payload. A. 1. True, 2. true, 3. true B. 1. true, 2. false, 3. false C. 1. false, 2. false, 3. false D. 1.false, 2. true, 3. true

Description : State weather the following statement is true or false for IPV6 Addressing 1). IPV6 is a routable protocol that addresses, routes, fragments, and reassembles packets 2).IPV6 is a connectionless, unreliable datagram protocol. 3). ... C. 1. false, 2. false, 3. false D. 1.false, 2. true, 3. true

Last Answer : A. 1. True, 2. true, 3. true

Explain about RSA algorithm.

Description : Explain about RSA algorithm.

Last Answer : ∙ Public key Encryption technique. ∙ Encryption algorithm ∙ Decryption algorithm ∙ Security in RSA

Dynamic routing protocol enable routers to a. Dynamically discover and maintain routes b. Distribute routing updates to other routers c. Reach agreement with other routers about the network topology d. All of the above

Description : Dynamic routing protocol enable routers to a. Dynamically discover and maintain routes b. Distribute routing updates to other routers c. Reach agreement with other routers about the network topology d. All of the above

Last Answer : d. All of the above

Routes are built automatically by………………….., manually by the system administrator, or dynamically by routing protocols. A. route B. traceroute C. ifconfig D. netstat

Description : Routes are built automatically by………………….., manually by the system administrator, or dynamically by routing protocols. A. route B. traceroute C. ifconfig D. netstat

Last Answer : C. ifconfig

Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay between A and B is 40 milli seconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal window size of A is (1) 20 (2) 10 (3) 30 (4) 40

Description : Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay between A and B is 40 milli seconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal window size of A is (1) 20 (2) 10 (3) 30 (4) 40

Last Answer : (2) 10

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 in the industry for security product. (C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits. (D) Public key algorithms use two different keys for Encryption and Decryption.

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.

An artificial neurons receives n inputs x1, x2,...,xn with weights w1,w2,...,wn attached to the input links. The weighted sum ............... is computed to be passed on to a non-linear filter ϕ called activation function to release the output. (A) Σ wi (B) Σ xi (C) Σ wi + Σ xi (D) Σ wi . Σ xi

Description : An artificial neurons receives n inputs x1, x2,...,xn with weights w1,w2,...,wn attached to the input links. The weighted sum ............... is computed to be passed on to a non-linear filter ϕ called activation function to release the output. (A) Σ wi (B) Σ xi (C) Σ wi + Σ xi (D) Σ wi . Σ xi

Last Answer : (D) Σ wi . Σ xi

Which one of the following is not a definition of error ? (A) It refers to the discrepancy between a computed, observed or measured value and the true, specified or theoretically correct value. (B) It refers to the actual output of a software and the correct output. (C) It refers to a condition that causes a system to fail. (D) It refers to human action that results in software containing a defect or fault.

Description : Which one of the following is not a definition of error ? (A) It refers to the discrepancy between a computed, observed or measured value and the true, specified or theoretically correct value. (B) It ... to fail. (D) It refers to human action that results in software containing a defect or fault. 

Last Answer : The input, or clock pulse.

A three dimensional array in ‘C’ is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer): (A) &A[0][0][0]+w(y*z*q+z*p+r) (B) &A[0][0][0]+w(y*z*p+z*q+r) (C) &A[0][0][0]+w(x*y*p+z*q+r) (D) &A[0][0][0]+w(x*y*q+z*p+r)

Description : A three dimensional array in C' is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer): (A) &A[0][0][0]+w(y*z*q+z*p+r) (B) &A ... *q+r) (C) &A[0][0][0]+w(x*y*p+z*q+r) (D) &A[0][0][0]+w(x*y*q+z*p+r)

Last Answer : Answer: B

Triple DES uses a. 168 bit keys on 64-bit blocks of plain text b. Working on 64-bit blocks of plain text and 56 bit keys by applying DES algorithm for three rounds. c. Works with 144 bit blocks of plain text and applies DES algorithm once. d. Uses 128 bit blocks of plain text and 112 bit keys and apply DES algorithm thrice.

Description : Triple DES uses a. 168 bit keys on 64-bit blocks of plain text b. Working on 64-bit blocks of plain text and 56 bit keys by applying DES algorithm for three rounds. c. Works with 144 bit ... algorithm once. d. Uses 128 bit blocks of plain text and 112 bit keys and apply DES algorithm thrice. 

Last Answer : b. Working on 64-bit blocks of plain text and 56 bit keys by applying DES algorithm for three rounds. 

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

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

A __________ is a device that forwards packets between networks by processing the routing information included in the packet.a) bridge b) firewall c) router d) hub

Description : A __________ is a device that forwards packets between networks by processing the routing information included in the packet. a) bridge b) firewall c) router d) hub

Last Answer : c) router

The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Description : The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Last Answer : (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm.

An all-pairs shortest-paths problem is efficiently solved using: (A) Dijkstra' algorithm (B) Bellman-Ford algorithm (C) Kruskal Algorithm (D) Floyd-Warshall algorithm

Description : An all-pairs shortest-paths problem is efficiently solved using: (A) Dijkstra' algorithm (B) Bellman-Ford algorithm (C) Kruskal Algorithm (D) Floyd-Warshall algorithm

Last Answer : (D) Floyd-Warshall algorithm

Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). Consider the following three lines for clipping with the given end point co-ordinates: Line AB: A(-6,2) and B(-1,8) Line CD: C(-1,5) and D(4,8) Line EF: E(-2,3) and F(1,2) Which of the following line(s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Description : Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). ... s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Last Answer : (D) AB and CD

Consider a disk queue with I/O requests on the following cylinders in their arriving order: 6,10,12,54,97,73,128,15,44,110,34,45 The disk head is assumed to be at cylinder 23 and moving in the direction of decreasing number of cylinders. Total number of cylinders in the disk is 150. The disk head movement using SCAN-scheduling algorithm is: (1) 172 (2) 173 (3) 227 (4) 228

Description : Consider a disk queue with I/O requests on the following cylinders in their arriving order: 6,10,12,54,97,73,128,15,44,110,34,45 The disk head is assumed to be at cylinder 23 and moving in the direction ... . The disk head movement using SCAN-scheduling algorithm is: (1) 172 (2) 173 (3) 227 (4) 228

Last Answer : (2) 173

Below are the few steps given for scan-converting a circle using Bresenham's Algorithm. Which of the given steps is not correct? (1) Compute d = 3 – 2r (where r is radius) (2) Stop if x> y (3) If d<0, then d=4x+6 and x=x+1 (4) If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

Description : Below are the few steps given for scan-converting a circle using Bresenham's Algorithm. Which of the given steps is not correct? (1) Compute d = 3 – 2r (where r is radius) (2) Stop if x> y (3) If d

Last Answer : If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

Which transmission technique guarantees that data packets will be received by the receiver in the same order in which they were sent by the sender? (A) Broadcasting (B) Unicasting (C) Packet Switching (D) Circuit Switching

Description : Which transmission technique guarantees that data packets will be received by the receiver in the same order in which they were sent by the sender? (A) Broadcasting (B) Unicasting (C) Packet Switching (D) Circuit Switching

Last Answer : (D) Circuit Switching

In TCP/IP Reference model, the job of ............... layer is to permit hosts to inject packets into any network and travel them independently to the destination. (A) Physical (B) Transport (C) Application (D) Host-to-network

Description : In TCP/IP Reference model, the job of ............... layer is to permit hosts to inject packets into any network and travel them independently to the destination. (A) Physical (B) Transport (C) Application (D) Host-to-network

Last Answer : Answer: Marks to all

In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24 packets are required to transmit the message, the packet size is ................ (1) 2 bytes (2) 1 byte (3) 4 bytes (4) 5 bytes

Description : In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24 packets are required to transmit the message, the packet size is ................ (1) 2 bytes (2) 1 byte (3) 4 bytes (4) 5 bytes

Last Answer : (4) 5 bytes 

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

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

______ 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

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

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

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

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

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

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

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