Question
stringlengths 39
1.33k
| Tag
stringlengths 3
46
| label
int64 0
206
|
|---|---|---|
The following bit pattern represents a floating point number in IEEE 754 single precision format 1 10000011 101000000000000000000000 The value of the number in decimal form is 10 13 26 None of the above | Ieee Representation | 83 |
In the IEEE floating point representation the hexadecimal value 0 ext x 00000000 corresponds to The normalized value 2 127 The normalized value 2 126 The normalized value 0 The special value 0 | Ieee Representation | 83 |
An index is clustered if it is on a set of fields that form a candidate key it is on a set of fields that include the primary key the data records of the file are organized in the same order as the data entries of the index the data records of the file are organized not in the same order as the data entries of the index | Indexing | 84 |
A file is organized so that the ordering of the data records is the same as or close to the ordering of data entries in some index Than that index is called Dense Sparse Clustered Unclustered | Indexing | 84 |
There are five records in a database Name Age Occupation Category Rama 27 CON A Abdul 22 ENG A Jennifer 28 DOC B Maya 32 SER D Dev 24 MUS C There is an index file associated with this and it contains the values 1 3 2 5 and 4 Which one of the fields is the index built from Age Name Occupation Category | Indexing | 84 |
A clustering index is defined on the fields which are of type non key and ordering non key and non ordering key and ordering key and non ordering | Indexing | 84 |
There are five records in a database Name Age Occupation Category Rama 27 CON A Abdul 22 ENG A Jennifer 28 DOC B Maya 32 SER D Dev 24 MUS C There is an index file associated with this and it contains the values 1 3 2 5 and 4 Which one of the fields is the index built from Age Name Occupation Category | Indexing | 84 |
An ext ISAM indexed sequential file consists of records of size 64 bytes each including key field of size 14 bytes An address of a disk block takes 2 bytes If the disk block size is 512 bytes and there are 16 K records compute the size of the data and index areas in terms of number blocks How many levels of ext tree do you have for the index | Indexing | 84 |
Consider a file of 16384 records Each record is 32 bytes long and its key field is of size 6 bytes The file is ordered on a non key field and the file organization is unspanned The file is stored in a file system with block size 1024 bytes and the size of a block pointer is 10 bytes If the secondary index is built on the key field of the file and a multi level index scheme is used to store the secondary index the number of first level and second level blocks in the multi level index are respectively 8 and 0 128 and 6 256 and 4 512 and 5 | Indexing | 84 |
Hari H Gita G Irfan I and Saira S are siblings i e brothers and sisters All were born on 1st January The age difference between any two successive siblings that is born one after another is less than three years Given the following facts Hari s age Gita s age gt Irfan s age Saira s age The age difference between Gita and Saira is one year However Gita is not the oldest and Saira is not the youngest There are no twins In what order they were born oldest first HSIG SGHI IGSH IHSG | Inference | 85 |
Hari H Gita G Irfan I and Saira S are siblings i e brothers and sisters All were born on 1st January The age difference between any two successive siblings that is born one after another is less than three years Given the following facts Hari s age Gita s age gt Irfan s age Saira s age The age difference between Gita and Saira is one year However Gita is not the oldest and Saira is not the youngest There are no twins In what order they were born oldest first HSIG SGHI IGSH IHSG | Inference | 85 |
Hari H Gita G Irfan I and Saira S are siblings i e brothers and sisters All were born on 1st January The age difference between any two successive siblings that is born one after another is less than three years Given the following facts Hari s age Gita s age gt Irfan s age Saira s age The age difference between Gita and Saira is one year However Gita is not the oldest and Saira is not the youngest There are no twins In what order they were born oldest first HSIG SGHI IGSH IHSG | Inference | 85 |
Hari H Gita G Irfan I and Saira S are siblings i e brothers and sisters All were born on 1st January The age difference between any two successive siblings that is born one after another is less than three years Given the following facts Hari s age Gita s age gt Irfan s age Saira s age The age difference between Gita and Saira is one year However Gita is not the oldest and Saira is not the youngest There are no twins In what order they were born oldest first HSIG SGHI IGSH IHSG | Inference | 85 |
Hari H Gita G Irfan I and Saira S are siblings i e brothers and sisters All were born on 1st January The age difference between any two successive siblings that is born one after another is less than three years Given the following facts Hari s age Gita s age gt Irfan s age Saira s age The age difference between Gita and Saira is one year However Gita is not the oldest and Saira is not the youngest There are no twins In what order they were born oldest first HSIG SGHI IGSH IHSG | Inference | 85 |
Hari H Gita G Irfan I and Saira S are siblings i e brothers and sisters All were born on 1st January The age difference between any two successive siblings that is born one after another is less than three years Given the following facts Hari s age Gita s age gt Irfan s age Saira s age The age difference between Gita and Saira is one year However Gita is not the oldest and Saira is not the youngest There are no twins In what order they were born oldest first HSIG SGHI IGSH IHSG | Inference | 85 |
Hari H Gita G Irfan I and Saira S are siblings i e brothers and sisters All were born on 1st January The age difference between any two successive siblings that is born one after another is less than three years Given the following facts Hari s age Gita s age gt Irfan s age Saira s age The age difference between Gita and Saira is one year However Gita is not the oldest and Saira is not the youngest There are no twins In what order they were born oldest first HSIG SGHI IGSH IHSG | Inference | 85 |
Hari H Gita G Irfan I and Saira S are siblings i e brothers and sisters All were born on 1st January The age difference between any two successive siblings that is born one after another is less than three years Given the following facts Hari s age Gita s age gt Irfan s age Saira s age The age difference between Gita and Saira is one year However Gita is not the oldest and Saira is not the youngest There are no twins In what order they were born oldest first HSIG SGHI IGSH IHSG | Inference | 85 |
Hari H Gita G Irfan I and Saira S are siblings i e brothers and sisters All were born on 1st January The age difference between any two successive siblings that is born one after another is less than three years Given the following facts Hari s age Gita s age gt Irfan s age Saira s age The age difference between Gita and Saira is one year However Gita is not the oldest and Saira is not the youngest There are no twins In what order they were born oldest first HSIG SGHI IGSH IHSG | Inference | 85 |
Hari H Gita G Irfan I and Saira S are siblings i e brothers and sisters All were born on 1st January The age difference between any two successive siblings that is born one after another is less than three years Given the following facts Hari s age Gita s age gt Irfan s age Saira s age The age difference between Gita and Saira is one year However Gita is not the oldest and Saira is not the youngest There are no twins In what order they were born oldest first HSIG SGHI IGSH IHSG | Inference | 85 |
Hari H Gita G Irfan I and Saira S are siblings i e brothers and sisters All were born on 1st January The age difference between any two successive siblings that is born one after another is less than three years Given the following facts Hari s age Gita s age gt Irfan s age Saira s age The age difference between Gita and Saira is one year However Gita is not the oldest and Saira is not the youngest There are no twins In what order they were born oldest first HSIG SGHI IGSH IHSG | Inference | 85 |
Hari H Gita G Irfan I and Saira S are siblings i e brothers and sisters All were born on 1st January The age difference between any two successive siblings that is born one after another is less than three years Given the following facts Hari s age Gita s age gt Irfan s age Saira s age The age difference between Gita and Saira is one year However Gita is not the oldest and Saira is not the youngest There are no twins In what order they were born oldest first HSIG SGHI IGSH IHSG | Inference | 85 |
Hari H Gita G Irfan I and Saira S are siblings i e brothers and sisters All were born on 1st January The age difference between any two successive siblings that is born one after another is less than three years Given the following facts Hari s age Gita s age gt Irfan s age Saira s age The age difference between Gita and Saira is one year However Gita is not the oldest and Saira is not the youngest There are no twins In what order they were born oldest first HSIG SGHI IGSH IHSG | Inference | 85 |
Hari H Gita G Irfan I and Saira S are siblings i e brothers and sisters All were born on 1st January The age difference between any two successive siblings that is born one after another is less than three years Given the following facts Hari s age Gita s age gt Irfan s age Saira s age The age difference between Gita and Saira is one year However Gita is not the oldest and Saira is not the youngest There are no twins In what order they were born oldest first HSIG SGHI IGSH IHSG | Inference | 85 |
int pi 4 _0 1 an x 1 an x dx 0 1 ln 2 1 2 ln 2 | Integration | 86 |
The value of the integral given below is int limits_0 pi x 2 cos x dx 2 pi pi pi 2 pi | Integration | 86 |
Compute the value of large int_ frac 1 pi frac 2 pi frac cos 1 x x 2 dx | Integration | 86 |
Compute the value of large int_ frac 1 pi frac 2 pi frac cos 1 x x 2 dx | Integration | 86 |
The value of the integral given below is int limits_0 pi x 2 cos x dx 2 pi pi pi 2 pi | Integration | 86 |
Let S sum_ i 3 100 i log_ 2 i and T int_ 2 100 x log_ 2 x dx Which of the following statements is true S gt T S T S lt T and 2S gt T 2S u2264 T | Integration | 86 |
The value of the integral given below is int limits_0 pi x 2 cos x dx 2 pi pi pi 2 pi | Integration | 86 |
Let S sum_ i 3 100 i log_ 2 i and T int_ 2 100 x log_ 2 x dx Which of the following statements is true S gt T S T S lt T and 2S gt T 2S u2264 T | Integration | 86 |
I O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting 2 programs through a pipe None of the above | Inter Process Communication | 87 |
I O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting 2 programs through a pipe None of the above | Inter Process Communication | 87 |
I O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting 2 programs through a pipe None of the above | Inter Process Communication | 87 |
I O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting 2 programs through a pipe None of the above | Inter Process Communication | 87 |
I O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting 2 programs through a pipe None of the above | Inter Process Communication | 87 |
I O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting 2 programs through a pipe None of the above | Inter Process Communication | 87 |
I O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting 2 programs through a pipe None of the above | Inter Process Communication | 87 |
I O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting 2 programs through a pipe None of the above | Inter Process Communication | 87 |
I O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting 2 programs through a pipe None of the above | Inter Process Communication | 87 |
I O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting 2 programs through a pipe None of the above | Inter Process Communication | 87 |
I O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting 2 programs through a pipe None of the above | Inter Process Communication | 87 |
I O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting 2 programs through a pipe None of the above | Inter Process Communication | 87 |
I O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting 2 programs through a pipe None of the above | Inter Process Communication | 87 |
I O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting 2 programs through a pipe None of the above | Inter Process Communication | 87 |
Consider the following relation schema pertaining to a students database Students rollno name address Enroll rollno courseno coursename where the primary keys are shown underlined The number of tuples in the student and Enroll tables are 120 and 8 respectively What are the maximum and minimum number of tuples that can be present in Student Enroll where u2018 u2019 denotes natural join 8 8 120 8 960 8 960 120 | Joins | 88 |
A database table T_1 has 2000 records and occupies 80 disk blocks Another table T_2 has 400 records and occupies 20 disk blocks These two tables have to be joined as per a specified join condition that needs to be evaluated for every pair of records from these two tables The memory buffer space available can hold exactly one block of records for T_1 and one block of records for T_2 simultaneously at any point in time No index is available on either table If instead of Nested loop join Block nested loop join is used again with the most appropriate choice of table in the outer loop the reduction in number of block accesses required for reading the data will be 0 30400 38400 798400 | Joins | 88 |
Consider the following relation schemas b Schema b name b city assets a Schema a num b name bal d Schema c name a number Let branch account and depositor be respectively instances of the above schemas Assume that account and depositor relations are much bigger than the branch relation Consider the following query u041fc name u03c3b city Agra u22c0 bal lt 0 branch u22c8 account u22c8 depositor Which one of the following queries is the most efficient version of the above query u041fc name u03c3bal lt 0 u03c3b city Agra branch u22c8 account u22c8 depositor u041fc name u03c3b city Agra branch u22c8 u03c3bal lt 0 account u22c8 depositor u041fc name u03c3b city Agra branch u22c8 u03c3b city Agra u22c0 bal lt 0 account u22c8 depositor u041fc name u03c3b city Agra branch u22c8 u03c3b city Agra u22c0 bal lt 0 account u22c8 depositor | Joins | 88 |
Consider the following relation schemas b Schema b name b city assets a Schema a num b name bal d Schema c name a number Let branch account and depositor be respectively instances of the above schemas Assume that account and depositor relations are much bigger than the branch relation Consider the following query u041fc name u03c3b city Agra u22c0 bal lt 0 branch u22c8 account u22c8 depositor Which one of the following queries is the most efficient version of the above query u041fc name u03c3bal lt 0 u03c3b city Agra branch u22c8 account u22c8 depositor u041fc name u03c3b city Agra branch u22c8 u03c3bal lt 0 account u22c8 depositor u041fc name u03c3b city Agra branch u22c8 u03c3b city Agra u22c0 bal lt 0 account u22c8 depositor u041fc name u03c3b city Agra branch u22c8 u03c3b city Agra u22c0 bal lt 0 account u22c8 depositor | Joins | 88 |
A database table T_1 has 2000 records and occupies 80 disk blocks Another table T_2 has 400 records and occupies 20 disk blocks These two tables have to be joined as per a specified join condition that needs to be evaluated for every pair of records from these two tables The memory buffer space available can hold exactly one block of records for T_1 and one block of records for T_2 simultaneously at any point in time No index is available on either table If Nested loop join algorithm is employed to perform the join with the most appropriate choice of table to be used in outer loop the number of block accesses required for reading the data are 800000 40080 32020 100 | Joins | 88 |
Consider the following relation schemas b Schema b name b city assets a Schema a num b name bal d Schema c name a number Let branch account and depositor be respectively instances of the above schemas Assume that account and depositor relations are much bigger than the branch relation Consider the following query u041fc name u03c3b city Agra u22c0 bal lt 0 branch u22c8 account u22c8 depositor Which one of the following queries is the most efficient version of the above query u041fc name u03c3bal lt 0 u03c3b city Agra branch u22c8 account u22c8 depositor u041fc name u03c3b city Agra branch u22c8 u03c3bal lt 0 account u22c8 depositor u041fc name u03c3b city Agra branch u22c8 u03c3b city Agra u22c0 bal lt 0 account u22c8 depositor u041fc name u03c3b city Agra branch u22c8 u03c3b city Agra u22c0 bal lt 0 account u22c8 depositor | Joins | 88 |
Consider the following relation schemas b Schema b name b city assets a Schema a num b name bal d Schema c name a number Let branch account and depositor be respectively instances of the above schemas Assume that account and depositor relations are much bigger than the branch relation Consider the following query u041fc name u03c3b city Agra u22c0 bal lt 0 branch u22c8 account u22c8 depositor Which one of the following queries is the most efficient version of the above query u041fc name u03c3bal lt 0 u03c3b city Agra branch u22c8 account u22c8 depositor u041fc name u03c3b city Agra branch u22c8 u03c3bal lt 0 account u22c8 depositor u041fc name u03c3b city Agra branch u22c8 u03c3b city Agra u22c0 bal lt 0 account u22c8 depositor u041fc name u03c3b city Agra branch u22c8 u03c3b city Agra u22c0 bal lt 0 account u22c8 depositor | Joins | 88 |
A database table T_1 has 2000 records and occupies 80 disk blocks Another table T_2 has 400 records and occupies 20 disk blocks These two tables have to be joined as per a specified join condition that needs to be evaluated for every pair of records from these two tables The memory buffer space available can hold exactly one block of records for T_1 and one block of records for T_2 simultaneously at any point in time No index is available on either table If instead of Nested loop join Block nested loop join is used again with the most appropriate choice of table in the outer loop the reduction in number of block accesses required for reading the data will be 0 30400 38400 798400 | Joins | 88 |
The literal count of a Boolean expression is the sum of the number of times each literal appears in the expression For example the literal count of left xy xz right is 4 What are the minimum possible literal counts of the product of sum and sum of product representations respectively of the function given by the following Karnaugh map Here X denotes don t care 11 9 9 13 9 10 11 11 | K Map | 89 |
Let wedge vee denote the meet and join operations of lattice A lattice is called distributive if for all x y z x wedge left y vee z right left x wedge y right vee left x wedge z right It is called complete if meet and join exist for every subset It is called modular if for all x y z z leq x Rightarrow x wedge left y vee z right left x wedge y right vee z The positive integers under divisibility ordering i e p leq q if p divides q forms a Complete lattice Modular but not distributive lattice Distributive lattice Lattice but not a complete lattice Under the give ordering positive integers do not form a lattice | Lattice | 90 |
Suppose L left p q r s t right is a lattice represented by the following Hasse diagram For any x y isin L not necessarily distinct x or y and x and y are join and meet of x y respectively Let L 3 left left x y z right x y z isin L right be the set of all ordered triplets of the elements of L Let p_ r be the probability that an element left x y z right isin L 3 chosen equiprobably satisfies x or y and z x or y and x or z Then p_r 0 p_r 1 0 lt p_r le frac 1 5 frac 1 5 lt p_r lt 1 | Lattice | 90 |
In the lattice defined by the Hasse diagram given in following figure how many complements does the element u2018e u2019 have 2 3 0 1 | Lattice | 90 |
S 1 2 2 1 is binary relation on set A 1 2 3 Is it irreflexive Add the minimum number of ordered pairs to S to make it an equivalence relation Give the modified S Let S a b and let square S be the powerset of S Consider the binary relation subseteq set inclusion on square S Draw the Hasse diagram corresponding to the lattice square S subseteq | Lattice | 90 |
Suppose L left p q r s t right is a lattice represented by the following Hasse diagram For any x y isin L not necessarily distinct x or y and x and y are join and meet of x y respectively Let L 3 left left x y z right x y z isin L right be the set of all ordered triplets of the elements of L Let p_ r be the probability that an element left x y z right isin L 3 chosen equiprobably satisfies x or y and z x or y and x or z Then p_r 0 p_r 1 0 lt p_r le frac 1 5 frac 1 5 lt p_r lt 1 | Lattice | 90 |
In the lattice defined by the Hasse diagram given in following figure how many complements does the element u2018e u2019 have 2 3 0 1 | Lattice | 90 |
The following is the Hasse diagram of the poset a b c d e u227a The poset is not a lattice a lattice but not a distributive lattice a distributive lattice but not a Boolean algebra a Boolean algebra | Lattice | 90 |
Suppose L left p q r s t right is a lattice represented by the following Hasse diagram For any x y isin L not necessarily distinct x or y and x and y are join and meet of x y respectively Let L 3 left left x y z right x y z isin L right be the set of all ordered triplets of the elements of L Let p_ r be the probability that an element left x y z right isin L 3 chosen equiprobably satisfies x or y and z x or y and x or z Then p_r 0 p_r 1 0 lt p_r le frac 1 5 frac 1 5 lt p_r lt 1 | Lattice | 90 |
What is the value of lim_ n o infty left 1 frac 1 n right 2n 0 e 2 e 1 2 1 | Limits | 91 |
lim _ x rightarrow 4 frac sin x 4 x 4 ____ | Limits | 91 |
The value of lim_ x rightarrow 1 frac x 7 2x 5 1 x 3 3x 2 2 is 0 is 1 is 1 does not exist | Limits | 91 |
lim _ x rightarrow 4 frac sin x 4 x 4 ____ | Limits | 91 |
lim _ x rightarrow 4 frac sin x 4 x 4 ____ | Limits | 91 |
The value of lim_ x rightarrow 1 frac x 7 2x 5 1 x 3 3x 2 2 is 0 is 1 is 1 does not exist | Limits | 91 |
The value of lim_ x rightarrow infty 1 x 2 e x is u00a0 0 frac 1 2 1 infty | Limits | 91 |
lim_ x rightarrow infty x frac 1 x is infty 0 1 Not defined | Limits | 91 |
lim_ x o infty frac x sin x x cos x equals 1 1 infty infty | Limits | 91 |
The line graph L G of a simple graph G is defined as follows There is exactly one vertex v e in L G for each edge e in G For any two edges e and e in G L G has an edge between v e and v e if and only if e and e are incident with the same vertex in G Which of the following statements is are TRUE P The line graph of a cycle is a cycle Q The line graph of a clique is a clique R The line graph of a planar graph is planar S The line graph of a tree is a tree A P only B P and R only C R only D P Q and S only | Line Graph | 92 |
The line graph L G of a simple graph G is defined as follows There is exactly one vertex v e in L G for each edge e in G For any two edges e and e in G L G has an edge between v e and v e if and only if e and e are incident with the same vertex in G Which of the following statements is are TRUE P The line graph of a cycle is a cycle Q The line graph of a clique is a clique R The line graph of a planar graph is planar S The line graph of a tree is a tree A P only B P and R only C R only D P Q and S only | Line Graph | 92 |
The line graph L G of a simple graph G is defined as follows There is exactly one vertex v e in L G for each edge e in G For any two edges e and e in G L G has an edge between v e and v e if and only if e and e are incident with the same vertex in G Which of the following statements is are TRUE P The line graph of a cycle is a cycle Q The line graph of a clique is a clique R The line graph of a planar graph is planar S The line graph of a tree is a tree A P only B P and R only C R only D P Q and S only | Line Graph | 92 |
The line graph L G of a simple graph G is defined as follows There is exactly one vertex v e in L G for each edge e in G For any two edges e and e in G L G has an edge between v e and v e if and only if e and e are incident with the same vertex in G Which of the following statements is are TRUE P The line graph of a cycle is a cycle Q The line graph of a clique is a clique R The line graph of a planar graph is planar S The line graph of a tree is a tree A P only B P and R only C R only D P Q and S only | Line Graph | 92 |
The line graph L G of a simple graph G is defined as follows There is exactly one vertex v e in L G for each edge e in G For any two edges e and e in G L G has an edge between v e and v e if and only if e and e are incident with the same vertex in G Which of the following statements is are TRUE P The line graph of a cycle is a cycle Q The line graph of a clique is a clique R The line graph of a planar graph is planar S The line graph of a tree is a tree A P only B P and R only C R only D P Q and S only | Line Graph | 92 |
The line graph L G of a simple graph G is defined as follows There is exactly one vertex v e in L G for each edge e in G For any two edges e and e in G L G has an edge between v e and v e if and only if e and e are incident with the same vertex in G Which of the following statements is are TRUE P The line graph of a cycle is a cycle Q The line graph of a clique is a clique R The line graph of a planar graph is planar S The line graph of a tree is a tree A P only B P and R only C R only D P Q and S only | Line Graph | 92 |
The line graph L G of a simple graph G is defined as follows There is exactly one vertex v e in L G for each edge e in G For any two edges e and e in G L G has an edge between v e and v e if and only if e and e are incident with the same vertex in G Which of the following statements is are TRUE P The line graph of a cycle is a cycle Q The line graph of a clique is a clique R The line graph of a planar graph is planar S The line graph of a tree is a tree A P only B P and R only C R only D P Q and S only | Line Graph | 92 |
The line graph L G of a simple graph G is defined as follows There is exactly one vertex v e in L G for each edge e in G For any two edges e and e in G L G has an edge between v e and v e if and only if e and e are incident with the same vertex in G Which of the following statements is are TRUE P The line graph of a cycle is a cycle Q The line graph of a clique is a clique R The line graph of a planar graph is planar S The line graph of a tree is a tree A P only B P and R only C R only D P Q and S only | Line Graph | 92 |
The line graph L G of a simple graph G is defined as follows There is exactly one vertex v e in L G for each edge e in G For any two edges e and e in G L G has an edge between v e and v e if and only if e and e are incident with the same vertex in G Which of the following statements is are TRUE P The line graph of a cycle is a cycle Q The line graph of a clique is a clique R The line graph of a planar graph is planar S The line graph of a tree is a tree A P only B P and R only C R only D P Q and S only | Line Graph | 92 |
The line graph L G of a simple graph G is defined as follows There is exactly one vertex v e in L G for each edge e in G For any two edges e and e in G L G has an edge between v e and v e if and only if e and e are incident with the same vertex in G Which of the following statements is are TRUE P The line graph of a cycle is a cycle Q The line graph of a clique is a clique R The line graph of a planar graph is planar S The line graph of a tree is a tree A P only B P and R only C R only D P Q and S only | Line Graph | 92 |
The line graph L G of a simple graph G is defined as follows There is exactly one vertex v e in L G for each edge e in G For any two edges e and e in G L G has an edge between v e and v e if and only if e and e are incident with the same vertex in G Which of the following statements is are TRUE P The line graph of a cycle is a cycle Q The line graph of a clique is a clique R The line graph of a planar graph is planar S The line graph of a tree is a tree A P only B P and R only C R only D P Q and S only | Line Graph | 92 |
The line graph L G of a simple graph G is defined as follows There is exactly one vertex v e in L G for each edge e in G For any two edges e and e in G L G has an edge between v e and v e if and only if e and e are incident with the same vertex in G Which of the following statements is are TRUE P The line graph of a cycle is a cycle Q The line graph of a clique is a clique R The line graph of a planar graph is planar S The line graph of a tree is a tree A P only B P and R only C R only D P Q and S only | Line Graph | 92 |
The line graph L G of a simple graph G is defined as follows There is exactly one vertex v e in L G for each edge e in G For any two edges e and e in G L G has an edge between v e and v e if and only if e and e are incident with the same vertex in G Which of the following statements is are TRUE P The line graph of a cycle is a cycle Q The line graph of a clique is a clique R The line graph of a planar graph is planar S The line graph of a tree is a tree A P only B P and R only C R only D P Q and S only | Line Graph | 92 |
The line graph L G of a simple graph G is defined as follows There is exactly one vertex v e in L G for each edge e in G For any two edges e and e in G L G has an edge between v e and v e if and only if e and e are incident with the same vertex in G Which of the following statements is are TRUE P The line graph of a cycle is a cycle Q The line graph of a clique is a clique R The line graph of a planar graph is planar S The line graph of a tree is a tree A P only B P and R only C R only D P Q and S only | Line Graph | 92 |
In a circular linked list oraganisation insertion of a record involves modification of One pointer Two pointers Multiple pointers No pointer | Linked Lists | 93 |
A circularly linked list is used to represent a Queue A single variable p is used to access the Queue To which node should p point such that both the operations ext enQueue and ext deQueue can be performed in constant time rear node front node not possible with a single pointer node next to front | Linked Lists | 93 |
Consider the following circuit composed of XOR gates and non inverting buffers The non inverting buffers have delays delta_1 2 ns and delta_2 4 ns as shown in the figure Both XOR gates and all wires have zero delay Assume that all gate inputs outputs and wires are stable at logic level 0 at time 0 If the following waveform is applied at input A how many transition s change of logic levels occur s at B during the interval from 0 to 10 ns 1 2 3 4 | Logic Gates | 94 |
The Boolean function obtained by adding an inverter to each and every input of an AND gate is OR XOR NAND NOR None of the above | Logic Gates | 94 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only All digital circuits can be realized using only Ex OR gates Multiplexers Half adders OR gates | Logic Gates | 94 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only All digital circuits can be realized using only Ex OR gates Multiplexers Half adders OR gates | Logic Gates | 94 |
The Boolean function obtained by adding an inverter to each and every input of an AND gate is OR XOR NAND NOR None of the above | Logic Gates | 94 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only All digital circuits can be realized using only Ex OR gates Multiplexers Half adders OR gates | Logic Gates | 94 |
Express the function f x y z xy yz with only one complement operation and one or more AND OR operations Draw the logic circuit implementing the expression obtained using a single NOT gate and one or more AND OR gates Transform the following logic circuit without expressing its switching function into an equivalent logic circuit that employs only 6 NAND gates each with 2 inputs | Logic Gates | 94 |
Choose the correct alternatives more than one may be correct and write the corresponding letters only All digital circuits can be realized using only Ex OR gates Multiplexers Half adders OR gates | Logic Gates | 94 |
The Boolean function obtained by adding an inverter to each and every input of an AND gate is OR XOR NAND NOR None of the above | Logic Gates | 94 |
The Boolean function obtained by adding an inverter to each and every input of an AND gate is OR XOR NAND NOR None of the above | Logic Gates | 94 |
Express the function f x y z xy yz with only one complement operation and one or more AND OR operations Draw the logic circuit implementing the expression obtained using a single NOT gate and one or more AND OR gates Transform the following logic circuit without expressing its switching function into an equivalent logic circuit that employs only 6 NAND gates each with 2 inputs | Logic Gates | 94 |
Consider the following program fragment for reversing the digits in a given integer to obtain a new integer Let n d_1 d_2 ldots d_m int n rev rev 0 while n gt 0 rev rev 10 n 10 n n 10 The loop invariant condition at the end of the i th iteration is n d_1 d_2 ldots d_ m i qquad mathbf and qquad ext rev d_m d_ m 1 ldots d_ m i 1 n d_ m i 1 ldots d_ m 1 d_m qquad mathbf or qquad ext rev d_ m i ldots d_2 d_1 n eq ext rev n d_1 d_2 ldots d_m qquad mathbf or qquad ext rev d_m ldots d_2 d_1 | Loop Invariants | 96 |
The following function computes X Y for positive integers X and Y int exp int X int Y int res 1 a X b Y while b 0 if b 2 0 a a a b b 2 else res res a b b 1 return res Which one of the following conditions is TRUE before every iteration of the loop X Y a b res a Y res X b X Y res a b X Y res a b | Loop Invariants | 96 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.