Answers by Aboveallplayer / GATE Overflow for GATE CSE

1 votes

41

CPU Utilization
What are the factors to improve CPU Utilization? List Them.

What are the factors to improve CPU Utilization? List Them.

457 views

answered Feb 4, 2017

0 votes

42

Gatebook
Consider languages L1 and L2 over {0,1) alphabet. L2= {w/w contains some x as a substring and x belongs to L1} Which of the following must be true? I. If L1 is regular, L2 is also regular II. If L1 is CFL, L2 is also CFL III. If L1 is recursive, L2 is also recursive (A). I and II only (B). I, II, III only (C). I and III only (D). II and III only

Consider languages L1 and L2 over {0,1) alphabet.L2= {w/w contains some x as a substring and x belongs to L1}Which of the following must be true?I. If L1 is regular, L2 i...

1.9k views

answered Feb 3, 2017

1 votes

43

MADE EASY TEST SERIES
Consider languages L1 and L2 over alphabet Σ = {a, b}. L1 is known to be a context-free language. L2 = {w|w is prefix of w' ∈ L1} Which of the following is true ? A> L2 need not be CFL B> L2 will be regular C> L2 will be CFL D> None of the above

Consider languages L1 and L2 over alphabet Σ = {a, b}. L1 is known to be a context-free language. L2 = {w|w is prefix of w' ∈ L1}Which of the following is true ?A L2 ...

679 views

answered Feb 3, 2017

2 votes

44

Compexity of sum of complexity bounds

259 views

answered Feb 2, 2017

0 votes

45

Permutation and combinations
I am confused with Following formulaes of combination.. 1. n!/r! 2. n+k-1 C k 3. (P+1)*2^R where (P+R are total things and P are alike). 4. question such as number of ways of choosing 10 balls out of 15 balls in which 5 are red,8 are green,2 are black. Anybody please provide me some reference to understand these formulaes related to combination.

I am confused with Following formulaes of combination..1. n!/r!2. n+k-1 C k3. (P+1)*2^R where (P+R are total things and P are alike).4. question such as number of ways of...

360 views

answered Jan 31, 2017

0 votes

46

Virtual Gate Test Series: Digital Logic - Number Representation
How many minimum bits are required to represent $-16$ in $2's$ complement form

How many minimum bits are required to represent $-16$ in $2's$ complement form

430 views

answered Jan 31, 2017

1 votes

47

UGC NET CSE | January 2017 | Part 3 | Question: 49
A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively: 14 and 15 14 and 29 15 and 14 16 and 32

A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are ...

7.9k views

answered Jan 31, 2017

0 votes

48

UGC NET CSE | January 2017 | Part 3 | Question: 22
Let $G= (V,T,S,P)$ be a context-free grammer such that every one of its productions is of the form $A\rightarrow v$, with $\mid v \mid=K> 1$. The derivation tree for any $W \in L(G)$ has a height $h$ ... $\log_{K}|W \mid \leq h \leq \left (\frac{ \mid W \mid - 1}{K-1} \right)$

Let $G= (V,T,S,P)$ be a context-free grammer such that every one of its productions is of the form $A\rightarrow v$, with $\mid v \mid=K 1$. The derivation tree for any ...

1.4k views

answered Jan 31, 2017

1 votes

49

UGC NET CSE | January 2017 | Part 3 | Question: 10
For database relation $R(A,B,C,D)$ where the domains of $A,B,C$ and $D$ include only atomic values, only the following functional dependencies and those that can be inferred from them are: $A \rightarrow C$ $B \rightarrow D$ ... normal form Second normal form but not in third normal form. Both in second normal form as well as in third normal form.

For database relation $R(A,B,C,D)$ where the domains of $A,B,C$ and $D$ include only atomic values, only the following functional dependencies and those that can be infer...

1.0k views

answered Jan 31, 2017

0 votes

50

UGC NET CSE | January 2017 | Part 3 | Question: 7
Consider following schedules involving two transactions: $S_{1}: \: r_{1}(X);r_{1}(Y);r_{2}(X);r_{2}(Y);w_{2}(Y);w_{1}(X)$ ... serializable and $S_2$ is not conflict serializable $S_1$ is not conflict serializable and $S_2$ is conflict serializable Both $S_1$ and $S_2$ are not conflict serializable

Consider following schedules involving two transactions:$S_{1}: \: r_{1}(X);r_{1}(Y);r_{2}(X);r_{2}(Y);w_{2}(Y);w_{1}(X)$$S_{2}: \: r_{1}(X);r_{2}(X);r_{2}(Y);w_{2}(Y);r_...

3.9k views

answered Jan 31, 2017

2 votes

51

UGC NET CSE | January 2017 | Part 3 | Question: 4
Match the following : ... $\text{a-iv, b-ii, c-i, d-iii}$ $\text{a-iv, b-iii, c-ii, d-i}$

Match the following :$\begin{array}{clcl} & {\textbf{Addressing Mode}} & {} & {\textbf{Location of operand}} \\ \text{a.} & \text{Implied} & \text{i.} & \text{Registe...

1.6k views

answered Jan 31, 2017

1 votes

52

UGC NET CSE | January 2017 | Part 3 | Question: 2
Which of the following is incorrect for virtual memory? Large programs can be written More I/O is required More addressable memory available Faster and easy swapping of process

Which of the following is incorrect for virtual memory?Large programs can be writtenMore I/O is requiredMore addressable memory availableFaster and easy swapping of proce...

1.8k views

answered Jan 31, 2017

0 votes

53

UGC NET CSE | January 2017 | Part 3 | Question: 21
Given the following statements: A class of languages that is closed under union and complementation has to be closed under intersection A class of languages that is closed under union and intersection has to be closed under complementation Which of the following options is ... and (ii) are true (i) is true, (ii) is false (i) is false, (ii) is true

Given the following statements:A class of languages that is closed under union and complementation has to be closed under intersectionA class of languages that is closed ...

2.6k views

answered Jan 31, 2017

2 votes

54

UGC NET CSE | January 2017 | Part 3 | Question: 23
Given the following two languages: $L_1 = \{a^n b^n \mid n \geq 0, \: n \neq 100\}$ $L_2 = \{ w \in \{a, b, c\}^* \mid n_a(w) = n_b (w) = n_c(w) \}$ Which of the following options is correct ... context free language $L_1$ is context free language, $L_2$ is not context free language $L_1$ is not context free language, $L_2$ is context free language

Given the following two languages:$L_1 = \{a^n b^n \mid n \geq 0, \: n \neq 100\}$$L_2 = \{ w \in \{a, b, c\}^* \mid n_a(w) = n_b (w) = n_c(w) \}$Which of the following o...

4.2k views

answered Jan 31, 2017

4 votes

55

UGC NET CSE | January 2017 | Part 3 | Question: 25
Suppose there are N stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that only one station transmits in a given slot is____ $nP(1-P)^{n-1}$ $nP$ $P(1-P)^{n-1}$ $n^P (1-P)^{n-1}$

Suppose there are N stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that only one station transmits i...

1.9k views

answered Jan 31, 2017

1 votes

56

UGC NET CSE | January 2017 | Part 3 | Question: 29
In RSA public key cryptosystem suppose $n=p*q$ where $p$ and $q$ are primes. $(e,n)$ and $(d,n)$ are public and private keys respectively. Let $M$ be an integer such that $o< M< n$ and $\phi(n)=(p-1)(q-1)$. Which of the following equations ... I and II I and III II and III I and IV

In RSA public key cryptosystem suppose $n=p*q$ where $p$ and $q$ are primes. $(e,n)$ and $(d,n)$ are public and private keys respectively. Let $M$ be an integer such that...

1.1k views

answered Jan 31, 2017

5 votes

57

UGC NET CSE | January 2017 | Part 3 | Question: 38
Given the array of integers ‘array’ shown below: 13 7 27 2 18 33 9 11 22 8 What is the output of the following JAVA statements? int[] p = new int [10]; int[] q = new int [10]; for (int k=0; k< 10; k++) p[k]=array [k]; q=p; p[4]=20; System.out.println(array[4]+":"+q[4]); 20:20 18:18 18:20 20:18

Given the array of integers ‘array’ shown below:1372721833911228What is the output of the following JAVA statements?int[] p = new int [10]; int[] q = new int [10]; fo...

2.9k views

answered Jan 31, 2017

2 votes

58

UGC NET CSE | January 2017 | Part 3 | Question: 28
In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24 packets are required to transmit the message, the packet size is 2 bytes 1 byte 4 bytes 5 bytes

In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24 packets are required to transmit the message, the packe...

4.8k views

answered Jan 31, 2017

1 votes

59

Basic Doubt Chomsky Hierarchy
I know that if L1 is regular and L2 is CFL then L1 intersection L2 is always CFL. But if we go according to hierarchy then if L1 is regular then it should be CFL so L1 intersection L2 is CFL intersection CFL and is not necessarily CFL as CFL's are not closed under intersection. My question is why is there a contradiction when I use this approach?

I know that if L1 is regular and L2 is CFL then L1 intersection L2 is always CFL. But if we go according to hierarchy then if L1 is regular then it should be CFL so L1 in...

435 views

answered Jan 30, 2017

7 votes

60

Test by Bikram | Mock GATE | Test 2 | Question: 11
A certain architecture supports indirect, direct, and register addressing modes for use in identifying operands for arithmetic instructions. Which of the following cannot be achieved with a single instruction? Specifying a register number in the ... memory location which in turn contains the value of an operand that will be used by the instruction.

A certain architecture supports indirect, direct, and register addressing modes for use in identifying operands for arithmetic instructions.Which of the following cannot ...

593 views

answered Jan 30, 2017

4 votes

61

Test by Bikram | Mock GATE | Test 2 | Question: 2
Which of the following statements is NOT true? Deadlock can never occur if all resources can be shared by competing processes. Deadlock can never occur if resources must be requested in the same order by processes ... then deadlock has certainly occurred. The Banker's algorithm for avoiding deadlock requires knowing resource requirements in advance

Which of the following statements is NOT true? Deadlock can never occur if all resources can be shared by competing proces...

937 views

answered Jan 30, 2017

2 votes

62

Test by Bikram | Mock GATE | Test 2 | Question: 4
Which of the following languages over the alphabet $A = $\left \{ 0,1 \right \}$ is regular ? $\{ w ∈ A^* : w$ contains a $1$ in every position that is a power of $2\}$ $\{ w ∈ A^* : w$ contains a prime number of $1's \}$ $\{ w ∈ ... that $w = uu \}$ $\{ w ∈ A^* : w$ does not contain any $1's$ in even positions, where the leftmost position is $1 \}$

Which of the following languages over the alphabet $A = $$\left \{ 0,1 \right \}$ is regular ? $\{ w ∈ A^* : w$ contains a $1$ in every position that is a power of ...

634 views

answered Jan 30, 2017

1 votes

63

Test by Bikram | Mock GATE | Test 2 | Question: 12
Why might quick sort be preferred over insertion sort and merge sort? The worst-case asymptotic algorithmic complexity of quick sort is superior to that of insertion sort and merge sort. In situations where little temporary space is available, ... on a long tape, the average run time of quick sort is superior to that of insertion and merge sort.

Why might quick sort be preferred over insertion sort and merge sort?The worst-case asymptotic algorithmic complexity of quick sort is superior to that of insertion sort ...

601 views

answered Jan 30, 2017

1 votes

64

Test by Bikram | Mock GATE | Test 2 | Question: 23
Suppose a user turns on a computer, starts a browser, types http://www.google.com, and hits ENTER. Which of the following protocols would probably not be used at any point to serve this request? $IP$ $TCP$ $UDP$ $SMTP$

Suppose a user turns on a computer, starts a browser, types http://www.google.com, and hits ENTER.Which of the following protocols would probably not be used at any point...

343 views

answered Jan 29, 2017

1 votes

65

Test by Bikram | Mock GATE | Test 2 | Question: 39
A relation can be defined by giving the ordered pairs of elements for which the relation holds. Let $R$ be defined over $\left \{ a,b,c \right \}$ by $R$ $=$ ... properties does $R$ have? Symmetry Antisymmetry Reflexivity Transitivity II and III only II and IV only I, III, and IV II, III, and IV

A relation can be defined by giving the ordered pairs of elements for which the relation holds.Let $R$ be defined over $\left \{ a,b,c \right \}$ by $R$ $=$ $\left \{ \le...

348 views

answered Jan 29, 2017

5 votes

66

Test by Bikram | Mock GATE | Test 2 | Question: 33
Let A represent the below matrix: $\begin{pmatrix} 1 & 0 & 3 \\ 2 & 1 & -1 \\ 1 & -1 & 1 \end{pmatrix}$ Then which among these four options are correct : $A^{3}$ $+ 3$ $A^{2}$ $+ A – 9I = 0$ $A^{3}$ $- 3$ $A^{2}$ $- A + 9I = 0$ $A^{3}$ $- 3$ $A^{2}$ $+ A + 9I = 0$ $A^{3}$+ 3$ $A^{2}$- A + 9I = 0$

Let A represent the below matrix:$\begin{pmatrix} 1 & 0 & 3 \\ 2 & 1 & -1 \\ 1 & -1 & 1 \end{pmatrix}$Then which among these four options are correct :$A^{3}$ $+ 3$ $A^{2...

414 views

answered Jan 29, 2017

3 votes

67

Test by Bikram | Mock GATE | Test 2 | Question: 22
A certain hard drive rotates at $6000$ $rpm$. It has $1 KB$ per sector and averages $128$ sectors per track. Consider the following statements: The average latency of the drive is under $6$ $milliseconds$. The burst data rate of the drive is ... . Which of the above statements is/are true? II and III only I, II, and III I and II only II only

A certain hard drive rotates at $6000$ $rpm$. It has $1 KB$ per sector and averages $128$ sectors per track.Consider the following statements:The average latency of the d...

503 views

answered Jan 29, 2017

3 votes

68

Test by Bikram | Mock GATE | Test 2 | Question: 34
Suppose that a certain computer with paged virtual memory has $4 KB$ pages, a $32-bit$ byte addressable virtual address space, and a $30-bit$ byte-addressable physical address space. The system manages an inverted page table, where ... ). Then the size of the basic inverted page table, including page numbers and overhead bits is ________ $bytes$.

Suppose that a certain computer with paged virtual memory has $4 KB$ pages, a $32-bit$ byte addressable virtual address space, and a $30-bit$ byte-addressable physical ad...

868 views

answered Jan 29, 2017

3 votes

69

UGC NET CSE | January 2017 | Part 3 | Question: 29
In RSA public key cryptosystem suppose $n=p*q$ where $p$ and $q$ are primes. $(e,n)$ and $(d,n)$ are public and private keys respectively. Let $M$ be an integer such that $o< M< n$ and $\phi(n)=(p-1)(q-1)$. Which of the following equations ... I and II I and III II and III I and IV

In RSA public key cryptosystem suppose $n=p*q$ where $p$ and $q$ are primes. $(e,n)$ and $(d,n)$ are public and private keys respectively. Let $M$ be an integer such that...

1.1k views

answered Jan 28, 2017

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