The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by VS
User VS
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User VS
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+2
votes
1
ISRO201877
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

1.1k
views
isro2018
computernetworks
networksecurity
firewalls
+3
votes
2
ISRO201867
In multiprogrammed 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 multiprogrammed 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
Operating System

799
views
isro2018
operatingsystem
+14
votes
3
ISRO201849
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
Databases

2.7k
views
isro2018
databases
btree
+10
votes
4
ISRO201846
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
Computer Networks

1.9k
views
isro2018
computernetworks
networksecurity
+8
votes
5
ISRO201832
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
CO and Architecture

862
views
isro2018
coandarchitecture
numberrepresentation
+1
vote
6
ISRO201830
Which of the following comment about peephole 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
Compiler Design

969
views
isro2018
compilerdesign
codeoptimization
+9
votes
7
ISRO201826
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.9k
views
isro2018
finiteautomata
theoryofcomputation
mooremealymachine
+6
votes
8
ISRO201824
Choose the correct statement  $A=\{a^nb^n \mid n= 1, 2, 3, \ldots\}$ 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
answered
Apr 23, 2018
in
Theory of Computation

1.5k
views
isro2018
identifyclasslanguage
theoryofcomputation
+8
votes
9
ISRO201815
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
answered
Apr 23, 2018
in
Set Theory & Algebra

2k
views
isro2018
functions
settheory&algebra
+3
votes
10
ISRO201813
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
Operating System

1.5k
views
isro2018
operatingsystem
pipes
nongate
+11
votes
11
ISRO20181
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
answered
Apr 23, 2018
in
Programming

3.5k
views
isro2018
programming
+1
vote
12
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

159
views
grammar
theoryofcomputation
+26
votes
13
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

1.1k
views
permutationandcombination
madeeasytestseries
+3
votes
14
#Conflict Misses
A byte addressable computer has a small data cache capable of holding 16 32bit words. Each cache block consist of four 32 bits words. For the following sequence of main memory addresses (in hexadecimal). The conflict miss if 2way set associative LRU cache is used is ________. 100, 108, 114, 1C7, 128, 1B5, 100, 108, 1C7
answered
Jan 21, 2018
in
CO and Architecture

303
views
cachememory
coandarchitecture
+2
votes
15
#of variables in SSA
Consider the following code segment: c=b+a e=ca f=c*e h=c+a i=h+f The minimum number of $\color{blue} {total}$ and $\color{blue} {temporary }$ variable required to convert the above code segment to static single assignment form are ________
answered
Jan 12, 2018
in
Compiler Design

310
views
compilerdesign
staticsingleassignment
+10
votes
16
Hashing (Test Series)
Consider an initially empty hash table of length 10. Following set of keys are inserted using open addressing with hash function h(k) = k mod 10 and linear probing. 0 1 91 2 2 3 13 4 24 5 12 6 62 7 77 8 82 9 The number of different insertion sequence of the key values using the given hash function and linear probing will result in the hash table shown in above __________.
answered
Jan 3, 2018
in
DS

1.2k
views
hashing
+2
votes
17
ME test series
A system has 10 identical resources and N processes competing for them. Each process can request atmost 3 resources but by grouping of first 3 processes needs only 6 resources. Then, the maximum value of ‘N’ is _______.
answered
Dec 16, 2017
in
Operating System

1.1k
views
+6
votes
18
[TOC] Identify class of language
L={$a^m$b^n$  m <= n <= 3m }
answered
Nov 26, 2017
in
Theory of Computation

136
views
theoryofcomputation
identifyclasslanguage
0
votes
19
MADE EASY TEST SERIES
Consider a linked list of length n is implemented using a circular array P[0, n  1], two variables first and last are used to point the first and last element of the list present in array respectively i.e., first = P and last = (P + x) mod n, where x is the size of ... the time complexity of above two operations respectively? O(n), O(n) O(n), O(1) O(1), O(1) O(1), O(n)
answered
Nov 24, 2017
in
DS

205
views
+2
votes
20
Inplace Merge Sort via Doubly linked list in place of Array
In general merge sort is not considered inplace sorting technique. Because an auxiliary array is used. If we will try to do it inplace in array data structure then our merge procedure will take O($n^2$) time. so overall ... list in place of Array (for storing and merging data) ? Please share your valuable opinion. It will be great help.
answered
Nov 3, 2017
in
Algorithms

316
views
algorithms
sorting
spacecomplexity
linkedlists
timecomplexity
0
votes
21
algorithms Asymptotic Notations
answered
Aug 12, 2017
in
Algorithms

269
views
asymptoticnotations
algorithms
timecomplexity
+3
votes
22
CN Boot P Protocol
In bootp protocol client puts all 0 in source IP and broadcast the packet.Then relay agent encapsulate that in a unicast packet and send to boot p server. How does boot p server know the Mac address of the client to which it is assigning the address ?
answered
Aug 12, 2017
in
Computer Networks

66
views
computernetworks
+2
votes
23
CN Data link layer
True/False: 1. The communication between Network layer and Mac sublayer is contention less. 2. The communication between Network layer and LLC sublayer is contention less.
answered
Aug 11, 2017
in
Computer Networks

