search
Log In

Recent questions tagged gate1995

0 votes
0 answers
1
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
asked Jul 14, 2019 in Computer Peripherals Arjun 240 views
7 votes
2 answers
2
Determine the number of positive integers $(\leq 720)$ which are not divisible by any of $2,3$ or $5.$
asked Jun 6, 2019 in Set Theory & Algebra Arjun 835 views
3 votes
1 answer
3
What is the equivalent minimal Boolean expression (in sum of products form) for the Karnaugh map given below?
asked Feb 12, 2018 in Digital Logic jothee 799 views
20 votes
3 answers
4
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.
asked Oct 8, 2014 in DS Kathleen 1.6k views
16 votes
3 answers
5
Consider the relation scheme.$\begin{array}{ll} \text{AUTHOR} & \text{(ANAME, INSTITUTION, ACITY, AGE)} \\\hline \text{PUBLISHER} & \text{(PNAME, PCITY)} \\\hline \text{BOOK} & \text{(TITLE, ANAME, PNAME)} \\ \end{array}$Express the following ... a book for the publisher with PNAME='TECHNICAL PUBLISHERS'. Get the names of all authors who have published a book for any publisher located in Madras
asked Oct 8, 2014 in Databases Kathleen 1.5k views
23 votes
5 answers
6
Consider the relation scheme $R(A, B, C)$ with the following functional dependencies: $A, B → C,$ $C → A$ Show that the scheme R is in $3NF$ but not in $\text{BCNF}$. Determine the minimal keys of relation $R$.
asked Oct 8, 2014 in Databases Kathleen 2.8k views
11 votes
1 answer
7
Find the minimum value of $3-4x+2x^2$.
asked Oct 8, 2014 in Calculus Kathleen 1.1k views
16 votes
2 answers
8
Prove that in finite graph, the number of vertices of odd degree is always even.
asked Oct 8, 2014 in Graph Theory Kathleen 1.9k views
8 votes
3 answers
9
10 votes
1 answer
10
How many minimum spanning trees does the following graph have? Draw them. (Weights are assigned to edges).
asked Oct 8, 2014 in Algorithms Kathleen 1.8k views
19 votes
4 answers
11
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$?.
asked Oct 8, 2014 in Set Theory & Algebra Kathleen 1.9k views
13 votes
1 answer
12
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 FCFS (First Come First Served) and SSTF (Shortest Seek Time First) will require less head movement? Find the head movement for each of the algorithms.
asked Oct 8, 2014 in Operating System Kathleen 10.2k views
20 votes
1 answer
13
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(c); V(d) end; ... end; begin P(g); S6; V(i) end; begin P(h); P(i); S8; V(j) end; begin P(j); P(k); S9 end; coend end;
asked Oct 8, 2014 in Operating System Kathleen 2.1k views
16 votes
2 answers
14
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):integer; var REM, ... <>0 do begin REM:=N mod 2; BIANRY:=BINARY + B*EXPONENT; EXPONENT:=EXPONENT*10; N:=C end TWOSCOMP:=BINARY end end;
asked Oct 8, 2014 in Digital Logic Kathleen 1.1k views
6 votes
1 answer
15
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 $1200$ bits/second. What is the complete bit stream that is transmitted for the string ‘0110101’? How many such string can be transmitted per second?
asked Oct 8, 2014 in Computer Networks Kathleen 930 views
0 votes
0 answers
16
10 votes
2 answers
17
Implement a circuit having the following output expression using an inverter and a nand gate $Z=\overline{A} + \overline{B} +C$
asked Oct 8, 2014 in Digital Logic Kathleen 1.1k views
33 votes
2 answers
18
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 the disk: $4$ cm ... at $360$ rpm, determine the effective data transfer rate which is defined as the number of bytes transferred per second between disk and memory.
asked Oct 8, 2014 in Operating System Kathleen 6.1k views
12 votes
3 answers
19
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.
asked Oct 8, 2014 in Mathematical Logic Kathleen 1.5k views
13 votes
2 answers
20
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.
asked Oct 8, 2014 in Algorithms Kathleen 1.1k views
14 votes
2 answers
21
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.
asked Oct 8, 2014 in Theory of Computation Kathleen 1.3k views
0 votes
0 answers
22
21 votes
3 answers
23
Translate the arithmetic expression $a^*-(b+c)$ into syntax tree. A grammar is said to have cycles if it is the case that $A \Rightarrow^+ A$ Show that no grammar that has cycles can be LL(1).
asked Oct 8, 2014 in Compiler Design Kathleen 2.5k views
4 votes
1 answer
24
Construct the 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$
asked Oct 8, 2014 in Compiler Design Kathleen 798 views
4 votes
4 answers
25
Determine the number of divisors of $600.$ Compute without using power series expansion $\lim_{x \to 0} \frac{\sin x}{x}$
asked Oct 8, 2014 in Set Theory & Algebra Kathleen 796 views
20 votes
3 answers
26
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 Job 5 requiring ... 80k arrives Draw the memory allocation table using Best Fit and First Fit algorithms Which algorithm performs better for this sequence?
asked Oct 8, 2014 in Operating System Kathleen 3.2k views
11 votes
3 answers
27
Consider the following Pascal function where $A$ and $B$ are non-zero positive integers. What is the value of $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 procedure given for computing the ... 1 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;
asked Oct 8, 2014 in Algorithms Kathleen 1.2k views
17 votes
3 answers
28
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 any. var A, B ... integer, (each integer is represented by two bytes) begin X :=A+B Y :=abs(A-B); W :=A-B Z :=A*B end;
asked Oct 8, 2014 in Programming Kathleen 1.7k views
18 votes
1 answer
29
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$
asked Oct 8, 2014 in CO and Architecture Kathleen 4.2k views
19 votes
5 answers
30
Let $\Sigma=\left\{0,1\right\}, L = \Sigma^*$ and $R=\left\{0^n1^n \mid n > 0\right\} $ then the languages $L \cup R$ and $R$ are respectively regular, regular not regular, regular regular, not regular not regular, not regular
asked Oct 8, 2014 in Theory of Computation Kathleen 3.2k views
...