Answers by Soumya29 / GATE Overflow for GATE CSE

100 votes

1

GATE CSE 2019 | Question: 33
Assume that in a certain computer, the virtual addresses are $64$ bits long and the physical addresses are $48$ bits long. The memory is word addressible. The page size is $8$ kB and the word size is $4$ bytes. The Translation Look-aside Buffer (TLB) in the address translation path ... TLB miss? $16 \times 2^{10}$ $256 \times 2^{10}$ $4 \times 2^{20}$ $8 \times 2^{20}$

Assume that in a certain computer, the virtual addresses are $64$ bits long and the physical addresses are $48$ bits long. The memory is word addressible. The page size i...

21.6k views

answered Feb 7, 2019

7 votes

2

PI and EPI in case of Don't care
Consider the below function $f=\sum m(0,1,2,5,8,15)+d(6,7,10)$ In this Prime Implicant count comes-7 and Essential Prime Implicant Count comes 2. Please verify.

Consider the below function$f=\sum m(0,1,2,5,8,15)+d(6,7,10)$In this Prime Implicant count comes-7 and Essential Prime Implicant Count comes 2.Please verify.

5.5k views

answered Aug 16, 2018

6 votes

3

probability question
Consider 'A is a set containing n elements. A subset 'P' of 'A' is chosen at random The set 'A' is reconstructed by replacing the elements of 'A'. A subset 'Q' of 'A' is again chosen at random. What is the probability that 'P' and 'Q' have no common element?

Consider 'A is a set containing n elements. A subset 'P' of 'A' is chosen at random The set 'A' is reconstructed by replacing the elements of 'A'. A subset 'Q' of 'A' is ...

836 views

answered Aug 9, 2018

3 votes

4

MadeEasy Test Series: General Aptitude - Verbal Ability
Consider there are two tribes living on the Island: Knights and knaves. Knights always tell truth while Knaves always tells lie. Suppose we counter two random people A and B, upon asking a question to A', A says If B is Knight then I am a Knave . ... Knave b.) A is Knave and B is Knave c.) Both A and B are Knight d.) Both A and B are Knave

Consider there are two tribes living on the Island: Knights and knaves. Knights always tell truth while Knaves always tells lie. Suppose we counter two random people A an...

572 views

answered Aug 6, 2018

8 votes

5

Ace algorithms
What is the time complexity? int i,j,k,x=0; for(i=1;i<=n;i++) for(j=1;j<=i*i;j++) { if (j mod i ==0) for(k=1;k<=j;k++) x=x+10; }

What is the time complexity?int i,j,k,x=0;for(i=1;i<=n;i++)for(j=1;j<=i*i;j++){if (j mod i ==0)for(k=1;k<=j;k++)x=x+10;}

805 views

answered Aug 3, 2018

1 votes

6

Minterm
I had a slight doubt as regards with Minterm. How the output is 1 in the truth table values of the minterms?Please explain in detail.

I had a slight doubt as regards with Minterm. How the output is 1 in the truth table values of the minterms?Please explain in detail.

800 views

answered Jul 19, 2018

4 votes

7

Kenneth Rosen Edition 6th Exercise 6.6 Question 11 (Page No. 457)
In how many different ways can seven different jobs be assigned to four different employees so that each employee is assigned at least one job and the most difficult job is assigned to the best employee? I got the first ... 4 elements. But how to deal with the second part that most difficult job is assigned to the best employee?

In how many different ways can seven different jobs be assigned to four different employees so that each employee is assigned at least one job and the most difficult job ...

2.7k views

answered Jun 28, 2018

2 votes

8

combinatorics
let say there are three elements in a set {1,2,3}.find total #of 4 digit no. which are neither non decreasing nor non increasing.

let say there are three elements in a set {1,2,3}.find total #of 4 digit no. which are neither non decreasing nor non increasing.

479 views

answered Jun 28, 2018

1 votes

9

Rosen (Nested Quantifiers)
If we think about nested quantifiers as nested loops ∀x((F (x) ∧ P(x)) → ∃yM(x, y)) for this then when we are iterating for outer loop x and we find the LHS to be true then only iterate in internal loop of y whether she is ... (x, y) } } We are making unnecessary comparisons here. So how could we move that existential quantifier in beginning? What is null quantification?

If we think about nested quantifiers as nested loops ∀x((F (x) ∧ P(x)) → ∃yM(x, y)) for this then when we are iterating for outer loop x and we find the LHS to b...

1.3k views

