menu
search
Log In

GO Book for GATECSE 2022GATE Overflow Book for GATE CSE 2022

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects


GATE Overflow
Recent questions

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions

1 vote
2 answers
1
UGCNET-Dec2019-II: 1
A basic feasible solution of an $m \times n$ transportation problem is said to be non-degenerate, if basic feasible solution contains exactly _______ number of individual allocation in ______ positions. $m+n+1$, independent $m+n-1$, independent $m+n-1$, appropriate $m-n+1$, independent
A basic feasible solution of an $m \times n$ transportation problem is said to be non-degenerate, if basic feasible solution contains exactly _______ number of individual allocation in ______ positions. $m+n+1$, independent $m+n-1$, independent $m+n-1$, appropriate $m-n+1$, independent
asked May 12 in Others soujanyareddy13 348 views
0 votes
1 answer
2
UGCNET-Dec2019-II: 2
Consider the following Linear programming problem $\text{(LPP)}$: Maximize $z=x_1+x_2$ Subject to the constraints: $x_1+2x_2 \leq 2000 \\ x_1+x_2 \leq 1500 \\ x_2 \leq 600 \\ \text{and } x_1, x_2 \geq 0$ The solution of the above $\text{LPP}$ is $x_1=750, x_2= 750, z=1500$ $x_1=500, x_2= 1000, z=1500$ $x_1=1000, x_2= 500, z=1500$ $x_1=900, x_2= 600, z=1500$
Consider the following Linear programming problem $\text{(LPP)}$: Maximize $z=x_1+x_2$ Subject to the constraints: $x_1+2x_2 \leq 2000 \\ x_1+x_2 \leq 1500 \\ x_2 \leq 600 \\ \text{and } x_1, x_2 \geq 0$ The solution of the above $\text{LPP}$ is $x_1=750, x_2= 750, z=1500$ $x_1=500, x_2= 1000, z=1500$ $x_1=1000, x_2= 500, z=1500$ $x_1=900, x_2= 600, z=1500$
asked May 12 in Others soujanyareddy13 125 views
0 votes
4 answers
3
UGCNET-Dec2019-II: 3
The Boolean expression $AB+A \overline{B}+\overline{A}C+AC$ is unaffected by the value of the Boolean variable _________. $A$ $B$ $C$ $A, B$ and $C$
The Boolean expression $AB+A \overline{B}+\overline{A}C+AC$ is unaffected by the value of the Boolean variable _________. $A$ $B$ $C$ $A, B$ and $C$
asked May 12 in Others soujanyareddy13 232 views
1 vote
1 answer
4
UGCNET-Dec2019-II: 4
What are the greatest lower bound $\text{(GLB)}$ and the least upper bound $\text{(LUB)}$ of the sets $A= \{ 3, 9, 12 \}$ and $B=\{1,2,4,5,10 \}$ if they exist in poset $(z^+, / )$? $\text{A(GLB - 3, LUB - 36); B(GLB - 1, LUB - 20)}$ ... $\text{A(GLB - 1, LUB - 36); B(GLB - 2, LUB - 20)}$ $\text{A(GLB - 1, LUB - 12); B(GLB - 2, LUB - 10)}$
What are the greatest lower bound $\text{(GLB)}$ and the least upper bound $\text{(LUB)}$ of the sets $A= \{ 3, 9, 12 \}$ and $B=\{1,2,4,5,10 \}$ if they exist in poset $(z^+, / )$? $\text{A(GLB – 3, LUB – 36); B(GLB – 1, LUB – 20)}$ $\text{A(GLB – 3, LUB – 12); B(GLB – 1, LUB – 10)}$ $\text{A(GLB – 1, LUB – 36); B(GLB – 2, LUB – 20)}$ $\text{A(GLB – 1, LUB – 12); B(GLB – 2, LUB – 10)}$
asked May 12 in Others soujanyareddy13 114 views
1 vote
1 answer
5
UGCNET-Dec2019-II: 5
Let $P$ be the set of all people. Let $R$ be a binary relation on $P$ such that $(a, b)$ is in $R$ if $a$ is a brother of $b$. Is $R$ symmetric transitive, an equivalence relation, a partial order relation? $\text{NO, NO, NO, NO}$ $\text{NO, NO, YES, NO}$ $\text{NO, YES, NO, NO}$ $\text{NO, YES, YES, NO}$
Let $P$ be the set of all people. Let $R$ be a binary relation on $P$ such that $(a, b)$ is in $R$ if $a$ is a brother of $b$. Is $R$ symmetric transitive, an equivalence relation, a partial order relation? $\text{NO, NO, NO, NO}$ $\text{NO, NO, YES, NO}$ $\text{NO, YES, NO, NO}$ $\text{NO, YES, YES, NO}$
asked May 12 in Others soujanyareddy13 68 views
1 vote
1 answer
6
UGCNET-Dec2019-II: 6
The weight of minimum spanning tree in graph $G$, calculated using Kruskal’s algorithm is: $14$ $15$ $17$ $18$
The weight of minimum spanning tree in graph $G$, calculated using Kruskal’s algorithm is: $14$ $15$ $17$ $18$
asked May 12 in Others soujanyareddy13 128 views
0 votes
2 answers
7
UGCNET-Dec2019-II: 7
A tree has $2n$ vertices of degree $1$, $3n$ vertices of degree $2$, $n$ vertices of degree $3$. Determine the number of vertices and edges in tree. $12, 11$ $11, 12$ $10, 11$ $9, 10$
A tree has $2n$ vertices of degree $1$, $3n$ vertices of degree $2$, $n$ vertices of degree $3$. Determine the number of vertices and edges in tree. $12, 11$ $11, 12$ $10, 11$ $9, 10$
asked May 12 in Others soujanyareddy13 66 views
2 votes
2 answers
8
UGCNET-Dec2019-II: 8
How many reflexive relations are there on a set with $4$ elements? $2^4$ $2^{12}$ $4^2$ $2$
How many reflexive relations are there on a set with $4$ elements? $2^4$ $2^{12}$ $4^2$ $2$
asked May 12 in Others soujanyareddy13 62 views
0 votes
2 answers
9
UGCNET-Dec2019-II: 9
A non-pipelined system takes $\text{30ns}$ to process a task. The same task can be processed in a four-segment pipeline with a clock cycle of $\text{10ns}$. Determine the speed up of the pipeline for $100$ tasks. $3$ $4$ $3.91$ $2.91$
A non-pipelined system takes $\text{30ns}$ to process a task. The same task can be processed in a four-segment pipeline with a clock cycle of $\text{10ns}$. Determine the speed up of the pipeline for $100$ tasks. $3$ $4$ $3.91$ $2.91$
asked May 12 in Others soujanyareddy13 77 views
0 votes
1 answer
10
UGCNET-Dec2019-II: 10
A computer uses a memory unit of $512\:K$ words of $32$ bits each. A binary instruction code is stored in one word of the memory. The instruction has four parts: an addressing mode field to specify one of the two-addressing mode (direct and indirect), an operation code, a register code part to ... and the address part? $1, 3, 9, 19$ $1, 4, 9, 18$ $1, 4, 8, 19$ $1, 3, 8, 20$
A computer uses a memory unit of $512\:K$ words of $32$ bits each. A binary instruction code is stored in one word of the memory. The instruction has four parts: an addressing mode field to specify one of the two-addressing mode (direct and indirect), an operation code, a register code part to specify one of ... part and the address part? $1, 3, 9, 19$ $1, 4, 9, 18$ $1, 4, 8, 19$ $1, 3, 8, 20$
asked May 12 in Others soujanyareddy13 42 views
0 votes
2 answers
11
UGCNET-Dec2019-II: 11
A micro instruction format has microoperation field which is divided into $2$ sunbfields $F1$ and $F2$ , each having $15$ distinct microoperations, condition field $\text{CD}$ for four status bits, branch field $\text{BR}$ having four options used in conjunction with ... $128$ memory words. The size of micro instruction is: $19$ $18$ $17$ $20$
A micro instruction format has microoperation field which is divided into $2$ sunbfields $F1$ and $F2$ , each having $15$ distinct microoperations, condition field $\text{CD}$ for four status bits, branch field $\text{BR}$ having four options used in conjunction with address field $\text{AD}$. The address space is of $128$ memory words. The size of micro instruction is: $19$ $18$ $17$ $20$
asked May 12 in Others soujanyareddy13 47 views
0 votes
1 answer
12
UGCNET-Dec2019-II: 12
Given following equation: $(142)_b + (112)_{b-2} = (75)_8$, find base $b$. $3$ $6$ $7$ $5$
Given following equation: $(142)_b + (112)_{b-2} = (75)_8$, find base $b$. $3$ $6$ $7$ $5$
asked May 12 in Others soujanyareddy13 50 views
0 votes
0 answers
13
UGCNET-Dec2019-II: 13
The following program is stored in the memory unit of the basic computer. Give the content of accumulator register in hexadecimal after the execution of the program. ... $\text{A}1\text{B}4$ $81\text{B}4$ $\text{A}184$ $8184$
The following program is stored in the memory unit of the basic computer. Give the content of accumulator register in hexadecimal after the execution of the program. ... $\text{A}1\text{B}4$ $81\text{B}4$ $\text{A}184$ $8184$
asked May 12 in Others soujanyareddy13 72 views
0 votes
3 answers
14
UGCNET-Dec2019-II: 14
What is the output of the following $C$ program? # include <stdio.h> main () { int i, j, x=0; for (i=0; i<5; ++i) for (j=0; j<i; ++j) { x+=(i+j-1); break; } printf(“%d”, x); } $6$ $5$ $4$ $3$
What is the output of the following $C$ program? # include <stdio.h> main () { int i, j, x=0; for (i=0; i<5; ++i) for (j=0; j<i; ++j) { x+=(i+j-1); break; } printf(“%d”, x); } $6$ $5$ $4$ $3$
asked May 12 in Others soujanyareddy13 105 views
0 votes
1 answer
15
UGCNET-Dec2019-II: 15
Let $A$ be the base class in $\text{C++}$ and $B$ be the derived class from $A$ with protected inheritance. Which of the following statement is false for class $B$? Member function of class $B$ can access protected data of class $A$ Member ... $B$ cannot access private data of class $A$ Object of derived class $B$ can access public base class data
Let $A$ be the base class in $\text{C++}$ and $B$ be the derived class from $A$ with protected inheritance. Which of the following statement is false for class $B$? Member function of class $B$ can access protected data of class $A$ ... $A$ Member function of class $B$ cannot access private data of class $A$ Object of derived class $B$ can access public base class data
asked May 12 in Others soujanyareddy13 58 views
0 votes
2 answers
16
UGCNET-Dec2019-II: 16
Which tag is used to enclose any number of javascript statements in HTML document? <code> <script> <title> <body>
Which tag is used to enclose any number of javascript statements in HTML document? <code> <script> <title> <body>
asked May 12 in Others soujanyareddy13 42 views
0 votes
0 answers
17
UGCNET-Dec2019-II: 17
A rectangle is bound by the lines $x=0; y=0; x=5$ and $y=3$. The line segment joining $(-1, 0)$ and $(4,5)$, if clipped against this window will connect the points __________. $(0,1)$ and $(3,3)$ $(0,1)$ and $(2,3)$ $(0,1)$ and $(4,5)$ $(0,1)$ and $(3,5)$
A rectangle is bound by the lines $x=0; y=0; x=5$ and $y=3$. The line segment joining $(-1, 0)$ and $(4,5)$, if clipped against this window will connect the points __________. $(0,1)$ and $(3,3)$ $(0,1)$ and $(2,3)$ $(0,1)$ and $(4,5)$ $(0,1)$ and $(3,5)$
asked May 12 in Others soujanyareddy13 54 views
0 votes
0 answers
18
UGCNET-Dec2019-II: 18
Which of the following algorithms is not used for line clipping? Cohen-Sutherland algorithm Sutherland-Hodgeman algorithm Liang-Barsky algorithm Nicholl-Lee-Nicholl algorithm
Which of the following algorithms is not used for line clipping? Cohen-Sutherland algorithm Sutherland-Hodgeman algorithm Liang-Barsky algorithm Nicholl-Lee-Nicholl algorithm
asked May 12 in Others soujanyareddy13 46 views
0 votes
0 answers
19
UGCNET-Dec2019-II: 19
If we want to resize a $1024 \times 768$ pixels image to one that is $640$ pixels wide with the same aspect ratio, what would be the height of the resized image? $420$ Pixels $460$ Pixels $480$ Pixels $540$ Pixels
If we want to resize a $1024 \times 768$ pixels image to one that is $640$ pixels wide with the same aspect ratio, what would be the height of the resized image? $420$ Pixels $460$ Pixels $480$ Pixels $540$ Pixels
asked May 12 in Others soujanyareddy13 43 views
0 votes
1 answer
20
UGCNET-Dec2019-II: 20
Which of the component module of $\text{DBMS}$ does rearrangement and possible ordering of operations, eliminate redundancy in query and use efficient algorithms and indexes during the execution of a query? query compiler query optimizer Stored data manager Database processor
Which of the component module of $\text{DBMS}$ does rearrangement and possible ordering of operations, eliminate redundancy in query and use efficient algorithms and indexes during the execution of a query? query compiler query optimizer Stored data manager Database processor
asked May 12 in Others soujanyareddy13 55 views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...