Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Year
Exams
Recent questions tagged gate1994
0
votes
0
answers
GATE19941.6, ISRO200829 Video Solution
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
asked
Apr 19
in
Graph Theory
by
admin
(
3.6k
points)

1
view
gate1994
graphtheory
permutationandcombination
normal
isro2008
counting
videosolution
0
votes
0
answers
GATE19941.11 Video Solution
In a compact single dimensional array representation for lower triangular matrices (i.e all the elements above the diagonal are zero) of size $n \times n$, nonzero elements, (i.e elements of lower triangle) of each row are stored one after another, starting from the first row, the index of the ... is: $i+j$ $i+j1$ $(j1)+\frac{i(i1)}{2}$ $i+\frac{j(j1)}{2}$
asked
Apr 19
in
DS
by
admin
(
3.6k
points)

2
views
gate1994
datastructures
arrays
normal
videosolution
0
votes
0
answers
GATE19941.14 Video Solution
Which of the following permutations can be obtained in the output (in the same order) using a stack assuming that the input is the sequence $\text{1, 2, 3, 4, 5}$ in that order? $\text{3, 4, 5, 1, 2}$ $\text{3, 4, 5, 2, 1}$ $\text{1, 5, 2, 3, 4}$ $\text{5, 4, 3, 1, 2}$
asked
Apr 19
in
DS
by
admin
(
3.6k
points)

4
views
gate1994
datastructures
stack
normal
videosolution
0
votes
0
answers
GATE19941.4, ISRO20172 Video Solution
Let $A$ and $B$ be any two arbitrary events, then, which one of the following is TRUE? $P (A \cap B) = P(A)P(B)$ $P (A \cup B) = P(A)+P(B)$ $P (A \mid B) = P(A \cap B)P(B)$ $P (A \cup B) \leq P(A) + P(B)$
asked
Apr 19
in
Probability
by
admin
(
3.6k
points)

3
views
gate1994
probability
conditionalprobability
normal
isro2017
videosolution
0
votes
0
answers
GATE19941.12 Video Solution
Generation of intermediate code based on an abstract machine model is useful in compilers because it makes implementation of lexical analysis and syntax analysis easier syntaxdirected translations can be written for intermediate code generation it enhances ... the compiler it is not possible to generate code for real machines directly from high level language programs
asked
Apr 19
in
Compiler Design
by
admin
(
3.6k
points)

3
views
gate1994
compilerdesign
intermediatecode
easy
videosolution
0
votes
0
answers
GATE19942.5 Video Solution
The number of edges in a regular graph of degree $d$ and $n$ vertices is ____________
asked
Apr 19
in
Graph Theory
by
admin
(
3.6k
points)

1
view
gate1994
graphtheory
easy
graphconnectivity
descriptive
videosolution
0
votes
0
answers
GATE19941.7, ISRO201714 Video Solution
The recurrence relation that arises in relation with the complexity of binary search is: $T(n) = 2T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+\log n$ $T(n) = T\left(\frac{n}{2}\right)+n$
asked
Apr 19
in
Algorithms
by
admin
(
3.6k
points)

1
view
gate1994
algorithms
recurrence
easy
isro2017
videosolution
0
votes
0
answers
GATE19941.17, UGCNETSep2013II32 Video Solution
asked
Apr 19
in
DS
by
admin
(
3.6k
points)

7
views
gate1994
datastructures
linkedlists
normal
ugcnetsep2013ii
videosolution
0
votes
0
answers
GATE19941.19, ISRO201631 Video Solution
Algorithm design technique used in quicksort algorithm is? Dynamic programming Backtracking Divide and conquer Greedy method
asked
Apr 19
in
Algorithms
by
admin
(
3.6k
points)

2
views
gate1994
algorithms
sorting
easy
isro2016
videosolution
0
votes
0
answers
GATE19943.3 Video Solution
State True or False with one line explanation A FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).
asked
Apr 19
in
Theory of Computation
by
admin
(
3.6k
points)

2
views
gate1994
theoryofcomputation
finiteautomata
normal
videosolution
0
votes
0
answers
GATE19941.18 Video Solution
Which of the following features cannot be captured by contextfree grammars? Syntax of ifthenelse statements Syntax of recursive procedures Whether a variable has been declared before its use Variable names of arbitrary length
asked
Apr 19
in
Compiler Design
by
admin
(
3.6k
points)

