The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged ugcnetdec2018ii
+1
vote
1
answer
1
UGCNETDEC2018II1
In mathematical logic, which of the following are statements? There will be snow in January. What is the time now? Today is Sunday. You must study Discrete mathematics Choose the correct answer from the code given below: i and iii i and ii ii and iv iii and iv
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

700
views
ugcnetdec2018ii
0
votes
2
answers
2
UGCNETDEC2018II2
Match the ListI with ListII and choose the correct answer from the code given below: ... ) (a)(iii), (b)(iv), (c)(ii), (d)(i) (a)(iv), (b)(iii), (c)(ii), (d)(i)
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

400
views
ugcnetdec2018ii
0
votes
1
answer
3
UGCNETDEC2018II3
A box contains six red balls and four green balls. Four balls are selected at random from the box. What is the probability that two of the selected balls will be red and two will be in green? $\frac{1}{14}$ $\frac{3}{7}$ $\frac{1}{35}$ $\frac{1}{9}$
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

417
views
ugcnetdec2018ii
0
votes
1
answer
4
UGCNETDEC2018II4
A survey has been conducted on methods of commuter travel. Each respondent was asked to check bus, Train and Automobile as a major method of travelling to work. More than one answer was permitted. The results reported were as follows: Bus $30$ people; Train $35$ ... people; and all the three methods $5$ people. How many people completed the survey form? $120$ $165$ $160$ $115$
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

400
views
ugcnetdec2018ii
0
votes
0
answers
5
UGCNETDEC2018II5
Which of the following statements are true? Every logic network is equivalent to one using just NAND gates or just NOR gates. Boolean expressions and logic networks correspond to labelled acyclic diagraphs. No two Boolean algebras with n atoms are isomorphic. Nonzero elements of finite ... the code given below: i and iv only i, ii and iii only i and ii only ii, iii, and iv only
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

419
views
ugcnetdec2018ii
0
votes
1
answer
6
UGCNETDEC2018II6
The relation $\leq$ and $>$ on a boolean algebra are defined as: $x \leq y$ if and only if $x \vee y =y$ $x <y$ means $x \leq y$ but $x \neq y$ $x \geq y$ means $y \leq x$ and $x>y$ means $y<x$ Considering the above definitions, ... $y < z$, then $x < y$ Choose the correct answer from the code given below: i and ii only ii and iii only iii only iv only
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

455
views
ugcnetdec2018ii
0
votes
2
answers
7
UGCNETDEC2018II7
The boolean expression $\overline{A} \cdot B + A \cdot \overline{B}+ A \cdot B$ is equivalenet to $\overline{A} \cdot B$ $\overline{A+B}$ $A \cdot B$ $A+B$
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

328
views
ugcnetdec2018ii
0
votes
0
answers
8
UGCNETDEC2018II8
In PERT/CPM, the merge event represents _____ of two or more events. completion beginning splitting joining
asked
Jan 2
in
Numerical Methods
by
Arjun
Veteran
(
418k
points)

566
views
ugcnetdec2018ii
operationresearchpertcpm
0
votes
0
answers
9
UGCNETDEC2018II9
Use Dual Simplex Method to solve the following problem: $\begin{array} \text{Maximize} & z=2x_13x_2 \\ \text{subject to:} & \\ & x_1+x_2 \geq 2 \\ & 2x_1 +x_2 \leq10 \\ & x_2 +x_2 \leq 8 \\ & x_1,x_2 \geq 0 \end{array}$ ... $x_1=0, x_2=2, \text{ and } z=6$ $x_1=6, x_2=2, \text{ and } z=18$
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

256
views
ugcnetdec2018ii
0
votes
1
answer
10
UGCNETDEC2018II10
In computers, subtraction is generally carried out by $9$’s complement $1$’s complement $10$’s complement $2$’s complement
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

168
views
ugcnetdec2018ii
0
votes
1
answer
11
UGCNETDEC2018II11
Consider the following boolean equations: $wx+w(x+y)+x(x+y)=x+wy$ $(w \overline{x}(y+x \overline{z})+ \overline{w} \overline{x})y= \overline{x}y$ What can you say about the above equation? (i) is true and (ii) is false (i) is false and (ii) is true Both (i) and (ii) are true Both (i) and (ii) are false
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

