Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
SPluto
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by SPluto
1
answer
1
IIT Madras MS written test 2019 - TOC - 1
Let L1 and L2 be 2 languages which are not regular. Which of these is true? The union of L1 and L2 is not regular. The intersection of L1 and L2 is not regular. Both I and II are true I is true, II is false I is false, II is true Both I and II are false
Let L1 and L2 be 2 languages which are not regular. Which of these is true?The union of L1 and L2 is not regular.The intersection of L1 and L2 is not regular.Both I and I...
563
views
answer selected
May 24, 2019
Theory of Computation
iit-madras
ms
written-test
2019
+
–
1
answer
2
IIT Madras MS written test 2019 - C prog.
for(; i != 0; --i) { printf("\nIITM"); --i; } If i is initialized to 100, then IITM will be printed 50 times If i is initialized to 101, then IITM will be printed 51 times Both I and II are true I is true, II is false I is false, II is true Both I and II are false
for(; i != 0; i) { printf("\nIITM"); i; }If i is initialized to 100, then IITM will be printed 50 timesIf i is initialized to 101, then IITM will be printed 51 timesBot...
615
views
answer edited
May 24, 2019
Programming in C
iit-madras
ms
written-test
2019
+
–
0
answers
3
IIT Madras MS written test 2019 - Algorithms - 1
Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph. Which of the following is true? SP is NP-hard, LP is not LP is NP-hard, SP is not Both are NP-hard Neither SP nor LP is NP-hard
Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph....
499
views
asked
May 2, 2019
Algorithms
iit-madras
ms
written-test
2019
+
–
0
answers
4
IIT Madras MS written test 2019 - OS - 1
A scheduler - such as an OS scheduler - can suffer from the priority inversion problem, in which a lower priority process indirectly pre-empts a higher priority process, and this can happen due to the usage of shared resources and mutual exclusion. ... the highest priority by the time it exits the CS. S1 alone S2 alone Neither S1 nor S2 Either S1 or S2
A scheduler – such as an OS scheduler – can suffer from the priority inversion problem, in which a lower priority process indirectly pre-empts a higher priority proce...
479
views
asked
May 2, 2019
Operating System
iit-madras
ms
written-test
2019
+
–
2
answers
5
IIT Madras MS written test 2019 - DBMS
Which of the following statements about SQL queries is true? The GROUP BY clause has nothing to do with Aggregate functions. The GROUP BY clause can only be used when Aggregate functions are used. Aggregate functions can only be used when the GROUP BY clause has been used. The GROUP BY clause can be used even when Aggregate functions are not used.
Which of the following statements about SQL queries is true?The GROUP BY clause has nothing to do with Aggregate functions.The GROUP BY clause can only be used when Aggre...
482
views
asked
May 2, 2019
Databases
iit-madras
ms
written-test
2019
+
–
1
answer
6
IIT Madras MS written test 2019
Which of the following infinite sets have the same cardinality? $\mathbb{N}$ : Set of Natural numbers $\mathbb{E}$ : Set of Even numbers $\mathbb{Q}$ : Set of Rational numbers $\mathbb{R}$ : Set of Real numbers $\mathbb{N}$ and $\mathbb{E}$ $\mathbb{Q}$ and $\mathbb{R}$ $\mathbb{R}$ and $\mathbb{N}$ None of the above
Which of the following infinite sets have the same cardinality?$\mathbb{N}$ : Set of Natural numbers$\mathbb{E}$ : Set of Even numbers$\mathbb{Q}$ : Set of Rational numbe...
689
views
commented
May 2, 2019
Set Theory & Algebra
iit-madras
ms
written-test
2019
+
–
1
answer
7
IIIT H 2018
Assume that an integer and a pointer each takes 4 bytes. Also assume there is no alignment in objects. Predict the output #include <iostream> using namespace std; class Test{ static int x; int *ptr; int y; }; int main() { // your code goes here Test t; int a; cout<<sizeof(t)<<"\n"; cout<<sizeof(Test *); return 0; }
Assume that an integer and a pointer each takes 4 bytes. Also assume there is no alignment in objects. Predict the output #include <iostream using namespace std; class Te...
1.6k
views
comment edited
Apr 23, 2019
Programming in C
iiith-pgee
+
–
6
answers
8
GATE CSE 2004 | Question: 3
A single array $A[1 \ldots \text{MAXSIZE}]$ is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables $top1$ and $top2$ $(top1 < top 2)$ point to the location of the topmost element in each of the stacks. If the space is to ... $(top1 = \text{MAXSIZE} / 2)$ or $(top2 = \text{MAXSIZE})$ $top1 = top2 - 1$
A single array $A[1 \ldots \text{MAXSIZE}]$ is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables $top1$ and $top2$ $(top1 < top...
35.1k
views
commented
Mar 14, 2019
DS
gatecse-2004
data-structures
stack
easy
+
–
2
answers
9
GATE CSE 2004 | Question: 67
The microinstructions stored in the control memory of a processor have a width of $26$ bits. Each microinstruction is divided into three fields: a micro-operation field of $13$ bits, a next address field $(X),$ and a MUX select field $(Y).$ There are $8$ status bits in the ... of the control memory in number of words? $10, 3, 1024$ $8, 5, 256$ $5, 8, 2048$ $10, 3, 512$
The microinstructions stored in the control memory of a processor have a width of $26$ bits. Each microinstruction is divided into three fields: a micro-operation field o...
13.4k
views
commented
Mar 14, 2019
CO and Architecture
gatecse-2004
co-and-architecture
microprogramming
normal
+
–
3
answers
10
GATE CSE 2014 Set 1 | Question: 3
Let $G=(V,E)$ be a directed graph where $V$ is the set of vertices and $E$ the set of edges. Then which one of the following graphs has the same strongly connected components as $G$ ? $G_1$ = $(V,E_1)$ ... $u$ to $v$ in $E\}$ $G_4$ = $(V_4,E)$ where $V_4$ is the set of vertices in $G$ which are not isolated
Let $G=(V,E)$ be a directed graph where $V$ is the set of vertices and $E$ the set of edges. Then which one of the following graphs has the same strongly connected compon...
16.7k
views
commented
Mar 1, 2019
DS
gatecse-2014-set1
data-structures
graph-theory
ambiguous
+
–
1
answer
11
ISRO-DEC2017-46
In a compact one-dimensional array representation for lower triangular matrix (all elements above diagonal are zero) of size $n\times n,$ non zero elements of each row are stored one after another, starting from first row, the index of $(i,j)^{th}$ element in this niw representation is $i+j$ $j+\dfrac{i(i-1)}{2}$ $i+j-1$ $i+\dfrac{j(j-1)}{2}$
In a compact one-dimensional array representation for lower triangular matrix (all elementsabove diagonal are zero) of size $n\times n,$ non zero elements of each row are...
1.8k
views
commented
Feb 27, 2019
Programming in C
isrodec2017
+
–
2
answers
12
ISRO2015-76
Consider the following statements #define hypotenuse (a, b) sqrt (a*a+b*b); The macro call hypotenuse(a+2,b+3); Finds the hypotenuse of a triangle with sides $a+2$ and $b+3$ Finds the square root of $(a+2)^2$ and $(b+3)^2$ Is invalid Find the square root of $3 *a+4*b+5$
Consider the following statements#define hypotenuse (a, b) sqrt (a*a+b*b);The macro call hypotenuse(a+2,b+3);Finds the hypotenuse of a triangle with sides $a+2$ and $b+3$...
5.9k
views
commented
Feb 27, 2019
Programming in C
programming-in-c
macros
isro2015
+
–
3
answers
13
[DBMS] Number of view equal schedules
Number of schedules view equal to following schedule :- r1(A), w1(B), r2(A), w2(B), r3(A), w3(B)
Number of schedules view equal to following schedule :- r1(A), w1(B), r2(A), w2(B), r3(A), w3(B)
10.4k
views
commented
Jan 30, 2019
Databases
databases
view-serializable
transaction-and-concurrency
+
–
1
answer
14
MadeEasy Test Series: Combinatory - Permutations And Combinations
why is my approach giving wrong answer: choose 2 men from 8: 8C2 choose 3 women from 5: 5C3 rest 8 people left ( 8+5- 5= 8) , choose 1 from these 8 people = 8C1 Hence after multiplying above three we get 4480 but answer given is 700
why is my approach giving wrong answer:choose 2 men from 8: 8C2choose 3 women from 5: 5C3rest 8 people left ( 8+5- 5= 8) , choose 1 from these 8 people = 8C1Hence after ...
303
views
answer edited
Jan 22, 2019
Mathematical Logic
discrete-mathematics
combinatory
made-easy-test-series
+
–
1
answer
15
MadeEasy Test Series: Digital Logic - Decoder
A $3 \times 8$ decoder with two enables inputs is to be used to address 8 blocks of memory. What will be the size of each memory block when addressed from a sixteen-bit bus with two MSBs used to enable the decoder? $i)2k$ $ii)4k$ $iii)16k$ $iv) 64k$ What does “two enable inputs is to be used” mean? I am not able to visualize the circuit.
A $3 \times 8$ decoder with two enables inputs is to be used to address 8 blocks of memory. What will be the size of each memory block when addressed from a sixteen-bit ...
2.2k
views
commented
Jan 18, 2019
Digital Logic
made-easy-test-series
decoder
digital-logic
+
–
0
answers
16
made easy mock1
let L={set of all strings over {0,1}* , containing 01 and 011 as the substring } number of states in the minimal DFA of L’ is? i’m getting 3. please confirm if you are getting 3 or 4.
let L={set of all strings over {0,1}* , containing 01 and 011 as the substring }number of states in the minimal DFA of L’ is?i’m getting 3. please confirm if you are ...
1.2k
views
commented
Jan 17, 2019
Theory of Computation
theory-of-computation
finite-automata
+
–
5
answers
17
GATE CSE 2014 Set 2 | Question: 9
A $4$-way set-associative cache memory unit with a capacity of $16$ KB is built using a block size of $8$ words. The word length is $32$ bits. The size of the physical address space is $4$ GB. The number of bits for the TAG field is ____
A $4$-way set-associative cache memory unit with a capacity of $16$ KB is built using a block size of $8$ words. The word length is $32$ bits. The size of the physical ad...
25.7k
views
commented
Jan 3, 2019
CO and Architecture
gatecse-2014-set2
co-and-architecture
cache-memory
numerical-answers
normal
+
–
3
answers
18
GATE IT 2007 | Question: 67
Consider the following implications relating to functional and multivalued dependencies given below, which may or may not be correct. if $A \rightarrow \rightarrow B$ and $A \rightarrow \rightarrow C$ then $A \rightarrow BC$ if $A \rightarrow B$ ... then $A \rightarrow \rightarrow C$ Exactly how many of the above implications are valid? $0$ $1$ $2$ $3$
Consider the following implications relating to functional and multivalued dependencies given below, which may or may not be correct.if $A \rightarrow \rightarrow B$ and ...
12.8k
views
commented
Dec 28, 2018
Databases
gateit-2007
databases
database-normalization
multivalued-dependency-4nf
normal
+
–
8
answers
19
GATE CSE 1998 | Question: 1.34
Which normal form is considered adequate for normal relational database design? $2NF$ $5NF$ $4NF$ $3NF$
Which normal form is considered adequate for normal relational database design?$2NF$$5NF$$4NF$$3NF$
10.2k
views
commented
Dec 28, 2018
Databases
gate1998
databases
database-normalization
easy
+
–
9
answers
20
GATE CSE 2014 Set 2 | Question: GA-10
At what time between $6$ a. m. and $7$ a. m. will the minute hand and hour hand of a clock make an angle closest to $60^{\circ}$? $6: 22$ a.m. $6: 27$ a.m. $6: 38$ a.m. $6: 45$ a.m.
At what time between $6$ a. m. and $7$ a. m. will the minute hand and hour hand of a clock make an angle closest to $60^{\circ}$?$6: 22$ a.m.$6: 27$ a.m.$6: 38$ a.m.$6: 4...
10.0k
views
commented
Dec 7, 2018
Quantitative Aptitude
gatecse-2014-set2
quantitative-aptitude
normal
clock-time
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register