Question
stringlengths 39
1.33k
| Tag
stringlengths 3
46
| label
int64 0
206
|
|---|---|---|
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
The number of distinct simple graphs with up to three nodes is 15 10 7 9 | Counting | 32 |
How many distinct binary search trees can be created out of 4 distinct keys 5 14 24 42 | 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 |
The number of distinct simple graphs with up to three nodes is 15 10 7 9 | Counting | 32 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
State True or False with reason Logical data independence is easier to achieve than physical data independence | Data Independence | 34 |
State True or False with reason Logical data independence is easier to achieve than physical data independence | Data Independence | 34 |
State True or False with reason Logical data independence is easier to achieve than physical data independence | Data Independence | 34 |
State True or False with reason Logical data independence is easier to achieve than physical data independence | Data Independence | 34 |
State True or False with reason Logical data independence is easier to achieve than physical data independence | Data Independence | 34 |
State True or False with reason Logical data independence is easier to achieve than physical data independence | Data Independence | 34 |
State True or False with reason Logical data independence is easier to achieve than physical data independence | Data Independence | 34 |
State True or False with reason Logical data independence is easier to achieve than physical data independence | Data Independence | 34 |
State True or False with reason Logical data independence is easier to achieve than physical data independence | Data Independence | 34 |
State True or False with reason Logical data independence is easier to achieve than physical data independence | Data Independence | 34 |
State True or False with reason Logical data independence is easier to achieve than physical data independence | Data Independence | 34 |
State True or False with reason Logical data independence is easier to achieve than physical data independence | Data Independence | 34 |
State True or False with reason Logical data independence is easier to achieve than physical data independence | Data Independence | 34 |
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 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 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 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 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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
Let L be a language over Sigma i e L subseteq Sigma Suppose L satisfies the two conditions given below L is in NP and For every n there is exactly one string of length n that belongs to L Let L c be the complement of L over Sigma Show that L c is also in NP | Decidability | 38 |
Answer the following questions Which of the following problems are undecidable Membership problem in context free languages Whether a given context free language is regular Whether a finite state automation halts on all inputs Membership problem for type 0 languages | Decidability | 38 |
Choose the correct alternatives More than one may be correct It is undecidable whether An arbitrary Turing machine halts after 100 steps A Turing machine prints a specific letter A Turing machine computes the products of two numbers None of the above | Decidability | 38 |
Which one of the following is not decidable Given a Turing machine M a string s and an integer k M accepts s within k steps Equivalence of two given Turing machines Language accepted by a given finite state machine is not empty Language generated by a context free grammar is non empty | Decidability | 38 |
Answer the following questions Which of the following problems are undecidable Membership problem in context free languages Whether a given context free language is regular Whether a finite state automation halts on all inputs Membership problem for type 0 languages | Decidability | 38 |
Let L be a language over Sigma i e L subseteq Sigma Suppose L satisfies the two conditions given below L is in NP and For every n there is exactly one string of length n that belongs to L Let L c be the complement of L over Sigma Show that L c is also in NP | Decidability | 38 |
Let L be a language over Sigma i e L subseteq Sigma Suppose L satisfies the two conditions given below L is in NP and For every n there is exactly one string of length n that belongs to L Let L c be the complement of L over Sigma Show that L c is also in NP | Decidability | 38 |
How many 3 to 8 line decoders with an enable input are needed to construct a 6 to 64 line decoder without using any other logic gates 7 8 9 10 | Decoder | 39 |
How many 3 to 8 line decoders with an enable input are needed to construct a 6 to 64 line decoder without using any other logic gates 7 8 9 10 | Decoder | 39 |
How many 3 to 8 line decoders with an enable input are needed to construct a 6 to 64 line decoder without using any other logic gates 7 8 9 10 | Decoder | 39 |
How many 3 to 8 line decoders with an enable input are needed to construct a 6 to 64 line decoder without using any other logic gates 7 8 9 10 | Decoder | 39 |
How many 3 to 8 line decoders with an enable input are needed to construct a 6 to 64 line decoder without using any other logic gates 7 8 9 10 | Decoder | 39 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.