Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged descriptive
31
votes
1
answer
2611
GATE CSE 1992 | Question: 16
Which of the following three statements are true? Prove your answer. The union of two recursive languages is recursive. The language $\{O^n \mid n\text{ is a prime} \}$ is not regular. Regular languages are closed under infinite union.
Kathleen
asked
in
Theory of Computation
Sep 13, 2014
by
Kathleen
6.7k
views
gate1992
theory-of-computation
normal
closure-property
proof
descriptive
9
votes
1
answer
2612
GATE CSE 1992 | Question: 15.a
Use Modus ponens $(A, A → B |= B)$ or resolution to show that the following set is inconsistent: $Q(x) \rightarrow P (x) \vee \sim R (a)$ $R (a) \vee \sim Q(a)$ $Q(a)$ $\sim P (y)$ where $x$ and $y$ are universally quantified variables, $a$ is a constant and $P, Q, R$ are monadic predicates.
Kathleen
asked
in
Mathematical Logic
Sep 13, 2014
by
Kathleen
2.1k
views
gate1992
normal
mathematical-logic
propositional-logic
descriptive
30
votes
3
answers
2613
GATE CSE 1992 | Question: 14a
If $G$ is a group of even order, then show that there exists an element $a≠e$, the identity in $G$, such that $a^2 = e$.
Kathleen
asked
in
Set Theory & Algebra
Sep 13, 2014
by
Kathleen
5.3k
views
gate1992
set-theory&algebra
group-theory
normal
descriptive
proof
6
votes
1
answer
2614
GATE CSE 1992 | Question: 13a
How is redundancy reduced in the following models? Hierarchical Network Relational
Kathleen
asked
in
Databases
Sep 13, 2014
by
Kathleen
777
views
gate1992
databases
descriptive
relational-model
10
votes
2
answers
2615
GATE CSE 1992 | Question: 12-a
Draw the precedence graph for the concurrent program given below S1 parbegin begin S2:S4 end; begin S3; parbegin S5; begin S6:S8 end parend end; S7 parend; S9
Kathleen
asked
in
Operating System
Sep 13, 2014
by
Kathleen
2.6k
views
gate1992
operating-system
normal
concurrency
precedence-graph
descriptive
13
votes
1
answer
2616
GATE CSE 1992 | Question: 11a
Write syntax directed definitions (semantic rules) for the following grammar to add the type of each identifier to its entry in the symbol table during semantic analysis. Rewriting the grammar is not permitted and semantic rules are to be added to the ends of productions ... $T \rightarrow \text{int}$ $T \rightarrow \text{real}$ $L \rightarrow L,id$ $L \rightarrow id$
Kathleen
asked
in
Compiler Design
Sep 13, 2014
by
Kathleen
2.3k
views
gate1992
compiler-design
syntax-directed-translation
normal
descriptive
27
votes
2
answers
2617
GATE CSE 1992 | Question: 09
Suggest a data structure for representing a subset $S$ of integers from $1$ to $n$. Following operations on the set $S$ are to be performed in constant time (independent of cardinality of $S$ ... an English like language. You may assume that the data structure has been suitable initialized. Clearly state your assumptions regarding initialization.
Kathleen
asked
in
DS
Sep 13, 2014
by
Kathleen
2.7k
views
gate1992
data-structures
normal
descriptive
queue
15
votes
5
answers
2618
GATE CSE 1992 | Question: 8
Let $T$ be a Depth First Tree of a undirected graph $G$. An array $P$ indexed by the vertices of $G$ is given. $P[V]$ is the parent of vertex $V$, in $T$. Parent of the root is the root itself. Give a method for finding ... to the length of the cycle. Describe the algorithm in a PASCAL $(C)$ - like language. Assume that the variables have been suitably declared.
Kathleen
asked
in
Algorithms
Sep 13, 2014
by
Kathleen
3.5k
views
gate1992
algorithms
descriptive
algorithm-design
13
votes
4
answers
2619
GATE CSE 1992 | Question: 07a
Consider the function $F(n)$ for which the pseudocode is given below : Function F(n) begin F1 ← 1 if(n=1) then F ← 3 else For i = 1 to n do begin C ← 0 For j = 1 to n – 1 do begin C ← C + 1 end F1 = F1 * C end F = F1 end [$n$ is a positive integer greater than zero] Derive a recurrence relation for $F(n)$.
Kathleen
asked
in
Algorithms
Sep 13, 2014
by
Kathleen
2.6k
views
gate1992
algorithms
recurrence-relation
descriptive
2
votes
0
answers
2620
GATE CSE 1992 | Question: 06,a,b
A microprocessor is capable of addressing 1 megabyte of memory with a 20-bit address bus. The system to be designed requires 256 K bytes of RAM, 256 K bytes of EPROM, 16 I/O devices (memory mapped I/O) and 1 K byte of ... to two clock cycles for memory read and write. Assuming control signals similar to 8085, design the extra logic required for interfacing EERAM.
Kathleen
asked
in
Digital Logic
Sep 13, 2014
by
Kathleen
640
views
gate1992
digital-logic
descriptive
memory-interfacing
out-of-gate-syllabus
8085-microprocessor
14
votes
3
answers
2621
GATE CSE 1992 | Question: 4-a
Consider addition in two's complement arithmetic. A carry from the most significant bit does not always correspond to an overflow. Explain what is the condition for overflow in two's complement arithmetic.
Kathleen
asked
in
Digital Logic
Sep 13, 2014
by
Kathleen
1.7k
views
gate1992
digital-logic
normal
number-representation
descriptive
19
votes
2
answers
2622
GATE CSE 1992 | Question: 03,iv
Assume that the last element of the set is used as partition element in Quicksort. If $n$ distinct elements from the set $\left[1\dots n\right]$ are to be sorted, give an input for which Quicksort takes maximum time.
Kathleen
asked
in
Algorithms
Sep 13, 2014
by
Kathleen
3.6k
views
gate1992
algorithms
sorting
easy
quick-sort
descriptive
32
votes
3
answers
2623
GATE CSE 1992 | Question: 03,iii
How many edges can there be in a forest with $p$ components having $n$ vertices in all?
Kathleen
asked
in
Graph Theory
Sep 13, 2014
by
Kathleen
4.7k
views
gate1992
graph-theory
graph-connectivity
descriptive
6
votes
1
answer
2624
GATE CSE 1992 | Question: 3,i
Write short answers to the following: Which of the following macros can put a macro assembler into an infinite loop? .MACRO M1,X .IF EQ,X M1 X+1 .ENDC .IF NE,X .WORD X .ENDC .ENDM .MACRO M2,X .IF EQ,X M2 X .ENDC .IF NE,X .WORD X+1 .ENDC .ENDM Give an example call that does so.
Kathleen
asked
in
Compiler Design
Sep 13, 2014
by
Kathleen
1.4k
views
gate1992
compiler-design
assembler
normal
descriptive
37
votes
9
answers
2625
GATE CSE 1991 | Question: 17,b
Let $L$ be the language of all binary strings in which the third symbol from the right is a $1$. Give a non-deterministic finite automaton that recognizes $L$. How many states does the minimized equivalent deterministic finite automaton have? Justify your answer briefly?
Kathleen
asked
in
Theory of Computation
Sep 13, 2014
by
Kathleen
9.3k
views
gate1991
theory-of-computation
finite-automata
normal
descriptive
46
votes
2
answers
2626
GATE CSE 1991 | Question: 16,a
Find the number of binary strings $w$ of length $2n$ with an equal number of $1's$ and $0's$ and the property that every prefix of $w$ has at least as many $0's$ as $1's.$
Kathleen
asked
in
Combinatory
Sep 13, 2014
by
Kathleen
4.6k
views
gate1991
combinatory
normal
descriptive
catalan-number
15
votes
5
answers
2627
GATE CSE 1991 | Question: 15,a
Show that the product of the least common multiple and the greatest common divisor of two positive integers $a$ and $b$ is $a\times b$.
Kathleen
asked
in
Set Theory & Algebra
Sep 13, 2014
by
Kathleen
1.3k
views
gate1991
set-theory&algebra
normal
number-theory
proof
descriptive
24
votes
3
answers
2628
GATE CSE 1991 | Question: 14,a
Consider the binary tree in the figure below: What structure is represented by the binary tree?
Kathleen
asked
in
DS
Sep 13, 2014
by
Kathleen
3.1k
views
gate1991
data-structures
binary-tree
time-complexity
normal
descriptive
22
votes
5
answers
2629
GATE CSE 1991 | Question: 13
Give an optimal algorithm in pseudo-code for sorting a sequence of $n$ numbers which has only $k$ distinct numbers ($k$ is not known a Priori). Give a brief analysis for the time-complexity of your algorithm.
Kathleen
asked
in
Algorithms
Sep 13, 2014
by
Kathleen
4.9k
views
gate1991
sorting
time-complexity
algorithms
difficult
descriptive
21
votes
6
answers
2630
GATE CSE 1991 | Question: 12-a
Suppose a database consist of the following relations: SUPPLIER (SCODE,SNAME,CITY). PART (PCODE,PNAME,PDESC,CITY). PROJECTS (PRCODE,PRNAME,PRCITY). SPPR (SCODE,PCODE,PRCODE,QTY). Write SQL programs corresponding to the following queries: Print PCODE values for ... part to a project in the second city, but do not print the triples in which the two CITY values are same.
Kathleen
asked
in
Databases
Sep 13, 2014
by
Kathleen
2.4k
views
gate1991
databases
sql
normal
descriptive
7
votes
2
answers
2631
GATE CSE 1991 | Question: 11,a
Consider the following scheme for implementing a critical section in a situation with three processes $P_i, P_j$ and $P_k$. Pi; repeat flag[i] := true; while flag [j] or flag[k] do case turn of j: if flag [j] then begin flag [i] ... j; flag [i] := false non-critical section until false; Does the scheme ensure mutual exclusion in the critical section? Briefly explain.
Kathleen
asked
in
Operating System
Sep 13, 2014
by
Kathleen
3.1k
views
gate1991
process-synchronization
normal
operating-system
descriptive
18
votes
2
answers
2632
GATE CSE 1991 | Question: 10a
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative $E \rightarrow E -T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol) Is the grammar ... what is the relative precedence between $-$ and $/$? If not, give an unambiguous grammar that gives $/$ precedence over $-$.
Kathleen
asked
in
Compiler Design
Sep 13, 2014
by
Kathleen
3.4k
views
gate1991
grammar
compiler-design
normal
descriptive
25
votes
3
answers
2633
GATE CSE 1991 | Question: 09a
Consider the following pseudo-code (all data items are of type integer): procedure P(a, b, c); a := 2; c := a + b; end {P} begin x := 1; y := 5; z := 100; P(x, x*y, z); Write ('x = ', x, 'z = ', z); end Determine its output, if the parameters are passed to the Procedure $\text{P}$ by value reference name
Kathleen
asked
in
Compiler Design
Sep 13, 2014
by
Kathleen
2.7k
views
gate1991
compiler-design
parameter-passing
normal
runtime-environment
descriptive
2
votes
0
answers
2634
GATE CSE 1991 | Question: 07a
It is required to design a hardwired controller to handle the fetch cycle of a single address CPU with a $16$ bit instruction-length. The effective address of an indexed instruction should be derived in the fetch cycle itself. ... bits of an instruction constitute the operand field. Give the register transfer sequence for realizing the above instruction fetch cycle.
Kathleen
asked
in
CO and Architecture
Sep 13, 2014
by
Kathleen
530
views
gate1991
co-and-architecture
control-unit
hardwired-controller
normal
unsolved
descriptive
5
votes
1
answer
2635
GATE CSE 1991 | Question: 06,a
Using $\text{D}$ flip-flop gates, design a parallel-in/serial-out shift register that shifts data from left to right with the following input lines: Clock $\text{CLK}$ Three parallel data inputs $A, B, C$ Serial input $S$ Control input $\text{load} / \overline{\text{SHIFT}}$.
Kathleen
asked
in
Digital Logic
Sep 13, 2014
by
Kathleen
827
views
gate1991
digital-logic
difficult
sequential-circuit
flip-flop
shift-registers
descriptive
22
votes
1
answer
2636
GATE CSE 1991 | Question: 5-a
Analyse the circuit in Fig below and complete the following table ${\begin{array}{|c|c|c|}\hline \textbf{a}& \textbf{b}& \bf{ Q_n} \\\hline 0&0\\\ 0&1 \\ 1&0 \\ 1&1 \\ \hline \end{array}}$
Kathleen
asked
in
Digital Logic
Sep 13, 2014
by
Kathleen
3.0k
views
gate1991
digital-logic
normal
circuit-output
sequential-circuit
descriptive
19
votes
5
answers
2637
GATE CSE 1991 | Question: 1,ix
If the binary tree in figure is traversed in inorder, then the order in which the nodes will be visited is ______
Kathleen
asked
in
DS
Sep 12, 2014
by
Kathleen
4.1k
views
gate1991
binary-tree
easy
data-structures
descriptive
Page:
« prev
1
...
83
84
85
86
87
88
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Recent Posts
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions tagged descriptive
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...