Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gatecse-2014-set1
19
votes
2
answers
31
GATE CSE 2014 Set 1 | Question: 25
Identify the correct order in which the following actions take place in an interaction between a web browser and a web server. The web browser requests a webpage using HTTP. The web browser establishes a TCP connection with the web server. The web server sends the requested webpage using HTTP. ... domain name using DNS. 4, 2, 1, 3 1, 2, 3, 4 4, 1, 2, 3 2, 4, 1, 3
Identify the correct order in which the following actions take place in an interaction between a web browser and a web server.The web browser requests a webpage using HTT...
go_editor
5.2k
views
go_editor
asked
Sep 26, 2014
Web Technologies
gatecse-2014-set1
web-technologies
easy
+
–
19
votes
4
answers
32
GATE CSE 2014 Set 1 | Question: 24
Which of the following are used to generate a message digest by the network security protocols? RSA SHA-$1$ DES MD5 I and III only II and III only II and IV only III and IV only
Which of the following are used to generate a message digest by the network security protocols?RSASHA-$1$DESMD5I and III onlyII and III onlyII and IV onlyIII and IV only
go_editor
7.1k
views
go_editor
asked
Sep 26, 2014
Computer Networks
gatecse-2014-set1
computer-networks
network-security
normal
out-of-gate-syllabus
+
–
49
votes
5
answers
33
GATE CSE 2014 Set 1 | Question: 23
Consider the following three statements about link state and distance vector routing protocols, for a large network with $500$ network nodes and $4000$ links. [S1]: The computational overhead in link state protocols is higher than in distance vector protocols. [S2]: A distance ... $S2$ are true, but $S3$ is false. $S1$ and $S3$ are true, but $S2$ is false.
Consider the following three statements about link state and distance vector routing protocols, for a large network with $500$ network nodes and $4000$ links. [S1]: The c...
go_editor
15.8k
views
go_editor
asked
Sep 26, 2014
Computer Networks
gatecse-2014-set1
computer-networks
routing
normal
+
–
73
votes
3
answers
34
GATE CSE 2014 Set 1 | Question: 22
Given the following statements: S1: A foreign key declaration can always be replaced by an equivalent check assertion in SQL. S2: Given the table $R(a,b,c)$ where $a$ and $b$ together form the primary key, the following is a valid table definition. CREATE ... S1 is TRUE and S2 is FALSE Both S1 and S2 are TRUE S1 is FALSE and S2 is TRUE Both S1 and S2 are FALSE
Given the following statements: S1: A foreign key declaration can always be replaced by an equivalent check assertion in SQL. S2: Given the table $R(a,b,c)$ where $a$ an...
go_editor
23.7k
views
go_editor
asked
Sep 26, 2014
Databases
gatecse-2014-set1
databases
normal
sql
+
–
37
votes
4
answers
35
GATE CSE 2014 Set 1 | Question: 21
Consider the relation scheme $R = (E, F, G, H, I, J, K, L, M, N)$ and the set of functional dependencies $\left\{ \{E, F \} \to \{G\}, \{F\} \to \{I, J\}, \{E, H\} \to \{K, L\}, \\ \{K\} \to \{M\}, \{L\} \to \{N\}\right\}$ on $R$. What is the key for $R$? $\{E, F\}$ $\{E, F, H\}$ $\{E, F, H, K, L\}$ $\{E\}$
Consider the relation scheme $R = (E, F, G, H, I, J, K, L, M, N)$ and the set of functional dependencies $$\left\{ \{E, F \} \to \{G\}, \{F\} \to \{I, J\}, \{E, H\} \to \...
go_editor
8.4k
views
go_editor
asked
Sep 26, 2014
Databases
gatecse-2014-set1
databases
database-normalization
normal
+
–
54
votes
3
answers
36
GATE CSE 2014 Set 1 | Question: 20
Which one of the following is FALSE? User level threads are not scheduled by the kernel. When a user level thread is blocked, all other threads of its process are blocked. Context switching between user level threads is faster than context switching between kernel level threads. Kernel level threads cannot share the code segment.
Which one of the following is FALSE?User level threads are not scheduled by the kernel.When a user level thread is blocked, all other threads of its process are blocked.C...
go_editor
25.0k
views
go_editor
asked
Sep 26, 2014
Operating System
gatecse-2014-set1
operating-system
threads
normal
+
–
34
votes
4
answers
37
GATE CSE 2014 Set 1 | Question: 19
Suppose a disk has $201$ cylinders, numbered from $0$ to $200$. At some time the disk arm is at cylinder $100$, and there is a queue of disk access requests for cylinders $30, 85, 90, 100, 105, 110, 135$ ... First (SSTF) is being used for scheduling the disk access, the request for cylinder $90$ is serviced after servicing ____________ number of requests.
Suppose a disk has $201$ cylinders, numbered from $0$ to $200$. At some time the disk arm is at cylinder $100$, and there is a queue of disk access requests for cylinders...
go_editor
11.1k
views
go_editor
asked
Sep 26, 2014
Operating System
gatecse-2014-set1
operating-system
disk-scheduling
numerical-answers
normal
+
–
4
votes
2
answers
38
GATE CSE 2014 Set 1 | Question: 18
Match the following: 1) Waterfall model a) Specifications can be developed incrementally 2) Evolutionary model b) Requirements compromises are inevitable 3) Component-based software engineering c) Explicit recognition of risk 4) Spiral development d) Inflexible partitioning of the project into stages 1-a, 2-b, ... -a, 3-b, 4-c 1-d, 2-b, 3-a, 4-c 1-c, 2-a, 3-b, 4-d
Match the following:1) Waterfall modela) Specifications can be developed incrementally2) Evolutionary modelb) Requirements compromises are inevitable3) Component-based so...
go_editor
2.8k
views
go_editor
asked
Sep 26, 2014
IS&Software Engineering
gatecse-2014-set1
is&software-engineering
normal
+
–
31
votes
1
answer
39
GATE CSE 2014 Set 1 | Question: 17
Which one of the following is FALSE? A basic block is a sequence of instructions where control enters the sequence at the beginning and exits at the end. Available expression analysis can be used for common subexpression elimination. Live variable ... be used for dead code elimination. $x=4*5 \Rightarrow x=20$ is an example of common subexpression elimination.
Which one of the following is FALSE?A basic block is a sequence of instructions where control enters the sequence at the beginning and exits at the end. Available express...
go_editor
11.9k
views
go_editor
asked
Sep 26, 2014
Compiler Design
gatecse-2014-set1
compiler-design
code-optimization
normal
+
–
29
votes
5
answers
40
GATE CSE 2014 Set 1 | Question: 16
Consider the finite automaton in the following figure: What is the set of reachable states for the input string $0011$? $\{q_0,q_1,q_2\}$ $\{q_0,q_1\}$ $\{q_0,q_1,q_2,q_3\}$ $\{q_3\}$
Consider the finite automaton in the following figure: What is the set of reachable states for the input string $0011$?$\{q_0,q_1,q_2\}$$\{q_0,q_1\}$$\{q_0,q_1,q_2,q_3\}$...
go_editor
15.0k
views
go_editor
asked
Sep 26, 2014
Theory of Computation
gatecse-2014-set1
theory-of-computation
finite-automata
easy
+
–
25
votes
3
answers
41
GATE CSE 2014 Set 1 | Question: 15
Which one of the following is TRUE? The language $L = \left\{a^nb^n \mid n \geq 0\right\}$ is regular. The language $L = \left\{a^n \mid n \text{ is prime }\right\}$ is regular. The language $L$ ... is regular. The language $L = \left\{ww \mid w \in \Sigma^* \text{ with } \Sigma = \left\{0,1\right\}\right\}$ is regular.
Which one of the following is TRUE?The language $L = \left\{a^nb^n \mid n \geq 0\right\}$ is regular.The language $L = \left\{a^n \mid n \text{ is prime }\right\}$ is reg...
go_editor
9.4k
views
go_editor
asked
Sep 26, 2014
Theory of Computation
gatecse-2014-set1
theory-of-computation
regular-language
normal
+
–
46
votes
6
answers
42
GATE CSE 2014 Set 1 | Question: 14
Let $P$ be quicksort program to sort numbers in ascending order using the first element as the pivot. Let $t_1$ and $t_2$ be the number of comparisons made by P for the inputs $[1 \ 2 \ 3 \ 4 \ 5]$ and $[4 \ 1 \ 5 \ 3 \ 2]$ respectively. Which one of the following holds? $t_1 = 5$ $t_1 < t_2$ $t_1>t_2$ $t_1 = t_2$
Let $P$ be quicksort program to sort numbers in ascending order using the first element as the pivot. Let $t_1$ and $t_2$ be the number of comparisons made by P for the i...
go_editor
19.4k
views
go_editor
asked
Sep 26, 2014
Algorithms
gatecse-2014-set1
algorithms
sorting
easy
quick-sort
+
–
31
votes
5
answers
43
GATE CSE 2014 Set 1 | Question: 13
Consider the directed graph below given. Which one of the following is TRUE? The graph does not have any topological ordering. Both PQRS and SRQP are topological orderings. Both PSRQ and SPRQ are topological orderings. PSRQ is the only topological ordering.
Consider the directed graph below given. Which one of the following is TRUE?The graph does not have any topological ordering.Both PQRS and SRQP are topological orderings....
go_editor
7.8k
views
go_editor
asked
Sep 26, 2014
Algorithms
gatecse-2014-set1
graph-algorithms
easy
topological-sort
+
–
90
votes
11
answers
44
GATE CSE 2014 Set 1 | Question: 12
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is $O(n^a\log^bn)$. Then the value of $a+10b$ is __________.
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is...
go_editor
24.9k
views
go_editor
asked
Sep 26, 2014
DS
gatecse-2014-set1
data-structures
binary-tree
numerical-answers
normal
+
–
34
votes
4
answers
45
GATE CSE 2014 Set 1 | Question: 11
Let $G$ be a graph with $n$ vertices and $m$ edges. What is the tightest upper bound on the running time of Depth First Search on $G$, when $G$ is represented as an adjacency matrix? $\Theta(n)$ $\Theta(n+m)$ $\Theta(n^2)$ $\Theta(m^2)$
Let $G$ be a graph with $n$ vertices and $m$ edges. What is the tightest upper bound on the running time of Depth First Search on $G$, when $G$ is represented as an adjac...
go_editor
12.3k
views
go_editor
asked
Sep 26, 2014
Algorithms
gatecse-2014-set1
algorithms
graph-algorithms
normal
graph-search
+
–
62
votes
5
answers
46
GATE CSE 2014 Set 1 | Question: 10
Consider the following program in C language: #include <stdio.h> main() { int i; int*pi = &i; scanf("%d",pi); printf("%d\n", i+5); } Which one of the following statements is TRUE? Compilation fails. Execution ... $5$ more than the address of variable $i$. On execution, the value printed is $5$ more than the integer value entered.
Consider the following program in C language:#include <stdio.h main() { int i; int*pi = &i; scanf("%d",pi); printf("%d\n", i+5); }Which one of the following statements is...
go_editor
17.6k
views
go_editor
asked
Sep 26, 2014
Programming in C
gatecse-2014-set1
programming
programming-in-c
easy
pointers
+
–
49
votes
6
answers
47
GATE CSE 2014 Set 1 | Question: 9
A machine has a $32\text{-bit}$ architecture, with $1\text{-word}$ long instructions. It has $64$ registers, each of which is $32$ bits long. It needs to support $45$ instructions, which have an immediate operand in ... to two register operands. Assuming that the immediate operand is an unsigned integer, the maximum value of the immediate operand is ____________
A machine has a $32\text{-bit}$ architecture, with $1\text{-word}$ long instructions. It has $64$ registers, each of which is $32$ bits long. It needs to support $45$ ins...
go_editor
18.5k
views
go_editor
asked
Sep 26, 2014
CO and Architecture
gatecse-2014-set1
co-and-architecture
machine-instruction
instruction-format
numerical-answers
normal
+
–
34
votes
3
answers
48
GATE CSE 2014 Set 1 | Question: 8
The base (or radix) of the number system such that the following equation holds is____________. $\frac{312}{20} = 13.1$
The base (or radix) of the number system such that the following equation holds is____________. $\frac{312}{20} = 13.1$
go_editor
12.5k
views
go_editor
asked
Sep 26, 2014
Digital Logic
gatecse-2014-set1
digital-logic
number-representation
numerical-answers
normal
+
–
27
votes
7
answers
49
GATE CSE 2014 Set 1 | Question: 7
Consider the following Boolean expression for F: $F(P,Q,R,S)= PQ + \bar{P}QR + \bar{P}Q\bar{R}S$ The minimal sum$-$of$-$products form of $F$ is $PQ+QR+QS$ $P+Q+R+S$ $\bar{P} + \bar{Q}+ \bar{R}+ \bar{S}$ $\bar{P}R + \bar{R} \bar{P}S+P$
Consider the following Boolean expression for F: $F(P,Q,R,S)= PQ + \bar{P}QR + \bar{P}Q\bar{R}S$The minimal sum$-$of$-$products form of $F$ is$PQ+QR+QS$$P+Q+R+S$$\bar{P} ...
go_editor
8.6k
views
go_editor
asked
Sep 26, 2014
Digital Logic
gatecse-2014-set1
digital-logic
normal
min-sum-of-products-form
+
–
43
votes
4
answers
50
GATE CSE 2014 Set 1 | Question: 6
Let the function ... $\theta \in (\frac{\pi}{6},\frac{\pi}{3})$ such that $f'(\theta)\neq 0$ I only II only Both I and II Neither I nor II
Let the function$$f(\theta) = \begin{vmatrix} \sin\theta & \cos\theta & \tan\theta \\ \sin(\frac{\pi}{6}) & \cos(\frac{\pi}{6}) & \tan(\frac{\pi}{6}) & \\ \sin(\frac{\pi...
go_editor
13.9k
views
go_editor
asked
Sep 26, 2014
Calculus
gatecse-2014-set1
calculus
differentiation
normal
+
–
60
votes
4
answers
51
GATE CSE 2014 Set 1 | Question: 5
The value of the dot product of the eigenvectors corresponding to any pair of different eigenvalues of a $4-by-4$ symmetric positive definite matrix is ___________
The value of the dot product of the eigenvectors corresponding to any pair of different eigenvalues of a $4-by-4$ symmetric positive definite matrix is ___________
go_editor
14.7k
views
go_editor
asked
Sep 26, 2014
Linear Algebra
gatecse-2014-set1
linear-algebra
eigen-value
numerical-answers
normal
+
–
35
votes
6
answers
52
GATE CSE 2014 Set 1 | Question: 4
Consider the following system of equations: $3x + 2y = 1 $ $4x + 7z = 1 $ $x + y + z = 3$ $x - 2y + 7z = 0$ The number of solutions for this system is ______________
Consider the following system of equations: $3x + 2y = 1 $$4x + 7z = 1 $$x + y + z = 3$$x - 2y + 7z = 0$The number of solutions for this system is ______________
go_editor
13.2k
views
go_editor
asked
Sep 26, 2014
Linear Algebra
gatecse-2014-set1
linear-algebra
system-of-equations
numerical-answers
normal
+
–
55
votes
3
answers
53
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...
go_editor
17.1k
views
go_editor
asked
Sep 26, 2014
DS
gatecse-2014-set1
data-structures
graph-theory
ambiguous
+
–
61
votes
3
answers
54
GATE CSE 2014 Set 1 | Question: 2
Suppose you break a stick of unit length at a point chosen uniformly at random. Then the expected length of the shorter stick is ________ .
Suppose you break a stick of unit length at a point chosen uniformly at random. Then the expected length of the shorter stick is ________ .
Arjun
17.6k
views
Arjun
asked
Sep 26, 2014
Probability
gatecse-2014-set1
probability
uniform-distribution
expectation
numerical-answers
normal
+
–
31
votes
6
answers
55
GATE CSE 2014 Set 1 | Question: GA-10
When a point inside of a tetrahedron (a solid with four triangular surfaces) is connected by straight lines to its corners, how many (new) internal planes are created with these lines?
When a point inside of a tetrahedron (a solid with four triangular surfaces) is connected by straight lines to its corners, how many (new) internal planes are created wit...
gatecse
8.9k
views
gatecse
asked
Sep 15, 2014
Quantitative Aptitude
gatecse-2014-set1
quantitative-aptitude
geometry
combinatory
normal
numerical-answers
+
–
21
votes
3
answers
56
GATE CSE 2014 Set 1 | Question: GA-9
In a survey, $300$ ...
In a survey, $300$ respondents were asked whether they own a vehicle or not. If yes, they were further asked to mention whether they own a car or scooter or both. Their r...
gatecse
5.0k
views
gatecse
asked
Sep 15, 2014
Quantitative Aptitude
gatecse-2014-set1
quantitative-aptitude
normal
numerical-answers
data-interpretation
tabular-data
+
–
19
votes
4
answers
57
GATE CSE 2014 Set 1 | Question: GA-8
Round-trip tickets to a tourist destination are eligible for a discount of $10\%$ on the total fare. In addition, groups of $4$ or more get a discount of $5\%$ on the total fare. If the one way single person fare is $Rs$ $100$, a group of $5$ tourists purchasing round-trip tickets will be charged $Rs$ __________
Round-trip tickets to a tourist destination are eligible for a discount of $10\%$ on the total fare. In addition, groups of $4$ or more get a discount of $5\%$ on the tot...
gatecse
6.3k
views
gatecse
asked
Sep 15, 2014
Quantitative Aptitude
gatecse-2014-set1
quantitative-aptitude
easy
numerical-answers
percentage
+
–
12
votes
2
answers
58
GATE CSE 2014 Set 1 | Question: GA-7
Geneticists say that they are very close to confirming the genetic roots of psychiatric illnesses such as depression and schizophrenia, and consequently, that doctors will be able to eradicate these diseases through early identification and ... they are expressed In the future, genetics will become the only relevant field for identifying psychiatric illnesses
Geneticists say that they are very close to confirming the genetic roots of psychiatric illnesses such as depression and schizophrenia, and consequently, that doctors wil...
gatecse
2.0k
views
gatecse
asked
Sep 15, 2014
Verbal Aptitude
gatecse-2014-set1
verbal-aptitude
verbal-reasoning
normal
+
–
6
votes
2
answers
59
GATE CSE 2014 Set 1 | Question: GA-6
The Palghat Gap (or Palakkad Gap) , a region about $30\;\text{km}$ wide in the southern part of the Western Ghats in India, is lower than the hilly terrain to its north and south. The exact reasons for the ... on weather patterns in neighbouring parts of Tamil Nadu and Kerala Higher summer temperatures result in higher rainfall near the Palghat Gap area
The Palghat Gap (or Palakkad Gap) , a region about $30\;\text{km}$ wide in the southern part of the Western Ghats in India, is lower than the hilly terrain to its north a...
gatecse
1.9k
views
gatecse
asked
Sep 15, 2014
Verbal Aptitude
gatecse-2014-set1
verbal-aptitude
passage-reading
normal
+
–
12
votes
2
answers
60
GATE CSE 2014 Set 1 | Question: GA-4
If $\large\left(z + \dfrac{1}{z}\right)^{2}= 98$, compute $\large \left(z^{2} +\dfrac{1}{z^{2}}\right)$.
If $\large\left(z + \dfrac{1}{z}\right)^{2}= 98$, compute $\large \left(z^{2} +\dfrac{1}{z^{2}}\right)$.
gatecse
3.3k
views
gatecse
asked
Sep 15, 2014
Quantitative Aptitude
gatecse-2014-set1
quantitative-aptitude
easy
numerical-answers
numerical-computation
+
–
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register