Dark Mode

Answers by akash.dinkar12

6 votes

61

GATE CSE 1996 | Question: 1.1
Let $A$ and $B$ be sets and let $A^c$ and $B^c$ denote the complements of the sets $A$ and $B$. The set $(A-B) \cup (B-A) \cup (A \cap B)$ is equal to $A \cup B$ $A^c \cup B^c$ $A \cap B$ $A^c \cap B^c$

answered in Set Theory & Algebra Jul 22, 2017

6.0k views

18 votes

62

GATE CSE 2008 | Question: 2
If $P, Q, R$ are subsets of the universal set U, then $(P\cap Q\cap R) \cup (P^c \cap Q \cap R) \cup Q^c \cup R^c$ is $Q^c \cup R^c$ $P \cup Q^c \cup R^c$ $P^c \cup Q^c \cup R^c$ U

answered in Set Theory & Algebra Jul 22, 2017

9.3k views

35 votes

63

GATE IT 2006 | Question: 23
Let $P$, $Q$ and $R$ be sets let Δ denote the symmetric difference operator defined as $PΔQ=(P \cup Q) - (P ∩ Q).$ Using Venn diagrams, determine which of the following is/are TRUE? $PΔ (Q ∩ R) = (P Δ Q) ∩ (P Δ R)$ $P ∩ (Q ∩ R) = (P ∩ Q) Δ (P Δ R)$ I only II only Neither I nor II Both I and II

answered in Set Theory & Algebra Jul 22, 2017

5.7k views

20 votes

64

GATE CSE 2006 | Question: 22
Let $E, F$ and $G$ be finite sets. Let $X = (E ∩ F) - (F ∩ G)$ and $Y = (E - (E ∩ G)) - (E - F)$. Which one of the following is true? $X ⊂ Y$ $X ⊃ Y$ $X = Y$ $X - Y ≠ \emptyset$ and $Y - X ≠ \emptyset$

answered in Set Theory & Algebra Jul 22, 2017

6.5k views

1 vote

65

Test by Bikram | Mathematics | Test 2 | Question: 28
What is the solution of the following recurrence relation? $a_n = 6.a_{n-1} - 9.a_{n-2}$ Base cases : $a_0 = 1$ and $a_1 = 6$. $3n$ $2.3n$ $3n + n.3n$ $3n - n.3n$

answered in Mathematical Logic Jul 20, 2017

226 views

4 votes

66

Macros
# include <stdio.h> # define scanf "%s GeeksQuiz" int main() { printf(scanf, scanf); return 0; } (A) Compiler Error (B) %s Geeks Quiz (C) Geeks Quiz (D) %s Geeks Quiz Geeks Quiz

answered in Programming in C Jul 18, 2017

1.5k views

0 votes

67

computer org
A 32 bit machine processor has 32 registers, each of it is 16 bit long.Each instruction is specified with 4 fields, namely operation part, immediate operand in addition to 2 register operands. Assume that immediate operand is signed integer ... represented in immediate operand field is +4095 Max number of instructions that can be permitted by this processor is _______________________

answered in CO and Architecture Jul 5, 2017

371 views

1 vote

68

Shortest Path Algorithms
For a given undirected weighted graph G with V number of vertices, if you want to find all pair shortest paths then which one of the following is true ? a) run dijkstra's shortest path algorithm only once. b) run dijkstra's shortest path algorithm V times. What if the given graph is directed ?

answered in Algorithms Jul 4, 2017

1.1k views

0 votes

69

answered in Theory of Computation Jul 1, 2017

226 views

1 vote

70

Bit-wise operation
#include <stdio.h> int main() { unsigned int m = 0; m |= 0xA38; printf("%x\n",m|(m-1)); printf("%x\n",( (m|(m-1)) + 1 ) & m ); } Find the output ?

answered in Programming in C Jun 27, 2017

507 views

1 vote

71

CONFLICT SERIALIZABLE
What is the answer?

answered in Databases Jun 21, 2017

532 views

0 votes

72

Programmin
main() { char check ='a'; switch(check) { case 'a'||1:printf("gats"); case 'b' || 2: printf("quiz"); break; default :printf("Gatesquiz"); } } a)gates b)gatesquiz c)gatesquizgatesquiz d)compiler error

answered in Programming in C Jun 14, 2017

353 views

0 votes

73

SQL Query
Select operation in SQL is a a) Data query language b) Data definition language c) Data manipulation language d) Data control language Confused between option a) and option c) .

answered in Databases Jun 10, 2017

371 views

3 votes

74

ternary operator
How to solve i|j&&j|i ?????????

answered in Programming in C Jun 6, 2017

437 views

1 vote

75

