Dark Mode

Recent questions tagged gate1995

4 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}.$

admin asked in Calculus Apr 25, 2021

by admin

1.4k views

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.4k views

18 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

4.3k views

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

2.5k views

25 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

3.7k views

24 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

4.5k views

28 votes

6 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

11.1k views

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

2.6k views

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

5.7k views

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

1.5k views

16 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

5.0k views

27 votes

5 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

6.5k views

19 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

122k views

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

4.7k views

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

2.5k views

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

2.3k views

0 votes

0 answers

17

GATE CSE 1995 | Question: 16

Kathleen asked in CO and Architecture Oct 8, 2014

579 views

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

2.5k views

39 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

12.8k views

21 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

4.2k views

18 votes

2 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

8.5k views

20 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

3.7k views

0 votes

0 answers

23

GATE CSE 1995 | Question: 10

Kathleen asked in Others Oct 8, 2014

456 views

23 votes

4 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

6.6k views

6 votes

2 answers

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

2.4k views

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

1.8k views

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

7.8k views

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

3.0k views

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 in C Oct 8, 2014

5.3k views

23 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

10.7k views

Page:

1
2
3
next »

Recent questions tagged gate1995