Recent questions tagged gate2003
Register

Recent questions tagged gate2003

Recent questions tagged gate2003
0 votes
0 answers 40 views
GATE2003-78 Video Solution
A processor uses $2-level$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, the ... virtual address is approximately (to the nearest $0.5$ ns) $1.5$ ns $2$ ns $3$ ns $4$ ns
admin asked in Operating System Apr 18, 2020
by admin
585 points
40 views
0 votes
0 answers 20 views
GATE2003-18 Video Solution
In a bottom-up evaluation of a syntax directed definition, inherited attributes can always be evaluated be evaluated only if the definition is L-attributed be evaluated only if the definition has synthesized attributes never be evaluated
admin asked in Compiler Design Apr 18, 2020
by admin
585 points
20 views
0 votes
0 answers 21 views
GATE2003-23 Video Solution
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time $\Theta (n \log n)$ $\Theta (n)$ $\Theta(\log n)$ $\Theta(1)$
admin asked in DS Apr 18, 2020
by admin
585 points
21 views
0 votes
0 answers 23 views
GATE2003-82, ISRO2009-1 Video Solution
The subnet mask for a particular network is $255.255.31.0.$ Which of the following pairs of $\text{IP}$ addresses could belong to this network? $172.57.88.62$ and $172.56.87.23$ $10.35.28.2$ and $10.35.29.4$ $191.203.31.87$ and $191.234.31.88$ $128.8.129.43$ and $128.8.161.55$
admin asked in Computer Networks Apr 18, 2020
by admin
585 points
23 views
0 votes
0 answers 26 views
GATE2003-66 Video Solution
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is represented by binary notation) is $O(n)$ but not $O(n^{0.5})$ $O(n^{0.5})$ ... constant $m>0$ $O( (\log \log n)^k )$ for some constant $k > 0.5$, but not $O( (\log \log n)^{0.5} )$
admin asked in Algorithms Apr 18, 2020
by admin
585 points
26 views
0 votes
0 answers 23 views
GATE2003-79 Video Solution
A processor uses $\text{2-level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, ... tables of this process is $\text{8 KB}$ $\text{12 KB}$ $\text{16 KB}$ $\text{20 KB}$
admin asked in Operating System Apr 18, 2020
by admin
585 points
23 views
0 votes
0 answers 25 views
GATE2003-54 Video Solution
Define languages $L_0$ and $L_1$ as follows : $L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $ $L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts on }w\}$ Here $\langle M, w, i \rangle$ is a triplet, whose ... $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable
admin asked in Theory of Computation Apr 18, 2020
by admin
585 points
25 views
0 votes
0 answers 23 views
GATE2003-64 Video Solution
Let S be a stack of size $n \geq1$. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform $n$ pop operations. Assume that Push and Pop operations take $X$ seconds each, and $Y$ seconds elapse between the end of one such stack ... S. The average stack-life of an element of this stack is $n(X+Y)$ $3Y+2X$ $n(X+Y)-X$ $Y+2X$
admin asked in DS Apr 18, 2020
by admin
585 points
23 views
0 votes
0 answers 18 views
GATE2003-16 Video Solution
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar? Removing left recursion alone Factoring the grammar alone Removing left recursion and factoring the grammar None of the above
admin asked in Compiler Design Apr 18, 2020
by admin
585 points
18 views
0 votes
0 answers 27 views
GATE2003-2 Video Solution
Assume the following C variable declaration: int *A[10], B[10][10]; Of the following expressions: $A[2]$ $A[2][3]$ $B[1]$ $B[2][3]$ which will not give compile-time errors if used as left hand sides of assignment statements in a C program? I, II, and IV only II, III, and IV only II and IV only IV only
admin asked in Programming Apr 18, 2020
by admin
585 points
27 views
0 votes
0 answers 26 views
GATE2003-43 Video Solution
The following is a scheme for floating point number representation using 16 bits. Bit Position 15 14 .... 9 8 ...... 0 s e m Sign Exponent Mantissa Let s, e, and m be the numbers represented in binary in the sign, exponent, and mantissa fields respectively. ... between two successive real numbers representable in this system? $2^{-40}$ $2^{-9}$ $2^{22}$ $2^{31}$
admin asked in Digital Logic Apr 18, 2020
by admin
585 points
26 views
0 votes
0 answers 17 views
GATE2003-67 Video Solution
Let $G =(V,E)$ be an undirected graph with a subgraph $G_1 = (V_1, E_1)$. Weights are assigned to edges of $G$ as follows. $w(e) = \begin{cases} 0 \text{, if } e \in E_1 \\1 \text{, otherwise} \end{cases}$ A single-source shortest path ... edges in the shortest paths from $v_1$ to all vertices of $G$ $G_1$ is connected $V_1$ forms a clique in $G$ $G_1$ is a tree
admin asked in Algorithms Apr 18, 2020
by admin
585 points
17 views
1 vote
0 answers 22 views
GATE2003-32 Video Solution
Which of the following is a valid first order formula? (Here \(\alpha\) and \(\beta\) are first order formulae with $x$ as their only free variable) $((∀x)[α] ⇒ (∀x)[β]) ⇒ (∀x)[α ⇒ β]$ $(∀x)[α] ⇒ (∃x)[α ∧ β]$ $((∀x)[α ∨ β] ⇒ (∃x)[α]) ⇒ (∀x)[α]$ $(∀x)[α ⇒ β] ⇒ (((∀x)[α]) ⇒ (∀x)[β])$
admin asked in Mathematical Logic Apr 18, 2020
by admin
585 points
22 views
0 votes
0 answers 27 views
GATE2003-57 Video Solution
Consider the grammar shown below. $S \rightarrow C \ C$ $C \rightarrow c \ C \mid d$ This grammar is LL(1) SLR(1) but not LL(1) LALR(1) but not SLR(1) LR(I) but not LALR(1)
admin asked in Compiler Design Apr 18, 2020
by admin
585 points
27 views
0 votes
0 answers 30 views
GATE2003-62 Video Solution
In a permutation \(a_1 ... a_n\), of $n$ distinct integers, an inversion is a pair \((a_i, a_j)\) such that \(i < j\) and \(a_i > a_j\). What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations of \(1. ... at most $n$ inversions? \(\Theta(n^2)\) \(\Theta(n\log n)\) \(\Theta(n^{1.5})\) \(\Theta(n)\)
admin asked in Algorithms Apr 18, 2020
by admin
585 points
30 views
0 votes
0 answers 26 views
GATE2003-63, ISRO2009-25 Video Solution
A data structure is required for storing a set of integers such that each of the following operations can be done in $O(\log n)$ time, where $n$ is the number of elements in the set. Deletion of the smallest element Insertion of an ... used but not a heap Both balanced binary search tree and heap can be used Neither balanced search tree nor heap can be used
admin asked in DS Apr 18, 2020
by admin
585 points
26 views
0 votes
0 answers 19 views
GATE2003-46 Video Solution
Consider the ALU shown below. If the operands are in $2's$ complement representation, which of the following operations can be performed by suitably setting the control lines $K$ and $C_0$ only (+ and - denote addition and subtraction respectively)? $A + B$, and $A - B$, but not $A + 1$ $A + B$ ... $A + B$, but not $A - B$ or $A + 1$ $A + B$, and $A - B$, and $A + 1$
admin asked in Digital Logic Apr 18, 2020
by admin
585 points
19 views
0 votes
0 answers 17 views
GATE2003-77 Video Solution
A uni-processor computer system only has two processes, both of which alternate $10$ $\text{ms}$ CPU bursts with $90$ $\text{ms}$ I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes ... Static priority scheduling with different priorities for the two processes Round robin scheduling with a time quantum of $5$ $\text{ms}$
admin asked in Operating System Apr 18, 2020
by admin
585 points
17 views
0 votes
0 answers 20 views
GATE2003-47 Video Solution
Consider the following circuit composed of XOR gates and non-inverting buffers. The non-inverting buffers have delays $\delta_1 = 2 ns$ and $\delta_2 = 4 ns$ as shown in the figure. Both XOR gates and all wires have zero delays. Assume that all gate inputs, outputs, and wires ... of logic levels) occur(s) at $B$ during the interval from $0$ to $10$ ns? $1$ $2$ $3$ $4$
admin asked in Digital Logic Apr 18, 2020
by admin
585 points
20 views
0 votes
0 answers 21 views
GATE2003-36 Video Solution
How many perfect matching are there in a complete graph of $6$ vertices? $15$ $24$ $30$ $60$
admin asked in Graph Theory Apr 18, 2020
by admin
585 points
21 views
0 votes
0 answers 38 views
GATE2003-15 Video Solution
If the strings of a language $L$ can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true? $L$ is necessarily finite $L$ is regular but not necessarily finite $L$ is context free but not necessarily regular $L$ is recursive but not necessarily context-free
admin asked in Theory of Computation Apr 18, 2020
by admin
585 points
38 views
0 votes
0 answers 18 views
GATE2003-61 Video Solution
In a permutation \(a_1 ... a_n\), of n distinct integers, an inversion is a pair \((a_i, a_j)\) such that \(i < j\) and \(a_i > a_j\). If all permutations are equally likely, what is the expected number of inversions in a randomly chosen permutation of \(1. . . n\)? \(\frac{n(n-1)}{2}\) \(\frac{n(n-1)}{4}\) \(\frac{n(n+1)}{4}\) \(2n[\log_2n]\)
admin asked in Algorithms Apr 18, 2020
by admin
585 points
18 views
0 votes
0 answers 19 views
GATE2003-6 Video Solution
Let $T(n)$ be the number of different binary search trees on $n$ distinct elements. Then $T(n) = \sum_{k=1}^{n} T(k-1)T(x)$, where $x$ is $n-k+1$ $n-k$ $n-k-1$ $n-k-2$
admin asked in DS Apr 18, 2020
by admin
585 points
19 views
0 votes
0 answers 12 views
GATE2003-11 Video Solution
Consider an array multiplier for multiplying two $n$ bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is $\Theta(1)$ $\Theta(\log n)$ $\Theta(n)$ $\Theta(n^2)$
admin asked in Digital Logic Apr 18, 2020
by admin
585 points
12 views
0 votes
0 answers 18 views
GATE2003-45 Video Solution
The literal count of a Boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of $\left(xy+xz'\right)$ is $4.$ What are the minimum possible literal counts of the product-of-sum and sum-of-product representations ... map? Here, $X$ denotes "don't care" $(11, 9)$ $(9, 13)$ $(9, 10)$ $(11,11)$
admin asked in Digital Logic Apr 18, 2020
by admin
585 points
18 views
0 votes
0 answers 21 views
GATE2003-76 Video Solution
Which of the following is NOT an advantage of using shared, dynamically linked libraries as opposed to using statistically linked libraries? Smaller sizes of executable files Lesser overall page fault rate in the system Faster program startup Existing programs need not be re-linked to take advantage of newer versions of libraries
admin asked in Compiler Design Apr 18, 2020
by admin
585 points
21 views
0 votes
0 answers 20 views
GATE2003-70 Video Solution
Let $G= (V,E)$ be a directed graph with $n$ vertices. A path from $v_i$ to $v_j$ in $G$ is a sequence of vertices ($v_{i},v_{i+1}, \dots , v_j$) such that $(v_k, v_{k+1}) \in E$ for all $k$ in $i$ through $j-1$. A simple path is a path in ... length from $j$ to $k$ If there exists a path from $j$ to $k$, every simple path from $j$ to $k$ contains at most $A[j,k]$ edges
admin asked in Algorithms Apr 18, 2020
by admin
585 points
20 views
0 votes
0 answers 21 views
GATE2003-22 Video Solution
The unusual $\Theta(n^2)$ implementation of Insertion Sort to sort an array uses linear search to identify the position where an element is to be inserted into the already sorted part of the array. If, instead, we use binary search to identify the position, the worst case running ... $\Theta(n^2)$ become $\Theta(n (\log n)^2)$ become $\Theta(n \log n)$ become $\Theta(n)$
admin asked in Algorithms Apr 18, 2020
by admin
585 points
21 views
0 votes
0 answers 23 views
GATE2003-33 Video Solution
Consider the following formula and its two interpretations \(I_1\) and \(I_2\). \(\alpha: (\forall x)\left[P_x \Leftrightarrow (\forall y)\left[Q_{xy} \Leftrightarrow \neg Q_{yy} \right]\right] \Rightarrow (\forall x)\left[\neg P_x\right]\) \(I_1\) : Domain: ... (I_1\) does not Neither \(I_1\) nor \(I_2\) satisfies \(\alpha\) Both \(I_1\) and \(I_2\) satisfies \(\alpha\)
admin asked in Mathematical Logic Apr 18, 2020
by admin
585 points
23 views
0 votes
0 answers 26 views
GATE2003-48 Video Solution
Consider the following assembly language program for a hypothetical processor $A, B,$ and $C$ are $8-$bit registers. The meanings of various instructions are shown as comments. $\begin{array}{lll} & \text{MOV B, #0}&& \text{;} & \text{$B \leftarrow ... the program execution will be the number of $0$ bits in $A_0$ the number of $1$ bits in $A_0$ $A_0$ $8$
admin asked in CO & Architecture Apr 18, 2020
by admin
585 points
26 views
0 votes
0 answers 12 views
GATE2003-8, ISRO2009-53 Video Solution
Let $G$ be an arbitrary graph with $n$ nodes and $k$ components. If a vertex is removed from $G$, the number of components in the resultant graph must necessarily lie down between $k$ and $n$ $k-1$ and $k+1$ $k-1$ and $n-1$ $k+1$ and $n-k$
admin asked in Graph Theory Apr 18, 2020
by admin
585 points
12 views
0 votes
0 answers 18 views
GATE2003-27 Video Solution
Which of the following assertions is FALSE about the Internet Protocol (IP)? It is possible for a computer to have multiple IP addresses IP packets from the same source to the same destination can take different routes in the network IP ensures that a ... set the route of an outgoing packets; the route is determined only by the routing tables in the routers on the way
admin asked in Computer Networks Apr 18, 2020
by admin
585 points
18 views
0 votes
0 answers 20 views
GATE2003-25, ISRO2009-12 Video Solution
Using a larger block size in a fixed block size file system leads to better disk throughput but poorer disk space utilization better disk throughput and better disk space utilization poorer disk throughput but better disk space utilization poorer disk throughput and poorer disk space utilization
admin asked in Operating System Apr 18, 2020
by admin
585 points
20 views
0 votes
0 answers 18 views
GATE2003-40 Video Solution
A graph $G=(V,E)$ satisfies $\mid E \mid \leq 3 \mid V \mid - 6$. The min-degree of $G$ is defined as $\min_{v\in V}\left\{ \text{degree }(v)\right \}$. Therefore, min-degree of $G$ cannot be $3$ $4$ $5$ $6$
admin asked in Graph Theory Apr 18, 2020
by admin
585 points
18 views
0 votes
0 answers 16 views
GATE2003-14 Video Solution
The regular expression $0^*(10^*)^*$ denotes the same set as $(1^*0)^*1^*$ $0+(0+10)^*$ $(0+1)^*10(0+1)^*$ None of the above
admin asked in Theory of Computation Apr 18, 2020
by admin
585 points
16 views
0 votes
0 answers 16 views
GATE2003-28 Video Solution
Which of the following functionality must be implemented by a transport protocol over and above the network protocol? Recovery from packet losses Detection of duplicate packets Packet delivery in the correct order End to end connectivity
admin asked in Computer Networks Apr 18, 2020
by admin
585 points
16 views
0 votes
0 answers 19 views
GATE2003-44 Video Solution
A $\text{1-input}$, $\text{2-output}$ synchronous sequential circuit behaves as follows: Let $z_k, n_k$ denote the number of $0'$s and $1's$ respectively in initial k bits of the input $(z_k+n_k=k)$. The circuit outputs $00$ until one of the ... $01$. What is the minimum number of states required in the state transition graph of the above circuit? $5$ $6$ $7$ $8$
admin asked in Digital Logic Apr 18, 2020
by admin
585 points
19 views
0 votes
0 answers 22 views
GATE2003-29, ISRO2009-73 Video Solution
Which of the following scenarios may lead to an irrecoverable error in a database system? A transaction writes a data item after it is read by an uncommitted transaction A transaction reads a data item after it is read by an ... it is written by a committed transaction A transaction reads a data item after it is written by an uncommitted transaction
admin asked in Databases Apr 18, 2020
by admin
585 points
22 views
0 votes
0 answers 11 views
GATE2003-51 Video Solution
Let $G=\left(\left\{S\right\}, \left\{a,b\right\},R,S\right)$ be a context free grammar where the rule set R is $S \to a S b \mid S S \mid \epsilon$ Which of the following statements is true? $G$ is not ambiguous There ... $L(G)$ We can find a deterministic finite state automaton that accepts $L(G)$
admin asked in Theory of Computation Apr 18, 2020
by admin
585 points
11 views
Page:
Ask a Question
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Developed by Chun