answered Jun 25, 2018

3 votes

10

Kenneth Rosen Edition 6th Exercise 5.1 Question 23c (Page No. 345)
How many strings of three decimal digits can be formed such that they have exactly two digits that are 4's. My approach as to select 2 positions for these 4's in $\binom{3}{2}$ ways and the last bit will have 10 choices.Now I can permute ... should be $\binom{3}{2}$ * 10*$\frac{3!}{2!}$ = 90. But the answer is 27. How?

How many strings of three decimal digits can be formed such that they have exactly two digits that are 4's.My approach as to select 2 positions for these 4's in $\binom{3...

303 views

answered Jun 23, 2018

1 votes

11

pipelining
A CPU has five-stage pipeline where each stage takes 1ns, 2ns, 1.5ns, 3ns, 2.5ns. Instruction fetch happens in the first stage of the pipeline. Branch instructions are not overlapped. i.e., the instruction after the branch is not fetched ... one clock cycle. 30% of the instructions are conditional branches. Find the average execution time of the program for 1200 instructions is ________

A CPU has five-stage pipeline where each stage takes 1ns, 2ns, 1.5ns, 3ns, 2.5ns. Instruction fetch happens in the first stage of the pipeline. Branch instructions are no...

1.2k views

answered Jun 8, 2018

1 votes

12

set theory
How many relation possible with $n$ elements of a set which are symmetric but not antisymmetric ?

How many relation possible with $n$ elements of a set which are symmetric but not antisymmetric ?

632 views

answered Jun 5, 2018

9 votes

13

Find the language
1)$L_{1}=\left \{ a^{2^{n}} \right \}$ where n is a positive integer. Is it Reguler, CFL or CSL? 2)$L_{2}=\left \{ (a^{n})^{m}.b^{n}|n,m\geq 1 \right \}$ Is it Regular CFL or CSL?

1)$L_{1}=\left \{ a^{2^{n}} \right \}$ where n is a positive integer.Is it Reguler, CFL or CSL?2)$L_{2}=\left \{ (a^{n})^{m}.b^{n}|n,m\geq 1 \right \}$ Is it Regular CFL ...

2.2k views

answered Jun 3, 2018

4 votes

14

Addressing mode

1.1k views

answered May 27, 2018

11 votes

15

Fork Output
#include<stdio.h> #include<sys/types.h> #include<unistd.h> void forkexample() { int x = 1; if (fork() == 0) printf("Child has x = %d\n", ++x); else printf("Parent has x = %d\n", --x); } int main() { forkexample(); return 0; ... = 2 (or) Child has x = 2 Parent has x = 0 I guess both because we dont know who will return first parent or child is it ?

#include<stdio.h #include<sys/types.h #include<unistd.h void forkexample() { int x = 1; if (fork() == 0) printf("Child has x = %d\n", ++x); else printf("Parent has x = %d...

4.0k views

answered May 25, 2018

5 votes

16

kenneth rosen chapter 5 exercise 5.5 ques 51
How many ways are there to distribute six distinguishable objects into four indistinguishable objects so that each of the boxes contain at least one object?? Plss tell how to solve questions based on distributing Distinguishable objects ... boxes and Indistinguishable objects into indistinguishable boxes. I am not able to solve problem based on these.

How many ways are there to distribute six distinguishable objects into four indistinguishable objects so that each of the boxes contain at least one object??Plss tell how...

2.0k views

answered May 17, 2018

0 votes

17

SELF DOUBT
it is confirmed that every LL(1) is LR(1) i.e CLR(1),but i want to know that is every LL(1) grammar is also LALR????? becz LALR is subset of CLR(1).

it is confirmed that every LL(1) is LR(1) i.e CLR(1),but i want to know that is every LL(1) grammar is also LALR????? becz LALR is subset of CLR(1).

306 views

answered May 17, 2018

3 votes

18

question of type where propagation delay is given

3.0k views

answered May 15, 2018

7 votes

19

Set Theory
How to distinguish between countably finite , countably infinite , uncountably infinite set? for reference see this ques:https://gateoverflow.in/36654/why-set-of-all-functions-f-n-0-1-is-uncountably-infinite

How to distinguish between countably finite , countably infinite , uncountably infinite set?for reference see this ques:https://gateoverflow.in/36654/why-set-of-all-funct...

1.2k views

answered May 15, 2018

4 votes

20

IISc CDS(MTech -R)
There are 12 pair of shoes, what is the probability that atleast one complete pair of shoes are present if 4 shoes are selected at random?

