Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged ugcnetcse-dec2018-paper2
7
votes
1
answer
1
UGC NET CSE | December 2018 | Part 2 | Question: 1
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
Arjun
asked
in
Mathematical Logic
Jan 2, 2019
by
Arjun
3.3k
views
ugcnetcse-dec2018-paper2
mathematical-logic
0
votes
2
answers
2
UGC NET CSE | December 2018 | Part 2 | Question: 2
Match List-I with List-II and choose the correct answer from the code given below : ... -(iii), (b)-(iv), (c)-(ii), (d)-(i) (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
Arjun
asked
in
Mathematical Logic
Jan 2, 2019
by
Arjun
1.8k
views
ugcnetcse-dec2018-paper2
mathematical-logic
1
vote
1
answer
3
UGC NET CSE | December 2018 | Part 2 | Question: 3
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}$
Arjun
asked
in
Probability
Jan 2, 2019
by
Arjun
4.5k
views
ugcnetcse-dec2018-paper2
probability
0
votes
2
answers
4
UGC NET CSE | December 2018 | Part 2 | Question: 4
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 : ... all the three methods $5$ people. How many people completed the survey form? $120$ $165$ $160$ $115$
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
2.6k
views
ugcnetcse-dec2018-paper2
0
votes
0
answers
5
UGC NET CSE | December 2018 | Part 2 | Question: 5
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 ... given below : i and iv only i, ii and iii only i and ii only ii, iii, and iv only
Arjun
asked
in
Digital Logic
Jan 2, 2019
by
Arjun
1.2k
views
ugcnetcse-dec2018-paper2
digital-logic
0
votes
1
answer
6
UGC NET CSE | December 2018 | Part 2 | Question: 6
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 ... $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
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
1.4k
views
ugcnetcse-dec2018-paper2
0
votes
2
answers
7
UGC NET CSE | December 2018 | Part 2 | Question: 7
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$
Arjun
asked
in
Digital Logic
Jan 2, 2019
by
Arjun
1.5k
views
ugcnetcse-dec2018-paper2
digital-logic
1
vote
1
answer
8
UGC NET CSE | December 2018 | Part 2 | Question: 8
In PERT/CPM, the merge event represents _____ of two or more events. completion beginning splitting joining
Arjun
asked
in
Numerical Methods
Jan 2, 2019
by
Arjun
2.9k
views
ugcnetcse-dec2018-paper2
operation-research-pert-cpm
1
vote
0
answers
9
UGC NET CSE | December 2018 | Part 2 | Question: 9
Use Dual Simplex Method to solve the following problem: $\begin{array} \text{Maximize} & z=-2x_1-3x_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$
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
816
views
ugcnetcse-dec2018-paper2
0
votes
1
answer
10
UGC NET CSE | December 2018 | Part 2 | Question: 10
In computers, subtraction is generally carried out by $9$’s complement $1$’s complement $10$’s complement $2$’s complement
Arjun
asked
in
Digital Logic
Jan 2, 2019
by
Arjun
4.8k
views
ugcnetcse-dec2018-paper2
digital-logic
0
votes
1
answer
11
UGC NET CSE | December 2018 | Part 2 | Question: 11
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 equations ? (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
Arjun
asked
in
Digital Logic
Jan 2, 2019
by
Arjun
1.0k
views
ugcnetcse-dec2018-paper2
digital-logic
0
votes
2
answers
12
UGC NET CSE | December 2018 | Part 2 | Question: 12
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$
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
3.6k
views
ugcnetcse-dec2018-paper2
algorithms
minimum-spanning-tree
1
vote
1
answer
13
UGC NET CSE | December 2018 | Part 2 | Question: 13
Consider the following statements : Auto increment addressing mode is useful in creating self-relocating code. If auto increment addressing mode is included in an instruction set architecture, then an additional ALU is required for effective address calculation. In auto ... is/are true? (i) and (ii) only (ii) and (iii) only (iii) only (ii) only
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
942
views
ugcnetcse-dec2018-paper2
0
votes
2
answers
14
UGC NET CSE | December 2018 | Part 2 | Question: 14
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 ... code, the register code part and the address part? $7,6,18$ $6,7,18$ $7,7,18$ $18,7,7$
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
1.9k
views
ugcnetcse-dec2018-paper2
0
votes
3
answers
15
UGC NET CSE | December 2018 | Part 2 | Question: 15
Consider the following $\textsf{x}86$ - assembly language instructions: MOV AL, 153 NEG AL The contents of the destination register $AL$ (in $8$-bit binary notation), th status of Carry Flag $(CF)$ and Sign Flag $(SF)$ ... $AL=0110 \: 0110; \: CF=1; \: SF=1$ $AL=0110 \: 0111; \: CF=1; \: SF=0$
Arjun
asked
in
CO and Architecture
Jan 2, 2019
by
Arjun
2.7k
views
ugcnetcse-dec2018-paper2
computer-architecture
assembly
non-gate
2
votes
4
answers
16
UGC NET CSE | December 2018 | Part 2 | Question: 16
The decimal floating point number $-40.1$ represented using $\textsf{IEEE-754} \: 32$-bit representation and written in hexadecimal form is $\textsf{0x}C2206666$ $\textsf{0x}C2206000$ $\textsf{0x}C2006666$ $\textsf{0x}C2006000$
Arjun
asked
in
Digital Logic
Jan 2, 2019
by
Arjun
2.2k
views
ugcnetcse-dec2018-paper2
digital-logic
number-representation
floating-point-representation
0
votes
1
answer
17
UGC NET CSE | December 2018 | Part 2 | Question: 17
Find the boolean expression for the logic circuit shown below: $A \overline{B}$ $\overline{A} B$ $AB$ $\overline{A} \overline{B}$
Arjun
asked
in
Digital Logic
Jan 2, 2019
by
Arjun
2.5k
views
ugcnetcse-dec2018-paper2
digital-logic
0
votes
6
answers
18
UGC NET CSE | December 2018 | Part 2 | Question: 18
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$
Arjun
asked
in
Operating System
Jan 2, 2019
by
Arjun
1.8k
views
ugcnetcse-dec2018-paper2
operating-system
disk
0
votes
3
answers
19
UGC NET CSE | December 2018 | Part 2 | Question: 19
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$ ... access time of the system ignoring the search time within the cache? $35.20$ ns $7.55$ ns $20.75$ ns $24.35$ ns
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
2.7k
views
ugcnetcse-dec2018-paper2
0
votes
1
answer
20
UGC NET CSE | December 2018 | Part 2 | Question: 20
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
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
750
views
ugcnetcse-dec2018-paper2
1
vote
3
answers
21
UGC NET CSE | December 2018 | Part 2 | Question: 21
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)))$
Arjun
asked
in
Algorithms
Jan 2, 2019
by
Arjun
549
views
ugcnetcse-dec2018-paper2
recurrence-relation
1
vote
1
answer
22
UGC NET CSE | December 2018 | Part 2 | Question: 22
The elements $42, 25, 30, 40, 22, 35, 26$ are inserted one by one in the given order into a max-heap. The resultant max-heap 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>$
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
1.8k
views
ugcnetcse-dec2018-paper2
data-structures
heap
1
vote
1
answer
23
UGC NET CSE | December 2018 | Part 2 | Question: 23
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$
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
3.0k
views
ugcnetcse-dec2018-paper2
algorithms
dynamic-programming
0
votes
1
answer
24
UGC NET CSE | December 2018 | Part 2 | Question: 24
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$
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
10.6k
views
ugcnetcse-dec2018-paper2
data-structures
stack
0
votes
2
answers
25
UGC NET CSE | December 2018 | Part 2 | Question: 25
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$
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
5.0k
views
ugcnetcse-dec2018-paper2
data-structures
binary-search-tree
0
votes
2
answers
26
UGC NET CSE | December 2018 | Part 2 | Question: 26
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$
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
1.9k
views
ugcnetcse-dec2018-paper2
0
votes
1
answer
27
UGC NET CSE | December 2018 | Part 2 | Question: 27
Match $\text{List I}$ with $\text{List II}$ ... $\text{(a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)}$
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
1.4k
views
ugcnetcse-dec2018-paper2
algorithms
graph-algorithms
time-complexity
0
votes
0
answers
28
UGC NET CSE | December 2018 | Part 2 | Question: 28
In K-coloring of an undirected graph $G=(V,E)$ is a function. $c: V \rightarrow \{0,1, \dots , K-1 \}$ 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
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
1.0k
views
ugcnetcse-dec2018-paper2
1
vote
2
answers
29
UGC NET CSE | December 2018 | Part 2 | Question: 29
Consider a singly linked list. What is the worst case time complexity of the best-known algorithm to delete the node $a$, pointer to this node is $q$, from the list? $O(n \lg \: n)$ $O(n)$ $O(\lg \: n)$ $O(1)$
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
2.1k
views
ugcnetcse-dec2018-paper2
data-structures
linked-list
time-complexity
0
votes
0
answers
30
UGC NET CSE | December 2018 | Part 2 | Question: 30
The second smallest of $n$ elements can be found with ____ comparisons in the worst case. $n-1$ $\lg \: n$ $n + ceil(\lg \: n)-2$ $\frac{3n}{2}$
Arjun
asked
in
Unknown Category
Jan 2, 2019
by
Arjun
878
views
ugcnetcse-dec2018-paper2
algorithms
sorting
Page:
1
2
3
4
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent questions tagged ugcnetcse-dec2018-paper2
Recent Blog Comments
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
@GO Classes @Deepak Poonia @Sachin...
@GO Classes @Deepak Poonia sir...
Maximum age limit changed from 35 yrs. to 28...