Recent activity

+22 votes

5 answers

1

GATE2005-IT-7
Which of the following expressions is equivalent to $(A \oplus B) \oplus C$ $(A + B + C) (\bar A +\bar B +\bar C)$ $(A + B + C) (\bar A +\bar B + C)$ $ABC + \bar A (B \oplus C) + \bar B(A \oplus C)$ None of these

commented 1 hour ago in Digital Logic by King Suleiman (317 points) | 1.8k views

0 votes

2 answers

2

Is Sahni Horowitz book sufficient for Algorithms?
I know the textbook recommended for Algorithms is CLRS. However, I found it too much to digest. I instead bought the book by Horowitz and Sahni- Fundamentals of Computer Algorithms. Is this book sufficent for GATE?

answer selected 1 hour ago in Others by Bikram Veteran (68.8k points) | 323 views

+18 votes

2 answers

3

GATE1996-1.20, ISRO2008-56
Which of the following is an example of spooled device? A line printer used to print the output of a number of jobs A terminal used to enter input data to a running program A secondary storage device in a virtual memory system A graphic display device

commented 1 hour ago in Operating System by Akash Papnai (65 points) | 3.3k views

+17 votes

2 answers

4

GATE1999-2.22
The main difference(s) between a CISC and a RISC processor is/are that a RISC processor typically has fewer instructions has fewer addressing modes has more registers is easier to implement using hard-wired logic

commented 2 hours ago in CO and Architecture by ayush.5 (67 points) | 2k views

0 votes

1 answer

5

forouzan 4th edition chapter 19
An organization is granted the block 16.0.0.0/8. The administrator wants to create 500 fixed-length subnets.Find the first and last addresses in subnet 500.

answered 2 hours ago in Computer Networks by shipra tressa (257 points) | 68 views

+48 votes

2 answers

6

GATE2013-39
A certain computation generates two arrays a and b such that $a[i] = f(i)$ for $0 \leq i < n$ and $b[i] = g(a[i])$ for $0 \leq i < n$. Suppose this computation is decomposed into two concurrent processes $X$ and $Y$ such that $X$ computes the array $a$ and $Y$ computes the array $b$. The ... ); } EntryY(R, S) { V(S); P(R); } ExitX(R, S) { V(R); P(S); } EntryY(R, S) { V(S); P(R); }

commented 2 hours ago in Operating System by ChandanKumar123 (225 points) | 8.2k views

+11 votes

4 answers

7

ISI2011-CS-5b
Suppose we have a relation $R(A, B, C, D, E)$ with the functional dependencies: $A \rightarrow D, B \rightarrow C, D \rightarrow E, CE \rightarrow B$. If we project $R$ and therefore its functional dependencies onto the schema $ABC$, what will the key(s) for $ABC$ be?

commented 3 hours ago in Databases by MRINMOY_HALDER Active (1.4k points) | 574 views

+9 votes

1 answer

8

TIFR2010-B-40
Which of the following statement is FALSE? All recursive sets are recursively enumerable. The complement of every recursively enumerable sets is recursively enumerable. Every Non-empty recursively enumerable set is the range of some totally recursive function. All finite sets are recursive. The complement of every recursive set is recursive.

commented 4 hours ago in Theory of Computation by Bikram Veteran (68.8k points) | 757 views

+31 votes

4 answers

9

GATE1998-7-b
In a computer system where the best-fit' algorithm is used for allocating jobs' to memory partitions', the following situation was encountered:$\begin{array}{|l|l|} \hline \textbf{Partitions size in $KB$} & \textbf{$4K \ 8K \ 20K \ 2K$} \\\hline \textbf{Job sizes in $ ... $} \\\hline \end{array}$When will the $20K$ job complete?

answered 5 hours ago in Operating System by ayushsomani (99 points) | 2.9k views

+32 votes

7 answers

10

GATE2002-1.19
Relation $R$ with an associated set of functional dependencies, $F$, is decomposed into $\text{BCNF}$. The redundancy (arising out of functional dependencies) in the resulting set of relations is Zero More than zero but less than that of an equivalent $3NF$ decomposition Proportional to the size of F+ Indeterminate

commented 6 hours ago in Databases by MRINMOY_HALDER Active (1.4k points) | 4.1k views

