Answers by Arpit Dhuriya / GATE Overflow for GATE CSE

9 votes

31

GATE CSE 1989 | Question: 13c
Find the number of single valued functions from set $A$ to another set $B,$ given that the cardinalities of the sets $A$ and $B$ are $m$ and $n$ respectively.

Find the number of single valued functions from set $A$ to another set $B,$ given that the cardinalities of the sets $A$ and $B$ are $m$ and $n$ respectively.

3.0k views

answered Dec 19, 2016

0 votes

32

GATE CSE 1989 | Question: 13b
Find a solution to the following recurrence equation: $T(n)=\sqrt{n}+T\left(\frac{n}{2}\right)$ $T(1)=1$

Find a solution to the following recurrence equation:$T(n)=\sqrt{n}+T\left(\frac{n}{2}\right)$$T(1)=1$

4.4k views

answered Dec 19, 2016

1 votes

33

COA NUmerical Gate Application

2.4k views

answered Nov 4, 2016

0 votes

34

ambiguous grammar
Consider the following context-free grammar S → SS + | SS*| a for the string aa + a*. Is the grammar ambiguous ?

Consider the following context-free grammarS → SS + | SS*| a for the string aa + a*. Is the grammar ambiguous ?

4.3k views

answered Nov 3, 2016

0 votes

35

ME-Practice Set TOC Q#52

360 views

answered Nov 3, 2016

0 votes

36

ME-Practice Set TOC Q#9

237 views

answered Nov 3, 2016

1 votes

37

ME-Practice Set TOC Q#25

1.7k views

answered Nov 3, 2016

0 votes

38

ME-Practice Set TOC Q#11

262 views

answered Nov 2, 2016

3 votes

39

MadeEasy Test Series: Set Theory & Algebra - Binary Operation

486 views

answered Nov 2, 2016

0 votes

40

Searching in Indexing
Suppose a phone book contain 500 pages and each page can contain upto 500 records. Suppose we want to search for a particular name in a phone book. Give a worst case bound on number of pages that must be looked to perform a search using an index for the name of the first entry of each page.

Suppose a phone book contain 500 pages and each page can contain upto 500 records. Suppose we want to search for a particular name in a phone book. Give a worst case boun...

369 views

answered Nov 2, 2016

0 votes

41

speedup
Consider a non-pipelined processor design which has a cycle time of 10ns and average CPI of 1.4. The maximum speedup pipelined processor can get by pipelining it into 5 stages and each stage takes 2ns is______________? in this question,speed up is 10/2 = 5 but why it is'nt ... 1.4 * 10) /2 =7.. //i am just confused because speedup is (total time in non pipleine /total time in pipeline)

Consider a non-pipelined processor design which has a cycle time of 10ns and average CPI of 1.4. The maximum speedup pipelined processor can get by pipelining it into 5 s...

795 views

answered Nov 2, 2016

0 votes

42

set theory
What is the number of relations which are either symmetric or antisymmetric on a set with 3 elements?

What is the number of relations which are either symmetric or antisymmetric on a set with 3 elements?

2.0k views

answered Nov 2, 2016

0 votes

43

GATE Overflow | Digital Logic | Test 1 | Question: 24
What is minimum number of NAND gates required to implement a 2 input EX-OR gate without using any other logic gates?

What is minimum number of NAND gates required to implement a 2 input EX-OR gate without using any other logic gates?

186 views

answered Nov 2, 2016

0 votes

44

GATE Overflow | Digital Logic | Test 1 | Question: 29
The minimum number of gates required to implement the Boolean function $(AB+C)$ if we have to use only 2-input NOR gate?

The minimum number of gates required to implement the Boolean function $(AB+C)$ if we have to use only 2-input NOR gate?

272 views

answered Nov 2, 2016

0 votes

45

GATE Overflow | Digital Logic | Test 1 | Question: 22
On the fifth clock pulse, a 4-bit Johnson sequence is $Q_0 = 0, Q_1 = 1, Q_2 = 1,$ and $Q_3 = 1$. On the sixth clock pulse, the sequence is ________. $Q_0 = 1, Q_1 = 0, Q_2 = 0, Q_3 = 0$ $Q_0 = 1, Q_1 = 1, Q_2 = 1, Q_3 = 0$ $Q_0 = 0, Q_1 = 0, Q_2 = 1, Q_3 = 1$ $Q_0 = 0, Q_1 = 0, Q_2 = 0, Q_3 = 1$

On the fifth clock pulse, a 4-bit Johnson sequence is $Q_0 = 0, Q_1 = 1, Q_2 = 1,$ and $Q_3 = 1$. On the sixth clock pulse, the sequence is ________.$Q_0 = 1, Q_1 = 0, Q_...

156 views

answered Nov 2, 2016

1 votes

46

GATE Overflow | Digital Logic | Test 1 | Question: 9
Reduce this Boolean Expression to one literal $\bar W X( \bar Z +\bar YZ ) + X( W+\bar WYZ)$ $W$ $Z$ $X$ $Y$

Reduce this Boolean Expression to one literal$$\bar W X( \bar Z +\bar YZ ) + X( W+\bar WYZ)$$$W$$Z$$X$$Y$

434 views

answered Oct 28, 2016

0 votes

47

# gate 2005
Q Consider a disk drive with the following specifications: 16 surfaces, 512 tracks/surface, 512 sectors/track, 1 KB/sector, rotation speed 3000 rpm. The disk is operated in cycle stealing mode whereby whenever one byte word is ready it is sent to memory; similarly, for ... nsec. The maximum percentage of time that the CPU gets blocked during DMA operation is: A) 10 B)20 C)30 D) 25

Q Consider a disk drive with the following specifications: 16 surfaces, 512 tracks/surface, 512 sectors/track, 1 KB/sector, rotation speed 3000 rpm. The disk is operated ...

