Recent activity by VS - GATE Overflow

3 answers

1

ISRO2018-24
Choose the correct statement - $A$=${$a$*$b$ $\mid$ $n= 1, 2, 3,$ ...} is a regular language The set $B$, consisting of all strings made up of only $a's$ and $b's$ having equal number of $a's$ and bs defines a regular language $L$(A*B)$ $\cap$B$ gives the set $A$ None of the above

answer edited May 3, 2018 in Others | 1.2k views

3 answers

2

ISRO2018-77
What is one advantage of setting up a $DMZ$ (Demilitarized Zone) with two firewalls? You can control where traffic goes in the three networks You can do statefull packet filtering You can do load balancing Improve network performance

answered May 1, 2018 in Computer Networks | 742 views

1 answer

3

ISRO2018-75
ln neural network, the network capacity is defined as: The traffic (tarry capacity of the network The total number of nodes in the network The number of patterns that can be stored and recalled in a network None of the above

commented Apr 30, 2018 in Others | 451 views

1 answer

4

ISRO2018-73
For a multi-processor architecture, in which protocol a write transaction is forwarded to only those processors that are known ti possess a copy of newly altered cache line? Snoopy bus protocol Cache coherency protocol Directory based protocol None of the above

commented Apr 30, 2018 in Others | 680 views

4 answers

5

ISRO2018-78
Which one of the following algorithm is not used in asymmetric key cryptography? RSA Algorithm Gillie-Hellman Algorithm Electronic Code Book Algorithm None of the above

commented Apr 30, 2018 in Others | 757 views

2 answers

6

ISRO2018-68
In multi-programmed systems, it is advantageous if some programs such as editors anf compilers can be shared by several users. Which of the following must be true of multi-programmed systems in order that a single copy of a program can be shared by several users? The program is a macro The program is recursive The program is reentrant I only II only III only I, II and III

answered Apr 30, 2018 in Others | 543 views

1 answer

7

ISRO2018-60
What is the output of tho following program? main(){ int x=2, y=5; if(x<y) return (x=x+y); else printf("z1"); printf("z2"); } $z2$ $z1z2$ Compilation error None of these

commented Apr 30, 2018 in Others | 702 views

4 answers

8

ISRO2018-49
in a file which contains $1$ million records and the order of the tree is $100$, then what is the maximum number of nodes to be accessed if $B$+ tree index is used? $5$ $4$ $3$ $10$

answered Apr 26, 2018 in Others | 1.6k views

3 answers

9

ISRO2018-46
In cryptography, the following uses transposition ciphers and the keyword is LAYER. Encrypt the following message. (Spaces are omitted during encrypton) WELCOME TO NETWORK SECURITY! WMEKREETSILTWETCOOCYONRU! EETSICOOCYWMEKRONRU!LTWET LTWETONRU!WMEKRCOOCYEETSI ONRU!COOCYLTWETEETSIWMEKR

answered Apr 26, 2018 in Others | 978 views

3 answers

10

ISRO2018-15
The domain of the function log (log sin(x)) is: $0<x<$\pi$ $2n$\pi$<$x$<$(2n+1)$\pi$, for $n$ in $N$ Empty set None of the above

answer edited Apr 26, 2018 in Others | 1.1k views

2 answers

11

ISRO2018-32
A computer uses ternary system instead of the traditional systen, An $n$ bit string in the binary system will occupy $3+n$ ternary digits $2n/3$ ternary digits $n$\log_{2}3$ ternary digits $n$\log_{3}2$ ternary digits

answered Apr 24, 2018 in Others | 477 views

2 answers

12

ISRO2018-30
Which of the following comment about peep-hole optimization is true? It is applied to small part of the code and applied repeatedly It can be used to optimize intermediate code It can be applied to a portion of the code that is not contiguous It is applied in symbol table to optimize the memory requirements.

answered Apr 24, 2018 in Others | 704 views

2 answers

13

ISRO2018-1
Consider the following program { int x=1; printf("%d",(*char(char*)&x)); } Assuming required header files are included and if the machine in which this program is executed is little endian, then the output will be 0 99999999 1 unpredictable

commented Apr 23, 2018 in Programming | 2.1k views

2 answers

14

ISRO2018-26
The $FSM$ (Finite State Machine) machine pictured in the figure above Complements a given bit pattern Finds $2's$ complement of a given bit pattern Increments a given bit pattern by $1$ Changes the sign bit

answered Apr 23, 2018 in Theory of Computation | 1.3k views

2 answers

15

ISRO2018-13
The difference between a named pipe and a regular file in Unix is that Unlike a regular file, named pipe is a special file The data in a pipe is transient, unlike the content of a regular file Pipes forbid random accessing, while regular files do allow this. All of the above

answered Apr 23, 2018 in Others | 821 views

1 answer

16

ISRO2018-10
Which of the following comparisons between static and dynamic type checking incorrect? Dynamic type checking slows down the execution Dynamic type checking offers more flexibility to the programmers In contrast to Static type checking, dynamic type checking may cause failure in runtime due to type errors Unlike static type checking dynamic type checking is done during compilation

commented Apr 23, 2018 in Others | 920 views

2 answers

17

ISRO-DEC2017-71
A $32$-$bit$ adder is formed by cascading $4$-$bit$ CLA adder.The gate delays (latency) for getting the sum bits is $16$ $18$ $17$ $19$

commented Apr 20, 2018 in Digital Logic | 2.3k views

1 answer

18

ISRO-DEC2017-37
A two-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 physical address space is $4\, GB.$ The number of bits in the TAG, SET fields are $20,7$ $19,8$ $20,8$ $21,9$

commented Apr 20, 2018 in CO and Architecture | 897 views

2 answers

19

ISRO-DEC2017-15
Consider the following table: $\text{Faculty(facName, dept, office, rank, dateHired)}$ facName dept office rank dateHired Ravi Art A101 Professor 1975 Murali Math M201 Assistant 2000 Narayanan Art A101 Associate 1992 Lakshmi Math M201 Professor 1982 Mohan CSC C101 Professor 1980 Sreeni ... $Faculty$ is Not in 3NF,in BCNF In 3NF,not in BCNF In 3NF, in BCNF Not in 3NF, not in BCNF

commented Apr 19, 2018 in Databases | 1.8k views

3 answers

20

ISRO-DEC2017-6
The proposition $(P\Rightarrow Q)\wedge (Q\Rightarrow P)$ is a Tautology Contradiction Contingency Absurdity

commented Apr 19, 2018 in Mathematical Logic | 992 views

1 answer

21

ISRO-DEC2017-2
Consider the set of integers $I.$ Let $D$ denote "divides with an integer quotient" (e.g. $4D8$ but not $4D7$). Then $D$ is Reflexive, Not Symmetric, Transitive Not Reflexive, Not Anti-symmetric, Transitive Reflexive, Anti-symmetric, Transitive Not Reflexive, Not Anti-symmetric, Not Transitive

commented Apr 19, 2018 in Set Theory & Algebra | 2.2k views

13 answers

22

GATE2007-15,ISRO2016-26
Consider the following segment of C-code: int j, n; j = 1; while (j <= n) j = j * 2; The number of comparisons made in the execution of the loop for any $n > 0$ is: $\lceil \log_2n \rceil +1$ $n$ $\lceil \log_2n \rceil$ $\lfloor \log_2n \rfloor +1$

comment edited Apr 18, 2018 in Algorithms | 9.4k views

2 answers

23

GATE2004-IT-11, ISRO2011-33
What is the bit rate of a video terminal unit with $80$ characters/line, $8$ $\text{bits/character}$ and horizontal sweep time of $100$ $\text{µs}$ (including $20$ $\text{µs}$ of retrace time)? $8$ $\text{Mbps}$ $6.4$ $\text{Mbps}$ $0.8$ $\text{Mbps}$ $0.64$ $\text{Mbps}$

comment edited Apr 13, 2018 in Operating System | 2.8k views

3 answers

24

How many DFA's exist with three states over the input alphabet {0,1}
Is there any procedure to generalize these types of problems ? Thanks in advance

commented Mar 27, 2018 in Theory of Computation | 5.3k views

1 answer

25

Peterlinz question
Please write grammar for it and explain with example. $L=\{w \: : n_a(w) > n_b(w) \}$

answered Mar 5, 2018 in Theory of Computation | 156 views

3 answers

26

GATE2018-42
Consider the following four relational schemas. For each schema , all non-trivial functional dependencies are listed, The bolded attributes are the respective primary keys. Schema I: Registration(rollno, courses) Field courses' is a set-valued attribute containing the set of ... Which one of the relational schemas above is in 3NF but not in BCNF? Schema I Schema II Schema III Schema IV

commented Feb 25, 2018 in Databases | 2.9k views

3 answers

27

GATE2018-39
In a system, there are three types of resources: $E, F$ and $G$. Four processes $P_0$, $P_1$, $P_2$ and $P_3$ execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example, ... of $F$ were available The system is not in $safe$ state, but would be $safe$ if one more instance of $G$ were available

commented Feb 23, 2018 in Operating System | 2.3k views

6 answers

28

GATE2018-22
Consider the sequential circuit shown in the figure, where both flip-flops used are positive edge-triggered D flip-flops. The number of states in the state transition diagram of this circuit that have a transition back to the same state on some value of "in" is ____

commented Feb 23, 2018 in Digital Logic | 5k views

1 answer

29

ISRO2009-49
$x=a \cos(t), y=b \sin(t)$ is the parametric form of Ellipse Hyperbola Circle Parabola

commented Feb 11, 2018 in Calculus | 1.1k views

3 answers

30

ISRO2007-09
Eigen vectors of $\begin{bmatrix} 1 && \cos \theta \\ \cos \theta && 1 \end{bmatrix}$ are $\begin{bmatrix} a^n && 1 \\ 0 && a^n \end{bmatrix}$ $\begin{bmatrix} a^n && n \\ 0 && a^n \end{bmatrix}$ ... $\begin{bmatrix} a^n && na^{n-1} \\ -n && a^n \end{bmatrix}$

commented Feb 9, 2018 in Linear Algebra | 2.3k views

0 answers

31

Merge Sort
Let A,B,C,D,E are sorted sequences having length 70,74,80,85,102 respectively.They are merged into a single sequence by merging together two sequences at a time.The minimum number of comparisons that will be needed by algorithm in best case for going merging is _________.

commented Jan 31, 2018 in Algorithms | 387 views

8 answers

32

GATE2010-41
Let $w$ be any string of length $n$ in $\{0,1\}^*$. Let $L$ be the set of all substrings of $w$. What is the minimum number of states in non-deterministic finite automation that accepts $L$? $n-1$ $n$ $n+1$ $2^{n-1}$

commented Jan 28, 2018 in Theory of Computation | 4.7k views

7 answers

33

GATE2010-37
The program below uses six temporary variables $a, b, c, d, e, f$. a = 1 b = 10 c = 20 d = a + b e = c + d f = c + e b = c + e e = b + f d = 5 + e return d + f Assuming that all operations take their operands from registers, what is the minimum number of registers needed to execute this program without spilling? $2$ $3$ $4$ $6$

commented Jan 26, 2018 in Compiler Design | 5.4k views

7 answers

34

GATE2017-2-33
A system shares $9$ ... following best describes current state of the system? Safe, Deadlocked Safe, Not Deadlocked Not Safe, Deadlocked Not Safe, Not Deadlocked

commented Jan 26, 2018 in Operating System | 3.8k views

3 answers

35

GATE2017-2-31
For any discrete random variable $X$, with probability mass function $P(X=j)=p_j, p_j \geq 0, j \in \{0, \dots , N \}$, and $\Sigma_{j=0}^N \: p_j =1$, define the polynomial function $g_x(z) = \Sigma_{j=0}^N \: p_j \: z^j$. For a certain discrete random ... $Y$ is $N \beta(1-\beta)$ $N \beta$ $N (1-\beta)$ Not expressible in terms of $N$ and $\beta$ alone

commented Jan 26, 2018 in Probability | 4.5k views

5 answers

36

GATE2017-2-24
Consider the quadratic equation $x^2-13x+36=0$ with coefficients in a base $b$. The solutions of this equation in the same base $b$ are $x=5$ and $x=6$. Then $b=$ _____

commented Jan 25, 2018 in Set Theory & Algebra | 4.2k views

6 answers

37

GATE2017-2-32
Consider the following expression grammar $G$: $E \rightarrow E-T \mid T$ $T \rightarrow T + F \mid F$ $F \rightarrow (E) \mid id$ Which of the following grammars is not left recursive, but is equivalent to $G$? $E \rightarrow E-T \mid T$ ... $F \rightarrow (E) \mid id$ $E \rightarrow TX \mid (TX)$ $X \rightarrow -TX \mid +TX \mid \epsilon$ $T \rightarrow id$

commented Jan 25, 2018 in Compiler Design | 3k views

4 answers

38

MadeEasy Test Series: Combinatory - Permutations And Combinations
MY SOLUTION : Fix the root then next level 2 elements ( 2! possibilities) next level 4 elements( 4! possibilities) last level 2 elements ( 2! possibilities) total possibility = 2! * 4! * 2! = 2 * 24 * 2 = 96 what ... that if node of above graph is filled with these elements it satisfies max heap property a)96 b)896 c)2688 d) none

answered Jan 24, 2018 in Combinatory | 963 views

1 answer

39

Identify class of the language
L={ xy | x,y$\epsilon$ (a+b)*, na(x) = nb(y) }

asked Jan 24, 2018 in Theory of Computation | 108 views

0 answers

40

Stack algorithm
Is Most Recently Used (MRU) Page replacement algorithm a 'Stack Algorithm' i.e. it doesn't suffer from Belady's Anomaly ?

commented Jan 24, 2018 in Operating System | 143 views