+24 votes

4 answers

11

GATE2016-2-37
Consider the following program: int f (int * p, int n) { if (n <= 1) return 0; else return max (f (p+1, n-1), p[0] - p[1]); } int main () { int a[] = {3, 5, 2, 6, 4}; print f(" %d", f(a, 5)); } Note: $max (x, y)$ returns the maximum of $x$ and $y$. The value printed by this program is ________.

commented 6 hours ago in Programming by adarsh_1997 Active (3.3k points) | 3.7k views

+1 vote

1 answer

12

Madeesay Test Series
Consider TCP implements an extension that allows window size much larger than 64KB. Suppose you are using this extended TCP over a 1Gbps link with a latency of 50ms to transfer a 10 MB file and TCP receive window is 1MB. If TCP sends 1KB packet ... multiplied by link latency, then effective throughput of transfer is x Mbps. Find x. (Assuming no congestion and no lost packets)

commented 8 hours ago in Computer Networks by shankargadri Junior (525 points) | 194 views

+16 votes

3 answers

13

TIFR2011-B-30
Consider an array $A[1...n]$. It consists of a permutation of numbers $1....n$. Now compute another array $B[1...n]$ as follows: $B[A[i]]:= i$ for all $i$. Which of the following is true? $B$ will be a sorted array. $B$ is a permutation of array $A$. Doing the same transformation twice will not give the same array. $B$ is not a permutation of array $A$. None of the above.

comment edited 8 hours ago in DS by iarnav Loyal (7.9k points) | 889 views

+1 vote

0 answers

14

ME Test series
Suppose a switch is built using a computer workstation and that it can forward packets at a rate of 500,000 packets per second, regardless (within limits) of size. Assume the workstation uses direct memory access (DMA) to move data in and out of its main memory ... and that the I/O bus has a bandwidth of 1 Gbps. At what packet size would the bus bandwidth become the limiting factor?

commented 10 hours ago in Computer Networks by shankargadri Junior (525 points) | 152 views

+2 votes

4 answers

15

What is the difference between order and degree of a B-tree
What is the difference between order and degree of a B-tree are they same or different

answered 11 hours ago in Programming by mint Active (1.2k points) | 2.2k views

+1 vote

0 answers

16

MadeEasy Test Series: CO & Architecture - Instruction Format
How they have calculated the memory address part?

commented 11 hours ago in CO and Architecture by Ram Swaroop Active (3.6k points) | 100 views

+34 votes

10 answers

17

GATE2012-12
What is the complement of the language accepted by the NFA shown below? Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string. $\phi$ $\{\epsilon\}$ $a^*$ $\{a , \epsilon\}$

commented 12 hours ago in Theory of Computation by shivam001 (175 points) | 4.2k views

0 votes

1 answer

18

Boolean logic implementation

answered 17 hours ago in Digital Logic by BASANT KUMAR Active (2.3k points) | 91 views

+1 vote

2 answers

19

GATE ECE 2014
Above question modification. This is the actual question Boolean expression$:(x+y)(x+\bar{y})+\overline{{(x\bar{y}+\bar{x})}}$ $(A) x$ $(B)y$ $(C)xy$ $(D)x+y$

answered 17 hours ago in Digital Logic by BASANT KUMAR Active (2.3k points) | 90 views

+11 votes

7 answers

20

Minimum number of tables to represent ER-Diagram
How many minimum relations required for given ER diagram ?

commented 20 hours ago in Databases by Doraemon (227 points) | 1.2k views

+1 vote

3 answers

21

Suppose that 100 people enter a contest and that different winners are selected at random for first, second, and third prizes. What is the probability that Michelle wins one of these prizes if she is one of the contestants?

answered 21 hours ago in Probability by mohan123 (283 points) | 917 views

0 votes

0 answers

22

Ullman (TOC) Edition 3 Exercise 9.4 Question 4 (Page No. 412)

asked 21 hours ago in Theory of Computation by Lakshman Patel RJIT Boss (41.8k points) | 8 views

0 votes

0 answers

23

Ullman (TOC) Edition 3 Exercise 9.4 Question 3 (Page No. 412)
Suppose we limited $PCP$ to a one-symbol alphabet, say $\Sigma = \left\{0\right\}$. Would this restricted case of $PCP$ still be undecidable?

