Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Aboveallplayer
4
votes
61
Test by Bikram | Mock GATE | Test 2 | Question: 2
Which of the following statements is NOT true? Deadlock can never occur if all resources can be shared by competing processes. Deadlock can never occur if resources must be requested in the same order by processes ... then deadlock has certainly occurred. The Banker's algorithm for avoiding deadlock requires knowing resource requirements in advance
Which of the following statements is NOT true? Deadlock can never occur if all resources can be shared by competing proces...
939
views
answered
Jan 30, 2017
Databases
tbb-mockgate-2
databases
operating-system
deadlock-prevention-avoidance-detection
bankers-algorithm
+
–
2
votes
62
Test by Bikram | Mock GATE | Test 2 | Question: 4
Which of the following languages over the alphabet $A = $\left \{ 0,1 \right \}$ is regular ? $\{ w ∈ A^* : w$ contains a $1$ in every position that is a power of $2\}$ $\{ w ∈ A^* : w$ contains a prime number of $1's \}$ $\{ w ∈ ... that $w = uu \}$ $\{ w ∈ A^* : w$ does not contain any $1's$ in even positions, where the leftmost position is $1 \}$
Which of the following languages over the alphabet $A = $$\left \{ 0,1 \right \}$ is regular ? $\{ w ∈ A^* : w$ contains a $1$ in every position that is a power of ...
636
views
answered
Jan 30, 2017
Theory of Computation
tbb-mockgate-2
theory-of-computation
identify-class-language
regular-language
+
–
1
votes
63
Test by Bikram | Mock GATE | Test 2 | Question: 12
Why might quick sort be preferred over insertion sort and merge sort? The worst-case asymptotic algorithmic complexity of quick sort is superior to that of insertion sort and merge sort. In situations where little temporary space is available, ... on a long tape, the average run time of quick sort is superior to that of insertion and merge sort.
Why might quick sort be preferred over insertion sort and merge sort?The worst-case asymptotic algorithmic complexity of quick sort is superior to that of insertion sort ...
603
views
answered
Jan 30, 2017
GATE
tbb-mockgate-2
algorithms
sorting
quick-sort
+
–
1
votes
64
Test by Bikram | Mock GATE | Test 2 | Question: 23
Suppose a user turns on a computer, starts a browser, types http://www.google.com, and hits ENTER. Which of the following protocols would probably not be used at any point to serve this request? $IP$ $TCP$ $UDP$ $SMTP$
Suppose a user turns on a computer, starts a browser, types http://www.google.com, and hits ENTER.Which of the following protocols would probably not be used at any point...
344
views
answered
Jan 29, 2017
GATE
tbb-mockgate-2
computer-networks
application-layer-protocols
+
–
1
votes
65
Test by Bikram | Mock GATE | Test 2 | Question: 39
A relation can be defined by giving the ordered pairs of elements for which the relation holds. Let $R$ be defined over $\left \{ a,b,c \right \}$ by $R$ $=$ ... properties does $R$ have? Symmetry Antisymmetry Reflexivity Transitivity II and III only II and IV only I, III, and IV II, III, and IV
A relation can be defined by giving the ordered pairs of elements for which the relation holds.Let $R$ be defined over $\left \{ a,b,c \right \}$ by $R$ $=$ $\left \{ \le...
349
views
answered
Jan 29, 2017
Set Theory & Algebra
tbb-mockgate-2
discrete-mathematics
set-theory&algebra
relations
+
–
5
votes
66
Test by Bikram | Mock GATE | Test 2 | Question: 33
Let A represent the below matrix: $\begin{pmatrix} 1 & 0 & 3 \\ 2 & 1 & -1 \\ 1 & -1 & 1 \end{pmatrix}$ Then which among these four options are correct : $A^{3}$ $+ 3$ $A^{2}$ $+ A – 9I = 0$ $A^{3}$ $- 3$ $A^{2}$ $- A + 9I = 0$ $A^{3}$ $- 3$ $A^{2}$ $+ A + 9I = 0$ $A^{3}$+ 3$ $A^{2}$- A + 9I = 0$
Let A represent the below matrix:$\begin{pmatrix} 1 & 0 & 3 \\ 2 & 1 & -1 \\ 1 & -1 & 1 \end{pmatrix}$Then which among these four options are correct :$A^{3}$ $+ 3$ $A^{2...
415
views
answered
Jan 29, 2017
GATE
tbb-mockgate-2
engineering-mathematics
linear-algebra
matrix
+
–
3
votes
67
Test by Bikram | Mock GATE | Test 2 | Question: 22
A certain hard drive rotates at $6000$ $rpm$. It has $1 KB$ per sector and averages $128$ sectors per track. Consider the following statements: The average latency of the drive is under $6$ $milliseconds$. The burst data rate of the drive is ... . Which of the above statements is/are true? II and III only I, II, and III I and II only II only
A certain hard drive rotates at $6000$ $rpm$. It has $1 KB$ per sector and averages $128$ sectors per track.Consider the following statements:The average latency of the d...
505
views
answered
Jan 29, 2017
GATE
tbb-mockgate-2
operating-system
disk
+
–
3
votes
68
Test by Bikram | Mock GATE | Test 2 | Question: 34
Suppose that a certain computer with paged virtual memory has $4 KB$ pages, a $32-bit$ byte addressable virtual address space, and a $30-bit$ byte-addressable physical address space. The system manages an inverted page table, where ... ). Then the size of the basic inverted page table, including page numbers and overhead bits is ________ $bytes$.
Suppose that a certain computer with paged virtual memory has $4 KB$ pages, a $32-bit$ byte addressable virtual address space, and a $30-bit$ byte-addressable physical ad...
869
views
answered
Jan 29, 2017
Operating System
tbb-mockgate-2
numerical-answers
operating-system
virtual-memory
+
–
3
votes
69
UGC NET CSE | January 2017 | Part 3 | Question: 29
In RSA public key cryptosystem suppose $n=p*q$ where $p$ and $q$ are primes. $(e,n)$ and $(d,n)$ are public and private keys respectively. Let $M$ be an integer such that $o< M< n$ and $\phi(n)=(p-1)(q-1)$. Which of the following equations ... I and II I and III II and III I and IV
In RSA public key cryptosystem suppose $n=p*q$ where $p$ and $q$ are primes. $(e,n)$ and $(d,n)$ are public and private keys respectively. Let $M$ be an integer such that...
1.1k
views
answered
Jan 28, 2017
Computer Networks
ugcnetcse-jan2017-paper3
computer-networks
rsa-security-networks
+
–
0
votes
70
UGC NET CSE | January 2017 | Part 3 | Question: 25
Suppose there are N stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that only one station transmits in a given slot is____ $nP(1-P)^{n-1}$ $nP$ $P(1-P)^{n-1}$ $n^P (1-P)^{n-1}$
Suppose there are N stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that only one station transmits i...
1.9k
views
answered
Jan 28, 2017
Computer Networks
ugcnetcse-jan2017-paper3
computer-networks
lan-technologies
+
–
0
votes
71
UGC NET CSE | January 2017 | Part 3 | Question: 19
Which of the following are not regular? Strings of even number of a’s Strings of a’s , whose length is a prime number. Set of all palindromes made up of a’s and b’s. Strings of a’s whose length is a perfect square. (i) and (ii) only (i), (ii) and (iii) only (ii),(iii) and (iv) only (ii) and (iv) only
Which of the following are not regular?Strings of even number of a’sStrings of a’s , whose length is a prime number. Set of all palindromes made up of a’s and b’s...
1.5k
views
answered
Jan 28, 2017
Theory of Computation
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
+
–
1
votes
72
UGC NET CSE | January 2017 | Part 3 | Question: 21
Given the following statements: A class of languages that is closed under union and complementation has to be closed under intersection A class of languages that is closed under union and intersection has to be closed under complementation Which of the following options is ... and (ii) are true (i) is true, (ii) is false (i) is false, (ii) is true
Given the following statements:A class of languages that is closed under union and complementation has to be closed under intersectionA class of languages that is closed ...
2.6k
views
answered
Jan 28, 2017
Theory of Computation
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
+
–
0
votes
73
is it conflict or view serializable?
228
views
answered
Jan 28, 2017
2
votes
74
Virtual Gate Test Series: Programming & DS - Tree
The minimum number of vertices having degree $1$ in a tree of at least $10$ vertices is ______________. If we consider this question, then the first answer comes in our mind is $'2',$ right? But what if Tree isn't binary? if the root node has $9$ leaf nodes, so all those nodes having degree $1,$ right$?$ So the answer could be$:9$
The minimum number of vertices having degree $1$ in a tree of at least $10$ vertices is ______________.If we consider this question, then the first answer comes in our mi...
469
views
answered
Jan 27, 2017
DS
data-structures
tree
virtual-gate-test-series
+
–
1
votes
75
UGC NET CSE | January 2017 | Part 3 | Question: 36
Match the following with respect to algorithm paradigms : ... $\text{a-ii, b-i, c-iii, d-iv}$ $\text{a-iii, b-ii, c-i, d-iv}$
Match the following with respect to algorithm paradigms :$\begin{array}{clcl} & \textbf{List-I} & {} & \textbf{List-II} \\ \text{a.} & \text{Merge sort} & \text{i.} & \te...
1.6k
views
answered
Jan 27, 2017
Algorithms
ugcnetcse-jan2017-paper3
algorithms
easy
match-the-following
+
–
2
votes
76
UGC NET CSE | January 2017 | Part 3 | Question: 38
Given the array of integers ‘array’ shown below: 13 7 27 2 18 33 9 11 22 8 What is the output of the following JAVA statements? int[] p = new int [10]; int[] q = new int [10]; for (int k=0; k< 10; k++) p[k]=array [k]; q=p; p[4]=20; System.out.println(array[4]+":"+q[4]); 20:20 18:18 18:20 20:18
Given the array of integers ‘array’ shown below:1372721833911228What is the output of the following JAVA statements?int[] p = new int [10]; int[] q = new int [10]; fo...
2.9k
views
answered
Jan 27, 2017
Object Oriented Programming
ugcnetcse-jan2017-paper3
object-oriented-programming
java
+
–
2
votes
77
UGC NET CSE | January 2017 | Part 3 | Question: 4
Match the following : ... $\text{a-iv, b-ii, c-i, d-iii}$ $\text{a-iv, b-iii, c-ii, d-i}$
Match the following :$\begin{array}{clcl} & {\textbf{Addressing Mode}} & {} & {\textbf{Location of operand}} \\ \text{a.} & \text{Implied} & \text{i.} & \text{Registe...
1.6k
views
answered
Jan 27, 2017
CO and Architecture
ugcnetcse-jan2017-paper3
co-and-architecture
addressing-modes
match-the-following
+
–
5
votes
78
IEEE 754 single precision
The value denoted by 110000100111100000 ... 0 in IEEE 754. Signal precision standard in decimal is ____.
The value denoted by 110000100111100000 ... 0 in IEEE 754. Signal precision standard in decimal is ____.
1.8k
views
answered
Jan 27, 2017
0
votes
79
made-easy mock test2
Which of the following statement is true related to synchronization mechanism? a) If any solution is satisfying the progress condition, then it will not have any deadlock. b) Race condition occur if mutual exclusion is satisfied. c) Bounded waiting is always satisfied if there are only two processes. d) None.
Which of the following statement is true related to synchronization mechanism?a) If any solution is satisfying the progress condition, then it will not have any deadlock....
2.8k
views
answered
Jan 26, 2017
Operating System
process-synchronization
deadlock-prevention-avoidance-detection
+
–
12
votes
80
GATE2016 Aptitude Set 8: GA-5
If $\mid 9y-6 \mid = 3$, then $y^{2}-\dfrac{4}{3}y$ is . $0$ $+\dfrac{1}{3}$ $-\dfrac{1}{3}$ undefined
If $\mid 9y-6 \mid = 3$, then $y^{2}-\dfrac{4}{3}y$ is .$0$$+\dfrac{1}{3}$$-\dfrac{1}{3}$undefined
2.0k
views
answered
Jan 25, 2017
Quantitative Aptitude
quantitative-aptitude
absolute-value
+
–
0
votes
81
MadeEasy Subject Test: Theory of Computation - Identify Class Language
344
views
answered
Jan 25, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
identify-class-language
+
–
0
votes
82
MadeEasy Subject Test: Theory of Computation - Identify Class Language
254
views
answered
Jan 25, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
identify-class-language
+
–
2
votes
83
MadeEasy CBT 2017: Algorithms - Graph Algorithms
611
views
answered
Jan 22, 2017
Algorithms
made-easy-test-series
cbt-2017
algorithms
graph-algorithms
+
–
1
votes
84
MadeEasy CBT 2017: CO & Architecture - Cache Memory
892
views
answered
Jan 22, 2017
CO and Architecture
made-easy-test-series
cbt-2017
co-and-architecture
cache-memory
+
–
2
votes
85
MadeEasy CBT 2017: Programming & DS - Trees
1.6k
views
answered
Jan 22, 2017
DS
made-easy-test-series
cbt-2017
data-structures
tree
+
–
1
votes
86
L={<M> : M is a TM that accepts all even numbers }
L={<M> : M is a TM that accepts all even numbers } is it recursive/R.E??
L={<M : M is a TM that accepts all even numbers }is it recursive/R.E??
3.5k
views
answered
Jan 16, 2017
Theory of Computation
theory-of-computation
decidability
+
–
1
votes
87
bits stuffing
1.2k
views
answered
Jan 9, 2017
1
votes
88
doubt
#plz explain??
#plz explain??
759
views
answered
Jan 6, 2017
Computer Networks
computer-networks
+
–
1
votes
89
prime attribute
910
views
answered
Jan 4, 2017
Page:
« prev
1
2
3
4
5
6
7
8
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register