226
views
computernetworks
link
layer
data
0
votes
24
half adder
If only half adder used for addition then the number of half adders required to add two 'm' bit numbers is; A) 2m1 B) 2m1 C) 2m+1 D)2m
answered
Aug 11, 2017
in
Digital Logic

929
views
+17
votes
25
GATE199770
Following is a state table for time finite state machine. ... states. For example if states $X$ and $Y$ are equivalent then use $XY$ as the name for the equivalent state in the minimal machine).
answered
Aug 9, 2017
in
Theory of Computation

1.7k
views
gate1997
theoryofcomputation
minimalstateautomata
+5
votes
26
TOC DCFL vs CFL
1. L ={ a^n b^m c^x d^y  n=m or x=y} 2. L ={ a^n b^x c^m d^y  n=m or x=y} Classify above in CFL/DCFL?
answered
Aug 8, 2017
in
Theory of Computation

540
views
theoryofcomputation
contextfreelanguages
dcfl
+43
votes
27
GATE200311
Consider an array multiplier for multiplying two $n$ bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is $\Theta(1)$ $\Theta(\log n)$ $\Theta(n)$ $\Theta(n^2)$
answered
Aug 6, 2017
in
Digital Logic

5k
views
gate2003
digitallogic
normal
arraymultiplier
+17
votes
28
GATE200736
The control signal functions of a $4$$bit$ binary counter are given below (where $X$ ... cycles through the following sequence: $0, 3, 4$ $0, 3, 4, 5$ $0, 1, 2, 3, 4$ $0, 1, 2, 3, 4, 5$
answered
Aug 5, 2017
in
Digital Logic

7.3k
views
gate2007
digitallogic
circuitoutput
normal
+20
votes
29
GATE200019
Consider the syntax directed translation scheme (SDTS) given in the following. Assume attribute evaluation with bottomup parsing, i.e., attributes are evaluated immediately after a reduction. E$\rightarrow $ E$_{1}$ * T {E.val = E$_{1}$.val * T.val} E ... the SDTS given, without changing the grammar, to find $E.red$, the number of reductions performed while reducing an input to $E$.
answered
Jul 7, 2017
in
Compiler Design

1.7k
views
gate2000
compilerdesign
syntaxdirectedtranslation
normal
descriptive
+12
votes
30
GATE199412
Assume that a CPU has only two registers $R_1$ and $R_2$ and that only the following instruction is available $XOR \: R_i, R_j;\{R_j \leftarrow R_i \oplus R_j, \text{ for } i, j =1, 2\}$ Using this XOR instruction, find an instruction sequence in order to ... $R_1$ and $R_2$ The line p of the circuit shown in figure has stuck at 1 fault. Determine an input test to detect the fault.
answered
Jul 3, 2017
in
CO and Architecture

1.1k
views
gate1994
coandarchitecture
machineinstructions
normal
+14
votes
31
TIFR2013B20
Suppose $n$ processors are connected in a linear array as shown below. Each processor has a number. The processors need to exchange numbers so that the numbers eventually appear in ascending order (the processor $\rm P1$ should have the minimum value and the the processor $\rm Pn$ ... ? $n \log n$ steps $n^2$ steps $n$ steps $n^{1.5}$ steps The algorithm is not guaranteed to sort
answered
Jun 18, 2017
in
Algorithms

992
views
tifr2013
algorithms
sorting
+3
votes
32
GATE2008IT43
If we use Radix Sort to sort $n$ integers in the range $\left (n^{k/2}, n^k \right ]$, for some $k > 0$ which is independent of $n$, the time taken would be? $\Theta(n)$ $\Theta(kn)$ $\Theta(n \log n)$ $\Theta(n^2)$
answered
Jun 14, 2017
in
Algorithms

4.1k
views
gate2008it
algorithms
sorting
normal
+59
votes
33
GATE2014339
Suppose we have a balanced binary search tree $T$ holding $n$ numbers. We are given two numbers $L$ and $H$ and wish to sum up all the numbers in $T$ that lie between $L$ and $H$. Suppose there are $m$ such numbers in $T$. If the tightest upper bound on the time to compute the sum is $O(n^a\log^bn+m^c\log^dn)$, the value of $a+10b+100c+1000d$ is ______.
answered
Jun 4, 2017
in
DS

10.6k
views
gate20143
datastructures
binarysearchtree
numericalanswers
normal
0
votes
34
Made Easy Test Series
Consider the following CFG. S $\rightarrow$aAbaBcbAdbBe A$\rightarrow$g B$\rightarrow$g The number of states exist in DFA using LALR (1) construction for the above grammar ____________?? (Doubt): In CLR(1) it takes 14 states and clubbing two states into one state will take ... ...!!! So 14 is the answer, I think.. But answer in Made Easy given as 13 Only.. Explain....???!!!
answered
Dec 10, 2016
in
Compiler Design

236
views
madeeasytestseries
cfg
finiteautomata
50,737
questions
57,296
answers
198,262
comments
104,974
users