There are 12 pair of shoes, what is the probability that atleast one complete pair of shoes are present if 4 shoes are selected at random?

1.2k views

answered May 4, 2018

11 votes

21

Connected Components
My Doubt is :- 1. If n vertices are there and p are the connected components then total n-p edges will be there. 2. In a simple graph with n vertices and p connected components there are atmost (n-p)(n-p+1)/2 number of edges Now which to ... the answer. Solution of made easy:- (Please tell how did they approached the question and which way is the best way to do such questions)

My Doubt is :- 1. If n vertices are there and p are the connected components then total n-p edges will be there.2. In a simple graph with n vertices and p connected compo...

7.0k views

answered May 2, 2018

1 votes

22

#Rosen Mathematics Question
Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, and the ordering of elements of U has the elements in increasing order; that is, ai = i. What bit strings represent the subset of all odd integers in U, the subset of all even integers in U, and the subset of integers not exceeding 5 in U?

Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, and the ordering of elements of U has the elements inincreasing order; that is, ai = i. What bit strings represent the subset of ...

2.4k views

answered May 1, 2018

7 votes

23

ISI 2014 PCB A2
Let $m$ and $n$ be two integers such that $m \geq n \geq 1.$ Count the number of functions $f : \{1, 2, \ldots , n\} \to \{1, 2, \ldots , m\}$ of the following two types: strictly increasing; i.e., whenever $x < y, f(x) < f(y),$ and non-decreasing; i.e., whenever $x < y, f(x) ≤ f(y).$

Let $m$ and $n$ be two integers such that $m \geq n \geq 1.$ Count the number of functions $f : \{1, 2, \ldots , n\} \to \{1, 2, \ldots , m\}$ of the following two types:...

1.9k views

answered May 1, 2018

4 votes

24

Computability
Why????

Why????

442 views

answered May 1, 2018

2 votes

25

TOC regular language
L={a^n b^n :n>=1} and R = (a+b)^* L union R is going to be regular or not regular plzz give reason L is not regular if N leads to infinity then how it can be regular ..........

L={a^n b^n :n>=1} and R = (a+b)^* L union R is going to be regular or not regular plzz give reason L is not regular if N leads to infinity then how it can be regular .......

402 views

answered May 1, 2018

1 votes

26

C Programming
main() { if(fork()>0) sleep(100); } The given code results in the creation of: I) an orphan process II) a zombie process III) a process that executes forever IV) None of these Can someone explain this?

main(){if(fork()>0)sleep(100);}The given code results in the creation of:I) an orphan processII) a zombie processIII) a process that executes foreverIV) None of these Ca...

9.9k views

answered Apr 30, 2018

8 votes

27

Minimum Spanning Tree
1) Kruskal Algorithm 2) Prims Algorithm 3) Dijkstra Algorithm 4) Bellman Ford Algorithm 5) Floyd Warshall Algorithm Among these which one works for only i) Positive edge weight ii) Negative edge weight iii) Negative weight cycle

1) Kruskal Algorithm2) Prims Algorithm3) Dijkstra Algorithm4) Bellman Ford Algorithm5) Floyd Warshall AlgorithmAmong these which one works for onlyi) Positive edge weight...

3.2k views

answered Apr 30, 2018

6 votes

28

Counting
Show that, in a grid, the number of paths from $(0,0)$ to $(n,n)$ which does not cross ( it could touch ) the line $x = y$ is \begin{align*} \frac{1}{1+n}\binom{2\cdot n}{n} = \binom{2\cdot n}{n} - \binom{2\cdot n}{n-1} \end{align*} After that, show the number of balanced paranthesis strings of length $2n$ is same as the above result.

Show that, in a grid, the number of paths from $(0,0)$ to $(n,n)$ which does not cross ( it could touch ) the line $x = y$ is \begin{align*} \frac{1}{1+n}\binom{2\cdot n...

2.5k views

answered Apr 30, 2018

6 votes

29

IIT KANPUR SAMPLE PAPER 2018
A symmetric matrix X is said to be diagonalizable if we can express it as X = P DP −1 where P is an invertible matrix and D is a diagonal matrix. For a diagonalizable matrix X, how many matrix multiplications would be required to compute X4 = X ∗ X ∗ X ∗ X? Why?

A symmetric matrix X is said to be diagonalizable if we can express it as X = P DP −1 where P is an invertible matrix and D is a diagonal matrix. For a diagonalizable m...

472 views

answered Apr 30, 2018

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