200
views
ugcnetdec2018ii
0
votes
1
answer
12
UGCNETDEC2018II12
Consider the graph shown below: Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is $17$ $14$ $16$ $13$
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

337
views
ugcnetdec2018ii
0
votes
1
answer
13
UGCNETDEC2018II13
Consider the following statements: Auto increment addressing mode is useful in creating sefrelocating code. If auto increment addressing mode is included in an instruction set architecture. In auto incrementing addressing mode, the amount of increment depends on the size of the ata item ... statements is/are true? (i) and (ii) only (ii) and (iii) only (iii) only (ii) only
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

154
views
ugcnetdec2018ii
0
votes
1
answer
14
UGCNETDEC2018II14
A computer uses a memory unit with $256$ K words of $32$ bits each. A binary instruction code is stored in one word of memory. The instruction has four parts: an indirect bit, an operation code and a register code part to specify one of $64$ registers and an address part. ... the operation code, the register code part and the address part? $7,6,18$ $6,7,18$ $7,7,18$ $18,7,7$
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

200
views
ugcnetdec2018ii
0
votes
1
answer
15
UGCNETDEC2018II15
Consider the following $\times 86$  assembly language instructions: MOV AL, 153 NEG AL The contents o the destination register AL (in $8$bit binary notation), th status of Carry Flag (CF) and Sign Flag after the execution of above instructions are $AL=0110 \: 0110; \: CF=0; \: SF=0$ ... $AL=0110 \: 0110; \: CF=1; \: SF=1$ $AL=0110 \: 0111; \: CF=1; \: SF=0$
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

244
views
ugcnetdec2018ii
0
votes
2
answers
16
UGCNETDEC2018II16
The decimal floating point number $40.1$ represented using $IEEE754 \: 32$bit representation and written in hexadecimal form is $0xC2206666$ $0xC2206000$ $0xC2006666$ $0xC200600$
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

301
views
ugcnetdec2018ii
0
votes
1
answer
17
UGCNETDEC2018II17
Find the boolean expression for the logic circuit shown below: $A \overline{B}$ $\overline{A} B$ $AB$ $\overline{A} \overline{B}$
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

192
views
ugcnetdec2018ii
0
votes
2
answers
18
UGCNETDEC2018II18
Consider a disk pack with $32$ surfaces, $64$ tracks and $512$ sectors per pack. $256$ bytes of data are stored in a bit serial manner in a sector. The number of bits required to specify a particular sector in the disk is $18$ $19$ $20$ $22$
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

139
views
ugcnetdec2018ii
0
votes
2
answers
19
UGCNETDEC2018II19
Consider a system with $2$ level cache. Access times of Level $1$ cache, Level $2$ cache and main memory are $0.5$ ns, $5$ ns and $100$ ns respectively. The hit rates of Level $1$ and Level $2$ caches are $0.7$ and $0.8$ respectively. What is the average access time of the system ignoring the search time within the cache? $35.20$ ns $7.55$ ns $20.75$ ns $24.35$ ns
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

376
views
ugcnetdec2018ii
0
votes
1
answer
20
UGCNETDEC2018II20
If a graph (G) has no loops or parallel edges, and if the number of vertices (n) the graph is $n \geq 3$, then graph G is Hamiltonian if $\text{deg(v)} \geq \frac{n}{3} \text{ for each vertex v}$ ... Choose the correct answer from the code given below: (i) and (iii) only (ii) only (ii) and (iii) only (iii) only
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

151
views
ugcnetdec2018ii
+1
vote
2
answers
21
UGCNETDEC2018II21
The solution of recurrence relation: $T(n) = 2T (sqrt(n)) + lg(n)$ is $O(lg(n))$ $O(n \: lg \: (n))$ $O(lg \: (n) \: lg (n))$ $O(lg \: (n) \: lg(lg \: (n)))$
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