3
views
gate1994
compilerdesign
grammar
normal
videosolution
0
votes
0
answers
GATE199414 Video Solution
Consider $B^+$  tree of order $d$ shown in figure. (A $B^+$  tree of order $d$ contains between $d$ and $2d$ keys in each node) Draw the resulting $B^+$  tree after $100$ is inserted in the figure below. For a $B^+$  tree of order $d$ with $n$ leaf nodes, the number of nodes accessed during a search is $O()$.
asked
Apr 19
in
Databases
by
admin
(
3.6k
points)

1
view
gate1994
databases
btree
normal
videosolution
0
votes
0
answers
GATE19941.22 Video Solution
Which of the following statements is false? Optimal binary search tree construction can be performed efficiently using dynamic programming Breadthfirst search cannot be used to find connected components of a graph Given the prefix and postfix walks ... binary tree cannot be uniquely constructed. Depthfirst search can be used to find connected components of a graph
asked
Apr 19
in
Algorithms
by
admin
(
3.6k
points)

2
views
gate1994
algorithms
normal
graphalgorithms
videosolution
0
votes
0
answers
GATE19941.23 Video Solution
Consider the following two functions: $g_1(n) = \begin{cases} n^3 \text{ for } 0 \leq n \leq 10,000 \\ n^2 \text{ for } n \geq 10,000 \end{cases}$ $g_2(n) = \begin{cases} n \text{ for } 0 \leq n \leq 100 \\ n^3 \text{ for } n > 100 \end{cases}$ Which of the ... $g_1(n) \text{ is } O(n^3)$ $g_2(n) \text{ is } O(g_1(n))$ $g_2(n) \text{ is } O(n)$
asked
Apr 19
in
Algorithms
by
admin
(
3.6k
points)

3
views
gate1994
algorithms
asymptoticnotations
normal
videosolution
0
votes
0
answers
GATE19941.10 Video Solution
Some group $(G, o)$ is known to be abelian. Then, which one of the following is true for $G$? $g=g^{1} \text{ for every } g \in G$ $g=g^2 \text{ for every }g \in G$ $(goh)^2 = g^2oh^2 \text{ for every } g, h \in G$ $G$ is of finite order
asked
Apr 19
in
Set Theory & Algebra
by
admin
(
3.6k
points)

2
views
gate1994
settheory&algebra
grouptheory
normal
videosolution
0
votes
0
answers
GATE19941.13 Video Solution
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed then LRU page replacement algorithm is used FIFO page replacement algorithm is used LFU page replacement algorithm is used None of the above
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

1
view
gate1994
operatingsystem
pagereplacement
easy
videosolution
0
votes
0
answers
GATE199421 Video Solution
Consider the following recursive function: function fib (n:integer);integer; begin if (n=0) or (n=1) then fib := 1 else fib := fib(n1) + fib(n2) end; The above function is run on a computer with a stack of $64$ bytes. Assuming that ... an address takes $2$ bytes each, estimate the maximum value of $n$ for which the stack will not overflow. Give reasons for your answer.
asked
Apr 19
in
Programming
by
admin
(
3.6k
points)

1
view
gate1994
programming
recursion
normal
videosolution
0
votes
0
answers
GATE199428 Video Solution
Consider the resource allocation graph in the figure. Find if the system is in a deadlock state Otherwise, find a safe sequence
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

1
view
gate1994
operatingsystem
resourceallocation
normal
videosolution
0
votes
0
answers
GATE19941.24 Video Solution
Consider the following heap (figure) in which blank regions are not in use and hatched region are in use. The sequence of requests for blocks of sizes $300, 25, 125, 50$ can be satisfied if we use either first fit or best fit policy (any one) first fit but not best fit policy best fit but not first fit policy None of the above
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

3
views
gate1994
operatingsystem
pagereplacement
normal
videosolution
0
votes
0
answers
GATE19941.15 Video Solution
The number of substrings (of all lengths inclusive) that can be formed from a character string of length $n$ is $n$ $n^2$ $\frac{n(n1)}{2}$ $\frac{n(n+1)}{2}$
asked
Apr 19
in
Combinatory
by
admin
(
3.6k
points)

