Question
stringlengths 39
1.33k
| Tag
stringlengths 3
46
| label
int64 0
206
|
|---|---|---|
Consider the Boolean operator with the following properties x 0 x x 1 overline x x x 0 and x overline x 1 Then x y is equivalent to x overline y overline x y x overline y overline x overline y overline x y xy xy overline x overline y | Boolean Expressions | 13 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only The operation which is commutative but not associative is AND OR EX OR NAND | Boolean Operations | 14 |
When multiplicand Y is multiplied by multiplier X x_ n 1 x_ n 2 dots x_0 using bit pair recoding in Booth s algorithm partial products are generated according to the following table Row xi 1 xi xi 1 Partial Product 1 0 0 0 0 2 0 0 1 Y 3 0 1 0 Y 4 0 1 1 2Y 5 1 0 0 6 1 0 1 Y 7 1 1 0 Y 8 1 1 1 The partial products for rows 5 and 8 are 2Y and Y 2Y and 2Y 2Y and 0 0 and Y | Booth Recoding | 15 |
Using Booth s Algorithm for multiplication the multiplier 57 will be recoded as 0 1 0 0 1 0 0 1 1 1 0 0 0 1 1 1 0 1 0 0 1 0 0 0 0 1 0 0 1 0 0 1 | Booths Algorithm | 16 |
The two numbers given below are multiplied using the Booth s algorithm Multiplicand 0101 1010 1110 1110 Multiplier 0111 0111 1011 1101 How many additions Subtractions are required for the multiplication of the above two numbers 6 8 10 12 | Booths Algorithm | 16 |
Booth u2019s algorithm for integer multiplication gives worst performance when the multiplier pattern is 101010 u2026 1010 100000 u2026 0001 111111 u2026 1111 011111 u2026 1110 | Booths Algorithm | 16 |
Booth s coding in 8 bits for the decimal number 57 is 0 100 1000 0 100 100 1 0 1 100 10 1 00 10 100 1 | Booths Algorithm | 16 |
The maximum number of superkeys for the relation schema R E F G H with E as the key is _____ | Candidate Keys | 17 |
Given an instance of the STUDENTS relation as shown as below StudentID StudentName StudentEmail StudentAge CPI 2345 Shankar Shankar math X 9 4 1287 Swati swati ee 19 9 5 7853 Shankar Shankar cse 19 9 4 9876 Swati swati mech 18 9 3 8765 Ganesh ganesh civil 19 8 7 For StudentName StudentAge to be a key for this instance the value X should NOT be equal to______ | Candidate Keys | 17 |
Consider a relational table with a single record for each registered student with the following attributes ext Registration_Num Unique registration number for each registered student ext UID Unique identity number unique at the national level for each citizen ext BankAccount_Num Unique account number at the bank A student can have multiple accounts or joint accounts This attribute stores the primary account number ext Name Name of the student ext Hostel_Room Room number of the hostel Which of the following options is INCORRECT A ext BankAccount_Num is a candidate key B ext Registration_Num can be a primary key C ext UID is a candidate key if all students are from the same country D If S is a super key such that S cap ext UID is ext NULL then S cup ext UID is also a superkey | Candidate Keys | 17 |
An instance of a relational scheme R A B C has distinct values for attribute A Can you conclude that A is a candidate key for R | Candidate Keys | 17 |
A prime attribute of a relation scheme R is an attribute that appears in all candidate keys of R in some candidate key of R in a foreign key of R only in the primary key of R | Candidate Keys | 17 |
The total number of prime implicants of the function f w x y z sum 0 2 4 5 6 10 is __________ | Canonical Normal Form | 18 |
The minterm expansion of f P Q R PQ Q bar R P bar R is m_2 m_4 m_6 m_7 m_0 m_1 m_3 m_5 m_0 m_1 m_6 m_7 m_2 m_3 m_4 m_5 | Canonical Normal Form | 18 |
Given the function F P QR where F is a function in three Boolean variables P Q and R and P P consider the following statements S1 F sum 4 5 6 S2 F sum 0 1 2 3 7 S3 F Pi 4 5 6 S4 F Pi 0 1 2 3 7 Which of the following is true S1 False S2 True S3 True S4 False S1 True S2 False S3 False S4 True S1 False S2 False S3 True S4 True S1 True S2 True S3 False S4 False | Canonical Normal Form | 18 |
Given f_1 f_3 and f in canonical sum of products form in decimal for the circuit f_1 Sigma m 4 5 6 7 8 f_3 Sigma m 1 6 15 f Sigma m 1 6 8 15 hen f_2 is Sigma m 4 6 Sigma m 4 8 Sigma m 6 8 Sigma m 4 6 8 | Canonical Normal Form | 18 |
Find the minimum product of sums of the following expression f ABC bar A bar B bar C | Canonical Normal Form | 18 |
Consider the following logic circuit whose inputs are functions f_1 f_2 f_3 and output is f Given that f_1 x y z Sigma 0 1 3 5 f_2 x y z Sigma 6 7 and f x y z Sigma 1 4 5 f_3 is Sigma 1 4 5 Sigma 6 7 Sigma 0 1 3 5 None of the above | Canonical Normal Form | 18 |
A Boolean expression is an expression made out of propositional letters such as p q r and operators wedge vee and eg e g p wedge eg q vee eg r An expression is said to be in sum of product form also called disjunctive normal form if all eg occur just before letters and no vee occurs in scope of wedge e g p wedge eg q vee eg p wedge q The expression is said to be in product of sum form also called conjunctive normal form if all negations occur just before letters and no wedge occurs in the scope of vee e g p vee eg q wedge eg p vee q Which of the following is not correct Every Boolean expression is equivalent to an expression is sum of product form Every Boolean expression is equivalent to an expression in product of sum form Every Boolean expression is equivalent to an expression without vee operator Every Boolean expression is equivalent to an expression without wedge operator Every Boolean expression is equivalent to an expression without eg operator | Canonical Normal Form | 18 |
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 |
The logic expression for the output of the circuit shown in figure below is overline AC overline BC CD A overline C B overline C CD ABC overline C overline D overline A overline B overline B overline C CD | Circuit Output | 20 |
The following arrangement of master slave flip flops has the initial state of P Q as 0 1 respectively After a clock cycle the output state P Q is respectively 1 0 1 1 0 0 0 1 | Circuit Output | 20 |
Multiple choices can be correct Mark all of them For the initial state of 000 the function performed by the arrangement of the J K flip flops in figure is Shift Register Mod 3 Counter Mod 6 Counter Mod 2 Counter None of the above | Circuit Output | 20 |
Find the contents of the flip flop Q_2 Q_1 and Q_0 in the circuit of figure after giving four clock pulses to the clock terminal Assume Q_2Q_1Q_0 000 initially | Circuit Output | 20 |
Consider the partial implementation of a 2 bit counter using T flip flops following the sequence 0 2 3 1 0 as shown below To complete the circuit the input X should be Q_2 c Q_2 Q_1 left Q_1 Q_2 right c Q_1 oplus Q_2 | Circuit Output | 20 |
Consider the following multiplexer where 10 11 12 13 are four data input lines selected by two address line combinations A1A0 00 01 10 11 respectively and f is the output of the multiplexor EN is the Enable input The function f x y z implemented by the above circuit is xyz xy z x y None of the above | Circuit Output | 20 |
Consider the following circuit with initial state Q_0 Q_1 0 The D Flip flops are positive edged triggered and have set up times 20 nanosecond and hold times 0 Consider the following timing diagrams of X and C The clock period of C geq 40 nanosecond Which one is the correct plot of Y | Circuit Output | 20 |
Consider the following circuit involving a positive edge triggered D FF Consider the following timing diagram Let A_ i represents the logic level on the line a in the i th clock period Let A represent the compliment of A The correct output sequence on Y over the clock periods 1 through 5 is A_ 0 A_ 1 A_ 1 A_ 3 A_ 4 A_ 0 A_ 1 A_ 2 A_ 3 A_ 4 A_ 1 A_ 2 A_ 2 A_ 3 A_ 4 A_ 1 A_ 2 A_ 3 A_ 4 A_ 5 | Circuit Output | 20 |
Consider the following circuit The flip flops are positive edge triggered D FFs Each state is designated as a two bit string Q_0Q_1 Let the initial state be 00 The state transition sequence is | Circuit Output | 20 |
Consider the circuit shown below In a certain steady state the line Y is at 1 What are the possible values of A B and C in this state A 0 B 0 C 1 A 0 B 1 C 1 A 1 B 0 C 1 A 1 B 1 C 1 | Circuit Output | 20 |
Consider the circuit in figure f implements overline A overline B C overline A B overline C ABC A B C A oplus B oplus C AB BC CA | Circuit Output | 20 |
Consider the circuit in Fig 2 21 which has a four bit binary number b_3b_2b_1b_0 as input and a five bit binary number d_4d_3d_2d_1d_0 as output Binary to Hex conversion Binary to BCD conversion Binary to grey code conversion Binary to radix 12 conversion | Circuit Output | 20 |
Consider a logic circuit shown in figure below The functions f_1 f_2 ext and f in canonical sum of products form in decimal notation are f_1 w x y z sum 8 9 10 f_2 w x y z sum 7 8 12 13 14 15 f w x y z sum 8 9 The function f_3 is sum 9 10 sum 9 sum 1 8 9 sum 8 10 15 | Circuit Output | 20 |
Analyse the circuit in Fig below and complete the following table a b Q_n 0 0 0 1 1 0 1 1 | Circuit Output | 20 |
A two way switch has three terminals a b and c In ON position logic value 1 a is connected to b and in OFF position a is connected to c Two of these two way switches S1 and S2 are connected to a bulb as shown below Which of the following expressions if true will always result in the lighting of the bulb S1 overline S2 S1 S2 overline S1 oplus S2 S1 oplus S2 | Circuit Output | 20 |
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 |
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 be a context free language and M a regular language Then the language L u2229 M is always regular never regular always a deterministic context free language always a context free language | Closure Property | 22 |
Context free languages and regular languages are both closed under the operation s of Union Intersection Concatenation Complementation | 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 |
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 |
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 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 |
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 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 |
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 |
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 |
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 |
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 |
State whether the following statements are TRUE or FALSE The intersection of two CFL s is also a CFL | Context Free Language | 27 |
Show that the language L left xcx mid x in left 0 1 right ext and c ext is a terminal symbol right is not context free c is not 0 or 1 | Context Free Language | 27 |
Let L_1 0 n m 1 n0 m mid n m geq 0 L_2 0 n m 1 n m 0 m mid n m geq 0 and L_3 0 n m 1 n m 0 n m mid n m geq 0 Which of these languages are NOT context free L_1 only L_3 only L_1 and L_2 L_2 and L_3 | Context Free Language | 27 |
Let G left left S right left a b right R S right be a context free grammar where the rule set R is S o a S b mid S S mid epsilon Which of the following statements is true G is not ambiguous There exist x y in L G such that xy otin L G There is a deterministic pushdown automaton that accepts L G We can find a deterministic finite state automaton that accepts L G | Context Free Language | 27 |
In the context free grammar below S is the start symbol a and b are terminals and epsilon denotes the empty string S o aSAb mid epsilon A o bA mid epsilon The grammar generates the language a b b a mb n mid m leq n a mb n mid m n a b | Context Free Language | 27 |
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 |
Define a context free languages L in 0 1 ext init L u mid uv in L for some v in 0 1 in other words ext init L is the set of prefixes of L Let L w mid w ext is nonempty and has an equal number of 0 u2019s and 1 u2019s Then ext init L is the set of all binary strings with unequal number of 0 u2019s and 1 u2019s the set of all binary strings including null string the set of all binary strings with exactly one more 0 than the number of 1 u2019s or one more 1 than the number of 0 u2019s None of the above | Context Free Language | 27 |
Context free languages are closed under Union intersection Union Kleene closure Intersection complement Complement Kleene closure | Context Free Language | 27 |
Consider the languages L_1 left ww R mid w in 0 1 right L_2 left w ext w R mid w in 0 1 right where ext is a special symbol L_3 left ww mid w in 0 1 right Which one of the following is TRUE L_1 is a deterministic CFL L_2 is a deterministic CFL L_3 is a CFL but not a deterministic CFL L_3 is a deterministic CFL | Context Free Language | 27 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only If G is a context free grammar and w is a string of length l in L G how long is a derivation of w in G if G is in Chomsky normal form 2l 2l 1 2l 1 l | Context Free Language | 27 |
A context free grammar is ambiguous if The grammar contains useless non terminals It produces more than one parse tree for some sentence Some production has two non terminals side by side on the right hand side None of the above | 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 |
Construct as minimal finite state machine that accepts the language over 0 1 of all strings that contain neither the sub string 00 nor the sub string 11 Consider the grammar S u2192 aSAb S u2192 u220a A u2192 bA A u2192 u220a where S A are non terminal symbols with S being the start symbol a b are terminal symbols and epsilon is the empty string This grammar generates strings of the form a ib i for some i j geq 0 where i and j satisfy some condition What is the condition on the values of i and j | 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 |
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 |
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 |
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 |
The cost function for a product in a firm is given by 5q 2 where q is the amount of production The firm can sell the product at a market price of u20b9 50 per unit The number of units to be produced by the firm such that the profit is maximized is A 5 B 10 C 15 D 25 | Cost Market Price | 30 |
Given Sigma a b which one of the following sets is not countable a Set of all strings over Sigma b Set of all languages over Sigma c Set of all regular languages over Sigma d Set of all languages over Sigma accepted by Turing machines | Countable Set | 31 |
What is the minimum number of ordered pairs of non negative numbers that should be chosen to ensure that there are two pairs a b and c d in the chosen set such that a equiv c mod 3 and b equiv d mod 5 4 6 16 24 | Counting | 32 |
The number of distinct simple graphs with up to three nodes is 15 10 7 9 | Counting | 32 |
Let G be a complete undirected graph on 6 vertices If vertices of G are labeled then the number of distinct cycles of length 4 in G is equal to 15 30 90 360 | Counting | 32 |
How many undirected graphs not necessarily connected can be constructed out of a given set V v_1 v_2 dots v_n of n vertices frac n n 1 2 2 n n 2 frac n n 1 2 | Counting | 32 |
How many graphs on n labeled vertices exist which have at least frac n 2 3n 2 edges left frac n 2 n 2 right C_ left frac n 2 3n 2 right large sum limits_ k 0 left frac n 2 3n 2 right left n 2 n right C_k left frac n 2 n 2 right C_n large sum limits_ k 0 n left frac n 2 n 2 right C_k | Counting | 32 |
How many distinct binary search trees can be created out of 4 distinct keys 5 14 24 42 | Counting | 32 |
An undirected graph is complete if there is an edge between every pair of vertices Given a complete undirected graph on n vertices in how many ways can you choose a direction for the edges so that there are no directed cycles n frac n n 1 2 n 2 n 2 m ext where m frac n n 1 2 | Counting | 32 |
A critical region is One which is enclosed by a pair of P and V operations on semaphores A program segment that has not been proved bug free A program segment that often causes unexpected system crashes A program segment where shared resources are accessed | Critical Section | 33 |
State True or False with reason Logical data independence is easier to achieve than physical data independence | Data Independence | 34 |
The table below has question wise data on the performance of students in an examination The marks for each question are also listed There is no negative or partial marking in the examination Q No Marks Answered Correctly Answered Wrongly Not Attempted 1 2 21 17 6 2 3 15 27 2 3 2 23 18 3 What is the average of the marks obtained by the class in the examination 1 34 1 74 3 02 3 91 | Data Interpretation | 35 |
The ratio of male to female students in a college for five years is plotted in the following line graph If the number of female students doubled in 2009 by what percent did the number of male students increase in 2009 | Data Interpretation | 35 |
The pie chart below has the breakup of the number of students from different departments in an engineering college for the year 2012 The proportion of male to female students in each department is 5 4 There are 40 males in Electrical Engineering What is the difference between the numbers of female students in the civil department and the female students in the Mechanical department | Data Interpretation | 35 |
In a survey 300 respondents were asked whether they own a vehicle or not If yes they were further asked to mention whether they own a car or scooter or both Their responses are tabulated below What percent of respondents do not own a scooter Men Women Own vehicle Car 40 34 Scooter 30 20 Both 60 46 Do not own vehicle 20 50 | Data Interpretation | 35 |
An air pressure contour line joins locations in a region having the same atmospheric pressure The following is an air pressure contour plot of a geographical religion Contour lines are shown at 0 05 bar intervals in this plot If the possibility of a thunderstorm is given by how fast air pressure rises or drops over a region which of the following regions is most likely to have a thunderstorm P Q R S | Data Interpretation | 35 |
A contour line joins locations having the same height above the mean sea level The following is a contour plot of a geographical region Contour lines are shown at 25 m intervals in this plot If in a flood the water level rises to 525 m which of the villages P Q R S T get submerged P Q P Q T R S T Q R S | Data Interpretation | 35 |
The exports and imports in crores of Rs of a country from the year 2000 to 2007 are given in the following bar chart In which year is the combined percentage increase in imports and exports the highest | Data Interpretation | 35 |
P Q R and S are four types of dangerous microbes recently found in a human habitat The area of each circle with its diameter printed in brackets represents the growth of a single microbe surviving human immunity system within 24 hours of entering the body The danger to human beings varies proportionately with the toxicity potency and growth attributed to a microbe shown in the figure below A pharmaceutical company is contemplating the development of a vaccine against the most dangerous microbe Which microbe should the company target in its first attempt P Q R S | Data Interpretation | 35 |
f x 1 x 1 f x 1 x 1 f x 2 x 1 f x 2 x 1 | Data Interpretation | 35 |
An ER model of a database consists of entity types A and B These are connected by a relationship R which does not have its own attribute Under which one of the following conditions can the relational table for R be merged with that of A Relationship R is one to many and the participation of A in R is total Relationship R is one to many and the participation of A in R is partial Relationship R is many to one and the participation of A in R is total Relationship R is many to one and the participation of A in R is partial | Database | 36 |
Which normal form is considered adequate for normal relational database design 2NF 5NF 4NF 3NF | Database Normalization | 37 |
The relation scheme ext Student Performance name courseNo rollNo grade has the following functional dependencies name courseNo rightarrow grade rollNo courseNo rightarrow grade name rightarrow rollNo rollNo rightarrow name The highest normal form of this relation scheme is 2NF 3NF ext BCNF 4NF | Database Normalization | 37 |
State True or False with reason There is always a decomposition into Boyce Codd normal form BCNF that is lossless and dependency preserving | Database Normalization | 37 |
Relation R is decomposed using a set of functional dependencies F and relation S is decomposed using another set of functional dependencies G One decomposition is definitely ext BCNF the other is definitely 3NF but it is not known which is which To make a guaranteed identification which one of the following tests should be used on the decompositions Assume that the closures of F and G are available Dependency preservation Lossless join ext BCNF definition 3NF definition | Database Normalization | 37 |
R A B C D is a relation Which of the following does not have a lossless join dependency preserving BCNF decomposition A rightarrow B B rightarrow CD A rightarrow B B rightarrow C C rightarrow D AB rightarrow C C rightarrow AD A rightarrow BCD | Database Normalization | 37 |
For relation R L M N O P the following dependencies hold M rightarrow O NO rightarrow P P rightarrow L and L rightarrow MN R is decomposed into R1 L M N P and R2 M O Is the above decomposition a lossless join decomposition Explain Is the above decomposition dependency preserving If not list all the dependencies that are not preserved What is the highest normal form satisfied by the above decomposition | Database Normalization | 37 |
Consider the schema R S T U V and the dependencies S rightarrow T T rightarrow U U rightarrow V and V rightarrow S Let R R1 ext and R2 be a decomposition such that R1 cap R2 eq phi The decomposition is not in 2NF in 2NF but not 3NF in 3NF but not in 2NF in both 2NF and 3NF | Database Normalization | 37 |
Consider the relation scheme R A B C with the following functional dependencies A B u2192 C C u2192 A Show that the scheme R is in 3NF but not in ext BCNF Determine the minimal keys of relation R | Database Normalization | 37 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.