c input output problem
int A(int m,int n) { if(!m) return n+1; if(!n) return A(m-1,1); return A(m-1,A(m,n-1)); } int main() { printf("A(1,2)=%d",A(1,2)); } what will be the output and how?

answered in Programming in C Jun 5, 2017

509 views

13 votes

76

GATE2017 EC-1: GA-8
Trucks ($10$ m long) and cars ($5$ m long) go on a single lane bridge. There must be a gap of at least $20$ m after each truck and a gap of at least $15$ m after each car. Trucks and cars travel at a speed of $36$ km/h. If cars and trucks go alternately, what is the maximum number of vehicles that can use the bridge in one hour? $1440$ $1200$ $720$ $600$

answered in Quantitative Aptitude Jun 5, 2017

3.9k views

1 vote

77

answered in Databases Jun 5, 2017

907 views

2 votes

78

answered in Algorithms Jun 3, 2017

469 views

0 votes

79

K map minimization and Dont cares
It might be silly thing, but I am confused here, In K-Map minimization, suppose there are don't care terms. When we want to get minimal SOP, we assume don't care to be 1 and will get the switching expression. Suppose for the same ... separately for SOP and POS. Don't care terms which are used to get SOP are not used to get POS and vice-versa.

answered in Digital Logic May 31, 2017

765 views

75 votes

80

GATE CSE 2007 | Question: 34
Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of $n$ variables. What is the minimum size of the multiplexer needed? $2^n$ line to $1$ line $2^{n+1}$ line to $1$line $2^{n-1}$ line to $1$line $2^{n-2}$ line to $1$line

answered in Digital Logic May 31, 2017

31.5k views

4 votes

81

NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 33
The number of columns in a state table for a sequential circuit with $’m’$ flip flops and $’n’$ input is $m+n$ $m+2n$ $2m+n$ $2m+2n$

answered in Digital Logic May 28, 2017

1.5k views

3 votes

82

OUTPUT OF PROGRAM

answered in Programming in C May 27, 2017

295 views

1 vote

83

Gate Sample Practise Questions
#include<stdio.h> int f(int *a, int n) { if(n ≤ 0) return 0; else if(*a % 2 = = 0) return *a + f(a+1, n-1); else return *a - f(a+1, n-1); } int main() { int a[] = {12, 7, 13, 4, 11, 6}; printf("%d", f(a, 6)); return 0; } (a) -9 (b) 5 (c) 15 (d) 19 Need explanation stepwise for solution

answered in Algorithms May 26, 2017

508 views

8 votes

84

Sample question for practise doubt
Consider the following 2 functions: f(n)= n3, if 0 ≤ n < 10,000 = n2, otherwise g(n)= n, if 0 ≤ n < 100 = n2 + 5n, otherwise Which of the following option is correct? (a) f(n) is O(n3) (b) g(n) is O(n3) (c) O(f(n)) is same as O(g(n)) (d) g(n) is O(1)

answered in Algorithms May 25, 2017

4.8k views

1 vote

85

GATE CSE 1992 | Question: 02-ii
All digital circuits can be realized using only Ex-OR gates Multiplexers Half adders OR gates

answered in Digital Logic May 21, 2017

10.5k views

3 votes

86

$a_n = 4^n + 6^n$
If $a_n = 4^n + 6^n$ Find the value of $a_{40} \text { mod } 25$

answered in Set Theory & Algebra May 19, 2017

500 views

28 votes

87

GATE CSE 1990 | Question: 5-c
For the synchronous counter shown in Fig$.3,$ write the truth table of $Q_{0}, Q_{1}$, and $Q_{2}$ after each pulse, starting from $Q_{0}=Q_{1}=Q_{2}=0$ and determine the counting sequence and also the modulus of the counter.

answered in Digital Logic May 19, 2017

6.3k views

0 votes

88

GATE CSE 1988 | Question: 3a-b
The Karnaugh map of a function of $(A, B, C)$ is shown on the left hand side of the above figure. The reduced form of the same map is shown on the right hand side, in which the variable $C$ is entered in the map itself. Discuss, ... reduced map has been derived and the rules (or steps) by which the boolean function can be derived from the entries in the reduced map.

answered in Digital Logic May 18, 2017

1.8k views

2 votes

89

database
If table is has only two coloumns,in which normal form would it be?

answered in Databases May 15, 2017

765 views

1 vote

90

Do while
What is the out put of the following code, i think it should be infinite loop, Correct me if iam wrong. When i execute it, only it is printing "Hello" only one Time. #include<stdio.h> int main() { int i = 1; do { printf("Hello\n"); continue; i--; }while(i>=1); return 0; }

answered in Programming in C May 15, 2017

472 views

Page:

« prev
1
2
3
4
5
6
7
8
...
10
next »