menu
Recent questions tagged gate1999
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged gate1999
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Recent questions tagged gate1999
0
votes
0
answers
26
views
GATE1999-2.7, UGCNET-June2014-III-25 Video Solution
admin
asked
in
Databases
Apr 18, 2020
by
admin
589
points
26
views
gate1999
databases
database-normalization
normal
ugcnetjune2014iii
video-solution
0
votes
0
answers
21
views
GATE1999-1.17 Video Solution
Which of the following is the most powerful parsing method? LL (1) Canonical LR SLR LALR
admin
asked
in
Compiler Design
Apr 18, 2020
by
admin
589
points
21
views
gate1999
compiler-design
parsing
easy
video-solution
1
vote
1
answer
28
views
GATE1999-1.18, ISRO2016-53 Video Solution
Consider the join of a relation $R$ with a relation $S$. If $R$ has $m$ tuples and $S$ has $n$ tuples then the maximum and minimum sizes of the join respectively are $m+n$ and $0$ $mn$ and $0$ $m+n$ and $|m-n|$ $mn$ and $m+n$
admin
asked
in
Databases
Apr 18, 2020
by
admin
589
points
28
views
gate1999
databases
relational-algebra
easy
isro2016
video-solution
0
votes
0
answers
21
views
GATE1999-1.14, ISRO2015-42 Video Solution
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order: $20, \ 47, \ 15, \ 8, \ 9, \ 4, \ 40, \ 30, \ 12, \ 17$ ... $4, \ 8, \ 9, \ 15, \ 20, \ 47, \ 12, \ 17, \ 30, \ 40$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
589
points
21
views
gate1999
algorithms
sorting
normal
isro2015
video-solution
0
votes
0
answers
16
views
GATE1999-2.9 Video Solution
Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function? XOR gates, NOT gates $2$ to $1$ multiplexers AND gates, XOR gates Three-input gates that output $(A.B) + C$ for the inputs $A, B$ and $C$.
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
589
points
16
views
gate1999
digital-logic
normal
functional-completeness
video-solution
0
votes
1
answer
39
views
GATE1999-2.16 Video Solution
The number of full and half-adders required to add $16$-bit numbers is $8$ half-adders, $8$ full-adders $1$ half-adder, $15$ full-adders $16$ half-adders, $0$ full-adders $4$ half-adders, $12$ full-adders
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
589
points
39
views
gate1999
digital-logic
normal
adder
video-solution
0
votes
0
answers
94
views
GATE1999-2.12 Video Solution
Which of the following actions is/are typically not performed by the operating system when switching context from process $A$ to process $B$? Saving current register values and restoring saved register values for process $B$. Changing address translation tables. Swapping out the memory image of process $A$ to the disk. Invalidating the translation look-aside buffer.
admin
asked
in
Operating System
Apr 18, 2020
by
admin
589
points
94
views
gate1999
operating-system
context-switch
normal
video-solution
0
votes
0
answers
24
views
GATE1999-1.4 Video Solution
Consider the regular expression $(0 + 1) (0+1) \dots N$ times. The minimum state finite automaton that recognizes the language represented by this regular expression contains $n$ states $n+1$ states $n+2$ states None of the above
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
589
points
24
views
gate1999
theory-of-computation
finite-automata
easy
minimal-state-automata
video-solution
0
votes
0
answers
15
views
GATE1999-1.6 Video Solution
Let $L_1$ be the set of all languages accepted by a PDA by final state and $L_2$ the set of all languages accepted by empty stack. Which of the following is true? $L_1 = L_2$ $L_1 \supset L_2$ $L_1 \subset L_2$ None
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
589
points
15
views
normal
theory-of-computation
gate1999
pushdown-automata
video-solution
0
votes
0
answers
21
views
GATE1999-1.13 Video Solution
Suppose we want to arrange the $n$ numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is $n-1$ $n$ $n+1$ None of the above
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
589
points
21
views
gate1999
algorithms
time-complexity
normal
video-solution
0
votes
0
answers
18
views
GATE1999-1.11, UGCNET-Dec2015-II-44 Video Solution
admin
asked
in
Operating System
Apr 18, 2020
by
admin
589
points
18
views
gate1999
operating-system
normal
ugcnetdec2015ii
os-protection
video-solution
1
vote
1
answer
47
views
GATE1999-2.25 Video Solution
Which of the following is/are correct? An SQL query automatically eliminates duplicates An SQL query will not work if there are no indexes on the relations SQL permits attribute names to be repeated in the same relation None of the above
admin
asked
in
Databases
Apr 18, 2020
by
admin
589
points
47
views
gate1999
databases
sql
easy
video-solution
0
votes
0
answers
27
views
GATE1999-2.10 Video Solution
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
admin
asked
in
Operating System
Apr 18, 2020
by
admin
589
points
27
views
gate1999
operating-system
normal
virtual-memory
video-solution
0
votes
1
answer
113
views
GATE1999-1.20 Video Solution
Booth's coding in $8$ bits for the decimal number $-57$ is: $0-100+1000$ $0-100+100-1$ $0-1+100-10+1$ $00-10+100-1$
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
589
points
113
views
gate1999
digital-logic
number-representation
booths-algorithm
normal
video-solution
0
votes
0
answers
102
views
GATE1999-19 Video Solution
A certain computer system has the segmented paging architecture for virtual memory. The memory is byte addressable. Both virtual and physical address spaces contain $2^{16}$ bytes each. The virtual address space is divided into $8$ non-overlapping equal size ... in page table entry for storing the aging information for the page? Assume that the page size is $512$ bytes.
admin
asked
in
Operating System
Apr 18, 2020
by
admin
589
points
102
views
gate1999
operating-system
virtual-memory
normal
video-solution
0
votes
1
answer
32
views
GATE1999-2.6 Video Solution
For the schedule given below, which of the following is correct: ... schedule is not serializable but can occur in a scheme using 2PL protocol This schedule is not serializable and cannot occur in a scheme using 2PL protocol
admin
asked
in
Databases
Apr 18, 2020
by
admin
589
points
32
views
gate1999
databases
transactions
normal
video-solution
0
votes
0
answers
16
views
GATE1999-2.2 Video Solution
Two girls have picked $10$ roses, $15$ sunflowers and $15$ daffodils. What is the number of ways they can divide the flowers among themselves? $1638$ $2100$ $2640$ None of the above
admin
asked
in
Combinatory
Apr 18, 2020
by
admin
589
points
16
views
gate1999
combinatory
normal
video-solution
0
votes
0
answers
20
views
GATE1999-2.23 Video Solution
A certain processor supports only the immediate and the direct addressing modes. Which of the following programming language features cannot be implemented on this processor? Pointers Arrays Records Recursive procedures with local variable
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
589
points
20
views
gate1999
co-and-architecture
addressing-modes
normal
video-solution
0
votes
0
answers
15
views
GATE1999-2-18, ISRO2008-46 Video Solution
Raid configurations of the disks are used to provide Fault-tolerance High speed High data density (A) & (B)
admin
asked
in
Operating System
Apr 18, 2020
by
admin
589
points
15
views
gate1999
operating-system
disks
easy
isro2008
video-solution
0
votes
0
answers
31
views
GATE1999-2.4 Video Solution
Multiple choices may be correct: If $L1$ is context free language and $L2$ is a regular language which of the following is/are false? $L1-L2$ is not context free $L1 \cap L2$ is context free $\sim L1$ is context free $\sim L2$ is regular
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
589
points
31
views
gate1999
theory-of-computation
identify-class-language
normal
video-solution
0
votes
0
answers
25
views
GATE1999-2.21 Video Solution
If $T_1 = O(1)$, give the correct matching for the following pairs: $\begin{array}{l|l}\hline \text{(M) $T_n = T_{n-1} + n$} & \text{(U) $T_n = O(n)$} \\\hline \text{(N) $T_n = T_{n/2} + n$} & \text{(V) $T_n = O(n \log n)$} \\\hline \text{(O) $T_n = T_{n/2} + n ... $\text{M-W, N-U, O-X, P-V}$ $\text{M-V, N-W, O-X, P-U}$ $\text{M-W, N-U, O-V, P-X}$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
589
points
25
views
gate1999
algorithms
recurrence
asymptotic-notations
normal
video-solution
0
votes
0
answers
20
views
GATE1999-2.20 Video Solution
The minimum number of record movements required to merge five files A (with $10$ records), B (with $20$ records), C (with $15$ records), D (with $5$ records) and E (with $25$ records) is: $165$ $90$ $75$ $65$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
589
points
20
views
gate1999
algorithms
normal
greedy-algorithm
video-solution
0
votes
0
answers
31
views
GATE1999-2.11 Video Solution
Which of the following is/are advantage(s) of virtual memory? Faster access to memory on an average. Processes can be given protected address spaces. Linker can assign addresses independent of where the program will be loaded in physical memory. Program larger than the physical memory size can be run.
admin
asked
in
Operating System
Apr 18, 2020
by
admin
589
points
31
views
gate1999
operating-system
virtual-memory
easy
video-solution
0
votes
0
answers
18
views
GATE1999-2.24 Video Solution
Consider the following $C$ function definition int Trial (int a, int b, int c) { if ((a>=b) && (c<b)) return b; else if (a>=b) return Trial(a, c, b); else return Trial(b, a, c); } The functional Trial: Finds the maximum of $a$, $b$, and $c$ Finds the minimum of $a$, $b$, and $c$ Finds the middle number of $a$, $b$, $c$ None of the above
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
589
points
18
views
gate1999
algorithms
identify-function
normal
video-solution
0
votes
0
answers
19
views
GATE1999-1.25 Video Solution
Which of the following is correct? B-trees are for storing data on disk and B$^+$ trees are for main memory. Range queries are faster on B$^+$ trees. B-trees are for primary indexes and B$^+$ trees are for secondary indexes. The height of a B$^+$ tree is independent of the number of records.
admin
asked
in
Databases
Apr 18, 2020
by
admin
589
points
19
views
gate1999
databases
b-tree
normal
video-solution
0
votes
0
answers
16
views
GATE1999-2.17 Video Solution
Zero has two representations in Sign-magnitude $2's$ complement $1's$ complement None of the above
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
589
points
16
views
gate1999
digital-logic
number-representation
easy
video-solution
0
votes
0
answers
18
views
GATE1999-1.21 Video Solution
The maximum gate delay for any output to appear in an array multiplier for multiplying two $n$ bit numbers is $O(n^2)$ $O(n)$ $O(\log n)$ $O(1)$
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
589
points
18
views
gate1999
digital-logic
normal
array-multiplier
video-solution
0
votes
0
answers
50
views
GATE1999-2.15 Video Solution
A grammar that is both left and right recursive for a non-terminal, is Ambiguous Unambiguous Information is not sufficient to decide whether it is ambiguous or unambiguous None of the above
admin
asked
in
Compiler Design
Apr 18, 2020
by
admin
589
points
50
views
gate1999
compiler-design
grammar
normal
video-solution
0
votes
0
answers
28
views
GATE1999-1.10 Video Solution
Which of the following disk scheduling strategies is likely to give the best throughput? Farthest cylinder next Nearest cylinder next First come first served Elevator algorithm
admin
asked
in
Operating System
Apr 18, 2020
by
admin
589
points
28
views
gate1999
operating-system
disk-scheduling
normal
video-solution
0
votes
0
answers
23
views
GATE1999-21 Video Solution
Consider a B-tree with degree $m$, that is, the number of children, $c$, of any internal node (except the root) is such that $m \leq c \leq 2m-1$. Derive the maximum and minimum number of records in the leaf nodes for such a B-tree with height $h, h \geq 1$. (Assume that the root of a tree is at height 0).
admin
asked
in
Databases
Apr 18, 2020
by
admin
589
points
23
views
gate1999
databases
b-tree
normal
video-solution
0
votes
0
answers
19
views
GATE1999-1.1 Video Solution
Suppose that the expectation of a random variable $X$ is $5$. Which of the following statements is true? There is a sample point at which $X$ has the value $5$. There is a sample point at which $X$ has value greater than $5$. There is a sample point at which $X$ has a value greater than equal to $5$. None of the above
admin
asked
in
Probability
Apr 18, 2020
by
admin
589
points
19
views
gate1999
probability
expectation
easy
video-solution
0
votes
0
answers
38
views
GATE1999-1.12 Video Solution
A sorting technique is called stable if it takes $O (n \log n)$ time it maintains the relative order of occurrence of non-distinct elements it uses divide and conquer paradigm it takes $O(n)$ space
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
589
points
38
views
gate1999
algorithms
sorting
easy
video-solution
0
votes
0
answers
32
views
GATE1999-1.3 Video Solution
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is $^{n-1}C_k$ $^nC_k$ $^nC_{k+1}$ None of the above
admin
asked
in
Combinatory
Apr 18, 2020
by
admin
589
points
32
views
gate1999
combinatory
normal
video-solution
0
votes
0
answers
21
views
GATE1999-2.22 Video Solution
The main difference(s) between a CISC and a RISC processor is/are that a RISC processor typically has fewer instructions has fewer addressing modes has more registers is easier to implement using hard-wired logic
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
589
points
21
views
gate1999
co-and-architecture
normal
cisc-risc-architecture
video-solution
0
votes
0
answers
23
views
GATE1999-2.8 Video Solution
Consider the circuit shown below. In a certain steady state, the line $Y$ is at $'1'$. What are the possible values of $A, B$ and $C$ in this state? $A=0, B=0, C=1$ $A=0, B=1, C=1$ $A=1, B=0, C=1$ $A=1, B=1, C=1$
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
589
points
23
views
gate1999
digital-logic
circuit-output
normal
video-solution
0
votes
0
answers
14
views
GATE1999-1.2 Video Solution
The number of binary relations on a set with $n$ elements is: $n^2$ $2^n$ $2^{n^2}$ None of the above
admin
asked
in
Set Theory & Algebra
Apr 18, 2020
by
admin
589
points
14
views
gate1999
set-theory&algebra
relations
combinatory
easy
video-solution
0
votes
0
answers
15
views
GATE1999-1.22 Video Solution
The main memory of a computer has $2$ $cm$ blocks while the cache has $2c$ blocks. If the cache uses the set associative mapping scheme with $2$ blocks per set, then block $k$ of the main memory maps to the set: $(k$ $mod$ $m)$ of the cache $(k$ $mod$ $c)$ of the cache $(k$ $mod$ $2c)$ of the cache $(k$ $mod$ $2 cm)$ of the cache
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
589
points
15
views
gate1999
co-and-architecture
cache-memory
normal
video-solution
0
votes
0
answers
22
views
GATE1999-11a Video Solution
Consider the following algorithms. Assume, procedure $A$ and procedure $B$ take $O (1)$ and $O(1/n)$ unit of time respectively. Derive the time complexity of the algorithm in $O$-notation. algorithm what (n) begin if n = 1 then call A else begin what (n-1); call B(n) end end.
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
589
points
22
views
gate1999
algorithms
time-complexity
normal
video-solution
0
votes
0
answers
17
views
GATE1999-13 Video Solution
An instruction pipeline consists of $4$ stages - Fetch $(F)$, Decode field $(D)$, Execute $(E)$ and Result Write $(W)$. The $5$ instructions in a certain instruction sequence need these stages for the different number of clock cycles as shown by the table ... $1$} & \text{$2$} \\\hline \end{array} Find the number of clock cycles needed to perform the $5$ instructions.
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
589
points
17
views
gate1999
co-and-architecture
pipelining
normal
video-solution
0
votes
0
answers
18
views
GATE1999-1.16 Video Solution
If $n$ is a power of $2$, then the minimum number of multiplications needed to compute $a^n$ is $\log_2 n$ $\sqrt n$ $n-1$ $n$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
589
points
18
views
gate1999
algorithms
time-complexity
normal
video-solution
Page:
1
2
next »
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.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Search GATE CSE Video Solutions