Register

These questions are basic level ones and can be answered in less than a minute if you have seen the topic.

Recent questions tagged easy

0 votes
0 answers
182
Michael Sipser Edition 3 Exercise 0 Question 7 (Page No. 26)
For each part, give a relation that satisfies the condition. Reflexive and symmetric but not transitive Reflexive and transitive but not symmetric Symmetric and transitive but not reflexive
For each part, give a relation that satisfies the condition.Reflexive and symmetric but not transitiveReflexive and transitive but not symmetricSymmetric and transitive b...
User Avatar
0 votes
2 answers
184
Michael Sipser Edition 3 Exercise 0 Question 5 (Page No. 26)
If C is a set with c elements, how many elements are in the power set of C? Explain your answer.
If C is a set with c elements, how many elements are in the power set of C? Explain your answer.
User Avatar
0 votes
1 answer
185
Michael Sipser Edition 3 Exercise 0 Question 4 (Page No. 26)
If A has a elements and B has b elements, how many elements are in A × B? Explain your answer.
If A has a elements and B has b elements, how many elements are in A × B? Explain your answer.
User Avatar
0 votes
1 answer
186
Michael Sipser Edition 3 Exercise 0 Question 3 (Page No. 26)
Let A be the set {x, y, z} and B be the set {x, y}. a. Is A a subset of B? b. Is B a subset of A? c. What is A ∪ B? d. What is A ∩ B? e. What is A × B? f. What is the power set of B?
Let A be the set {x, y, z} and B be the set {x, y}.a. Is A a subset of B?b. Is B a subset of A?c. What is A ∪ B?d. What is A ∩ B?e. What is A × B?f. What is the powe...
User Avatar
2 votes
1 answer
192
GATE2019 CE-1: GA-2
They have come a long way in ________ trust among the users. creating created creation create
They have come a long way in ________ trust among the users.creatingcreatedcreationcreate
User Avatar
0 votes
2 answers
195
GATE2019 ME-2: GA-3
If IMHO=JNIP; IDK=JEL; and SO=TP, then IDC=______ JDE JED JDC JCD
If IMHO=JNIP; IDK=JEL; and SO=TP, then IDC=______JDEJEDJDCJCD
User Avatar
14 votes
6 answers
196
GATE CSE 2019 | Question: 24
Consider the following C program: #include <stdio.h> int main() { int arr[]={1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 5}, *ip=arr+4; printf(“%d\n”, ip[1]); return 0; } The number that will be displayed on execution of the program is _______
Consider the following C program:#include <stdio.h int main() { int arr[]={1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 5}, *ip=arr+4; printf(“%d\n”, ip ); return 0; }The numb...
User Avatar
0 votes
0 answers
197
RUN TIME error
why this program given run time error #include<stdio.h> int main ( ) { int x = 2, y = 5; if (x < y) return (x = x+y); else printf(“%d “,x); printf(“%d”,y); } https://ideone.com/AqYv40
why this program given run time error #include<stdio.h int main ( ) { int x = 2, y = 5; if (x < y) return (x = x+y); else printf(“%d “,x); printf(“%d”,y); }https:...
User Avatar
0 votes
1 answer
198
DS and programming
in a sorted array of n distinct element finding i th largest element take o(1) . true / false
in a sorted array of n distinct element finding i th largest element take o(1) . true / false
User Avatar
2 votes
1 answer
199
Complexity
An unordered list contains n distinct elements. Number of comparisons to find element larger than second minimum is O(1) O(n) None
An unordered list contains n distinct elements. Number of comparisons to find element larger than second minimum isO(1)O(n)None
User Avatar
0 votes
0 answers
201
Determinant
True and false IF A is 5*5 matrix then det(4$A^{3}$)=$4^{5}det(A^{3}))$ det($(4A)^{3}$)=$det(4^{3}A^{3}))$ i think both are true ??
True and falseIF A is 5*5 matrix thendet(4$A^{3}$)=$4^{5}det(A^{3}))$det($(4A)^{3}$)=$det(4^{3}A^{3}))$i think both are true ??
User Avatar
1 votes
1 answer
203
sudo gate test series
If the bandwidth of a medium is 100 Mbps and round-trip time is 50 microseconds then calculate the sequence bits in Go Back N ARQ flow control policy is applied and frame size 100 bits has to be transfer. A ) 5 B) 6 C) 7 D) None of these
If the bandwidth of a medium is 100 Mbps and round-trip time is 50 microseconds then calculate the sequence bits in Go Back N ARQ flow control policy is applied and frame...
User Avatar
0 votes
0 answers
204
Testbook test series
In th sliding window protocol if the transmission delay is 2ms ,propagation delay 149 ms and 7 bit is fixed for sequence no field ,find maximum efficiency?
In th sliding window protocol if the transmission delay is 2ms ,propagation delay 149 ms and 7 bit is fixed for sequence no field ,find maximum efficiency?
User Avatar
1 votes
2 answers
206
Invertible Matrix
Let A be a $5 × 5$ invertible matrix with row sums $1$. That is $\sum_{j=1}^{5} a_{ij} = 1$ for $1 \leq i\leq 5$. Then, what is the sum of all entries of $A^{-1}$.
Let A be a $5 × 5$ invertible matrix with row sums $1$. That is $\sum_{j=1}^{5} a_{ij} = 1$ for $1 \leq i\leq 5$. Then, what is the sum of all entries of $A^{-1}$.
User Avatar
0 votes
1 answer
209
workbook
An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither 2nd maximum nor 2nd minimum is Θ(nlogn) Θ(n) Θ(logn) Θ(1)
An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither 2nd maximum nor 2nd minimum isΘ(nlogn)Θ(n)Θ(l...
User Avatar
0 votes
1 answer
210
Self Doubt
if we have $n$ consecutive $1s$ in binary then its magnitude is $2^n -1$ similarly ,do we have any short cut like ,if we have $n$ consecutive $1s$ after a decimal point then the magnitude will be $1-2^n$ ?
if we have $n$ consecutive $1s$ in binary then its magnitude is $2^n -1$similarly ,do we have any short cut like ,if we have $n$ consecutive $1s$ after a decimal point...
User Avatar
Page: