Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Aboveallplayer
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Aboveallplayer
0
answers
1
IIIT Allahabad Query
if i opt for a integrated Phd in IIIT-A 1.will i also get a Mtech after completion of the degree?or only phd? 2.what will i miss ?(apart from the fact that i will miss a chance of phd from IIT)) given:Placement is not my concern
if i opt for a integrated Phd in IIIT-A1.will i also get a Mtech after completion of the degree?or only phd?2.what will i miss ?(apart from the fact that i will miss a ch...
434
views
asked
Mar 27, 2017
5
answers
2
GATE CSE 2017 Set 1 | Question: 30
Let $u$ and $v$ be two vectors in $\mathbf{R}^{2}$ whose Euclidean norms satisfy $\left \| u \right \| = 2\left \| v \right \|$. What is the value of $\alpha$ such that $w = u + \alpha v$ bisects the angle between $u$ and $v$? $2$ $\frac{1}{2}$ $1$ $\frac{ -1}{2}$
Let $u$ and $v$ be two vectors in $\mathbf{R}^{2}$ whose Euclidean norms satisfy $\left \| u \right \| = 2\left \| v \right \|$. What is the value of $\alpha$ such that $...
13.9k
views
commented
Mar 25, 2017
Linear Algebra
gatecse-2017-set1
linear-algebra
normal
vector-space
+
–
2
answers
3
difference between if(a=0) and if(a=non zero)
what is the differernce between if (a=0) and if (a= -7) or any other non-zero number e.g what will be the out put of following program a)if ( a=0) printf(""a is zero ") else printf("a is not zero") and if we replace 0 by some +ve or -ve number then
what is the differernce between if (a=0) and if (a= -7) or any other non-zero number e.g what will be the out put of following program a)if ( a=0)printf(""a is zero ")els...
2.1k
views
answered
Feb 18, 2017
11
answers
4
GATE CSE 2017 Set 1 | Question: 43
Consider the following grammar: stmt $\rightarrow$ if expr then expr else expr; stmt | $Ò$ expr $\rightarrow$ term relop term | term term $\rightarrow$ id | number id $\rightarrow$ a | b | c number $\rightarrow [0-9]$ where relop is a relational ... program if $e_1$ then $e_2$ else $e_3$ has $2$ control flow paths. $e_1 \rightarrow e_2$ and $e_1 \rightarrow e_3$.
Consider the following grammar:stmt $\rightarrow$ if expr then expr else expr; stmt | $Ò$expr $\rightarrow$ term relop term | termterm $\rightarrow$ id | numberid $\righ...
20.2k
views
commented
Feb 17, 2017
Compiler Design
gatecse-2017-set1
compiler-design
parsing
normal
numerical-answers
+
–
4
answers
5
GATE CSE 2017 Set 1 | Question: 39
Let $A$ and $B$ be finite alphabets and let $\#$ be a symbol outside both $A$ and $B$. Let $f$ be a total function from $A^{*}$ to $B^{*}$. We say $f$ is computable if there exists a Turing machine $M$ which given an ... $L_{f}$ is recursive, but not conversely. If $f$ is computable then $L_{f}$ is recursively enumerable, but not conversely.
Let $A$ and $B$ be finite alphabets and let $\#$ be a symbol outside both $A$ and $B$. Let $f$ be a total function from $A^{*}$ to $B^{*}$. We say $f$ is computable if th...
18.3k
views
commented
Feb 16, 2017
Theory of Computation
gatecse-2017-set1
theory-of-computation
decidability
difficult
+
–
7
answers
6
GATE CSE 2017 Set 1 | Question: 27
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock $l$, then it cannot re-acquire lock $l$ without releasing ... $x = 1, y = 2$ $x = 2, y = 1$ $x = 2, y = 2$ $x = 1, y = 1$
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All...
32.9k
views
commented
Feb 16, 2017
Operating System
gatecse-2017-set1
operating-system
process-synchronization
normal
+
–
5
answers
7
GATE CSE 2017 Set 1 | Question: 40
Recall that Belady's anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements: $S_1$: Random page replacement algorithm (where a page chosen at random is replaced) suffers from Belady's ... is true, $S_2$ is false $S_1$ is false, $S_2$ is true $S_1$ is false, $S_2$ is false
Recall that Belady's anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements:$S_1$: Random pa...
15.0k
views
commented
Feb 16, 2017
Operating System
gatecse-2017-set1
page-replacement
operating-system
normal
+
–
11
answers
8
GATE CSE 2017 Set 1 | Question: 08
Consider the C code fragment given below. typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->next; } p->next = m; } Assuming that m and n ... append list m to the end of list n. cause a null pointer dereference for all inputs. append list n to the end of list m for all inputs.
Consider the C code fragment given below.typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->ne...
25.4k
views
commented
Feb 15, 2017
DS
gatecse-2017-set1
data-structures
linked-list
normal
+
–
10
answers
9
GATE CSE 2017 Set 1 | Question: 48
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i \right ]$ is $1$ by probing the minimum number of locations in $A$. The worst case number of probes performed by an optimal algorithm is ____________.
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i ...
21.5k
views
commented
Feb 15, 2017
Algorithms
gatecse-2017-set1
algorithms
normal
numerical-answers
searching
+
–
9
answers
10
GATE CSE 2017 Set 1 | Question: 53
Consider the following C program. #include<stdio.h> #include<string.h> void printlength(char *s, char *t) { unsigned int c=0; int len = ((strlen(s) - strlen(t)) > c) ? strlen(s) : strlen(t); printf("%d\n", len); } ... in $string.h$ as returning a value of type $size\_t$, which is an unsigned int. The output of the program is __________ .
Consider the following C program.#include<stdio.h #include<string.h void printlength(char *s, char *t) { unsigned int c=0; int len = ((strlen(s) - strlen(t)) c) ? strlen...
24.7k
views
commented
Feb 15, 2017
Programming in C
gatecse-2017-set1
programming
programming-in-c
normal
numerical-answers
+
–
9
answers
11
GATE CSE 2017 Set 1 | Question: 7
The n-bit fixed-point representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i = n-f$. The range of decimal values for $X$ in this representation is $2^{-f}$ to $2^{i}$ $2^{-f}$ to $\left ( 2^{i} - 2^{-f} \right )$ 0 to $2^{i}$ 0 to $\left ( 2^{i} - 2^{-f} \right )$
The n-bit fixed-point representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i = n-f$. The range of decimal values for $X$ in this repres...
16.5k
views
commented
Feb 15, 2017
Digital Logic
gatecse-2017-set1
digital-logic
number-representation
fixed-point-representation
+
–
8
answers
12
GATE CSE 2017 Set 1 | Question: 10
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$S \rightarrow abScT \mid abcT$$T \rightarrow bT \mid b$ ... $\{\left ( ab \right )^{n}\left ( cb^{n} \right )^{m} \mid m,n \geq 1 \}$
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$$S \rightarrow abScT \mid abcT$$$$T \rightarrow bT \mid ...
21.5k
views
commented
Feb 15, 2017
Theory of Computation
gatecse-2017-set1
theory-of-computation
context-free-language
normal
+
–
6
answers
13
GATE CSE 2017 Set 1 | Question: 31
Let $A$ be $n\times n$ real valued square symmetric matrix of rank $2$ with $\sum_{i=1}^{n}\sum_{j=1}^{n}A^{2}_{ij} = 50.$ Consider the following statements. One eigenvalue must be in $\left [ -5,5 \right ]$ The eigenvalue ... than $5$ Which of the above statements about eigenvalues of $A$ is/are necessarily CORRECT? Both I and II I only II only Neither I nor II
Let $A$ be $n\times n$ real valued square symmetric matrix of rank $2$ with $\sum_{i=1}^{n}\sum_{j=1}^{n}A^{2}_{ij} = 50.$ Consider the following statements.One eigenvalu...
45.4k
views
commented
Feb 14, 2017
Linear Algebra
gatecse-2017-set1
linear-algebra
eigen-value
normal
+
–
4
answers
14
GATE CSE 2017 Set 1 | Question: 49
Consider a RISC machine where each instruction is exactly $4$ bytes long. Conditional and unconditional branch instructions use PC-relative addressing mode with Offset specified in bytes to the target location of the branch instruction. Further the Offset is ... $i,$ then the decimal value of the Offset is ____________ .
Consider a RISC machine where each instruction is exactly $4$ bytes long. Conditional and unconditional branch instructions use PC-relative addressing mode with Offset sp...
14.4k
views
commented
Feb 14, 2017
CO and Architecture
gatecse-2017-set1
co-and-architecture
normal
numerical-answers
instruction-execution
+
–
3
answers
15
GATE CSE 2017 Set 1 | Question: GA-6
"The hold of the nationalist imagination on our colonial past is such that anything inadequately or improperly nationalist is just not history." Which of the following statements best reflects the author's opinion? Nationalists ... filter of nationalism. Our colonial past never happened. Nationalism has to be both adequately and properly imagined.
"The hold of the nationalist imagination on our colonial past is such that anything inadequately or improperly nationalist is just not history."Which of the following sta...
3.9k
views
answered
Feb 14, 2017
Verbal Aptitude
gatecse-2017-set1
general-aptitude
verbal-aptitude
passage-reading
+
–
10
answers
16
GATE CSE 2017 Set 1 | Question: 6
Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are: Note: The height of a tree with a single node is $0$. $4$ and $15$ respectively. $3$ and $14$ respectively. $4$ and $14$ respectively. $3$ and $15$ respectively.
Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are:Note: The height of a tree with a single node is $0$.$4$ and $15$ res...
16.6k
views
answered
Feb 14, 2017
DS
gatecse-2017-set1
data-structures
binary-search-tree
easy
+
–
5
answers
17
GATE CSE 2017 Set 1 | Question: GA-7
Six people are seated around a circular table. There are at least two men and two women. There are at least three right-handed persons. Every woman has a left-handed person to her immediate right. None of the women are right-handed. The number of women at the table is $2$ $3$ $4$ Cannot be determined
Six people are seated around a circular table. There are at least two men and two women. There are at least three right-handed persons. Every woman has a left-handed pers...
8.0k
views
answered
Feb 14, 2017
Analytical Aptitude
gatecse-2017-set1
analytical-aptitude
round-table-arrangement
+
–
4
answers
18
GATE CSE 2017 Set 1 | Question: GA-4
Find the smallest number $y$ such that $y \times 162$ is a perfect cube. $24$ $27$ $32$ $36$
Find the smallest number $y$ such that $y \times 162$ is a perfect cube.$24$$27$$32$$36$
5.0k
views
answered
Feb 14, 2017
Quantitative Aptitude
gatecse-2017-set1
general-aptitude
quantitative-aptitude
numerical-computation
+
–
3
answers
19
GATE CSE 2017 Set 1 | Question: GA-2
Research in the workplace reveals that people work for many reasons _______________ . money beside beside money money besides besides money
Research in the workplace reveals that people work for many reasons _______________ .money besidebeside moneymoney besidesbesides money
4.5k
views
answered
Feb 14, 2017
Verbal Aptitude
gatecse-2017-set1
general-aptitude
verbal-aptitude
english-grammar
+
–
12
answers
20
GATE CSE 2017 Set 1 | Question: 04
Consider the following functions from positive integers to real numbers: $10$, $\sqrt{n}$, $n$, $\log_{2}n$, $\frac{100}{n}$. The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is: $\log_{2}n$, $\frac{100}{n}$, $10$, $\sqrt{n}$, $n$ ... $\sqrt{n}$, $\log_{2}n$, $n$ $\frac{100}{n}$, $\log_{2}n$, $10$, $\sqrt{n}$, $n$
Consider the following functions from positive integers to real numbers:$10$, $\sqrt{n}$, $n$, $\log_{2}n$, $\frac{100}{n}$.The CORRECT arrangement of the above functions...
17.6k
views
answered
Feb 14, 2017
Algorithms
gatecse-2017-set1
algorithms
asymptotic-notation
normal
+
–
8
answers
21
GATE CSE 2017 Set 1 | Question: 01
The statement $\left ( ¬p \right ) \Rightarrow \left ( ¬q \right )$ is logically equivalent to which of the statements below? $p \Rightarrow q$ $q \Rightarrow p$ $\left ( ¬q \right ) \vee p$ $\left ( ¬p \right ) \vee q$ I only I and IV only II only II and III only
The statement $\left ( ¬p \right ) \Rightarrow \left ( ¬q \right )$ is logically equivalent to which of the statements below?$p \Rightarrow q$$q \Rightarrow p$$\left ( ...
8.9k
views
commented
Feb 14, 2017
Mathematical Logic
gatecse-2017-set1
mathematical-logic
propositional-logic
easy
+
–
8
answers
22
GATE CSE 2017 Set 1 | Question: 02
Consider the first-order logic sentence $F:\forall x(\exists yR(x,y))$. Assuming non-empty logical domains, which of the sentences below are implied by $F$? $\exists y(\exists xR(x,y))$ $\exists y(\forall xR(x,y))$ $\forall y(\exists xR(x,y))$ $¬\exists x(\forall y¬R(x,y))$ IV only I and IV only II only II and III only
Consider the first-order logic sentence $F:\forall x(\exists yR(x,y))$. Assuming non-empty logical domains, which of the sentences below are implied by $F$?$\exists y(\ex...
17.1k
views
answered
Feb 14, 2017
Mathematical Logic
gatecse-2017-set1
mathematical-logic
first-order-logic
+
–
9
answers
23
GATE CSE 2017 Set 1 | Question: 3
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$. Consider the set of linear equations $Ax = b$ ... has a unique solution at $x=J_{n}$ where $J_{n}$ denotes a $n$-dimensional vector of all 1. no solution infinitely many solutions finitely many solutions
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$.Consider the set of linear equations$...
20.1k
views
commented
Feb 14, 2017
Linear Algebra
gatecse-2017-set1
linear-algebra
system-of-equations
normal
+
–
4
answers
24
GATE CSE 2017 Set 1 | Question: 21
Consider the Karnaugh map given below, where $X$ represents "don't care" and blank represents $0$. Assume for all inputs $\left ( a,b,c,d \right )$ ... . The above logic is implemented using $2$-input $\text{NOR}$ gates only. The minimum number of gates required is ____________ .
Consider the Karnaugh map given below, where $X$ represents "don't care" and blank represents $0$. Assume for all inputs $\left ( a,b,c,d \right )$, the respective comple...
14.0k
views
answered
Feb 14, 2017
Digital Logic
gatecse-2017-set1
digital-logic
k-map
numerical-answers
normal
+
–
3
answers
25
GATE CSE 2017 Set 2 | Question: 46
Consider the following database table named $\text{top_scorer}$ ... tc.goals FROM top_scorer AS tc WHERE tc.country='Germany') The number of tuples returned by the above SQL query is ______
Consider the following database table named $\text{top_scorer}$.$$\overset{\text{top_scorer}}{\begin{array}{|c|c|c|}\hline\\\textbf{player}& \textbf{country}& \textbf...
16.0k
views
comment edited
Feb 14, 2017
Databases
gatecse-2017-set2
databases
sql
numerical-answers
+
–
8
answers
26
GATE CSE 2017 Set 2 | Question: 52
If the characteristic polynomial of a $3 \times 3$ matrix $M$ over $\mathbb{R}$ (the set of real numbers) is $\lambda^3 – 4 \lambda^2 + a \lambda +30, \quad a \in \mathbb{R}$, and one eigenvalue of $M$ is $2,$ then the largest among the absolute values of the eigenvalues of $M$ is _______
If the characteristic polynomial of a $3 \times 3$ matrix $M$ over $\mathbb{R}$ (the set of real numbers) is $\lambda^3 – 4 \lambda^2 + a \lambda +30, \quad a \in \ma...
15.4k
views
answered
Feb 14, 2017
Linear Algebra
gatecse-2017-set2
engineering-mathematics
linear-algebra
numerical-answers
eigen-value
+
–
12
answers
27
GATE CSE 2017 Set 2 | Question: 39
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$ ... $\emptyset$ $\{q_0, q_1, q_3\}$ $\{q_0, q_1, q_2\}$ $\{q_0, q_2, q_3 \}$
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$-NFA whose transition table is given below:$$\...
28.1k
views
answered
Feb 14, 2017
Theory of Computation
gatecse-2017-set2
theory-of-computation
finite-automata
+
–
5
answers
28
GATE CSE 2017 Set 1 | Question: GA-1
After Rajendra Chola returned from his voyage to Indonesia, he ________ to visit the temple in Thanjavur. was wishing is wishing wished had wished
After Rajendra Chola returned from his voyage to Indonesia, he ________ to visit the temple in Thanjavur.was wishingis wishingwishedhad wished
7.4k
views
answered
Feb 14, 2017
Verbal Aptitude
gatecse-2017-set1
general-aptitude
verbal-aptitude
tenses
english-grammar
normal
+
–
5
answers
29
GATE CSE 2017 Set 2 | Question: GA-10
An air pressure contour line joins locations in a region having the same atmospheric pressure. The following is an air pressure contour plot of a geographical region. Contour lines are shown at $0.05$ bar intervals in this plot. If the possibility of a ... over a region, which of the following regions is most likely to have a thunderstorm? $P$ $Q$ $R$ $S$
An air pressure contour line joins locations in a region having the same atmospheric pressure. The following is an air pressure contour plot of a geographical region. Con...
8.0k
views
commented
Feb 14, 2017
Quantitative Aptitude
gatecse-2017-set2
quantitative-aptitude
data-interpretation
normal
contour-plots
+
–
4
answers
30
GATE CSE 2017 Set 1 | Question: 12
Consider the following intermediate program in three address code p = a - b q = p * c p = u * v q = p + q Which one of the following corresponds to a static single assignment form of the above code? p1 = a - b q1 = p1 * c p1 = u * v q1 = p1 + q1 p3 = a - b q4 = p3 * c p4 = ... = a - b q1 = p2 * c p3 = u * v q2 = p4 + q3 p1 = a - b q1 = p * c p2 = u * v q2 = p + q
Consider the following intermediate program in three address codep = a - b q = p * c p = u * v q = p + qWhich one of the following corresponds to a static single assignme...
11.5k
views
commented
Feb 14, 2017
Compiler Design
gatecse-2017-set1
compiler-design
intermediate-code
normal
static-single-assignment
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register