1
view
gate1994
permutationandcombination
normal
videosolution
0
votes
0
answers
GATE19942.10 Video Solution
The regular expression for the language recognized by the finite state automaton of figure is ______
asked
Apr 19
in
Theory of Computation
by
admin
(
3.6k
points)

3
views
gate1994
theoryofcomputation
finiteautomata
regularexpressions
easy
videosolution
0
votes
0
answers
GATE19941.21 Video Solution
Which one of the following statements is true? Macro definitions cannot appear within other macro definitions in assembly language programs Overlaying is used to run a program which is longer than the address space of a computer Virtual memory can be ... than the address space of a computer It is not possible to write interrupt service routines in a high level language
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

1
view
gate1994
operatingsystem
normal
virtualmemory
videosolution
0
votes
0
answers
GATE19948 Video Solution
A rooted tree with $12$ nodes has its nodes numbered $1$ to $12$ in preorder. When the tree is traversed in postorder, the nodes are visited in the order $3, 5, 4, 2, 7, 8, 6, 10, 11, 12, 9, 1$. Reconstruct the original tree from this information, that is, find the parent of each node, and show the tree diagrammatically.
asked
Apr 19
in
DS
by
admin
(
3.6k
points)

4
views
gate1994
datastructures
binarytree
normal
videosolution
0
votes
0
answers
GATE19941.8 Video Solution
The logic expression for the output of the circuit shown in figure below is: $\overline{AC} + \overline{BC} +CD$ $\overline{A}C + \overline{B}C + CD$ $ABC +\overline {C}\; \overline{D}$ $\overline{A}\; \overline{B} + \overline{B}\; \overline{C} +CD$
asked
Apr 19
in
Digital Logic
by
admin
(
3.6k
points)

1
view
gate1994
digitallogic
circuitoutput
normal
videosolution
0
votes
0
answers
GATE199421 Video Solution
The number of flipflops required to construct a binary modulo $N$ counter is __________
asked
Apr 19
in
Digital Logic
by
admin
(
3.6k
points)

2
views
gate1994
digitallogic
easy
digitalcounter
videosolution
0
votes
0
answers
GATE19949 Video Solution
Following $7$ ... that at most $1$ bit could be corrupted). If the message contains an error find the bit which is erroneous and gives correct message.
asked
Apr 19
in
Computer Networks
by
admin
(
3.6k
points)

2
views
gate1994
computernetworks
errordetection
hammingcode
normal
videosolution
0
votes
0
answers
GATE199419 Video Solution
(a) Given a set: $S = \left\{x \mid \text{ there is an xblock of 5's in the decimal expansion of } \pi\right\}$ (Note: $x$$block$ is a maximal block of $x$ successive $5$'s) Which of the following statements is true with respect ... a language $L_1$ is regular and and that the language $L_1 \cup L_2$ is regular, is the language $L_2$ always regular? Prove your answer.
asked
Apr 19
in
Theory of Computation
by
admin
(
3.6k
points)

2
views
gate1994
theoryofcomputation
identifyclasslanguage
normal
videosolution
0
votes
0
answers
GATE19941.2 Video Solution
Let $A$ and $B$ be real symmetric matrices of size $n \times n$. Then which one of the following is true? $AA'=I$ $A=A^{1}$ $AB=BA$ $(AB)'=BA$
asked
Apr 19
in
Linear Algebra
by
admin
(
3.6k
points)

1
view
gate1994
linearalgebra
normal
matrices
videosolution
0
votes
0
answers
GATE19943.7 Video Solution
An instance of a relational scheme $R(A, B, C)$ has distinct values for attribute $A$. Can you conclude that $A$ is a candidate key for $R$?
asked
Apr 19
in
Databases
by
admin
(
3.6k
points)

2
views
gate1994
databases
easy
candidatekeys
videosolution
0
votes
0
answers
GATE199426 Video Solution
A queue $Q$ containing $n$ items and an empty stack $S$ are given. It is required to transfer all the items from the queue to the stack, so that the item at the front of queue is on the TOP of the stack, and the order of all other ... which can be performed on the queue and stack are Delete, Insert, Push and Pop. Do not assume any implementation of the queue or stack.
asked
Apr 19
in
DS
by
admin
(
3.6k
points)

1
view
gate1994
datastructures
queues
stack
normal
videosolution
0
votes
0
answers
GATE19943.6 Video Solution
State True or False with reason There is always a decomposition into BoyceCodd normal form (BCNF) that is lossless and dependency preserving.
asked
Apr 19
in
Databases
by
admin
(
3.6k
points)

1
view
gate1994
databases
databasenormalization
easy
videosolution
0
votes
0
answers
GATE199427 Video Solution
Draw a precedence graph for the following sequential code. The statements are numbered from $S_1$ to $S_6$ $S_1$ read n $S_2$ i := 1 $S_3$ if i > n next $S_4$ a(i) := i+1 $S_5$ i := i+1 $S_6$ next : write a(i) Can this graph be converted to a concurrent program using parbeginparend construct only?
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

1
view
gate1994
operatingsystem
processsynchronization
normal
videosolution
0
votes
0
answers
GATE199424 Video Solution
An independent set in a graph is a subset of vertices such that no two vertices in the subset are connected by an edge. An incomplete scheme for a greedy algorithm to find a maximum independent set in a tree is given below: V: Set of all ... I); Complete the algorithm by specifying the property of vertex $u$ in each case. What is the time complexity of the algorithm?
asked
Apr 19
in
Algorithms
by
admin
(
3.6k
points)

