Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gatecse-2013
58
votes
4
answers
1
GATE CSE 2013 | Question: 53
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table $\text{(T1)},$ which occupies exactly one ... to guarantee that no two synonyms map to different sets in the processor cache of this computer? $2$ $4$ $8$ $16$
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three–level paged page table organization. The page table base register stores ...
go_editor
30.1k
views
go_editor
asked
Apr 21, 2016
Operating System
gatecse-2013
normal
operating-system
virtual-memory
+
–
16
votes
3
answers
2
GATE CSE 2013 | Question: 49
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. ... without any spill to memory? Do not apply any optimization other than optimizing register allocation. 3 4 5 6
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and on...
go_editor
6.8k
views
go_editor
asked
Apr 21, 2016
Compiler Design
out-of-syllabus-now
gatecse-2013
normal
compiler-design
target-code-generation
code-optimization
+
–
35
votes
4
answers
3
GATE CSE 2013 | Question: 51
The procedure given below is required to find and replace certain characters inside an input character string supplied in array $A$. The characters to be replaced are supplied in array $oldc$, while their respective replacement characters are supplied in array $newc$. ... will be successful in exposing the flaw in this procedure? None $2$ only $3$ and $4$ only $4$ only
The procedure given below is required to find and replace certain characters inside an input character string supplied in array $A$. The characters to be replaced are sup...
go_editor
5.2k
views
go_editor
asked
Apr 21, 2016
DS
gatecse-2013
data-structures
array
normal
+
–
38
votes
5
answers
4
GATE CSE 2013 | Question: 55
Relation $R$ has eight attributes $\text{ABCDEFGH}$. Fields of $R$ contain only atomic values. $F = \text{{CH $\rightarrow$ G, A $\rightarrow$ BC, B $\rightarrow$ CFH, E $\rightarrow$ A, F $\rightarrow$ EG}}$ is a set of functional dependencies $(FDs)$ ... in $\text{2NF}$, but not in $\text{3NF}$. in $\text{3NF}$, but not in $\text{BCNF}$. in $\text{BCNF}$.
Relation $R$ has eight attributes $\text{ABCDEFGH}$. Fields of $R$ contain only atomic values. $F = \text{{CH $\rightarrow$ G, A $\rightarrow$ BC, B $\rightarrow$ CFH, E ...
go_editor
14.5k
views
go_editor
asked
Apr 21, 2016
Databases
gatecse-2013
databases
database-normalization
normal
+
–
18
votes
6
answers
5
GATE CSE 2013 | Question: 65
The current erection cost of a structure is Rs. $13,200.$ If the labour wages per day increase by $1/5$ of the current wages and the working hours decrease by $1/24$ of the current period, then the new cost of erection in Rs. is $16,500$ $15,180$ $11,000$ $10,120$
The current erection cost of a structure is Rs. $13,200.$ If the labour wages per day increase by $1/5$ of the current wages and the working hours decrease by $1/24$ of t...
Arjun
8.0k
views
Arjun
asked
Sep 24, 2014
Quantitative Aptitude
gatecse-2013
quantitative-aptitude
normal
work-time
+
–
17
votes
3
answers
6
GATE CSE 2013 | Question: 64
A tourist covers half of his journey by train at $60\;\text{km/h}$, half of the remainder by bus at $30\;\text{km/h}$ and the rest by cycle at $10\;\text{km/h}$. The average speed of the tourist in $\text{km/h}$ during his entire journey is $36$ $30$ $24$ $18$
A tourist covers half of his journey by train at $60\;\text{km/h}$, half of the remainder by bus at $30\;\text{km/h}$ and the rest by cycle at $10\;\text{km/h}$. The aver...
Arjun
5.1k
views
Arjun
asked
Sep 24, 2014
Quantitative Aptitude
gatecse-2013
quantitative-aptitude
easy
speed-time-distance
+
–
14
votes
4
answers
7
GATE CSE 2013 | Question: 63
After several defeats in wars, Robert Bruce went in exile and wanted to commit suicide. Just before committing suicide, he came across a spider attempting tirelessly to have its net. Time and again, the spider failed but that did not deter it ... pillar of success. Honesty is the best policy. Life begins and ends with adventures. No adversity justifies giving up hope.
After several defeats in wars, Robert Bruce went in exile and wanted to commit suicide. Just before committing suicide, he came across a spider attempting tirelessly to h...
Arjun
3.5k
views
Arjun
asked
Sep 24, 2014
Verbal Aptitude
gatecse-2013
verbal-aptitude
passage-reading
normal
+
–
21
votes
2
answers
8
GATE CSE 2013 | Question: 62
Out of all the $2$-digit integers between $1$ and $100,$ a $2$-digit number has to be selected at random. What is the probability that the selected number is not divisible by $7$ ? $\left(\dfrac{13}{90}\right)$ $\left(\dfrac{12}{90}\right)$ $\left(\dfrac{78}{90}\right)$ $\left(\dfrac{77}{90}\right)$
Out of all the $2$-digit integers between $1$ and $100,$ a $2$-digit number has to be selected at random. What is the probability that the selected number is not divisibl...
Arjun
3.8k
views
Arjun
asked
Sep 24, 2014
Quantitative Aptitude
gatecse-2013
quantitative-aptitude
easy
probability
factors
+
–
24
votes
1
answer
9
GATE CSE 2013 | Question: 61
Find the sum of the expression $\frac{1}{\sqrt{1}+\sqrt{2}}+\frac{1}{\sqrt{2}+\sqrt{3}}+\frac{1}{\sqrt{3}+\sqrt{4}}+............+\frac{1}{\sqrt{80}+\sqrt{81}}$ $7$ $8$ $9$ $10$
Find the sum of the expression$\frac{1}{\sqrt{1}+\sqrt{2}}+\frac{1}{\sqrt{2}+\sqrt{3}}+\frac{1}{\sqrt{3}+\sqrt{4}}+............+\frac{1}{\sqrt{80}+\sqrt{81}}$$7$$8$$9$$10...
Arjun
7.5k
views
Arjun
asked
Sep 24, 2014
Quantitative Aptitude
gatecse-2013
quantitative-aptitude
normal
number-series
+
–
18
votes
2
answers
10
GATE CSE 2013 | Question: 60
Choose the grammatically INCORRECT sentence: He is of Asian origin. They belonged to Africa. She is an European. They migrated from India to Australia.
Choose the grammatically INCORRECT sentence:He is of Asian origin.They belonged to Africa.She is an European.They migrated from India to Australia.
Arjun
3.7k
views
Arjun
asked
Sep 24, 2014
Verbal Aptitude
gatecse-2013
verbal-aptitude
grammatical-error
normal
+
–
14
votes
4
answers
11
GATE CSE 2013 | Question: 59
Were you a bird, you ___________________ in the sky. would fly shall fly should fly shall have flown
Were you a bird, you ___________________ in the sky.would flyshall flyshould flyshall have flown
Arjun
3.9k
views
Arjun
asked
Sep 24, 2014
Verbal Aptitude
gatecse-2013
verbal-aptitude
tenses
normal
+
–
17
votes
5
answers
12
GATE CSE 2013 | Question: 58
What will be the maximum sum of $44, 42, 40, \dots$ ? $502$ $504$ $506$ $500$
What will be the maximum sum of $44, 42, 40, \dots$ ?$502$$504$$506$$500$
Arjun
5.6k
views
Arjun
asked
Sep 24, 2014
Quantitative Aptitude
gatecse-2013
quantitative-aptitude
easy
arithmetic-series
+
–
12
votes
1
answer
13
GATE CSE 2013 | Question: 57
Complete the sentence: Universalism is to particularism as diffuseness is to _______________. specificity neutrality generality adaptation
Complete the sentence:Universalism is to particularism as diffuseness is to _______________.specificityneutralitygeneralityadaptation
Arjun
2.8k
views
Arjun
asked
Sep 24, 2014
Verbal Aptitude
gatecse-2013
verbal-aptitude
normal
word-pairs
+
–
10
votes
2
answers
14
GATE CSE 2013 | Question: 56
Which one of the following options is the closest in meaning to the word given below? Nadir Highest Lowest Medium Integration
Which one of the following options is the closest in meaning to the word given below?NadirHighestLowestMediumIntegration
Arjun
2.9k
views
Arjun
asked
Sep 24, 2014
Verbal Aptitude
gatecse-2013
verbal-aptitude
meaning
normal
+
–
39
votes
3
answers
15
GATE CSE 2013 | Question: 54
Relation $R$ has eight attributes $\text{ABCDEFGH}$. Fields of $R$ contain only atomic values. $F$= $\text{{CH→G, A→BC, B→CFH, E→A, F→EG}}$ is a set of functional dependencies $(FDs)$ so that $F^+$ is exactly the set of $FDs$ that hold for $R$. How many candidate keys does the relation $R$ have? $3$ $4$ $5$ $6$
Relation $R$ has eight attributes $\text{ABCDEFGH}$. Fields of $R$ contain only atomic values. $F$=$\text{{CH→G, A→BC, B→CFH, E→A, F→EG}}$ is a set of functiona...
Arjun
14.2k
views
Arjun
asked
Sep 24, 2014
Databases
gatecse-2013
databases
database-normalization
normal
+
–
52
votes
9
answers
16
GATE CSE 2013 | Question: 50
The procedure given below is required to find and replace certain characters inside an input character string supplied in array $A$. The characters to be replaced are supplied in array $oldc$ ... given above, how many test cases will be able to capture the flaw? Only one Only two Only three All four
The procedure given below is required to find and replace certain characters inside an input character string supplied in array $A$. The characters to be replaced are sup...
Arjun
14.2k
views
Arjun
asked
Sep 24, 2014
DS
gatecse-2013
data-structures
array
normal
+
–
36
votes
5
answers
17
GATE CSE 2013 | Question: 48
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. c = ... while preserving correctness. What is the minimum number of spills to memory in the compiled code? 0 1 2 3
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and on...
Arjun
28.3k
views
Arjun
asked
Sep 24, 2014
Compiler Design
gatecse-2013
normal
compiler-design
target-code-generation
code-optimization
+
–
32
votes
4
answers
18
GATE CSE 2013 | Question: 46
A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is (A) 4 (B) 5 (C) 6 (D) 7
A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is(A...
Arjun
27.5k
views
Arjun
asked
Sep 24, 2014
Digital Logic
gatecse-2013
digital-logic
normal
out-of-syllabus-now
+
–
27
votes
2
answers
19
GATE CSE 2013 | Question: 43
The preorder traversal sequence of a binary search tree is $30, 20, 10, 15, 25, 23, 39, 35, 42$. Which one of the following is the postorder traversal sequence of the same tree? $10, 20, 15, 23, 25, 35, 42, 39, 30$ $15, 10, 25, 23, 20, 42, 35, 39, 30$ $15, 20, 10, 23, 25, 42, 35, 39, 30$ $15, 10, 23, 25, 20, 35, 42, 39, 30$
The preorder traversal sequence of a binary search tree is $30, 20, 10, 15, 25, 23, 39, 35, 42$. Which one of the following is the postorder traversal sequence of the sam...
Arjun
11.9k
views
Arjun
asked
Sep 24, 2014
DS
gatecse-2013
data-structures
binary-search-tree
normal
+
–
44
votes
2
answers
20
GATE CSE 2013 | Question: 41
Which of the following is/are undecidable? $G$ is a CFG. Is $L(G) = \phi$? $G$ is a CFG. Is $L(G) = \Sigma^*$? $M$ is a Turing machine. Is $L(M)$ regular? $A$ is a DFA and $N$ is an NFA. Is $L(A) = L(N)$? $3$ only $3$ and $4$ only $1, 2$ and $3$ only $2$ and $3$ only
Which of the following is/are undecidable?$G$ is a CFG. Is $L(G) = \phi$?$G$ is a CFG. Is $L(G) = \Sigma^*$?$M$ is a Turing machine. Is $L(M)$ regular?$A$ is a DFA and $N...
Arjun
11.0k
views
Arjun
asked
Sep 24, 2014
Theory of Computation
gatecse-2013
theory-of-computation
decidability
normal
+
–
53
votes
4
answers
21
GATE CSE 2013 | Question: 40
Consider the following two sets of $\textsf{LR(1)}$ items of an $\textsf{LR(1)}$ grammar.$\begin{array}{l|l} X \rightarrow c.X, c∕d &X → c.X, \$\\ X \rightarrow .cX, c∕ d& X → .cX, \$\\ X \rightarrow .d, c∕ d & X → .d, \$ ... $\textsf{goto}$ on $c$ will lead to two different sets. $1$ only $2$ only $1$ and $4$ only $\text{1, 2, 3}$ and $4$
Consider the following two sets of $\textsf{LR(1)}$ items of an $\textsf{LR(1)}$ grammar.$$\begin{array}{l|l}X \rightarrow c.X, c∕d &X → c.X, \$\\X \rightarrow .cX, c...
Arjun
13.2k
views
Arjun
asked
Sep 24, 2014
Compiler Design
gatecse-2013
compiler-design
parsing
normal
+
–
114
votes
6
answers
22
GATE CSE 2013 | Question: 39
A certain computation generates two arrays a and b such that $a[i] = f(i)$ for $0 \leq i < n$ and $b[i] = g(a[i])$ for $0 \leq i < n$. Suppose this computation is decomposed into two concurrent processes $X$ and $Y$ such that $X$ computes the array $a$ and $Y$ computes the ... EntryY(R, S) { V(S); P(R); } ExitX(R, S) { V(R); P(S); } EntryY(R, S) { V(S); P(R); }
A certain computation generates two arrays a and b such that $a[i] = f(i)$ for $0 \leq i < n$ and $b[i] = g(a[i])$ for $0 \leq i < n$. Suppose this computation is decompo...
Arjun
28.1k
views
Arjun
asked
Sep 24, 2014
Operating System
gatecse-2013
operating-system
process-synchronization
normal
+
–
3
votes
2
answers
23
GATE CSE 2013 | Question: 38
The following figure represents access graphs of two modules M1 and M2. The filled circles represent methods and the unfilled circles represent attributes. If method $m$ is moved to module M2 keeping the attributes where they are, what can we ... coupling is reduced. (C) Average cohesion goes down and coupling also reduces. (D) Average cohesion and coupling increase.
The following figure represents access graphs of two modules M1 and M2. The filled circles represent methods and the unfilled circles represent attributes. If method $m$ ...
Arjun
3.5k
views
Arjun
asked
Sep 24, 2014
IS&Software Engineering
gatecse-2013
is&software-engineering
software-coupling
easy
+
–
48
votes
7
answers
24
GATE CSE 2013 | Question: 37
In an IPv4 datagram, the $M$ bit is $0$, the value of $HLEN$ is $10$, the value of total length is $400$ and the fragment offset value is $300$. The position of the datagram, the sequence numbers of the first and the last bytes of the payload, ... , $2400$ and $2789$ First fragment, $2400$ and $2759$ Last fragment, $2400$ and $2759$ Middle fragment, $300$ and $689$
In an IPv4 datagram, the $M$ bit is $0$, the value of $HLEN$ is $10$, the value of total length is $400$ and the fragment offset value is $300$. The position of the datag...
Arjun
30.0k
views
Arjun
asked
Sep 24, 2014
Computer Networks
gatecse-2013
computer-networks
ip-addressing
normal
+
–
23
votes
5
answers
25
GATE CSE 2013 | Question: 36
Determine the maximum length of the cable (in km) for transmitting data at a rate of $500$ Mbps in an Ethernet LAN with frames of size $10,000$ bits. Assume the signal speed in the cable to be $2,00,000$ km/s. $1$ $2$ $2.5$ $5$
Determine the maximum length of the cable (in km) for transmitting data at a rate of $500$ Mbps in an Ethernet LAN with frames of size $10,000$ bits. Assume the signal sp...
Arjun
16.8k
views
Arjun
asked
Sep 24, 2014
Computer Networks
gatecse-2013
computer-networks
ethernet
normal
+
–
52
votes
2
answers
26
GATE CSE 2013 | Question: 35
Consider the following relational schema. Students(rollno: integer, sname: string) Courses(courseno: integer, cname: string) Registration(rollno: integer, courseno: integer, percent: real) Which of the following queries are equivalent to this query in English? Find the distinct names of ... I, II, III and IV I, II and III only I, II and IV only II, III and IV only
Consider the following relational schema.Students(rollno: integer, sname: string)Courses(courseno: integer, cname: string)Registration(rollno: integer, courseno: integer,...
Arjun
15.0k
views
Arjun
asked
Sep 24, 2014
Databases
gatecse-2013
databases
sql
relational-calculus
normal
+
–
61
votes
9
answers
27
GATE CSE 2013 | Question: 34
A shared variable $x$, initialized to zero, is operated on by four concurrent processes $W, X, Y, Z$ as follows. Each of the processes $W$ and $X$ reads $x$ from memory, increments by one, stores it to memory, and then terminates. Each of the ... initialized to two. What is the maximum possible value of $x$ after all processes complete execution? $-2$ $-1$ $1$ $2$
A shared variable $x$, initialized to zero, is operated on by four concurrent processes $W, X, Y, Z$ as follows. Each of the processes $W$ and $X$ reads $x$ from memory, ...
Arjun
22.3k
views
Arjun
asked
Sep 24, 2014
Operating System
gatecse-2013
operating-system
process-synchronization
normal
+
–
49
votes
4
answers
28
GATE CSE 2013 | Question: 33
Consider the DFA $A$ given below. Which of the following are FALSE? Complement of $L(A)$ is context-free. $L(A) = L((11^*0+0)(0 + 1)^*0^*1^*) $ For the language accepted by $A, A$ is the minimal DFA. $A$ accepts all strings over $\{0, 1\}$ of length at least $2$. 1 and 3 only 2 and 4 only 2 and 3 only 3 and 4 only
Consider the DFA $A$ given below. Which of the following are FALSE?Complement of $L(A)$ is context-free.$L(A) = L((11^*0+0)(0 + 1)^*0^*1^*) $For the language accepted by ...
Arjun
16.2k
views
Arjun
asked
Sep 24, 2014
Theory of Computation
gatecse-2013
theory-of-computation
finite-automata
normal
+
–
38
votes
2
answers
29
GATE CSE 2013 | Question: 32
Consider the following languages. $L_1 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0 \right \}$ $L_2 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0, p\neq r \right \}$ Which one of the following statements is FALSE? $L_2$ is context-free. $L_1\cap L_2$ is context-free. Complement of $L_2$ is recursive. Complement of $L_1$ is context-free but not regular.
Consider the following languages.$L_1 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0 \right \}$$L_2 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0, p\neq r \right \}$Which one of the fol...
Arjun
15.4k
views
Arjun
asked
Sep 24, 2014
Theory of Computation
gatecse-2013
theory-of-computation
identify-class-language
normal
+
–
42
votes
5
answers
30
GATE CSE 2013 | Question: 31
Consider the following function: int unknown(int n){ int i, j, k=0; for (i=n/2; i<=n; i++) for (j=2; j<=n; j=j*2) k = k + n/2; return (k); } The return value of the function is $\Theta(n^2)$ $\Theta(n^2\log n)$ $\Theta(n^3)$ $\Theta(n^3\log n)$
Consider the following function:int unknown(int n){ int i, j, k=0; for (i=n/2; i<=n; i++) for (j=2; j<=n; j=j*2) k = k + n/2; return (k); }The return value of the functio...
Arjun
29.2k
views
Arjun
asked
Sep 24, 2014
Algorithms
gatecse-2013
algorithms
identify-function
normal
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register