187
views
ugcnetdec2018ii
0
votes
1
answer
22
UGCNETDEC2018II22
The elements $42, 25, 30, 40, 22, 35, 26$ are inserted one by one in the given order into a maxheap. The resultant maxheap is sorted in an array implementation as $<42, 40, 35, 25, 22, 30, 26>$ $<42, 35, 40, 22, 25, 30, 26>$ $<42, 40, 35, 25, 22, 26, 30>$ $<42, 35, 40, 22, 25, 26, 30>$
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

140
views
ugcnetdec2018ii
0
votes
1
answer
23
UGCNETDEC2018II23
Consider two sequences $X$ and $Y$ $X=<0, 1, 2, 1, 3, 0, 1>$ $Y=<1, 3, 2, 0, 1, 0>$ The length of longest common subsequence between $X$ and $Y$ is $2$ $3$ $4$ $5$
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

122
views
ugcnetdec2018ii
0
votes
1
answer
24
UGCNETDEC2018II24
Consider the following postfix expression with single digit operands: $6 \; 2 \: 3 \: ^* \: / \: 4 \: 2 \: ^* \; + \: 6 \: 8 \: ^* \: $ The top two elements of the stack after the second $^*$ is evaluated, are: $8,2$ $8,1$ $6,2$ $6,3$
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

119
views
ugcnetdec2018ii
0
votes
1
answer
25
UGCNETDEC2018II25
A binary search tree is constructed by inserting the following numbers in order: $60, 25, 72, 15, 30, 68, 101, 13, 18, 47, 70, 34$ The number of nodes in the left subtree is $5$ $6$ $7$ $3$
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

230
views
ugcnetdec2018ii
0
votes
1
answer
26
UGCNETDEC2018II26
In a ternary tree, the number of internal nodes of degree $1, 2, $ and $3$ is $4, 3$, and $3$ respectively. The number of leaf nodes in the ternary tree is $9$ $10$ $11$ $12$
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

141
views
ugcnetdec2018ii
0
votes
1
answer
27
UGCNETDEC2018II27
Match ListI with ListII and choose the correct answer from the code given below: ... ) (a)(i), (b)(iii), (c)(iv), (d)(ii) (a)(iii), (b)(i), (c)(iv), (d)(ii)
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

108
views
ugcnetdec2018ii
0
votes
1
answer
28
UGCNETDEC2018II28
In Kcoloring of an undirected graph $G=(V,E)$ is a function. $c; V \rightarrow \{0,1, \dots , K1 \}$ such that $c(u) \neq c(v)$ for every edge $(u,v) \in E$. Which of the following is not correct? $G$ is bipartite $G$ is $2$colorable $G$ has cycles of odd length $G$ has no cycles of odd length
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

135
views
ugcnetdec2018ii
0
votes
1
answer
29
UGCNETDEC2018II31
Let $r=a(a+b)^*, \: s=aa^*b$ and $t=a^*b$ be three regular expressions. Consider the following $L(s) \subseteq L(r )\text{ and } L(s) \subseteq L(t)$ $L(r ) \subseteq L(s) \text{ and } L(s) \subseteq L(t)$ Choose the correct answer from the code given below: Only (i) is correct Only (ii) is correct Both (i) and (ii) are correct Neither (i) nor (ii) is correct
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

124
views
ugcnetdec2018ii
0
votes
2
answers
30
UGCNETDEC2018II32
Consider the language $L$ given by $L=\{ 2^{nk} \mid k >0, \text{ and n is nonnegative integer number } \}$ The minimum number of states of finite automaton which accepts the language $L$ is $n$ $n+1$ $\frac{n(n+1)}{2}$ $2^n$
asked
Jan 2
in
Others
by
Arjun
Veteran
(
418k
points)

216
views
ugcnetdec2018ii
Page:
1
2
3
4
next »
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
Recent Posts
GATE 2020 Application Form Opened!
My GATE Preparation Journey
ISI MTECH CS 2019 INTERVIEW EXPERIENCE
IIT HYDERABAD MTECH TA INTERVIEW EXPERIENCE
How to prepare for GATE with a fulltime job??
Follow @csegate
Recent questions tagged ugcnetdec2018ii
Recent Blog Comments
Feedback for next edition (if ever there's...
Is go book still available,I want to buy it
will pdfs be uploaded ?
6th...
49,896
questions
55,153
answers
190,577
comments
85,319
users