Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
2019_Aspirant
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by 2019_Aspirant
8
answers
1
Two dimensional array
Consider a 2 dimensional array A[40...95,40...95] in lower triangular matrix representation. The size of each element of array is 1 Byte.If array is implemented in memory as Row major,with base address as 1000,the address of A[66][50] is ..... Ans. 1361
Consider a 2 dimensional array A[40...95,40...95] in lower triangular matrix representation. The size of each element of array is 1 Byte.If array is implemented in memory...
5.5k
views
commented
Jan 26, 2019
DS
programming-in-c
array
pointers
data-structures
+
–
8
answers
2
GATE CSE 1996 | Question: 2.13, ISRO2016-28
The average number of key comparisons required for a successful search for sequential search on $n$ items is $\frac{n}{2}$ $\frac{n-1}{2}$ $\frac{n+1}{2}$ None of the above
The average number of key comparisons required for a successful search for sequential search on $n$ items is$\frac{n}{2}$$\frac{n-1}{2}$$\frac{n+1}{2}$None of the above
31.3k
views
commented
Jan 20, 2019
Algorithms
gate1996
algorithms
easy
isro2016
searching
+
–
1
answer
3
Applied Course | Mock GATE | Test 1 | Question: 8
The last sentence has been deleted from the following paragraph. From the given options, choose that one that completes the paragraph in the most appropriate way. For decades, psychologists believed that men experienced ... characteristic attribute of depression. Men's irritability is usually seen as a telling sign of medical problems.
The last sentence has been deleted from the following paragraph. From the given options, choose that one that completes the paragraph in the most appropriate way.For deca...
571
views
commented
Jan 20, 2019
Analytical Aptitude
applied-course-2019-mock1
analytical-aptitude
logical-reasoning
passage-reading
+
–
3
answers
4
GATE CSE 2006 | Question: 53
Consider the following C-function in which $a[n]$ and $b[m]$ are two sorted integer arrays and $c[n+m]$ be another integer array, void xyz(int a[], int b [], int c []){ int i,j,k; i=j=k=0; while ((i<n) && (j<m)) if (a[i] < b[j]) c[k++] = ... $b[m-1]\leq a[i]$ if $j=m$ only (i) only (ii) either (i) or (ii) but not both neither (i) nor (ii)
Consider the following C-function in which $a[n]$ and $b[m]$ are two sorted integer arrays and $c[n+m]$ be another integer array,void xyz(int a[], int b [], int c []){ in...
11.4k
views
commented
Jan 19, 2019
Algorithms
gatecse-2006
algorithms
identify-function
normal
+
–
7
answers
5
GATE CSE 2016 Set 2 | Question: 38
Let $A_{1}, A_{2}, A_{3}$ and $A_{4}$ be four matrices of dimensions $10 \times 5, 5 \times 20, 20 \times 10$ and $10 \times 5$, respectively. The minimum number of scalar multiplications required to find the product $A_{1}A_{2}A_{3}A_{4}$ using the basic matrix multiplication method is _________.
Let $A_{1}, A_{2}, A_{3}$ and $A_{4}$ be four matrices of dimensions $10 \times 5, 5 \times 20, 20 \times 10$ and $10 \times 5$, respectively. The minimum number of scala...
22.5k
views
commented
Jan 19, 2019
Algorithms
gatecse-2016-set2
dynamic-programming
algorithms
matrix-chain-ordering
normal
numerical-answers
+
–
7
answers
6
GATE CSE 2012 | Question: 45
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the threshold at the start of the first transmission is $8$ MSS. Assume that a timeout occurs during ... Find the congestion window size at the end of the tenth transmission. $8$ MSS $14$ MSS $7$ MSS $12$ MSS
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the t...
38.1k
views
commented
Jan 17, 2019
Computer Networks
gatecse-2012
computer-networks
congestion-control
normal
+
–
7
answers
7
GATE CSE 2008 | Question: 23
Which of the following statements is true for every planar graph on $n$ vertices? The graph is connected The graph is Eulerian The graph has a vertex-cover of size at most $\frac{3n}{4}$ The graph has an independent set of size at least $\frac{n}{3}$
Which of the following statements is true for every planar graph on $n$ vertices?The graph is connectedThe graph is EulerianThe graph has a vertex-cover of size at most $...
56.7k
views
commented
Jan 17, 2019
Graph Theory
gatecse-2008
graph-theory
normal
graph-planarity
+
–
3
answers
8
GATE Overflow | Mock GATE | Test 1 | Question: 65
Consider the following operators used in an arbitrary regular expression parsing. (In all the below statements, capital letters denote the operator. Ignore quotes.) 'xPy' denotes a double occurrence of either x or y. ... Which of the following strings does not belong to the above given regular expression? bbaaabba baaabb bbbaaaa baabbaaaa
Consider the following operators used in an arbitrary regular expression parsing.(In all the below statements, capital letters denote the operator. Ignore quotes.)'xPy' d...
1.1k
views
answered
Jan 13, 2019
Theory of Computation
go-mockgate-1
theory-of-computation
regular-expression
+
–
2
answers
9
GATE Overflow | Mock GATE | Test 1 | Question: 46
Which of the following statements is/are not correct? (P) The class of all Turing Machines is countably infinite (Q) The class of all DCFL's is countably infinite (R) The class of all formal languages is uncountably infinite (S) The set of all primes is countably infinite Only R Only R and S All are incorrect except P None of the above
Which of the following statements is/are not correct?(P) The class of all Turing Machines is countably infinite(Q) The class of all DCFL's is countably infinite(R) The cl...
3.2k
views
commented
Jan 13, 2019
Theory of Computation
go-mockgate-1
countable-uncountable-set
theory-of-computation
+
–
3
answers
10
GATE CSE 2002 | Question: 19
A computer uses $32-bit$ virtual address, and $32-bit$ physical address. The physical memory is byte addressable, and the page size is $4$ $\text{Kbytes}.$ It is decided to use two level page tables to translate from virtual address ... that can be contained in each page? How many bits are available for storing protection and other information in each page table entry?
A computer uses $32-bit$ virtual address, and $32-bit$ physical address. The physical memory is byte addressable, and the page size is $4$ $\text{Kbytes}.$ It is decided...
14.1k
views
commented
Jan 10, 2019
Operating System
gatecse-2002
operating-system
virtual-memory
normal
descriptive
+
–
1
answer
11
binary semaphore
Say I have a Binary Semaphore S initialized to 1. Consider V() as Signal and P() as Wait. If I now invoke V(S), will it wait for S to become 0? Or will it go on with further execution without making any changes to S?
Say I have a Binary Semaphore S initialized to 1. Consider V() as Signal and P() as Wait. If I now invoke V(S), will it wait for S to become 0? Or will it go on with furt...
1.2k
views
commented
Jan 9, 2019
4
answers
12
GATE CSE 2016 Set 1 | Question: 51
Consider the following two phase locking protocol. Suppose a transaction $T$ accesses (for read or write operations), a certain set of objects $\{O_1,\ldots,O_k \}$. This is done in the following ... freedom guarantee neither serializability nor deadlock-freedom guarantee serializability but not deadlock-freedom guarantee deadlock-freedom but not serializability.
Consider the following two phase locking protocol. Suppose a transaction $T$ accesses (for read or write operations), a certain set of objects $\{O_1,\ldots,O_k \}$. This...
21.3k
views
commented
Jan 8, 2019
Databases
gatecse-2016-set1
databases
transaction-and-concurrency
normal
+
–
5
answers
13
GATE IT 2004 | Question: 21
Which level of locking provides the highest degree of concurrency in a relational database ? Page Table Row Page, table and row level locking allow the same degree of concurrency
Which level of locking provides the highest degree of concurrency in a relational database ?PageTableRowPage, table and row level locking allow the same degree of concurr...
18.6k
views
commented
Jan 7, 2019
Databases
gateit-2004
databases
normal
transaction-and-concurrency
+
–
7
answers
14
GATE CSE 2004 | Question: 51
Consider the relation Student (name, sex, marks), where the primary key is shown underlined, pertaining to students in a class that has at least one boy and one girl. What does the following relational algebra expression produce? (Note: $\rho$ ... of girl students with marks not less than some boy student names of girl students with more marks than all the boy students
Consider the relation Student (name, sex, marks), where the primary key is shown underlined, pertaining to students in a class that has at least one boy and one girl. Wha...
17.7k
views
commented
Jan 6, 2019
Databases
gatecse-2004
databases
relational-algebra
normal
+
–
4
answers
15
GATE IT 2005 | Question: 82b
A database table $T_1$ has $2000$ records and occupies $80$ disk blocks. Another table $T_2$ has $400$ records and occupies $20$ disk blocks. These two tables have to be joined as per a specified join condition that needs to be evaluated for ... outer loop, the reduction in number of block accesses required for reading the data will be $0$ $30400$ $38400$ $798400$
A database table $T_1$ has $2000$ records and occupies $80$ disk blocks. Another table $T_2$ has $400$ records and occupies $20$ disk blocks. These two tables have to be ...
16.2k
views
answer edited
Jan 6, 2019
Databases
gateit-2005
databases
normal
joins
+
–
4
answers
16
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
Jan 2, 2019
Theory of Computation
gatecse-2017-set1
theory-of-computation
decidability
difficult
+
–
1
answer
17
TIFR CSE 2019 | Part A | Question: 8
Consider the following toy model of traffic on a straight , single lane, highway. We think of cars as points, which move at the maximum speed $v$ ... the following graphs most accurately captures the relationship between the speed $v$ and the density $\rho$ in this model ?
Consider the following toy model of traffic on a straight , single lane, highway. We think of cars as points, which move at the maximum speed $v$ that satisfies the follo...
1.1k
views
answered
Dec 19, 2018
Quantitative Aptitude
tifr2019
quantitative-aptitude
speed-time-distance
non-gate
+
–
2
answers
18
TIFR CSE 2019 | Part A | Question: 3
$A$ is $n \times n$ square matrix for which the entries in every row sum to $1$. Consider the following statements: The column vector $[1,1,\ldots,1]^T$ is an eigen vector of $A.$ $ \text{det}(A-I) = 0.$ $\text{det}(A) = 0.$ Which of the above statements must be ... Only $(i)$ Only $(ii)$ Only $(i)$ and $(ii)$ Only $(i)$ and $(iii)$ $(i),(ii) \text{ and }(iii)$
$A$ is $n \times n$ square matrix for which the entries in every row sum to $1$. Consider the following statements:The column vector $[1,1,\ldots,1]^T$ is an eigen vector...
3.1k
views
answered
Dec 19, 2018
Linear Algebra
tifr2019
engineering-mathematics
linear-algebra
eigen-value
+
–
2
answers
19
Kenneth Rosen Edition 6th Exercise 7.1 Question 23 (Page No. 458)
Find a recurrence relation for the number of bit strings of length n that contains a pair of consecutive 0s
Find a recurrence relation for the number of bit strings of length n that contains a pair of consecutive 0s
447
views
answer edited
Dec 15, 2018
Combinatory
kenneth-rosen
discrete-mathematics
recurrence-relation
+
–
1
answer
20
Paging
Consider a computer system with single level paging architecture having logical address of 'd'-bit. The memory is byte addressable. If the page table entry size is '32'-bits. What must be the optimal page size P by minimizing the page table overhead and internal fragmentation in paging?
Consider a computer system with single level paging architecture having logical address of 'd'-bit. The memory is byte addressable. If the page table entry size is '32'-b...
1.4k
views
comment edited
Dec 12, 2018
6
answers
21
Deadlock
Consider two processes P1 and P2, each needed 3 resources 1, 2 and 3 in a database. If each processes ask them in any order, then the number of ways possible in which system is guaranteed to be deadlock free ________. Given answer is 6. I am getting 12.
Consider two processes P1 and P2, each needed 3 resources 1, 2 and 3 in a database. If each processes ask them in any order, then the number of ways possible in which sy...
5.6k
views
comment edited
Dec 11, 2018
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
4
answers
22
Pipe-lining with floating point operation..!!
Suppose that a task makes extensive use of floating point operations with 40% of the time is consumed by floating point operations. With a new hardware design, the floating point module is speeded up by a factor of 4. What is the overall speedup? A. 1.05 B. 1.42 C. 2.5 D. 4 Please explain the little bit problem also.
Suppose that a task makes extensive use of floating point operations with 40% of the time is consumed by floating point operations. With a new hardware design, the floati...
3.9k
views
comment edited
Dec 10, 2018
CO and Architecture
co-and-architecture
pipelining
+
–
7
answers
23
TIFR CSE 2019 | Part B | Question: 13
A row of $10$ houses has to be painted using the colours red, blue, and green so that each house is a single colour, and any house that is immediately to the right of a red or a blue house must be green. How many ways are there to paint the houses? $199$ $683$ $1365$ $3^{10}-2^{10}$ $3^{10}$
A row of $10$ houses has to be painted using the colours red, blue, and green so that each house is a single colour, and any house that is immediately to the right of a r...
4.8k
views
comment edited
Dec 9, 2018
Combinatory
tifr2019
combinatory
counting
+
–
0
answers
24
Does operator grammar belong to both NCFL and DCFL?
Operator precedence parser even parses ambiguous grammars that are in form of operator grammars. I am inquiring about the nature of the ambiguous grammar. Could the language described by the operator grammar be both $DCFL$ or $NCFL$?
Operator precedence parser even parses ambiguous grammars that are in form of operator grammars. I am inquiring about the nature of the ambiguous grammar. Could the langu...
243
views
asked
Dec 9, 2018
Compiler Design
compiler-design
grammar
+
–
3
answers
25
GATE CSE 1994 | Question: 20
A grammar $G$ is in Chomsky-Normal Form (CNF) if all its productions are of the form $A \to BC$ or $A \to a$, where $A,B$ and $C$, are non-terminals and $a$ is a terminal. Suppose $G$ is a CFG in CNF and $w$ is a string in $L(G)$ of length $n$, then how long is a derivation of $w$ in $G$?
A grammar $G$ is in Chomsky-Normal Form (CNF) if all its productions are of the form $A \to BC$ or $A \to a$, where $A,B$ and $C$, are non-terminals and $a$ is a terminal...
4.9k
views
answered
Dec 8, 2018
Compiler Design
gate1994
compiler-design
grammar
normal
descriptive
+
–
6
answers
26
GATE2018 CE-1: GA-10
Each of the letters arranged as below represents a unique integer from $1$ to $9.$ The letters are positioned in the figure such that $(A \times B \times C), (B \times G \times E)$ and $(D \times E \times F)$ are equal. Which integer among the following choices cannot be represented by the letters $A, B, C, D, E, F \ or \ G?$ A D B G E C F $4$ $5$ $6$ $9$
Each of the letters arranged as below represents a unique integer from $1$ to $9.$ The letters are positioned in the figure such that $(A \times B \times C), (B \times G ...
2.5k
views
answer edited
Dec 7, 2018
Analytical Aptitude
gate2018-ce-1
general-aptitude
analytical-aptitude
logical-reasoning
+
–
18
answers
27
GATE CSE 2009 | Question: 57, ISRO2016-75
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into ...
48.1k
views
answered
Dec 4, 2018
Computer Networks
gatecse-2009
computer-networks
sliding-window
normal
isro2016
+
–
3
answers
28
Generating Function
What will be solution of this function for coefficient of $x^{100}$? $\frac{1}{\left ( 1-x^{10} \right )(1-x^{20})(1-x^{50})}$
What will be solution of this function for coefficient of $x^{100}$?$$\frac{1}{\left ( 1-x^{10} \right )(1-x^{20})(1-x^{50})}$$
1.7k
views
answer edited
Dec 3, 2018
Combinatory
generating-functions
discrete-mathematics
+
–
0
answers
29
Self doubt
State True/False and explain the following statements. Recoverability implies no dirty read. Dirty read implies cascading rollbacks when transactions are more than $2$
State True/False and explain the following statements. Recoverability implies no dirty read. Dirty read implies cascading rollbacks when transactions are more than $2$
175
views
asked
Nov 22, 2018
Databases
databases
+
–
5
answers
30
GATE CSE 2015 Set 3 | Question: 29
Consider the partial Schedule $S$ involving two transactions $T1$ and $T2$. Only the $\textit{read}$ and the $\textit{write}$ operations have been shown. The $\textit{read}$ operation on data item $P$ ... re-started to ensure transaction atomicity Schedule $S$ is recoverable and can ensure transaction atomicity and nothing else needs to be done
Consider the partial Schedule $S$ involving two transactions $T1$ and $T2$. Only the $\textit{read}$ and the $\textit{write}$ operations have been shown. The $\textit{rea...
14.2k
views
comment edited
Nov 22, 2018
Databases
gatecse-2015-set3
databases
transaction-and-concurrency
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register