Question
stringlengths 39
1.33k
| Tag
stringlengths 3
46
| label
int64 0
206
|
|---|---|---|
Given two three bit numbers a_ 2 a_ 1 a_ 0 and b_ 2 b_ 1 b_ 0 and c the carry in the function that represents the carry generate function when these two numbers are added is a_ 2 b_ 2 a_ 2 a_ 1 b_ 1 a_ 2 a_ 1 a_ 0 b_ 0 a_ 2 a_ 0 b_ 1 b_ 0 a_ 1 b_ 2 b_ 1 a_ 1 a_ 0 b_ 2 b_ 0 a_ 0 b_ 2 b_ 1 b_ 0 a_ 2 b_ 2 a_ 2 b_ 1 b_ 0 a_ 2 a_ 1 b_ 1 b_ 0 a_ 1 a_ 0 b_ 2 b_ 1 a_ 1 a_ 0 b_ 2 a_ 1 a_ 0 b_ 2 b_ 0 a_ 2 a_ 0 b_ 1 b_ 0 a_ 2 b_ 2 a_ 2 oplus b_ 2 a_ 1 b_ 1 a_ 1 oplus b_ 1 a_ 0 b_ 0 a_ 2 b_ 2 overline a_ 2 a_ 1 b_ 1 overline a_ 2 a_ 1 a_ 0 b_ 0 overline a_ 2 a_ 0 overline b_ 1 b_ 0 a_ 1 overline b_ 2 b_ 1 overline a_ 1 a_ 0 overline b_ 2 b_ 0 a_ 0 overline b_ 2 b_ 1 b_ 0 | Carry Generator | 19 |
In a look ahead carry generator the carry generate function G_i and the carry propagate function P_i for inputs A_i and B_i are given by P_i A_i oplus B_i ext and G_i A_iB_i The expressions for the sum bit S_i and the carry bit C_ i 1 of the look ahead carry adder are given by S_i P_i oplus C_i ext and C_ i 1 G_i P_iC_i ext where C_0 ext is the input carry Consider a two level logic implementation of the look ahead carry generator Assume that all P_i and G_i are available for the carry generator circuit and that the AND and OR gates can have any number of inputs The number of AND gates and OR gates needed to implement the look ahead carry generator for a 4 bit adder with S_3 S_2 S_1 S_0 and C_4 as its outputs are respectively 6 3 10 4 6 4 10 5 | Carry Generator | 19 |
Given two three bit numbers a_ 2 a_ 1 a_ 0 and b_ 2 b_ 1 b_ 0 and c the carry in the function that represents the carry generate function when these two numbers are added is a_ 2 b_ 2 a_ 2 a_ 1 b_ 1 a_ 2 a_ 1 a_ 0 b_ 0 a_ 2 a_ 0 b_ 1 b_ 0 a_ 1 b_ 2 b_ 1 a_ 1 a_ 0 b_ 2 b_ 0 a_ 0 b_ 2 b_ 1 b_ 0 a_ 2 b_ 2 a_ 2 b_ 1 b_ 0 a_ 2 a_ 1 b_ 1 b_ 0 a_ 1 a_ 0 b_ 2 b_ 1 a_ 1 a_ 0 b_ 2 a_ 1 a_ 0 b_ 2 b_ 0 a_ 2 a_ 0 b_ 1 b_ 0 a_ 2 b_ 2 a_ 2 oplus b_ 2 a_ 1 b_ 1 a_ 1 oplus b_ 1 a_ 0 b_ 0 a_ 2 b_ 2 overline a_ 2 a_ 1 b_ 1 overline a_ 2 a_ 1 a_ 0 b_ 0 overline a_ 2 a_ 0 overline b_ 1 b_ 0 a_ 1 overline b_ 2 b_ 1 overline a_ 1 a_ 0 overline b_ 2 b_ 0 a_ 0 overline b_ 2 b_ 1 b_ 0 | Carry Generator | 19 |
In a look ahead carry generator the carry generate function G_i and the carry propagate function P_i for inputs A_i and B_i are given by P_i A_i oplus B_i ext and G_i A_iB_i The expressions for the sum bit S_i and the carry bit C_ i 1 of the look ahead carry adder are given by S_i P_i oplus C_i ext and C_ i 1 G_i P_iC_i ext where C_0 ext is the input carry Consider a two level logic implementation of the look ahead carry generator Assume that all P_i and G_i are available for the carry generator circuit and that the AND and OR gates can have any number of inputs The number of AND gates and OR gates needed to implement the look ahead carry generator for a 4 bit adder with S_3 S_2 S_1 S_0 and C_4 as its outputs are respectively 6 3 10 4 6 4 10 5 | Carry Generator | 19 |
At what time between 6 a m and 7 a m will the minute hand and hour hand of a clock make an angle closest to 60 u00b0 6 22 a m 6 27 a m 6 38 a m 6 45 a m | Clock Time | 21 |
At what time between 6 a m and 7 a m will the minute hand and hour hand of a clock make an angle closest to 60 u00b0 6 22 a m 6 27 a m 6 38 a m 6 45 a m | Clock Time | 21 |
At what time between 6 a m and 7 a m will the minute hand and hour hand of a clock make an angle closest to 60 u00b0 6 22 a m 6 27 a m 6 38 a m 6 45 a m | Clock Time | 21 |
At what time between 6 a m and 7 a m will the minute hand and hour hand of a clock make an angle closest to 60 u00b0 6 22 a m 6 27 a m 6 38 a m 6 45 a m | Clock Time | 21 |
At what time between 6 a m and 7 a m will the minute hand and hour hand of a clock make an angle closest to 60 u00b0 6 22 a m 6 27 a m 6 38 a m 6 45 a m | Clock Time | 21 |
At what time between 6 a m and 7 a m will the minute hand and hour hand of a clock make an angle closest to 60 u00b0 6 22 a m 6 27 a m 6 38 a m 6 45 a m | Clock Time | 21 |
At what time between 6 a m and 7 a m will the minute hand and hour hand of a clock make an angle closest to 60 u00b0 6 22 a m 6 27 a m 6 38 a m 6 45 a m | Clock Time | 21 |
At what time between 6 a m and 7 a m will the minute hand and hour hand of a clock make an angle closest to 60 u00b0 6 22 a m 6 27 a m 6 38 a m 6 45 a m | Clock Time | 21 |
At what time between 6 a m and 7 a m will the minute hand and hour hand of a clock make an angle closest to 60 u00b0 6 22 a m 6 27 a m 6 38 a m 6 45 a m | Clock Time | 21 |
At what time between 6 a m and 7 a m will the minute hand and hour hand of a clock make an angle closest to 60 u00b0 6 22 a m 6 27 a m 6 38 a m 6 45 a m | Clock Time | 21 |
At what time between 6 a m and 7 a m will the minute hand and hour hand of a clock make an angle closest to 60 u00b0 6 22 a m 6 27 a m 6 38 a m 6 45 a m | Clock Time | 21 |
At what time between 6 a m and 7 a m will the minute hand and hour hand of a clock make an angle closest to 60 u00b0 6 22 a m 6 27 a m 6 38 a m 6 45 a m | Clock Time | 21 |
At what time between 6 a m and 7 a m will the minute hand and hour hand of a clock make an angle closest to 60 u00b0 6 22 a m 6 27 a m 6 38 a m 6 45 a m | Clock Time | 21 |
At what time between 6 a m and 7 a m will the minute hand and hour hand of a clock make an angle closest to 60 u00b0 6 22 a m 6 27 a m 6 38 a m 6 45 a m | Clock Time | 21 |
Consider the following types of languages L_ 1 Regular L_ 2 Context free L_ 3 Recursive L_ 4 Recursively enumerable Which of the following is are TRUE bar L_ 3 cup L_ 4 is recursively enumerable bar L_ 2 cup L_ 3 is recursive L _ 1 cap L_ 2 is context free L_ 1 cup bar L_ 2 is context free I only I and III only I and IV only I II and III only | Closure Property | 22 |
Consider the following types of languages L_ 1 Regular L_ 2 Context free L_ 3 Recursive L_ 4 Recursively enumerable Which of the following is are TRUE bar L_ 3 cup L_ 4 is recursively enumerable bar L_ 2 cup L_ 3 is recursive L _ 1 cap L_ 2 is context free L_ 1 cup bar L_ 2 is context free I only I and III only I and IV only I II and III only | Closure Property | 22 |
Consider the following types of languages L_ 1 Regular L_ 2 Context free L_ 3 Recursive L_ 4 Recursively enumerable Which of the following is are TRUE bar L_ 3 cup L_ 4 is recursively enumerable bar L_ 2 cup L_ 3 is recursive L _ 1 cap L_ 2 is context free L_ 1 cup bar L_ 2 is context free I only I and III only I and IV only I II and III only | Closure Property | 22 |
Context free languages and regular languages are both closed under the operation s of Union Intersection Concatenation Complementation | Closure Property | 22 |
Let L_1 L_2 be any two context free languages and R be any regular language Then which of the following is are CORRECT L_1 cup L_2 is context free overline L_1 is context free L_1 R is context free L_1 cap L_2 is context free I II and IV only I and III only II and IV only I only | Closure Property | 22 |
Let L_1 L_2 be any two context free languages and R be any regular language Then which of the following is are CORRECT L_1 cup L_2 is context free overline L_1 is context free L_1 R is context free L_1 cap L_2 is context free I II and IV only I and III only II and IV only I only | Closure Property | 22 |
Let L_1 L_2 be any two context free languages and R be any regular language Then which of the following is are CORRECT L_1 cup L_2 is context free overline L_1 is context free L_1 R is context free L_1 cap L_2 is context free I II and IV only I and III only II and IV only I only | Closure Property | 22 |
Let L_1 L_2 be any two context free languages and R be any regular language Then which of the following is are CORRECT L_1 cup L_2 is context free overline L_1 is context free L_1 R is context free L_1 cap L_2 is context free I II and IV only I and III only II and IV only I only | Closure Property | 22 |
Context free languages and regular languages are both closed under the operation s of Union Intersection Concatenation Complementation | Closure Property | 22 |
Which of the following statements is FALSE The intersection of a context free language with a regular language is context free The intersection of two regular languages is regular The intersection of two context free languages is context free The intersection of a context free language and the complement of a regular language is context free The intersection of a regular language and the complement of a regular language is regular | Closure Property | 22 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only Which of the following is an example of a spooled device The terminal used to input data for a program being executed The secondary memory device in a virtual memory system A line printer used to print the output of a number of jobs None of the above | Computer Peripherals | 23 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only Which of the following is an example of a spooled device The terminal used to input data for a program being executed The secondary memory device in a virtual memory system A line printer used to print the output of a number of jobs None of the above | Computer Peripherals | 23 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only Which of the following is an example of a spooled device The terminal used to input data for a program being executed The secondary memory device in a virtual memory system A line printer used to print the output of a number of jobs None of the above | Computer Peripherals | 23 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only Which of the following is an example of a spooled device The terminal used to input data for a program being executed The secondary memory device in a virtual memory system A line printer used to print the output of a number of jobs None of the above | Computer Peripherals | 23 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only Which of the following is an example of a spooled device The terminal used to input data for a program being executed The secondary memory device in a virtual memory system A line printer used to print the output of a number of jobs None of the above | Computer Peripherals | 23 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only Which of the following is an example of a spooled device The terminal used to input data for a program being executed The secondary memory device in a virtual memory system A line printer used to print the output of a number of jobs None of the above | Computer Peripherals | 23 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only Which of the following is an example of a spooled device The terminal used to input data for a program being executed The secondary memory device in a virtual memory system A line printer used to print the output of a number of jobs None of the above | Computer Peripherals | 23 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only Which of the following is an example of a spooled device The terminal used to input data for a program being executed The secondary memory device in a virtual memory system A line printer used to print the output of a number of jobs None of the above | Computer Peripherals | 23 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only Which of the following is an example of a spooled device The terminal used to input data for a program being executed The secondary memory device in a virtual memory system A line printer used to print the output of a number of jobs None of the above | Computer Peripherals | 23 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only Which of the following is an example of a spooled device The terminal used to input data for a program being executed The secondary memory device in a virtual memory system A line printer used to print the output of a number of jobs None of the above | Computer Peripherals | 23 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only Which of the following is an example of a spooled device The terminal used to input data for a program being executed The secondary memory device in a virtual memory system A line printer used to print the output of a number of jobs None of the above | Computer Peripherals | 23 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only Which of the following is an example of a spooled device The terminal used to input data for a program being executed The secondary memory device in a virtual memory system A line printer used to print the output of a number of jobs None of the above | Computer Peripherals | 23 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only Which of the following is an example of a spooled device The terminal used to input data for a program being executed The secondary memory device in a virtual memory system A line printer used to print the output of a number of jobs None of the above | Computer Peripherals | 23 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only Which of the following is an example of a spooled device The terminal used to input data for a program being executed The secondary memory device in a virtual memory system A line printer used to print the output of a number of jobs None of the above | Computer Peripherals | 23 |
Consider the following functions f and g f x x 50 y y 50 g a a x a a y Suppose we start with initial values of 100 for x 200 for y and 0 for a and then execute f and g in parallel u2014that is at each step we either execute one statement from f or one statement from g Which of the following is not a possible final value of a 300 250 350 200 | Concurrency | 24 |
The following two functions P1 and P2 that share a variable B with an initial value of 2 execute concurrently P1 C B 1 B 2 C P2 D 2 B B D 1 The number of distinct values that B can possibly take after the execution is______________________ | Concurrency | 24 |
Consider the following database schedule with two transactions T_ 1 and T_ 2 S r_ 2 left X right r_ 1 left X right r_ 2 left Y right w_ 1 left X right r_ 1 left Y right w_ 2 left X right a_ 1 a_ 2 Where r_ i Z denotes a read operation by transaction T_ i on a variable Z w_ i Z denotes a write operation by T_ i on a variable Z and a_ i denotes an abort by transaction T_ i Which one of the following statements about the above schedule is TRUE S is non recoverable S is recoverable but has a cascading abort S does not have a cascading abort S is strict | Concurrency | 24 |
The following two functions P1 and P2 that share a variable B with an initial value of 2 execute concurrently P1 C B 1 B 2 C P2 D 2 B B D 1 The number of distinct values that B can possibly take after the execution is______________________ | Concurrency | 24 |
Consider the following database schedule with two transactions T_ 1 and T_ 2 S r_ 2 left X right r_ 1 left X right r_ 2 left Y right w_ 1 left X right r_ 1 left Y right w_ 2 left X right a_ 1 a_ 2 Where r_ i Z denotes a read operation by transaction T_ i on a variable Z w_ i Z denotes a write operation by T_ i on a variable Z and a_ i denotes an abort by transaction T_ i Which one of the following statements about the above schedule is TRUE S is non recoverable S is recoverable but has a cascading abort S does not have a cascading abort S is strict | Concurrency | 24 |
Consider the following functions f and g f x x 50 y y 50 g a a x a a y Suppose we start with initial values of 100 for x 200 for y and 0 for a and then execute f and g in parallel u2014that is at each step we either execute one statement from f or one statement from g Which of the following is not a possible final value of a 300 250 350 200 | Concurrency | 24 |
The following two functions P1 and P2 that share a variable B with an initial value of 2 execute concurrently P1 C B 1 B 2 C P2 D 2 B B D 1 The number of distinct values that B can possibly take after the execution is______________________ | Concurrency | 24 |
Consider the concurrent program x 1 cobegin x x x 1 x x 2 coend Reading and writing of a variable is atomic but evaluation of an expression is not atomic The set of possible values of variable x at the end of execution of the program is left 3 right left 7 right left 3 5 7 right left 3 7 right left 3 5 right | Concurrency | 24 |
Consider the concurrent program x 1 cobegin x x x 1 x x 2 coend Reading and writing of a variable is atomic but evaluation of an expression is not atomic The set of possible values of variable x at the end of execution of the program is left 3 right left 7 right left 3 5 7 right left 3 7 right left 3 5 right | Concurrency | 24 |
Consider the following database schedule with two transactions T_ 1 and T_ 2 S r_ 2 left X right r_ 1 left X right r_ 2 left Y right w_ 1 left X right r_ 1 left Y right w_ 2 left X right a_ 1 a_ 2 Where r_ i Z denotes a read operation by transaction T_ i on a variable Z w_ i Z denotes a write operation by T_ i on a variable Z and a_ i denotes an abort by transaction T_ i Which one of the following statements about the above schedule is TRUE S is non recoverable S is recoverable but has a cascading abort S does not have a cascading abort S is strict | Concurrency | 24 |
The following two functions P1 and P2 that share a variable B with an initial value of 2 execute concurrently P1 C B 1 B 2 C P2 D 2 B B D 1 The number of distinct values that B can possibly take after the execution is______________________ | Concurrency | 24 |
Amar and Akbar both tell the truth with probability dfrac 3 4 and lie with probability dfrac 1 4 Amar watches a test match and talks to Akbar about the outcome Akbar in turn tells Anthony Amar told me that India won What probability should Anthony assign to India s win left dfrac 9 16 right left dfrac 6 16 right left dfrac 7 16 right left dfrac 10 16 right None of the above | Conditional Probability | 25 |
Amar and Akbar both tell the truth with probability dfrac 3 4 and lie with probability dfrac 1 4 Amar watches a test match and talks to Akbar about the outcome Akbar in turn tells Anthony Amar told me that India won What probability should Anthony assign to India s win left dfrac 9 16 right left dfrac 6 16 right left dfrac 7 16 right left dfrac 10 16 right None of the above | Conditional Probability | 25 |
Suppose that a shop has an equal number of LED bulbs of two different types The probability of an LED bulb lasting more than 100 hours given that it is of Type 1 is 0 7 and given that it is of Type 2 is 0 4 The probability that an LED bulb chosen uniformly at random lasts more than 100 hours is _________ | Conditional Probability | 25 |
Amar and Akbar both tell the truth with probability dfrac 3 4 and lie with probability dfrac 1 4 Amar watches a test match and talks to Akbar about the outcome Akbar in turn tells Anthony Amar told me that India won What probability should Anthony assign to India s win left dfrac 9 16 right left dfrac 6 16 right left dfrac 7 16 right left dfrac 10 16 right None of the above | Conditional Probability | 25 |
P and Q are considering to apply for a job The probability that P applies for the job is dfrac 1 4 the probability that P applies for the job given that Q applies for the job is dfrac 1 2 and the probability that Q applies for the job given that P applies for the job is dfrac 1 3 Then the probability that P does not apply for the job given that Q does not apply for this job is left dfrac 4 5 right left dfrac 5 6 right left dfrac 7 8 right left dfrac 11 12 right | Conditional Probability | 25 |
Karan tells truth with probability dfrac 1 3 and lies with probability dfrac 2 3 Independently Arjun tells truth with probability dfrac 3 4 and lies with probability dfrac 1 4 Both watch a cricket match Arjun tells you that India won Karan tells you that India lost What probability will you assign to India s win left dfrac 1 2 right left dfrac 2 3 right left dfrac 3 4 right left dfrac 5 6 right left dfrac 6 7 right | Conditional Probability | 25 |
Karan tells truth with probability dfrac 1 3 and lies with probability dfrac 2 3 Independently Arjun tells truth with probability dfrac 3 4 and lies with probability dfrac 1 4 Both watch a cricket match Arjun tells you that India won Karan tells you that India lost What probability will you assign to India s win left dfrac 1 2 right left dfrac 2 3 right left dfrac 3 4 right left dfrac 5 6 right left dfrac 6 7 right | Conditional Probability | 25 |
Suppose that a shop has an equal number of LED bulbs of two different types The probability of an LED bulb lasting more than 100 hours given that it is of Type 1 is 0 7 and given that it is of Type 2 is 0 4 The probability that an LED bulb chosen uniformly at random lasts more than 100 hours is _________ | Conditional Probability | 25 |
Let A and B be any two arbitrary events then which one of the following is true P A cap B P A P B P A cup B P A P B P A mid B P A cap B P B P A cup B leq P A P B | Conditional Probability | 25 |
P and Q are considering to apply for a job The probability that P applies for the job is dfrac 1 4 the probability that P applies for the job given that Q applies for the job is dfrac 1 2 and the probability that Q applies for the job given that P applies for the job is dfrac 1 3 Then the probability that P does not apply for the job given that Q does not apply for this job is left dfrac 4 5 right left dfrac 5 6 right left dfrac 7 8 right left dfrac 11 12 right | Conditional Probability | 25 |
Two transactions T_1 and T_2 are given as T_1 r_1 X w_1 X r_1 Y w_1 Y T_2 r_2 Y w_2 Y r_2 Z w_2 Z where r_i V denotes a extit read operation by transaction T_i on a variable V and w_i V denotes a extit write operation by transaction T_i on a variable V The total number of conflict serializable schedules that can be formed by T_1 and T_2 is ______ | Conflict Serializable | 26 |
Two transactions T_1 and T_2 are given as T_1 r_1 X w_1 X r_1 Y w_1 Y T_2 r_2 Y w_2 Y r_2 Z w_2 Z where r_i V denotes a extit read operation by transaction T_i on a variable V and w_i V denotes a extit write operation by transaction T_i on a variable V The total number of conflict serializable schedules that can be formed by T_1 and T_2 is ______ | Conflict Serializable | 26 |
Two transactions T_1 and T_2 are given as T_1 r_1 X w_1 X r_1 Y w_1 Y T_2 r_2 Y w_2 Y r_2 Z w_2 Z where r_i V denotes a extit read operation by transaction T_i on a variable V and w_i V denotes a extit write operation by transaction T_i on a variable V The total number of conflict serializable schedules that can be formed by T_1 and T_2 is ______ | Conflict Serializable | 26 |
Two transactions T_1 and T_2 are given as T_1 r_1 X w_1 X r_1 Y w_1 Y T_2 r_2 Y w_2 Y r_2 Z w_2 Z where r_i V denotes a extit read operation by transaction T_i on a variable V and w_i V denotes a extit write operation by transaction T_i on a variable V The total number of conflict serializable schedules that can be formed by T_1 and T_2 is ______ | Conflict Serializable | 26 |
Two transactions T_1 and T_2 are given as T_1 r_1 X w_1 X r_1 Y w_1 Y T_2 r_2 Y w_2 Y r_2 Z w_2 Z where r_i V denotes a extit read operation by transaction T_i on a variable V and w_i V denotes a extit write operation by transaction T_i on a variable V The total number of conflict serializable schedules that can be formed by T_1 and T_2 is ______ | Conflict Serializable | 26 |
Two transactions T_1 and T_2 are given as T_1 r_1 X w_1 X r_1 Y w_1 Y T_2 r_2 Y w_2 Y r_2 Z w_2 Z where r_i V denotes a extit read operation by transaction T_i on a variable V and w_i V denotes a extit write operation by transaction T_i on a variable V The total number of conflict serializable schedules that can be formed by T_1 and T_2 is ______ | Conflict Serializable | 26 |
Two transactions T_1 and T_2 are given as T_1 r_1 X w_1 X r_1 Y w_1 Y T_2 r_2 Y w_2 Y r_2 Z w_2 Z where r_i V denotes a extit read operation by transaction T_i on a variable V and w_i V denotes a extit write operation by transaction T_i on a variable V The total number of conflict serializable schedules that can be formed by T_1 and T_2 is ______ | Conflict Serializable | 26 |
Two transactions T_1 and T_2 are given as T_1 r_1 X w_1 X r_1 Y w_1 Y T_2 r_2 Y w_2 Y r_2 Z w_2 Z where r_i V denotes a extit read operation by transaction T_i on a variable V and w_i V denotes a extit write operation by transaction T_i on a variable V The total number of conflict serializable schedules that can be formed by T_1 and T_2 is ______ | Conflict Serializable | 26 |
Two transactions T_1 and T_2 are given as T_1 r_1 X w_1 X r_1 Y w_1 Y T_2 r_2 Y w_2 Y r_2 Z w_2 Z where r_i V denotes a extit read operation by transaction T_i on a variable V and w_i V denotes a extit write operation by transaction T_i on a variable V The total number of conflict serializable schedules that can be formed by T_1 and T_2 is ______ | Conflict Serializable | 26 |
Two transactions T_1 and T_2 are given as T_1 r_1 X w_1 X r_1 Y w_1 Y T_2 r_2 Y w_2 Y r_2 Z w_2 Z where r_i V denotes a extit read operation by transaction T_i on a variable V and w_i V denotes a extit write operation by transaction T_i on a variable V The total number of conflict serializable schedules that can be formed by T_1 and T_2 is ______ | Conflict Serializable | 26 |
Two transactions T_1 and T_2 are given as T_1 r_1 X w_1 X r_1 Y w_1 Y T_2 r_2 Y w_2 Y r_2 Z w_2 Z where r_i V denotes a extit read operation by transaction T_i on a variable V and w_i V denotes a extit write operation by transaction T_i on a variable V The total number of conflict serializable schedules that can be formed by T_1 and T_2 is ______ | Conflict Serializable | 26 |
Two transactions T_1 and T_2 are given as T_1 r_1 X w_1 X r_1 Y w_1 Y T_2 r_2 Y w_2 Y r_2 Z w_2 Z where r_i V denotes a extit read operation by transaction T_i on a variable V and w_i V denotes a extit write operation by transaction T_i on a variable V The total number of conflict serializable schedules that can be formed by T_1 and T_2 is ______ | Conflict Serializable | 26 |
Two transactions T_1 and T_2 are given as T_1 r_1 X w_1 X r_1 Y w_1 Y T_2 r_2 Y w_2 Y r_2 Z w_2 Z where r_i V denotes a extit read operation by transaction T_i on a variable V and w_i V denotes a extit write operation by transaction T_i on a variable V The total number of conflict serializable schedules that can be formed by T_1 and T_2 is ______ | Conflict Serializable | 26 |
Two transactions T_1 and T_2 are given as T_1 r_1 X w_1 X r_1 Y w_1 Y T_2 r_2 Y w_2 Y r_2 Z w_2 Z where r_i V denotes a extit read operation by transaction T_i on a variable V and w_i V denotes a extit write operation by transaction T_i on a variable V The total number of conflict serializable schedules that can be formed by T_1 and T_2 is ______ | Conflict Serializable | 26 |
If L_1 and L_2 are context free languages and R a regular set one of the languages below is not necessarily a context free language Which one L_1 L_2 L_1 cap L_2 L_1 cap R L_1 cup L_2 | Context Free Language | 27 |
02 Choose the correct alternatives more than one may be correct and write the corresponding letters only xix Context free languages are closed under union closed under complementation closed under intersection closed under Kleene closure | Context Free Language | 27 |
Which of the following actions is are typically not performed by the operating system when switching context from process A to process B Saving current register values and restoring saved register values for process B Changing address translation tables Swapping out the memory image of process A to the disk Invalidating the translation look aside buffer | Context Switch | 28 |
Which of the following actions is are typically not performed by the operating system when switching context from process A to process B Saving current register values and restoring saved register values for process B Changing address translation tables Swapping out the memory image of process A to the disk Invalidating the translation look aside buffer | Context Switch | 28 |
Let the time taken to switch from user mode to kernel mode of execution be T1 while time taken to switch between two user processes be T2 Which of the following is correct T1 gt T2 T1 T2 T1 lt T2 Nothing can be said about the relation between T1 and T2 | Context Switch | 28 |
Let the time taken to switch from user mode to kernel mode of execution be T1 while time taken to switch between two user processes be T2 Which of the following is correct T1 gt T2 T1 T2 T1 lt T2 Nothing can be said about the relation between T1 and T2 | Context Switch | 28 |
Which of the following actions is are typically not performed by the operating system when switching context from process A to process B Saving current register values and restoring saved register values for process B Changing address translation tables Swapping out the memory image of process A to the disk Invalidating the translation look aside buffer | Context Switch | 28 |
Which of the following actions is are typically not performed by the operating system when switching context from process A to process B Saving current register values and restoring saved register values for process B Changing address translation tables Swapping out the memory image of process A to the disk Invalidating the translation look aside buffer | Context Switch | 28 |
Let the time taken to switch from user mode to kernel mode of execution be T1 while time taken to switch between two user processes be T2 Which of the following is correct T1 gt T2 T1 T2 T1 lt T2 Nothing can be said about the relation between T1 and T2 | Context Switch | 28 |
Let the time taken to switch from user mode to kernel mode of execution be T1 while time taken to switch between two user processes be T2 Which of the following is correct T1 gt T2 T1 T2 T1 lt T2 Nothing can be said about the relation between T1 and T2 | Context Switch | 28 |
Which of the following actions is are typically not performed by the operating system when switching context from process A to process B Saving current register values and restoring saved register values for process B Changing address translation tables Swapping out the memory image of process A to the disk Invalidating the translation look aside buffer | Context Switch | 28 |
Which of the following actions is are typically not performed by the operating system when switching context from process A to process B Saving current register values and restoring saved register values for process B Changing address translation tables Swapping out the memory image of process A to the disk Invalidating the translation look aside buffer | Context Switch | 28 |
Which of the following actions is are typically not performed by the operating system when switching context from process A to process B Saving current register values and restoring saved register values for process B Changing address translation tables Swapping out the memory image of process A to the disk Invalidating the translation look aside buffer | Context Switch | 28 |
Which of the following actions is are typically not performed by the operating system when switching context from process A to process B Saving current register values and restoring saved register values for process B Changing address translation tables Swapping out the memory image of process A to the disk Invalidating the translation look aside buffer | Context Switch | 28 |
Which of the following actions is are typically not performed by the operating system when switching context from process A to process B Saving current register values and restoring saved register values for process B Changing address translation tables Swapping out the memory image of process A to the disk Invalidating the translation look aside buffer | Context Switch | 28 |
The function y 2 3x u200b a is continuous u2200 x u2208 R and differentiable u2200 x u2208 R b is continuous u2200 x u2208 R and differentiable u2200 x u2208 R except at x frac 3 2 c is continuous u2200 x u2208 R and differentiable u2200 x u2208 R except at x frac 2 3 d is continuous u2200 x u2208 R except x 3 and differentiable u2200 x u2208 R | Continuity | 29 |
Let f x x left frac 1 3 right and A denote the area of region bounded by f x and the X axis when x varies from 1 to 1 Which of the following statements is are TRUE f is continuous in 1 1 f is not bounded in 1 1 A is nonzero and finite II only III only II and III only I II and III | Continuity | 29 |
Let f x x left frac 1 3 right and A denote the area of region bounded by f x and the X axis when x varies from 1 to 1 Which of the following statements is are TRUE f is continuous in 1 1 f is not bounded in 1 1 A is nonzero and finite II only III only II and III only I II and III | Continuity | 29 |
A function f x is continuous in the interval 0 2 It is known that f 0 f 2 1 and f 1 1 Which one of the following statements must be true There exists a y in the interval 0 1 such that f y f y 1 For every y in the interval 0 1 f y f 2 y The maximum value of the function in the interval 0 2 is 1 There exists a y in the interval 0 1 such that f y f 2 y | Continuity | 29 |
Let f x x left frac 1 3 right and A denote the area of region bounded by f x and the X axis when x varies from 1 to 1 Which of the following statements is are TRUE f is continuous in 1 1 f is not bounded in 1 1 A is nonzero and finite II only III only II and III only I II and III | Continuity | 29 |
A function f x is continuous in the interval 0 2 It is known that f 0 f 2 1 and f 1 1 Which one of the following statements must be true There exists a y in the interval 0 1 such that f y f y 1 For every y in the interval 0 1 f y f 2 y The maximum value of the function in the interval 0 2 is 1 There exists a y in the interval 0 1 such that f y f 2 y | Continuity | 29 |
A function f x is continuous in the interval 0 2 It is known that f 0 f 2 1 and f 1 1 Which one of the following statements must be true There exists a y in the interval 0 1 such that f y f y 1 For every y in the interval 0 1 f y f 2 y The maximum value of the function in the interval 0 2 is 1 There exists a y in the interval 0 1 such that f y f 2 y | Continuity | 29 |
Let f x x left frac 1 3 right and A denote the area of region bounded by f x and the X axis when x varies from 1 to 1 Which of the following statements is are TRUE f is continuous in 1 1 f is not bounded in 1 1 A is nonzero and finite II only III only II and III only I II and III | Continuity | 29 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.