349 views

answered Oct 2, 2016

1 votes

48

GATE Overflow | Digital Logic | Test 1 | Question: 28
Zero has only one representation in Sign magnitude 1's complement 2's complement Both 1's complement and 2's complement

Zero has only one representation inSign magnitude1's complement2's complementBoth 1's complement and 2's complement

317 views

answered Sep 30, 2016

3 votes

49

GATE Overflow | Digital Logic | Test 1 | Question: 1
A sequential circuit has three D flip-flops $A, B, C$ and one input $X$. The circuit is described by the following input equations: $D_A = (B\bar C + \bar BC ) X + (BC + \bar B \bar C) \bar X , \\D_B = A , \\D_C = B$ What is the next state for the circuit for $X=0$ when present state $A, B ,C$ is $0, 0, 0$? 0 1 0 1 0 0 0 0 0 0 0 1

A sequential circuit has three D flip-flops $A, B, C$ and one input $X$. The circuit is described by the following input equations:$$D_A = (B\bar C + \bar BC ) X + (BC + ...

483 views

answered Sep 26, 2016

0 votes

50

Time Complexity
What is the running time of following recurrence relation? T(n) = T(n/2) + T(n/4) + T(n/8) + n

What is the running time of following recurrence relation?T(n) = T(n/2) + T(n/4) + T(n/8) + n

393 views

answered Sep 8, 2016

0 votes

51

c_programming
What will be the output of the program assuming that the array begins at the location 1002 and size of an integer is 4 bytes? #include<stdio.h> int main() { int a[3][4] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 }; printf("%u, %u, %u\n", a[0]+1, *(a[0]+1), *(*(a+0)+1)); return 0; } A. 448, 4, 4 B. 520, 2, 2 C. 1006, 2, 2 D. Error

What will be the output of the program assuming that the array begins at the location 1002 and size of an integer is 4 bytes?#include<stdio.h>int main(){ int a[3][4] =...

683 views

answered Sep 8, 2016

1 votes

52

cormen Q
Given an adjacency-list representation of a directed graph, how long does it take to compute the out-degree of every vertex? How long does it take to compute the in-degrees?

Given an adjacency-list representation of a directed graph, how long does it taketo compute the out-degree of every vertex? How long does it take to compute thein-degrees...

357 views

answered Sep 8, 2016

2 votes

53

Virtual Gate Test Series: Digital Logic - NAND Gates
The minimum number of $2$-input $NAND$ gates required to implement the function $F = (x' + y')(z + w)$ is ______

The minimum number of $2$-input $NAND$ gates required to implement the function $F = (x' + y')(z + w)$ is ______

15.9k views

answered Sep 8, 2016

1 votes

54

ambiguity
my doubt is if some grammer contain both left recursive and right recursive grammer then it's ambigious grammer. is this stmt is true for all such type of grammer???

my doubt is if some grammer contain both left recursive and right recursive grammer then it's ambigious grammer. is this stmt is true for all such type of grammer???

272 views

answered Sep 6, 2016

1 votes

55

Gatebook exam
Consider the following exponential search algorithm(ES). The array of n elements have to be searched is divided in to logn parts. The ith part is from index to. to search an element search all the parts one by one from left to right using binary search algorithm. What is the worst case complexity of above searching algorithm?

Consider the following exponential search algorithm(ES). The array of n elements have to be searched is divided in to logn parts. The ith part is from index to. to searc...

1.4k views

answered Sep 6, 2016

0 votes

56

after trap,what is state of process and after trap, process become ready?

682 views

answered May 15, 2015

13 votes

57

GATE CSE 2009 | Question: 33
The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows: void enter_CS(X) { while(test-and-set(X)); } void leave_CS(X) { X = 0; } In the above solution, $X$ is a memory location ... at the same time Which of the above statements are TRUE? (I) only (I) and (II) (II) and (III) (IV) only

The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows:void enter_CS(X) { while(test-an...

25.3k views

answered Jan 17, 2015

0 votes

58

How to rewrite .html url to. php file using .htaccess?
I have changed a website from .html extensions to .php; the file names are the same, and there are thousands of files. There is php code now which cannot be parsed with .html Basically, since now all the files have a .php extension ... visits: mysite.com/page.html then they are taken to: mysite.com/page.php How can I do this in .htaccess?

I have changed a website from .html extensions to .php; the file names are the same, and there are thousands of files. There is php code now which cannot be parsed with ....

988 views

answered Jan 15, 2015

12 votes

59

GATE IT 2006 | Question: 28
The following definite integral evaluates to $\int_{-\infty}^{0} e^ {-\left(\frac{x^2}{20} \right )}dx$ $\frac{1}{2}$ $\pi \sqrt{10}$ $\sqrt{10}$ $\pi$

The following definite integral evaluates to$$\int_{-\infty}^{0} e^ {-\left(\frac{x^2}{20} \right )}dx$$$\frac{1}{2}$$\pi \sqrt{10}$$\sqrt{10}$$\pi$

5.2k views

answered Jan 15, 2015

17 votes

60

GATE CSE 2014 Set 3 | Question: 8
Consider the following combinational function block involving four Boolean variables $x,\:y,\:a,\:b$ where $x,\:a,\:b$ are inputs and $y$ is the output. f(x, a, b, y) { if(x is 1) y = a; else y = b; } Which one of the following digital logic blocks is the most suitable for implementing this function? Full adder Priority encoder Multiplexor Flip-flop

Consider the following combinational function block involving four Boolean variables $x,\:y,\:a,\:b$ where $x,\:a,\:b$ are inputs and $y$ is the output.f(x, a, b, y) { if...

7.3k views

answered Jan 14, 2015

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