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 gate1995
3
votes
1
answer
1
GATE CSE 1995 | Question: 7(B)
Compute without using power series expansion $\displaystyle \lim_{x \to 0} \frac{\sin x}{x}.$
Lakshman Patel RJIT
asked
in
Calculus
Apr 25, 2021
by
Lakshman Patel RJIT
836
views
gate1995
calculus
limits
numerical-answers
0
votes
0
answers
2
GATE CSE 1995 | Question: 17b
Consider a CRT display that has a text mode display format of $80×25$ characters with a $9×12$ character cell. What is the size of the video buffer RAM for the display to be used in monochrome ($1$ bit per pixel) graphics mode
Arjun
asked
in
Computer Peripherals
Jul 14, 2019
by
Arjun
1.1k
views
gate1995
computer-peripherals
descriptive
out-of-gate-syllabus
15
votes
2
answers
3
GATE CSE 1995 | Question: 25b
Determine the number of positive integers $(\leq 720)$ which are not divisible by any of $2,3$ or $5.$
Arjun
asked
in
Set Theory & Algebra
Jun 6, 2019
by
Arjun
3.0k
views
gate1995
set-theory&algebra
set-theory
numerical-answers
7
votes
1
answer
4
GATE CSE 1995 | Question: 15-b
What is the equivalent minimal Boolean expression (in sum of products form) for the Karnaugh map given below?
go_editor
asked
in
Digital Logic
Feb 12, 2018
by
go_editor
1.9k
views
gate1995
digital-logic
boolean-algebra
k-map
normal
descriptive
24
votes
3
answers
5
GATE CSE 1995 | Question: 6
What is the number of binary trees with $3$ nodes which when traversed in post-order give the sequence $A, B, C ?$ Draw all these binary trees.
Kathleen
asked
in
DS
Oct 8, 2014
by
Kathleen
2.9k
views
gate1995
data-structures
binary-tree
normal
descriptive
23
votes
3
answers
6
GATE CSE 1995 | Question: 27
Consider the relation scheme. ... for the publisher with PNAME='TECHNICAL PUBLISHERS'. Get the names of all authors who have published a book for any publisher located in Madras
Kathleen
asked
in
Databases
Oct 8, 2014
by
Kathleen
3.5k
views
gate1995
databases
relational-algebra
normal
descriptive
26
votes
5
answers
7
GATE CSE 1995 | Question: 26
Consider the relation scheme $R(A, B, C)$ with the following functional dependencies: $A, B \rightarrow C,$ $C \rightarrow A$ Show that the scheme $R$ is in $3\text{NF}$ but not in $\text{BCNF}$. Determine the minimal keys of relation $R$.
Kathleen
asked
in
Databases
Oct 8, 2014
by
Kathleen
9.3k
views
gate1995
databases
database-normalization
normal
descriptive
13
votes
1
answer
8
GATE CSE 1995 | Question: 25a
Find the minimum value of $3-4x+2x^2$.
Kathleen
asked
in
Calculus
Oct 8, 2014
by
Kathleen
2.0k
views
gate1995
calculus
maxima-minima
easy
descriptive
19
votes
3
answers
9
GATE CSE 1995 | Question: 24
Prove that in finite graph, the number of vertices of odd degree is always even.
Kathleen
asked
in
Graph Theory
Oct 8, 2014
by
Kathleen
4.9k
views
gate1995
graph-theory
degree-of-graph
proof
descriptive
11
votes
3
answers
10
GATE CSE 1995 | Question: 23
Prove using mathematical induction for $n \geq 5, 2^n > n^2$
Kathleen
asked
in
Set Theory & Algebra
Oct 8, 2014
by
Kathleen
1.1k
views
gate1995
set-theory&algebra
proof
mathematical-induction
descriptive
15
votes
1
answer
11
GATE CSE 1995 | Question: 22
How many minimum spanning trees does the following graph have? Draw them. (Weights are assigned to edges).
Kathleen
asked
in
Algorithms
Oct 8, 2014
by
Kathleen
4.1k
views
gate1995
algorithms
graph-algorithms
spanning-tree
easy
descriptive
24
votes
4
answers
12
GATE CSE 1995 | Question: 21
Let $G_1$ and $G_2$ be subgroups of a group $G$. Show that $G_1 \cap G_2$ is also a subgroup of $G$. Is $G_1 \cup G_2$ always a subgroup of $G$?.
Kathleen
asked
in
Set Theory & Algebra
Oct 8, 2014
by
Kathleen
5.2k
views
gate1995
set-theory&algebra
group-theory
normal
descriptive
proof
18
votes
1
answer
13
GATE CSE 1995 | Question: 20
The head of a moving head disk with $100$ tracks numbered $0$ to $99$ is currently serving a request at track $55$. If the queue of requests kept in FIFO order is $10, 70, 75, 23, 65$ which of the two disk scheduling algorithms ... Come First Served) and SSTF (Shortest Seek Time First) will require less head movement? Find the head movement for each of the algorithms.
Kathleen
asked
in
Operating System
Oct 8, 2014
by
Kathleen
89.7k
views
gate1995
operating-system
disk-scheduling
normal
descriptive
22
votes
1
answer
14
GATE CSE 1995 | Question: 19
Consider the following program segment for concurrent processing using semaphore operators $P$ and $V$ for synchronization. Draw the precedence graph for the statements $S_1$ to $S_9$. var a,b,c,d,e,f,g,h,i,j,k : semaphore; begin cobegin begin S1; V(a); V(b) end; begin P(a); S2; V ... g); S6; V(i) end; begin P(h); P(i); S8; V(j) end; begin P(j); P(k); S9 end; coend end;
Kathleen
asked
in
Operating System
Oct 8, 2014
by
Kathleen
3.8k
views
gate1995
operating-system
process-synchronization
normal
descriptive
19
votes
2
answers
15
GATE CSE 1995 | Question: 18
The following is an incomplete Pascal function to convert a given decimal integer (in the range $-8$ to $+7$) into a binary integer in $2$'s complement representation. Determine the expressions $A, B, C$ that complete program. function TWOSCOMP (N:integer): ... do begin REM:=N mod 2; BINARY:=BINARY + B*EXPONENT; EXPONENT:=EXPONENT*10; N:=C end TWOSCOMP:=BINARY end end;
Kathleen
asked
in
Digital Logic
Oct 8, 2014
by
Kathleen
1.9k
views
gate1995
digital-logic
number-representation
normal
descriptive
9
votes
1
answer
16
GATE CSE 1995 | Question: 17a
An asynchronous serial communication controller that uses a start-stop scheme for controlling the serial I/O of a system is programmed for a string of length seven bits, one parity bit (odd parity) and one stop bit. The transmission rate is ... the complete bit stream that is transmitted for the string $ 0110101'?$ How many such string can be transmitted per second?
Kathleen
asked
in
Computer Networks
Oct 8, 2014
by
Kathleen
1.7k
views
gate1995
computer-networks
serial-communication
normal
descriptive
out-of-gate-syllabus
0
votes
0
answers
17
GATE CSE 1995 | Question: 16
Kathleen
asked
in
CO and Architecture
Oct 8, 2014
by
Kathleen
449
views
gate1995
co-and-architecture
8085-microprocessor
out-of-syllabus-now
14
votes
2
answers
18
GATE CSE 1995 | Question: 15-a
Implement a circuit having the following output expression using an inverter and a nand gate $Z=\overline{A} + \overline{B} +C$
Kathleen
asked
in
Digital Logic
Oct 8, 2014
by
Kathleen
2.0k
views
gate1995
digital-logic
k-map
normal
descriptive
36
votes
2
answers
19
GATE CSE 1995 | Question: 14
If the overhead for formatting a disk is $96$ bytes for a $4000$ byte sector, Compute the unformatted capacity of the disk for the following parameters: Number of surfaces: $8$ Outer diameter of the disk: $12$ cm Inner diameter of ... rpm, determine the effective data transfer rate which is defined as the number of bytes transferred per second between disk and memory.
Kathleen
asked
in
Operating System
Oct 8, 2014
by
Kathleen
10.5k
views
gate1995
operating-system
disk
normal
descriptive
18
votes
3
answers
20
GATE CSE 1995 | Question: 13
Obtain the principal (canonical) conjunctive normal form of the propositional formula $(p \wedge q) \vee (\neg q \wedge r)$ where $\wedge$ is logical and, $\vee$ is inclusive or and $\neg$ is negation.
Kathleen
asked
in
Mathematical Logic
Oct 8, 2014
by
Kathleen
3.2k
views
gate1995
mathematical-logic
propositional-logic
normal
descriptive
16
votes
3
answers
21
GATE CSE 1995 | Question: 12
Consider the following sequence of numbers:$92, 37, 52, 12, 11, 25$ Use Bubble sort to arrange the sequence in ascending order. Give the sequence at the end of each of the first five passes.
Kathleen
asked
in
Algorithms
Oct 8, 2014
by
Kathleen
6.5k
views
gate1995
algorithms
sorting
easy
descriptive
19
votes
2
answers
22
GATE CSE 1995 | Question: 11
Let $L$ be a language over $\Sigma$ i.e., $L\subseteq \Sigma^*$. Suppose $L$ satisfies the two conditions given below. $L$ is in NP and For every $n$, there is exactly one string of length $n$ that belongs to $L$. Let $L^c$ be the complement of $L$ over $\Sigma^*$. Show that $L^c$ is also in NP.
Kathleen
asked
in
Theory of Computation
Oct 8, 2014
by
Kathleen
2.9k
views
gate1995
theory-of-computation
normal
decidability
proof
descriptive
0
votes
0
answers
23
GATE CSE 1995 | Question: 10
Kathleen
asked
in
Others
Oct 8, 2014
by
Kathleen
333
views
gate1995
out-of-syllabus-now
pascal
23
votes
3
answers
24
GATE CSE 1995 | Question: 9
Translate the arithmetic expression $a^\ast -(b+c)$ into syntax tree. A grammar is said to have cycles if it is the case that $A \overset{+}{\Rightarrow} A$ Show that no grammar that has cycles can be $\text{LL(1)}.$
Kathleen
asked
in
Compiler Design
Oct 8, 2014
by
Kathleen
5.3k
views
gate1995
compiler-design
grammar
normal
descriptive
6
votes
1
answer
25
GATE CSE 1995 | Question: 8
Construct the $\text{LL(1)}$ table for the following grammar. $Expr \rightarrow \_Expr$ $Expr \rightarrow (Expr)$ $Expr \rightarrow Var\; ExprTail$ $ExprTail \rightarrow \_Expr$ $Expr \rightarrow \lambda$ $Var \rightarrow Id\; VarTail$ $VarTail \rightarrow (Expr)$ $VarTail \rightarrow \lambda$ $Goal \rightarrow Expr$
Kathleen
asked
in
Compiler Design
Oct 8, 2014
by
Kathleen
1.8k
views
gate1995
compiler-design
parsing
normal
descriptive
6
votes
2
answers
26
GATE CSE 1995 | Question: 7(A)
Determine the number of divisors of $600.$
Kathleen
asked
in
Set Theory & Algebra
Oct 8, 2014
by
Kathleen
1.3k
views
gate1995
set-theory&algebra
number-theory
numerical-answers
21
votes
3
answers
27
GATE CSE 1995 | Question: 5
A computer installation has $1000k$ of main memory. The jobs arrive and finish in the following sequences. Job 1 requiring 200k arrives Job 2 requiring 350k arrives Job 3 requiring 300k arrives Job 1 finishes Job 4 requiring 120k ... arrives Draw the memory allocation table using Best Fit and First Fit algorithms. Which algorithm performs better for this sequence?
Kathleen
asked
in
Operating System
Oct 8, 2014
by
Kathleen
6.5k
views
gate1995
operating-system
memory-management
normal
descriptive
16
votes
3
answers
28
GATE CSE 1995 | Question: 4
Consider the following Pascal function where $A$ and $B$ are non-zero positive integers. What is the value of $\text{GET}(3, 2)$? function GET(A,B:integer): integer; begin if B=0 then GET:= 1 else if A < B then GET:= 0 else GET:= GET(A-1, B) + GET(A-1, B-1) end; The Pascal ... to N - 1 do for J:=1 to N do begin TMP:= A[I, J]; A[I, J]:= A[J, I]; A[J, I]:= TMP end end;
Kathleen
asked
in
Algorithms
Oct 8, 2014
by
Kathleen
2.3k
views
gate1995
algorithms
identify-function
normal
descriptive
21
votes
3
answers
29
GATE CSE 1995 | Question: 3
Consider the following high level programming segment. Give the contents of the memory locations for variables $W, X, Y$ and $Z$ after the execution of the program segment. The values of the variables $A$ and $B$ are $5CH$ and $92H$, respectively. Also indicate error conditions if ... integer is represented by two bytes) begin X :=A+B Y :=abs(A-B); W :=A-B Z :=A*B end;
Kathleen
asked
in
Programming
Oct 8, 2014
by
Kathleen
4.0k
views
gate1995
programming
identify-function
descriptive
21
votes
2
answers
30
GATE CSE 1995 | Question: 2.25
A computer system has a $4 \ K$ word cache organized in block-set-associative manner with $4$ blocks per set, $64$ words per block. The number of bits in the SET and WORD fields of the main memory address format is: $15, 40$ $6, 4$ $7, 2$ $4, 6$
Kathleen
asked
in
CO and Architecture
Oct 8, 2014
by
Kathleen
9.3k
views
gate1995
co-and-architecture
cache-memory
normal
Page:
1
2
3
next »
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
My journey from being a MSc student to AIR 239 in GATE CSE 2023 and qualified UGC-NET JRF.
NEEPCO Recruitment 2023
GATE CSE 2023 Results
IIIT Banglore MTech 2023-24
IIIT-Delhi MTech 2023-24
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.3k)
Others
(2.5k)
Admissions
(653)
Exam Queries
(844)
Tier 1 Placement Questions
(17)
Job Queries
(76)
Projects
(9)
Unknown Category
(866)
Recent questions tagged gate1995
Recent Blog Comments
congrats pranab
Congratulations @Pranab Paul 10 🥳
sir give access to these tests at least mid May...
Was there interview for mtech as well?
Check CCMT website for previous year cutoff for...