Question
stringlengths 39
1.33k
| Tag
stringlengths 3
46
| label
int64 0
206
|
|---|---|---|
The number of edges in a regular graph of degree d and n vertices is ____________ | Regular Graph | 156 |
The number of edges in a regular graph of degree d and n vertices is ____________ | Regular Graph | 156 |
The number of edges in a regular graph of degree d and n vertices is ____________ | Regular Graph | 156 |
The number of edges in a regular graph of degree d and n vertices is ____________ | Regular Graph | 156 |
The number of edges in a regular graph of degree d and n vertices is ____________ | Regular Graph | 156 |
The number of edges in a regular graph of degree d and n vertices is ____________ | Regular Graph | 156 |
The number of edges in a regular graph of degree d and n vertices is ____________ | Regular Graph | 156 |
The number of edges in a regular graph of degree d and n vertices is ____________ | Regular Graph | 156 |
The number of edges in a regular graph of degree d and n vertices is ____________ | Regular Graph | 156 |
The number of edges in a regular graph of degree d and n vertices is ____________ | Regular Graph | 156 |
Consider the following two statements S_1 left 0 2n mid n geq 1 right is a regular language S_2 left 0 m1 n0 m n mid m geq 1 ext and n geq 1 right is a regular language Which of the following statement is correct Only S_1 is correct Only S_2 is correct Both S_1 and S_2 are correct None of S_1 and S_2 is correct | Regular Languages | 157 |
Let L subseteq Sigma where Sigma left a b right Which of the following is true a L left x mid x ext has an equal number of a ext s and b ext s right is regular b L left a nb n mid n geq 1 right is regular c L left x mid x ext has more number of a ext s than b ext s right is regular d L left a mb n mid m geq 1 n geq 1 right is regular | Regular Languages | 157 |
Let L be a regular language Consider the constructions on L below ext repeat L ww mid w in L ext prefix L u mid exists v uv in L ext suffix L v mid exists u uv in L ext half L u mid exists v v u ext and uv in L Which of the constructions could lead to a non regular language Both I and IV Only 1 Only IV Both II and III Which choice of L is best suited to support your answer above a b u03f5 a ab bab ab a nb n mid n geq 0 | Regular Languages | 157 |
Let L subseteq Sigma where Sigma left a b right Which of the following is true a L left x mid x ext has an equal number of a ext s and b ext s right is regular b L left a nb n mid n geq 1 right is regular c L left x mid x ext has more number of a ext s than b ext s right is regular d L left a mb n mid m geq 1 n geq 1 right is regular | Regular Languages | 157 |
Student school id sch roll no sname saddress School school id sch name sch address sch phone Enrolment school id sch roll no erollno examname ExamResult erollno examname marks Consider the following tuple relational calculus query t u2203 E u220a Enrolment t E school id x x u220a Enrolment x school id t u2203 B u220a ExamResult B erollno x erollno B examname x examname B marks gt 35 x x u220a Enrolment x school id t 100 gt 35 If a student needs to score more than 35 marks to pass an exam what does the query return The empty set schools with more than 35 of its students enrolled in some exam or the other schools with a pass percentage above 35 over all exams taken together schools with a pass percentage above 35 over each exam | Relational Calculus | 159 |
The relational algebra expression equivalent to the following tuple calculus expression left t mid t in r land left t A 10 land t B 20 right right is sigma_ A 10 lor B 20 r sigma_ A 10 r cup sigma_ B 20 r sigma_ A 10 r cap sigma_ B 20 r sigma_ A 10 r sigma_ B 20 r | Relational Calculus | 159 |
The following relations are used to store data about students courses enrollment of students in courses and teachers of courses Attributes for primary key in each relation are marked by u2018 u2019 Students rollno sname saddr courses cno cname enroll rollno cno grade each tno tname cao cno is course number cname is course name tno is teacher number tname is teacher name sname is student name etc Write a SQL query for retrieving roll number and name of students who got A grade in at least one course taught by teacher names Ramesh for the above relational database | Relational Calculus | 159 |
Let R and S be relational schemes such that R a b c and S c Now consider the following queries on the database pi_ R S r pi_ R S left pi_ R S r imes s pi_ R S S r right left t mid t in pi_ R S r wedge forall u in s left exists v in r left u v S wedge t v left R S right right right right left t mid t in pi_ R S r wedge forall v in r left exists u in s left u v S wedge t v left R S right right right right Select R a R b From R S Where R c S c Which of the above queries are equivalent 1 and 2 1 and 3 2 and 4 3 and 4 | Relational Calculus | 159 |
Consider the relation employee name sex supervisorName with name as the key supervisorName gives the name of the supervisor of the employee under consideration What does the following Tuple Relational Calculus query produce left e name mid employee e wedge left forall x right left eg employee left x right vee x supervisorName eq e name vee x sex male right right Names of employees with a male supervisor Names of employees with no immediate male subordinates Names of employees with no immediate female subordinates Names of employees with a female supervisor | Relational Calculus | 159 |
Let R_1 left underline A B C right and R_2 left underline D E right be two relation schema where the primary keys are shown underlined and let C be a foreign key in R_1 referring to R_2 Suppose there is no violation of the above referential integrity constraint in the corresponding relation instances r_1 and r_2 Which of the following relational algebra expressions would necessarily produce an empty relation Pi_D r_2 Pi_C r_1 Pi_C r_1 Pi_D r_2 Pi_D left r_1 bowtie_ C eq D r_2 right Pi_C left r_1 bowtie_ C D r_2 right | Relational Calculus | 159 |
Let R_1 left underline A B C right and R_2 left underline D E right be two relation schema where the primary keys are shown underlined and let C be a foreign key in R_1 referring to R_2 Suppose there is no violation of the above referential integrity constraint in the corresponding relation instances r_1 and r_2 Which of the following relational algebra expressions would necessarily produce an empty relation Pi_D r_2 Pi_C r_1 Pi_C r_1 Pi_D r_2 Pi_D left r_1 bowtie_ C eq D r_2 right Pi_C left r_1 bowtie_ C D r_2 right | Relational Calculus | 159 |
Consider the relation employee name sex supervisorName with name as the key supervisorName gives the name of the supervisor of the employee under consideration What does the following Tuple Relational Calculus query produce left e name mid employee e wedge left forall x right left eg employee left x right vee x supervisorName eq e name vee x sex male right right Names of employees with a male supervisor Names of employees with no immediate male subordinates Names of employees with no immediate female subordinates Names of employees with a female supervisor | Relational Calculus | 159 |
In a certain operating system deadlock prevention is attemped using the following scheme Each process is assigned a unique timestamp and is restarted with the same timestamp if killed Let Ph be the process holding a resource R Pr be a process requesting for the same resource R and T Ph and T Pr be their timestamps respectively The decision to wait or preempt one of the processes is based on the following algorithm if T Pr lt T Ph then kill Pr else wait Which one of the following is TRUE The scheme is deadlock free but not starvation free The scheme is not deadlock free but starvation free The scheme is neither deadlock free nor starvation free The scheme is both deadlock free and starvation free | Resource Allocation | 161 |
The amount of ROM needed to implement a 4 bit multiplier is 64 bits 128 bits 1 Kbits 2 Kbits | Rom | 162 |
The amount of ROM needed to implement a 4 bit multiplier is 64 bits 128 bits 1 Kbits 2 Kbits | Rom | 162 |
What is the minimum size of ROM required to store the complete truth table of an 8 bit imes 8 bit multiplier 32 K imes 16 bits 64 K imes 16 bits 16 K imes 32 bits 64 K x imes 32 bits | Rom | 162 |
The amount of ROM needed to implement a 4 bit multiplier is 64 bits 128 bits 1 Kbits 2 Kbits | Rom | 162 |
A ROM is used to store the table for multiplication of two 8 bit unsigned integers The size of ROM required is 256 u2a2f 16 64 K u2a2f 8 4 K u2a2f 16 64 K u2a2f 16 | Rom | 162 |
What is the minimum size of ROM required to store the complete truth table of an 8 bit imes 8 bit multiplier 32 K imes 16 bits 64 K imes 16 bits 16 K imes 32 bits 64 K x imes 32 bits | Rom | 162 |
The amount of ROM needed to implement a 4 bit multiplier is 64 bits 128 bits 1 Kbits 2 Kbits | Rom | 162 |
What is the minimum size of ROM required to store the complete truth table of an 8 bit imes 8 bit multiplier 32 K imes 16 bits 64 K imes 16 bits 16 K imes 32 bits 64 K x imes 32 bits | Rom | 162 |
The amount of ROM needed to implement a 4 bit multiplier is 64 bits 128 bits 1 Kbits 2 Kbits | Rom | 162 |
The amount of ROM needed to implement a 4 bit multiplier is 64 bits 128 bits 1 Kbits 2 Kbits | Rom | 162 |
The amount of ROM needed to implement a 4 bit multiplier is 64 bits 128 bits 1 Kbits 2 Kbits | Rom | 162 |
The amount of ROM needed to implement a 4 bit multiplier is 64 bits 128 bits 1 Kbits 2 Kbits | Rom | 162 |
In a network of LANs connected by bridges packets are sent from one LAN to another through intermediate bridges Since more than one path may exist between two LANs packets may have to be routed through multiple bridges Why is the spanning tree algorithm used for bridge routing For shortest path routing between LANs For avoiding loops in the routing paths For fault tolerance For minimizing collisions | Routing | 163 |
In a network of LANs connected by bridges packets are sent from one LAN to another through intermediate bridges Since more than one path may exist between two LANs packets may have to be routed through multiple bridges Why is the spanning tree algorithm used for bridge routing For shortest path routing between LANs For avoiding loops in the routing paths For fault tolerance For minimizing collisions | Routing | 163 |
Consider a simple graph with unit edge costs Each node in the graph represents a router Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router Initially the routing table is empty The routing table is synchronously updated as follows In each updation interval three tasks are performed A node determines whether its neighbours in the graph are accessible If so it sets the tentative cost to each accessible neighbour as 1 Otherwise the cost is set to u221e From each accessible neighbour it gets the costs to relay to other nodes via that neighbour as the next hop Each node updates its routing table based on the information received in the previous two steps by choosing the minimum cost For the graph given above possible routing tables for various nodes after they have stabilized are shown in the following options Identify the correct table Table for node A A B B 1 C C 1 D B 3 E C 3 F C 4 Table for node C A A 1 B B 1 C D D 1 E E 1 F E 3 Table for node B A A 1 B C C 1 D D 1 E C 2 F D 2 Table for node D A B 3 B B 1 C C 1 D E E 1 F F 1 | Routing | 163 |
Consider the following statements about the routing protocols Routing Information Protocol RIP and Oprn Shortest Path First OSPF in an IPv4 network RIP uses distance vector routing RIP packets are sent using UDP OSPF packets are sent using TCP OSPF operation is based on link state routing Which of the above statements are CORRECT I and IV only I II and III only I II and IV only II III and IV only | Routing | 163 |
Consider a simple graph with unit edge costs Each node in the graph represents a router Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router Initially the routing table is empty The routing table is synchronously updated as follows In each updation interval three tasks are performed A node determines whether its neighbours in the graph are accessible If so it sets the tentative cost to each accessible neighbour as 1 Otherwise the cost is set to u221e From each accessible neighbour it gets the costs to relay to other nodes via that neighbour as the next hop Each node updates its routing table based on the information received in the previous two steps by choosing the minimum cost Continuing from the earlier problem suppose at some time t when the costs have stabilized node A goes down The cost from node F to node A at time t 100 is gt 100 but finite infty 3 gt 3 and leq 100 | Routing | 163 |
A group of 15 routers are interconnected in a centralized complete binary tree with a router at each tree node Router i communicates with router j by sending a message to the root of the tree The root then sends the message back down to router j The mean number of hops per message assuming all possible router pairs are equally likely is 3 4 26 4 53 5 26 | Routing | 163 |
Consider the following statements about the routing protocols Routing Information Protocol RIP and Oprn Shortest Path First OSPF in an IPv4 network RIP uses distance vector routing RIP packets are sent using UDP OSPF packets are sent using TCP OSPF operation is based on link state routing Which of the above statements are CORRECT I and IV only I II and III only I II and IV only II III and IV only | Routing | 163 |
Consider the following statements about the routing protocols Routing Information Protocol RIP and Oprn Shortest Path First OSPF in an IPv4 network RIP uses distance vector routing RIP packets are sent using UDP OSPF packets are sent using TCP OSPF operation is based on link state routing Which of the above statements are CORRECT I and IV only I II and III only I II and IV only II III and IV only | Routing | 163 |
In a RSA cryptosystem a participant A uses two prime numbers p 13 and q 17 to generate here public and private keys If the public key of A is 35 then the private key of A is __________ | Rsa Security Networks | 164 |
In a RSA cryptosystem a participant A uses two prime numbers p 13 and q 17 to generate here public and private keys If the public key of A is 35 then the private key of A is __________ | Rsa Security Networks | 164 |
In a RSA cryptosystem a participant A uses two prime numbers p 13 and q 17 to generate here public and private keys If the public key of A is 35 then the private key of A is __________ | Rsa Security Networks | 164 |
In a RSA cryptosystem a participant A uses two prime numbers p 13 and q 17 to generate here public and private keys If the public key of A is 35 then the private key of A is __________ | Rsa Security Networks | 164 |
In a RSA cryptosystem a participant A uses two prime numbers p 13 and q 17 to generate here public and private keys If the public key of A is 35 then the private key of A is __________ | Rsa Security Networks | 164 |
In a RSA cryptosystem a participant A uses two prime numbers p 13 and q 17 to generate here public and private keys If the public key of A is 35 then the private key of A is __________ | Rsa Security Networks | 164 |
In a RSA cryptosystem a participant A uses two prime numbers p 13 and q 17 to generate here public and private keys If the public key of A is 35 then the private key of A is __________ | Rsa Security Networks | 164 |
In a RSA cryptosystem a participant A uses two prime numbers p 13 and q 17 to generate here public and private keys If the public key of A is 35 then the private key of A is __________ | Rsa Security Networks | 164 |
In a RSA cryptosystem a participant A uses two prime numbers p 13 and q 17 to generate here public and private keys If the public key of A is 35 then the private key of A is __________ | Rsa Security Networks | 164 |
In a RSA cryptosystem a participant A uses two prime numbers p 13 and q 17 to generate here public and private keys If the public key of A is 35 then the private key of A is __________ | Rsa Security Networks | 164 |
In a RSA cryptosystem a participant A uses two prime numbers p 13 and q 17 to generate here public and private keys If the public key of A is 35 then the private key of A is __________ | Rsa Security Networks | 164 |
In a RSA cryptosystem a participant A uses two prime numbers p 13 and q 17 to generate here public and private keys If the public key of A is 35 then the private key of A is __________ | Rsa Security Networks | 164 |
In a RSA cryptosystem a participant A uses two prime numbers p 13 and q 17 to generate here public and private keys If the public key of A is 35 then the private key of A is __________ | Rsa Security Networks | 164 |
In a RSA cryptosystem a participant A uses two prime numbers p 13 and q 17 to generate here public and private keys If the public key of A is 35 then the private key of A is __________ | Rsa Security Networks | 164 |
Consider a database that has the relation schemas EMP EmpId EmpName DeptId and DEPT DeptName DeptId Note that the DeptId can be permitted to be NULL in the relation EMP Consider the following queries on the database expressed in tuple relational calculus t exists u in EMP t EmpName u EmpName wedge forall v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId v DeptId Which of the above queries are safe I and II only I and III only II and III only I II and III | Safe Query | 165 |
Consider a database that has the relation schemas EMP EmpId EmpName DeptId and DEPT DeptName DeptId Note that the DeptId can be permitted to be NULL in the relation EMP Consider the following queries on the database expressed in tuple relational calculus t exists u in EMP t EmpName u EmpName wedge forall v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId v DeptId Which of the above queries are safe I and II only I and III only II and III only I II and III | Safe Query | 165 |
Consider a database that has the relation schemas EMP EmpId EmpName DeptId and DEPT DeptName DeptId Note that the DeptId can be permitted to be NULL in the relation EMP Consider the following queries on the database expressed in tuple relational calculus t exists u in EMP t EmpName u EmpName wedge forall v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId v DeptId Which of the above queries are safe I and II only I and III only II and III only I II and III | Safe Query | 165 |
Consider a database that has the relation schemas EMP EmpId EmpName DeptId and DEPT DeptName DeptId Note that the DeptId can be permitted to be NULL in the relation EMP Consider the following queries on the database expressed in tuple relational calculus t exists u in EMP t EmpName u EmpName wedge forall v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId v DeptId Which of the above queries are safe I and II only I and III only II and III only I II and III | Safe Query | 165 |
Consider a database that has the relation schemas EMP EmpId EmpName DeptId and DEPT DeptName DeptId Note that the DeptId can be permitted to be NULL in the relation EMP Consider the following queries on the database expressed in tuple relational calculus t exists u in EMP t EmpName u EmpName wedge forall v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId v DeptId Which of the above queries are safe I and II only I and III only II and III only I II and III | Safe Query | 165 |
Consider a database that has the relation schemas EMP EmpId EmpName DeptId and DEPT DeptName DeptId Note that the DeptId can be permitted to be NULL in the relation EMP Consider the following queries on the database expressed in tuple relational calculus t exists u in EMP t EmpName u EmpName wedge forall v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId v DeptId Which of the above queries are safe I and II only I and III only II and III only I II and III | Safe Query | 165 |
Consider a database that has the relation schemas EMP EmpId EmpName DeptId and DEPT DeptName DeptId Note that the DeptId can be permitted to be NULL in the relation EMP Consider the following queries on the database expressed in tuple relational calculus t exists u in EMP t EmpName u EmpName wedge forall v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId v DeptId Which of the above queries are safe I and II only I and III only II and III only I II and III | Safe Query | 165 |
Consider a database that has the relation schemas EMP EmpId EmpName DeptId and DEPT DeptName DeptId Note that the DeptId can be permitted to be NULL in the relation EMP Consider the following queries on the database expressed in tuple relational calculus t exists u in EMP t EmpName u EmpName wedge forall v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId v DeptId Which of the above queries are safe I and II only I and III only II and III only I II and III | Safe Query | 165 |
Consider a database that has the relation schemas EMP EmpId EmpName DeptId and DEPT DeptName DeptId Note that the DeptId can be permitted to be NULL in the relation EMP Consider the following queries on the database expressed in tuple relational calculus t exists u in EMP t EmpName u EmpName wedge forall v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId v DeptId Which of the above queries are safe I and II only I and III only II and III only I II and III | Safe Query | 165 |
Consider a database that has the relation schemas EMP EmpId EmpName DeptId and DEPT DeptName DeptId Note that the DeptId can be permitted to be NULL in the relation EMP Consider the following queries on the database expressed in tuple relational calculus t exists u in EMP t EmpName u EmpName wedge forall v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId v DeptId Which of the above queries are safe I and II only I and III only II and III only I II and III | Safe Query | 165 |
Consider a database that has the relation schemas EMP EmpId EmpName DeptId and DEPT DeptName DeptId Note that the DeptId can be permitted to be NULL in the relation EMP Consider the following queries on the database expressed in tuple relational calculus t exists u in EMP t EmpName u EmpName wedge forall v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId v DeptId Which of the above queries are safe I and II only I and III only II and III only I II and III | Safe Query | 165 |
Consider a database that has the relation schemas EMP EmpId EmpName DeptId and DEPT DeptName DeptId Note that the DeptId can be permitted to be NULL in the relation EMP Consider the following queries on the database expressed in tuple relational calculus t exists u in EMP t EmpName u EmpName wedge forall v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId v DeptId Which of the above queries are safe I and II only I and III only II and III only I II and III | Safe Query | 165 |
Consider a database that has the relation schemas EMP EmpId EmpName DeptId and DEPT DeptName DeptId Note that the DeptId can be permitted to be NULL in the relation EMP Consider the following queries on the database expressed in tuple relational calculus t exists u in EMP t EmpName u EmpName wedge forall v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId v DeptId Which of the above queries are safe I and II only I and III only II and III only I II and III | Safe Query | 165 |
Consider a database that has the relation schemas EMP EmpId EmpName DeptId and DEPT DeptName DeptId Note that the DeptId can be permitted to be NULL in the relation EMP Consider the following queries on the database expressed in tuple relational calculus t exists u in EMP t EmpName u EmpName wedge forall v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId eq v DeptId t exists u in EMP t EmpName u EmpName wedge exists v in DEPT t DeptId v DeptId Which of the above queries are safe I and II only I and III only II and III only I II and III | Safe Query | 165 |
Consider a 128 imes 10 3 bits second satellite communication link with one way propagation delay of 150 milliseconds Selective retransmission repeat protocol is used on this link to send data with a frame size of 1 kilobyte Neglect the transmission time of acknowledgement The minimum number of bits required for the sequence number field to achieve 100 utilization is ________ | Selective Repeat | 166 |
Consider a 128 imes 10 3 bits second satellite communication link with one way propagation delay of 150 milliseconds Selective retransmission repeat protocol is used on this link to send data with a frame size of 1 kilobyte Neglect the transmission time of acknowledgement The minimum number of bits required for the sequence number field to achieve 100 utilization is ________ | Selective Repeat | 166 |
Consider a 128 imes 10 3 bits second satellite communication link with one way propagation delay of 150 milliseconds Selective retransmission repeat protocol is used on this link to send data with a frame size of 1 kilobyte Neglect the transmission time of acknowledgement The minimum number of bits required for the sequence number field to achieve 100 utilization is ________ | Selective Repeat | 166 |
Consider a 128 imes 10 3 bits second satellite communication link with one way propagation delay of 150 milliseconds Selective retransmission repeat protocol is used on this link to send data with a frame size of 1 kilobyte Neglect the transmission time of acknowledgement The minimum number of bits required for the sequence number field to achieve 100 utilization is ________ | Selective Repeat | 166 |
Consider a 128 imes 10 3 bits second satellite communication link with one way propagation delay of 150 milliseconds Selective retransmission repeat protocol is used on this link to send data with a frame size of 1 kilobyte Neglect the transmission time of acknowledgement The minimum number of bits required for the sequence number field to achieve 100 utilization is ________ | Selective Repeat | 166 |
Consider a 128 imes 10 3 bits second satellite communication link with one way propagation delay of 150 milliseconds Selective retransmission repeat protocol is used on this link to send data with a frame size of 1 kilobyte Neglect the transmission time of acknowledgement The minimum number of bits required for the sequence number field to achieve 100 utilization is ________ | Selective Repeat | 166 |
Consider a 128 imes 10 3 bits second satellite communication link with one way propagation delay of 150 milliseconds Selective retransmission repeat protocol is used on this link to send data with a frame size of 1 kilobyte Neglect the transmission time of acknowledgement The minimum number of bits required for the sequence number field to achieve 100 utilization is ________ | Selective Repeat | 166 |
Consider a 128 imes 10 3 bits second satellite communication link with one way propagation delay of 150 milliseconds Selective retransmission repeat protocol is used on this link to send data with a frame size of 1 kilobyte Neglect the transmission time of acknowledgement The minimum number of bits required for the sequence number field to achieve 100 utilization is ________ | Selective Repeat | 166 |
Consider a 128 imes 10 3 bits second satellite communication link with one way propagation delay of 150 milliseconds Selective retransmission repeat protocol is used on this link to send data with a frame size of 1 kilobyte Neglect the transmission time of acknowledgement The minimum number of bits required for the sequence number field to achieve 100 utilization is ________ | Selective Repeat | 166 |
Consider a 128 imes 10 3 bits second satellite communication link with one way propagation delay of 150 milliseconds Selective retransmission repeat protocol is used on this link to send data with a frame size of 1 kilobyte Neglect the transmission time of acknowledgement The minimum number of bits required for the sequence number field to achieve 100 utilization is ________ | Selective Repeat | 166 |
Consider a 128 imes 10 3 bits second satellite communication link with one way propagation delay of 150 milliseconds Selective retransmission repeat protocol is used on this link to send data with a frame size of 1 kilobyte Neglect the transmission time of acknowledgement The minimum number of bits required for the sequence number field to achieve 100 utilization is ________ | Selective Repeat | 166 |
Consider a 128 imes 10 3 bits second satellite communication link with one way propagation delay of 150 milliseconds Selective retransmission repeat protocol is used on this link to send data with a frame size of 1 kilobyte Neglect the transmission time of acknowledgement The minimum number of bits required for the sequence number field to achieve 100 utilization is ________ | Selective Repeat | 166 |
Consider a 128 imes 10 3 bits second satellite communication link with one way propagation delay of 150 milliseconds Selective retransmission repeat protocol is used on this link to send data with a frame size of 1 kilobyte Neglect the transmission time of acknowledgement The minimum number of bits required for the sequence number field to achieve 100 utilization is ________ | Selective Repeat | 166 |
Consider a 128 imes 10 3 bits second satellite communication link with one way propagation delay of 150 milliseconds Selective retransmission repeat protocol is used on this link to send data with a frame size of 1 kilobyte Neglect the transmission time of acknowledgement The minimum number of bits required for the sequence number field to achieve 100 utilization is ________ | Selective Repeat | 166 |
Consider the blocked set semaphore where the signaling process awakens any one of the suspended process i e Wait S If S gt 0 then S leftarrow S 1 else suspend the execution of this process Signal S If there are processes that have been suspended on semaphore S then wake any one of them else S leftarrow S 1 Consider the following solution of mutual exclusion problem using blocked set semaphores s 1 cobegin P 1 P 2 P N coend Where the task body P i is begin while true do begin lt non critical section gt Wait S lt critical section gt Signal S end end Here N is the number of concurrent processors Which of the following is true The program fails to achieve mutual exclusion of critical regions The program achieves mutual exclusion but starvation freedom is ensured only for N leq 2 The program does not ensure mutual exclusion if N geq 3 The program achieves mutual exclusion but allows starvation for any N geq 2 The program achieves mutual exclusion and starvation freedom for any N geq 1 | Semaphore | 167 |
The P and V operations on counting semaphores where s is a counting semaphore are defined as follows P s s s 1 If s lt 0 then wait V s s s 1 If s lt 0 then wake up process waiting on s Assume that P_b and V_b the wait and signal operations on binary semaphores are provided Two binary semaphores x_b and y_b are used to implement the semaphore operations P s and V s as follows P s P_b x_b ext s s 1 ext if s lt 0 ext V_b x_b ext P_b y_b ext else V_b x_b V s P_b x_b ext s s 1 ext if s lt 0 V_b y_b ext V_b x_b The initial values of x_b and y_b are respectively 0 and 0 0 and 1 1 and 0 1 and 1 | Semaphore | 167 |
Consider a non negative counting semaphore S The operation P S decrements S and V S increments S During an execution 20 P S operations and 12 V S operations are issued in some order The largest initial value of S for which at least one P S operation will remain blocked is _______ | Semaphore | 167 |
Fill in the blanks Semaphore operations are atomic because they are implemented within the OS _________ | Semaphore | 167 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only At a particular time of computation the value of a counting semaphore is 7 Then 20 P operations and 15 V operations were completed on this semaphore The resulting value of the semaphore is 42 2 7 12 | Semaphore | 167 |
The wait and signal operations of a monitor are implemented using semaphores as follows In the following x is a condition variable mutex is a semaphore initialized to 1 x_sem is a semaphore initialized to 0 x_count is the number of processes waiting on semaphore x_sem initially 0 next is a semaphore initialized to 0 next_count is the number of processes waiting on semaphore next initially 0 The body of each procedure that is visible outside the monitor is replaced with the following P mutex body of procedure if next_count gt 0 V next else V mutex Each occurrence of x wait is replaced with the following x_count x_count 1 if next_count gt 0 V next else V mutex E1 x_count x_count 1 Each occurrence of x signal is replaced with the following if x_count gt 0 next_count next_count 1 E2 P next next_count next_count 1 For correct implementation of the monitor statements E1 and E2 are respectively P x_sem V next V next P x_sem P next V x_sem P x_sem V x_sem | Semaphore | 167 |
The P and V operations on counting semaphores where s is a counting semaphore are defined as follows P s s s 1 If s lt 0 then wait V s s s 1 If s lt 0 then wake up process waiting on s Assume that P_b and V_b the wait and signal operations on binary semaphores are provided Two binary semaphores x_b and y_b are used to implement the semaphore operations P s and V s as follows P s P_b x_b ext s s 1 ext if s lt 0 ext V_b x_b ext P_b y_b ext else V_b x_b V s P_b x_b ext s s 1 ext if s lt 0 V_b y_b ext V_b x_b The initial values of x_b and y_b are respectively 0 and 0 0 and 1 1 and 0 1 and 1 | Semaphore | 167 |
The P and V operations on counting semaphores where s is a counting semaphore are defined as follows P s s s 1 If s lt 0 then wait V s s s 1 If s lt 0 then wake up process waiting on s Assume that P_b and V_b the wait and signal operations on binary semaphores are provided Two binary semaphores x_b and y_b are used to implement the semaphore operations P s and V s as follows P s P_b x_b ext s s 1 ext if s lt 0 ext V_b x_b ext P_b y_b ext else V_b x_b V s P_b x_b ext s s 1 ext if s lt 0 V_b y_b ext V_b x_b The initial values of x_b and y_b are respectively 0 and 0 0 and 1 1 and 0 1 and 1 | Semaphore | 167 |
Consider a non negative counting semaphore S The operation P S decrements S and V S increments S During an execution 20 P S operations and 12 V S operations are issued in some order The largest initial value of S for which at least one P S operation will remain blocked is _______ | Semaphore | 167 |
In serial communication employing 8 data bits a parity bit and 2 stop bits the minimum band rate required to sustain a transfer rate of 300 characters per second is 2400 band 19200 band 4800 band 1200 band | Serial Communication | 168 |
How many bytes of data can be sent in 15 seconds over a serial link with baud rate of 9600 in asynchronous mode with odd parity and two stop bits in the frame 10 000 bytes 12 000 bytes 15 000 bytes 27 000 bytes | Serial Communication | 168 |
How many bytes of data can be sent in 15 seconds over a serial link with baud rate of 9600 in asynchronous mode with odd parity and two stop bits in the frame 10 000 bytes 12 000 bytes 15 000 bytes 27 000 bytes | Serial Communication | 168 |
How many bytes of data can be sent in 15 seconds over a serial link with baud rate of 9600 in asynchronous mode with odd parity and two stop bits in the frame 10 000 bytes 12 000 bytes 15 000 bytes 27 000 bytes | Serial Communication | 168 |
In serial communication employing 8 data bits a parity bit and 2 stop bits the minimum band rate required to sustain a transfer rate of 300 characters per second is 2400 band 19200 band 4800 band 1200 band | Serial Communication | 168 |
How many bytes of data can be sent in 15 seconds over a serial link with baud rate of 9600 in asynchronous mode with odd parity and two stop bits in the frame 10 000 bytes 12 000 bytes 15 000 bytes 27 000 bytes | Serial Communication | 168 |
Subsets and Splits