Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most answered questions in Others
45
votes
9
answers
1
Common Careless Mistakes
What are the most common mistakes you have made in tests? A good list will help aspirants reduce their mistakes in GATE. Just listing out some common ones. Missing the NOT in question - our eyes have a tendency to focus on important words and ... many calculation mistakes. In any formula you do, you must get the correct unit for the result Please add more as answers.
What are the most common mistakes you have made in tests? A good list will help aspirants reduce their mistakes in GATE. Just listing out some common ones.Missing the “...
Arjun
4.2k
views
Arjun
asked
Jan 26, 2019
Revision
mistakes
preparation
+
–
0
votes
7
answers
2
UGC NET CSE | June 2007 | Part 2 | Question: 37
Windows is a _______ operating system: Non-preemptive Preemptive Multi-user Real time
Windows is a _______ operating system:Non-preemptivePreemptiveMulti-userReal time
go_editor
2.0k
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-june2007-paper2
operating-system
windows
+
–
4
votes
6
answers
3
UGC NET CSE | December 2019 | Part 2 | Question: 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$
soujanyareddy13
2.0k
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
digital-logic
boolean-algebra
+
–
0
votes
5
answers
4
UGC NET CSE | December 2019 | Part 2 | Question: 38
In a B-Tree, each node represents a disk block. Suppose one block holds $8192$ bytes. Each key uses $32$ bytes. In a B-tree of order $M$ there are $M-1$ keys. Since each branch is on another disk block, we assume a branch is of $4$ bytes. The total memory requirement for a non-leaf node is $32 M -32$ $36 M – 32$ $36 M – 36$ $32 M – 36$
In a B-Tree, each node represents a disk block. Suppose one block holds $8192$ bytes. Each key uses $32$ bytes. In a B-tree of order $M$ there are $M-1$ keys. Since each ...
soujanyareddy13
1.1k
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
+
–
16
votes
5
answers
5
LEARNING LINUX--- Beginner's Guide to linux
Hey friends lets learn linux get small exercise and get speed over that platform as it is simlar to other operating system but to get an industrial touch just be familar and get daily small excersie and guidance by Arjun sir .. . .. follow ... n discuss here your queries ... Also make your laptop dual boot and install a linux if you already have not.
Hey friends lets learn linux get small exercise and get speed over that platform as it is simlar to other operating system but to get an industrial touch just be familar ...
priyanka gautam-piya
3.2k
views
priyanka gautam-piya
asked
Feb 18, 2017
Others
linux
getting-to-iits
+
–
5
votes
5
answers
6
Meta: Suggestions to improve GATE Overflow
Mention your dislikes about the site and suggest improvements if any
Mention your dislikes about the site and suggest improvements if any
amarVashishth
1.2k
views
amarVashishth
asked
Nov 2, 2015
Others
meta
site-improvement
gateoverflow
+
–
0
votes
4
answers
7
UGC NET CSE | December 2019 | Part 2 | Question: 88
Match $\text{List-I}$ with $\text{List-II}$ ... $\text{(a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)}$
Match $\text{List-I}$ with $\text{List-II}$:$$\begin{array}{llll} & \textbf{List I} && \textbf{List II} \\ \text{(a)} & \text{Micro operation} & \text{(i)} & \text{Speci...
soujanyareddy13
980
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
+
–
0
votes
4
answers
8
UGC NET CSE | January 2017 | Part 2 | Question: 48
Which of the following is/are true w.r.t. applications of mobile computing? Travelling of salesman Location awareness services a true; b false. Both a and b are true. Both a and b are false. a false; b true.
Which of the following is/are true w.r.t. applications of mobile computing?Travelling of salesmanLocation awareness servicesa true; b false.Both a and b are true.Both a a...
go_editor
672
views
go_editor
asked
Mar 24, 2020
Others
ugcnetjan2017ii
mobile-communication
+
–
0
votes
4
answers
9
UGC NET CSE | December 2010 | Part 2 | Question: 24
Linear probing suffers from a problem known as Secondary clustering Primary clustering Both (A) and (B) None of these
Linear probing suffers from a problem known asSecondary clusteringPrimary clusteringBoth (A) and (B)None of these
makhdoom ghaya
3.3k
views
makhdoom ghaya
asked
Sep 7, 2016
Others
ugcnetcse-dec2010-paper2
data-structures
hashing
+
–
30
votes
4
answers
10
What is/was your strategy for GATE Preparation?
Frequently it has been found that people ask each other or at least try to read about/ hear from others about how are they preparing for GATE. This question is a place where you should share answers to : What is your formula for ... , What is the critical point of advice. you prefer to give Any other relevant info. that you can come up with
Frequently it has been found that people ask each other or at least try to read about/ hear from others about how are they preparing for GATE.This question is a place whe...
amarVashishth
7.2k
views
amarVashishth
asked
Nov 23, 2015
Study Resources
study-resources
databases
theory-of-computation
engineering-mathematics
operating-system
algorithms
co-and-architecture
+
–
0
votes
3
answers
11
UGC NET CSE | June 2008 | Part 2 | Question: 4
The set of positive integers under the operation of ordinary multiplication is : not a monoid not a group a group an Abelian group
The set of positive integers under the operation of ordinary multiplication is :not a monoidnot a groupa groupan Abelian group
admin
341
views
admin
asked
Jan 6
Others
ugcnetcse-june2008-paper2
abelian-group
+
–
0
votes
3
answers
12
UGC NET CSE | June 2008 | Part 2 | Question: 21
Which of the following data structures is most efficient in terms of both space and time to reverse a string of characters? Linked list Stack Array Tree
Which of the following data structures is most efficient in terms of both space and time to reverse a string of characters?Linked listStackArrayTree
admin
251
views
admin
asked
Jan 6
Others
ugcnetcse-june2008-paper2
+
–
0
votes
3
answers
13
NIELIT 2021 Dec Scientist A - Section B: 117
Worst case scenario in case of linear search algorithm is ______________ . Item is somewhere in the middle of the array. Item is not in the array at all. Item is the last element in the array. Item is the last element in the array or is not there at all.
Worst case scenario in case of linear search algorithm is ______________ .Item is somewhere in the middle of the array.Item is not in the array at all.Item is the last el...
soujanyareddy13
539
views
soujanyareddy13
asked
Jan 9, 2022
Others
nielit2021dec-scientista
+
–
0
votes
3
answers
14
UGC NET CSE | December 2019 | Part 2 | Question: 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”...
soujanyareddy13
1.5k
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
+
–
1
votes
3
answers
15
UGC NET CSE | December 2019 | Part 2 | Question: 21
Given two tables $R1(x,y)$ and $R2(y,z)$ with $50$ and $30$ number of tuples respectively. Find maximum number of tuples in the output of natural join between tables $R1$ and $R2$ i.e. $R1 * R2$? ($*$- Natural Join) $30$ $20$ $50$ $1500$
Given two tables $R1(x,y)$ and $R2(y,z)$ with $50$ and $30$ number of tuples respectively. Find maximum number of tuples in the output of natural join between tables $R1$...
soujanyareddy13
1.8k
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
+
–
0
votes
3
answers
16
UGC NET CSE | December 2019 | Part 2 | Question: 37
What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an unsorted array? Assume that all the insertions can be accomodated. $\theta(1), \theta(n)$ $\theta(n), \theta(1)$ $\theta(1), \theta(1)$ $\theta(n), \theta(n)$
What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an unsorted array? Assume that all the insertions can be acc...
soujanyareddy13
818
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
+
–
0
votes
3
answers
17
CMI-2018-DataScience-A: 2
Let ... $|A|=|B|$ $|C|=|D|$ $|B|=-|C|$ $|A|=-|D|$
Let $A=\begin{bmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9 \end{bmatrix}, B=\begin{bmatrix} 1 & 4 & 7 \\ 2 & 5 & 8 \\ 3 & 6 & 9 \end{bmatrix}, C=\begin{bmatrix} 4 & 5 & 6...
soujanyareddy13
648
views
soujanyareddy13
asked
Jan 29, 2021
Others
cmi2018-datascience
matrix
linear-algebra
+
–
4
votes
3
answers
18
CMI2020-A: 1
Which of the following languages over the alphabet $\{0,1\}$ are $not$ recognized by deterministic finite state automata $(DFA)$ with $three$ states? Words which do not have $11$ as a contiguous subword Binary representations of multiples of three Words that have $11$ as a suffix Words that do not contain $101$ as a contiguous subword
Which of the following languages over the alphabet $\{0,1\}$ are $not$ recognized by deterministic finite state automata $(DFA)$ with $three$ states?Words which do not ha...
soujanyareddy13
695
views
soujanyareddy13
asked
Jan 28, 2021
Others
cmi2020
+
–
0
votes
3
answers
19
UGC NET CSE | June 2007 | Part 2 | Question: 21
The time required to find the shortest path in a graph with $n$ vertices and $e$ edges is: $O(e)$ $O(n)$ $O(e^{2})$ $O(n^{2})$
The time required to find the shortest path in a graph with $n$ vertices and $e$ edges is:$O(e)$$O(n)$$O(e^{2})$$O(n^{2})$
go_editor
1.7k
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-june2007-paper2
+
–
0
votes
3
answers
20
UGC NET CSE | June 2006 | Part 2 | Question: 25
Application of data structure queue is : Levelwise printing of tree Implementation of priority queues Function call implementation Depth first search in a graph
Application of data structure queue is :Levelwise printing of treeImplementation of priority queuesFunction call implementationDepth first search in a graph
go_editor
887
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-june2006-paper2
+
–
Page:
1
2
3
4
5
6
...
136
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register