asked 21 hours ago in Theory of Computation by Lakshman Patel RJIT Boss (41.8k points) | 1 view

0 votes

0 answers

24

Ullman (TOC) Edition 3 Exercise 9.4 Question 2 (Page No. 412)
We showed that $PCP$ was undecidable, but we assumed that the alphabet $\Sigma$ could be arbitrary. Show that $PCP$ is undecidable even if we limit the alphabet to $\Sigma = \left\{0,1\right\}$ by reducing $PCP$ to this special case of $PCP$.

asked 21 hours ago in Theory of Computation by Lakshman Patel RJIT Boss (41.8k points) | 1 view

+14 votes

2 answers

25

GATE2017-2-28
Given $f(w, x, y, z) = \Sigma_m(0,1, 2, 3, 7, 8, 10) + \Sigma_d(5, 6, 11, 15)$; where $d$ represents the 'don't-care' condition in Karnaugh maps. Which of the following is a minimum product-of-sums (POS) form of $f(w, x, y, z)$? $f=(\bar{w}+\bar{z}) (\bar{x}+z)$ $f=(\bar{w}+z) (x+z)$ $f=(w+z) (\bar{x}+z)$ $f=(w+\bar{z}) (\bar{x}+z)$

commented 22 hours ago in Digital Logic by Sona Barman Active (1.2k points) | 3.2k views

0 votes

0 answers

26

Ullman (TOC) Edition 3 Exercise 9.4 Question 1 (Page No. 412)
Tell whether each of the following instances of $PCP$ has a solution. Each is presented as two lists $A$ and $B$, and the $i^{th}$ strings on the two lists correspond for each $i = 1,2,\cdot\cdot\cdot\cdot$ $A=(01,001,10); \ B = (011,10,00).$ $A=(01,001,10); \ B = (011,01,00).$ $A=(ab,a,bc,c); \ B = (bc,ab,ca,a).$

asked 22 hours ago in Theory of Computation by Lakshman Patel RJIT Boss (41.8k points) | 2 views

0 votes

0 answers

27

Ullman (TOC) Edition 3 Exercise 9.3 Question 8 (Page No. 401)
Tell whether each of the following are recursive, RE-but-not-recursive, or non-RE. The set of all $TM$ codes for $TM's$ that halt on every input. The set of all $TM$ codes for $TM's$ ... that halt on at least one input. The set of all $TM$ codes for $TM's$ that fail to halt on at least one input.

asked 22 hours ago in Theory of Computation by Lakshman Patel RJIT Boss (41.8k points) | 2 views

0 votes

0 answers

28