1
view
gate1994
algorithms
graphalgorithms
normal
videosolution
0
votes
0
answers
GATE19943.2 Video Solution
State True or False with one line explanation Expanding opcode instruction formats are commonly employed in RISC. (Reduced Instruction Set Computers) machines.
asked
Apr 19
in
CO & Architecture
by
admin
(
3.6k
points)

1
view
gate1994
coandarchitecture
machineinstructions
instructionformat
normal
videosolution
0
votes
0
answers
GATE199204b Video Solution
A priority encoder accepts three input signals $\text{(A, B and C)}$ and produces a twobit output $(X_1, X_0 )$ corresponding to the highest priority active input signal. Assume $A$ has the highest priority followed by $B$ and $C$ has ... of the inputs are active the output should be $00$, design the priority encoder using $4:1$ multiplexers as the main components.
asked
Apr 19
in
Digital Logic
by
admin
(
3.6k
points)

3
views
gate1994
digitallogic
multiplexer
descriptive
videosolution
0
votes
0
answers
GATE199420 Video Solution
A grammar $G$ is in ChomskyNormal Form (CNF) if all its productions are of the form $A \to BC$ or $A \to a$, where $A,B$ and $C$, are nonterminals 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$?
asked
Apr 19
in
Compiler Design
by
admin
(
3.6k
points)

1
view
gate1994
compilerdesign
grammar
normal
videosolution
0
votes
0
answers
GATE19943.5 Video Solution
Match the following items ...
asked
Apr 19
in
Compiler Design
by
admin
(
3.6k
points)

3
views
gate1994
compilerdesign
grammar
normal
videosolution
0
votes
0
answers
GATE19943.11 Video Solution
State True or False with reason Logical data independence is easier to achieve than physical data independence
asked
Apr 19
in
Databases
by
admin
(
3.6k
points)

1
view
gate1994
databases
normal
dataindependence
videosolution
0
votes
0
answers
GATE19942.4 Video Solution
The number of subsets $\left\{ 1,2, \dots, n\right\}$ with odd cardinality is ___________
asked
Apr 19
in
Set Theory & Algebra
by
admin
(
3.6k
points)

1
view
gate1994
settheory&algebra
easy
sets
descriptive
videosolution
0
votes
0
answers
GATE19945 Video Solution
A $3\text{ary}$ tree is a tree in which every internal node has exactly three children. Use induction to prove that the number of leaves in a $3\text{ary}$ tree with $n$ internal nodes is $2(n1)$.
asked
Apr 19
in
DS
by
admin
(
3.6k
points)

1
view
gate1994
datastructures
trees
proof
videosolution
Page:
1
2
next »
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.
Top Users
Jul 2020
Shaik Masthan
39 Points
hiteshpujari
9 Points
Venkatesh Akhouri
6 Points
Meghana518
6 Points
bittujash
6 Points
Pawan_k
6 Points
rits78671
6 Points
srestha
6 Points
RavGopal
4 Points
Sumaiyas
4 Points
7,543
questions
1,783
answers
10,867
comments
90,482
users