Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
aspirant_18
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by aspirant_18
2
answers
1
TIFR CSE 2012 | Part B | Question: 8
Consider the parse tree Assume that $*$ has higher precedence than $+$, $-$ and operators associate right to left (i.e $(a + b + c= (a + (b + c)))$. Consider $2 + a - b$ $2 + a - b * a + b$ ... The parse tree corresponds to Expression (i) Expression (ii) Expression (iv) only Expression (ii), (iii), and (iv) Expression (iii) and (iv) only
Consider the parse treeAssume that $*$ has higher precedence than $+$, $-$ and operators associate right to left (i.e $(a + b + c= (a + (b + c)))$. Consider$2 + a - b$$2 ...
2.6k
views
commented
Jan 28, 2018
Compiler Design
tifr2012
compiler-design
parsing
operator-precedence
+
–
5
answers
2
GATE CSE 1998 | Question: 18
For a set-associative Cache organization, the parameters are as follows: ... $1 \leq m \leq l$. Give the value of the hit ratio for $l = 1$.
For a set-associative Cache organization, the parameters are as follows:$$\begin{array}{|c|l|} \hline \text {$t _c$} & \text{Cache Access Time }\\\hline \text{$t _m$} &...
11.9k
views
commented
Jan 25, 2018
CO and Architecture
gate1998
co-and-architecture
cache-memory
descriptive
+
–
3
answers
3
GATE CSE 2001 | Question: 20
Consider a disk with the $100$ tracks numbered from $0$ to $99$ rotating at $3000$ rpm. The number of sectors per track is $100$ and the time to move the head between two successive tracks is $0.2$ millisecond. Consider a set of disk ... at track $0$ and the elevator algorithm is used to schedule disk requests, what is the worse case time to complete all the requests?
Consider a disk with the $100$ tracks numbered from $0$ to $99$ rotating at $3000$ rpm. The number of sectors per track is $100$ and the time to move the head between two...
10.8k
views
commented
Jan 24, 2018
Operating System
gatecse-2001
operating-system
disk
normal
descriptive
+
–
3
answers
4
GATE CSE 1999 | Question: 2.10
A multi-user, multi-processing operating system cannot be implemented on hardware that does not support Address translation DMA for disk transfer At least two modes of CPU execution (privileged and non-privileged) Demand paging
A multi-user, multi-processing operating system cannot be implemented on hardware that does not supportAddress translationDMA for disk transferAt least two modes of CPU e...
12.6k
views
commented
Jan 24, 2018
Operating System
gate1999
operating-system
normal
virtual-memory
+
–
5
answers
5
GATE CSE 1998 | Question: 7-b
In a computer system where the best-fit' algorithm is used for allocating jobs' to memory partitions', the following situation was encountered:$\begin{array}{|l|l|} \hline \textbf{Partitions size in $KB$} & \textbf{$ ... $} \\\hline \end{array}$When will the $20K$ job complete?
In a computer system where the ‘best-fit’ algorithm is used for allocating ‘jobs’ to ‘memory partitions’, the following situation was encountered:$$\begin{arr...
12.7k
views
commented
Jan 23, 2018
Operating System
gate1998
operating-system
process-scheduling
normal
+
–
9
answers
6
GATE CSE 2014 Set 2 | Question: 3
The maximum number of edges in a bipartite graph on $12$ vertices is____
The maximum number of edges in a bipartite graph on $12$ vertices is____
26.9k
views
commented
Jan 14, 2018
Graph Theory
gatecse-2014-set2
graph-theory
graph-connectivity
numerical-answers
normal
+
–
3
answers
7
GATE IT 2007 | Question: 49
Consider the following grammars. Names representing terminals have been specified in capital letters. ... $G_1$ and $G_2$ are regular Both $G_1$ and $G_2$ are context-free but neither of them is regular
Consider the following grammars. Names representing terminals have been specified in capital letters.$$\begin{array}{llll}\hline \text{$G1$ :} & \text{stmnt} & \text{$\...
12.6k
views
commented
Jan 12, 2018
Theory of Computation
gateit-2007
theory-of-computation
context-free-language
normal
+
–
12
answers
8
GATE CSE 2014 Set 1 | Question: 27
Let the size of congestion window of a TCP connection be $32$ KB when a timeout occurs. The round trip time of the connection is $100$ msec and the maximum segment size used is $2$ KB. The time taken (in msec) by the TCP connection to get back to $32$ KB congestion window is _________.
Let the size of congestion window of a TCP connection be $32$ KB when a timeout occurs. The round trip time of the connection is $100$ msec and the maximum segment size u...
37.5k
views
comment edited
Jan 9, 2018
Computer Networks
gatecse-2014-set1
computer-networks
tcp
congestion-control
numerical-answers
normal
+
–
2
answers
9
GATE CSE 2017 Set 1 | Question: 23
Consider a database that has the relation schema EMP (EmpId, EmpName, and DeptName). An instance of the schema EMP and a SQL query on it are given below: ... SELECT DeptName, COUNT(EmpId) AS EC(DeptName, Num) FROM EMP GROUP BY DeptName) The output of executing the SQL query is _____________ .
Consider a database that has the relation schema EMP (EmpId, EmpName, and DeptName). An instance of the schema EMP and a SQL query on it are given below:$$\overset{\text{...
13.5k
views
comment moved
Jan 3, 2018
Databases
gatecse-2017-set1
databases
sql
numerical-answers
+
–
1
answer
10
GATE CSE 2004 | Question: 13
Let $R_1 \left(\underline{A}, B, C\right)$ and $R_2\left(\underline{D}, E \right) $ be two relation schema, where the primary keys are shown underlined, and let C be a foreign key in $R_1$ referring to $R_2$. Suppose there is no violation of the above ... $\Pi_D \left(r_1 \bowtie_{C \neq D}r_2\right)$ $\Pi_C \left(r_1 \bowtie_{C = D}r_2\right)$
Let $R_1 \left(\underline{A}, B, C\right)$ and $R_2\left(\underline{D}, E \right) $ be two relation schema, where the primary keys are shown underlined, and let C be a fo...
7.0k
views
commented
Dec 31, 2017
Databases
gatecse-2004
databases
relational-calculus
easy
+
–
4
answers
11
GATE CSE 2014 Set 1 | Question: 54
Given the following schema: employees(emp-id, first-name, last-name, hire-date, dept-id, salary) departments(dept-id, dept-name, manager-id, location-id) You want to display the last names and hire dates of all latest hires in their ... of pairwise comparison. It generates an error because of the GROUP BY clause cannot be used with table joins in a sub-query.
Given the following schema: employees(emp-id, first-name, last-name, hire-date, dept-id, salary) departments(dept-id, dept-name, manager-id, location-id)You wan...
14.4k
views
commented
Dec 31, 2017
Databases
gatecse-2014-set1
databases
sql
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register