Ullman (TOC) Edition 3 Exercise 9.3 Question 7 (Page No. 400 - 401)
Show that the following problems are not recursively enumerable: The set of pairs $(M,w)$ such that $TM \ M$, started with input $w$, does not halt. The set of pairs $(M_{1},M_{2})$ such that $L(M_{1}\cap L_(M_{2})=\phi$. ... $TM's$.

edited 22 hours ago in Theory of Computation by Lakshman Patel RJIT Boss (41.8k points) | 2 views

0 votes

0 answers

29

Ullman (TOC) Edition 3 Exercise 9.3 Question 6 (Page No. 400)
Show that the following questions are decidable: The set of codes for $TM's \ M$ such that when started with blank tape will eventually write some nonblank symbol on its tape. Hint: If $M$ has $m$ states, consider the first $m$ transitions ... $(M,w)$ such that $TM \ M$, started with input $w$, never scans any tape cell more than once.

asked 22 hours ago in Theory of Computation by Lakshman Patel RJIT Boss (41.8k points) | 1 view

0 votes

0 answers

30

Ullman (TOC) Edition 3 Exercise 9.3 Question 5 (Page No. 400)
Let $L$ be the language consisting of pairs of $TM$ codes plus an integer, $(M_{1},M_{2},k)$, such that $L(M_{1})\cap L(M_{2})$ contains at least $k$ strings. Show that $L$ is $RE$, but recursive.

asked 22 hours ago in Theory of Computation by Lakshman Patel RJIT Boss (41.8k points) | 2 views

0 votes

0 answers

31

Ullman (TOC) Edition 3 Exercise 9.3 Question 4 (Page No. 400)
We know by Rice's theorem that none of the following problems are decidable. However are they recursively enumerable,or non-RE? Does $L(M)$ contain at least two strings? Is $L(M)$ infinite? Is $L(M)$ a context-free language? Is $L(M) = (L(M))^{R}$?

asked 22 hours ago in Theory of Computation by Lakshman Patel RJIT Boss (41.8k points) | 2 views

0 votes

0 answers

32

Ullman (TOC) Edition 3 Exercise 9.3 Question 3 (Page No. 400)
Show that the language of codes for $TM's\ M$ that, when started with blank tape, eventually write a $1$ somewhere on the tape is undecidable.

asked 23 hours ago in Theory of Computation by Lakshman Patel RJIT Boss (41.8k points) | 1 view

0 votes

0 answers

33

Ullman (TOC) Edition 3 Exercise 9.3 Question 2 (Page No. 400)
The Big Computer Corp. has decided to bolster its sagging market share by manufacturing a high-tech version of the Turing machine called, $BWTM$ that is equipped with bells and whistles. The $BWTM$ is basically the same as your ordinary ... that it is undecidable whether a given $BWTM \ M$, on given input $w$, ever blows the whistle.

asked 23 hours ago in Theory of Computation by Lakshman Patel RJIT Boss (41.8k points) | 2 views

0 votes

0 answers

34

Ullman (TOC) Edition 3 Exercise 9.3 Question 1 (Page No. 400)
Show that the set of Turing-machine codes for TM's that accept all inputs that are palindromes (possibly along with some other inputs) is undecidable.

asked 23 hours ago in Theory of Computation by Lakshman Patel RJIT Boss (41.8k points) | 2 views

0 votes

0 answers

35

GATE1993-02.2
The radius of convergence of the power series$\sum_{}^{\infty} \frac{(3m)!}{(m!)^3}x^{3m}$ is: _____________

commented 23 hours ago in Calculus by srestha Veteran (112k points) | 155 views

0 votes

0 answers

36

Ullman (TOC) Edition 3 Exercise 9.2 Question 6 (Page No. 392)
We have not discussed closure properties of the recursive languages or the RE languages other than our discussion of complementation in Section $9.2.2.$ Tell whether the recursive languages and/or the RE ... , constructions to show closure. Union. Intersection. Concatenation. Kleene closure(star). Homomorphism. Inverse homomorphism.

asked 23 hours ago in Theory of Computation by Lakshman Patel RJIT Boss (41.8k points) | 3 views

0 votes

0 answers

37

Ullman (TOC) Edition 3 Exercise 9.2 Question 5 (Page No. 392)
Let $L$ be recursively enumerable and let $\overline{L}$ be non-RE. Consider the language $L' = \left\{0w\mid w\ \text{is in}\ L \right\}$ Can you say for certain whether $L'$ or its complement are recursive, RE, or non-RE? Justify your answer.

asked 23 hours ago in Theory of Computation by Lakshman Patel RJIT Boss (41.8k points) | 2 views

0 votes

1 answer

38

UGCNET-June-2019-II-13
How many different Boolean functions of degree $n$ are there? $2^{2^n}$ $(2^2)^n$ $2^{2^n} -1$ $2^n$

answer edited 23 hours ago in Set Theory & Algebra by Satbir Boss (16.1k points) | 37 views

+16 votes

3 answers

39

GATE2000-8
A push down automation (pda) is given in the following extended notation of finite state diagram: The nodes denote the states while the edges denote the moves of the pda. The edge labels are of the form $d$, $s/s'$ where $d$ is the input symbol read and $s, s'$ are ... states in the above notation that accept the language $\left\{0^{n}1^{m} \mid n \leq m \leq 2n\right\}$ by empty stack

commented 1 day ago in Theory of Computation by commenter commenter (225 points) | 1.4k views

+5 votes

1 answer

40

deterministic pushdown automata-prefix property
How to find DPDA’s that accept by null stack? Someone explain the prefix property for DPDA,How can we use this property?

commented 1 day ago in Theory of Computation by commenter commenter (225 points) | 768 views

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

Recent Blog Comments