Recent activity by humblefool / GATE Overflow for GATE CSE

5 answers

1

CMI2013-A-02
$10\%$ of all email you receive is spam. Your spam filter is $90\%$ reliable: that is, $90\%$ of the mails it marks as spam are indeed spam and $90\%$ of spam mails are correctly labeled as spam. If you see a mail marked spam by your filter, what is the probability that it really is spam? $10\%$ $50\%$ $70\%$ $90\%$

$10\%$ of all email you receive is spam. Your spam filter is $90\%$ reliable: that is, $90\%$ of the mails it marks as spam are indeed spam and $90\%$ of spam mails are c...

7.9k views

comment edited Jan 25, 2018

0 answers

2

Query regarding P NP
I know this questions is already asked but no answers are yet given IS P NP STILL PRESENT IN GATE 2018 SYLLABUS? The Official Syllabus EXCLUDES those topics and according to https://gatecse.in/gate-cse-2016-syllabus/ , the P NP is NOT THERE. But ... verify it. And please dont say, "it is better to read" because although knowledge is good but time is precious :-)

I know this questions is already asked but no answers are yet givenIS P NP STILL PRESENT IN GATE 2018 SYLLABUS? The Official Syllabus EXCLUDES those topics and according ...

959 views

asked Jan 6, 2018

0 answers

3

Microprogramming
In horizontal micro-programming the control word is of the following format: Flag bits Control Signal Bits Next Control Word Address I know that the Control Signal bits denote which micro-operation to execute. My question is does 1 bit of control ... that Scenario 2 is the correct one i.e. 1 control signal bit in horizontal microprogramming denotes 1 micro-operation entirely?

In horizontal micro-programming the control word is of the following format:Flag bitsControl Signal BitsNext Control Word AddressI know that the Control Signal bits denot...

719 views

asked Jan 4, 2018

3 answers

4

GATE CSE 1997 | Question: 5.3
A micro instruction is to be designed to specify: none or one of the three micro operations of one kind and none or upto six micro operations of another kind The minimum number of bits in the micro-instruction is: $9$ $5$ $8$ None of the above

A micro instruction is to be designed to specify:none or one of the three micro operations of one kind andnone or upto six micro operations of another kindThe minimum num...

11.5k views

commented Jan 4, 2018

11 answers

5

TIFR CSE 2012 | Part A | Question: 1
Amar and Akbar both tell the truth with probability $\dfrac{3 } {4}$ and lie with probability $\dfrac{1}{4}$. Amar watches a test match and talks to Akbar about the outcome. Akbar, in turn, tells Anthony, "Amar told me that India won". What ... $\left(\dfrac{7}{16}\right)$ $\left(\dfrac{10}{16}\right)$ None of the above

Amar and Akbar both tell the truth with probability $\dfrac{3 } {4}$ and lie with probability $\dfrac{1}{4}$. Amar watches a test match and talks to Akbar about the outco...

9.4k views

answer edited Dec 23, 2017

1 answer

6

Problem regarding mutual exclusion
Process P1 Process P2 P(S1) P(S1) P(S2) P(S2) Critical Section Critical Section V(S2) V(S1) V(S1) V(S2) In one of the Gateoverflow tests, this question was given and it was told that in the above case mutual exclusion is not ... section. As far as the order of unlocking, I dont see a problem there. Can someone please explain why mutual exclusion is not guaranteed?

Process P1Process P2P(S1)P(S1)P(S2)P(S2)Critical SectionCritical SectionV(S2)V(S1)V(S1)V(S2)In one of the Gateoverflow tests, this question was given and it was told that...

910 views

asked Dec 13, 2017

2 answers

7

Question on software installation
The installation approach in which totally removing the old manual or computerized system and putting the new system in use : Parallel run Phased approach Pilot installation None of these

The installation approach in which totally removing the old manual or computerized system and putting the new system in use :Parallel runPhased approachPilot installation...

1.5k views

answered Dec 12, 2017

4 answers

8

UGC NET CSE | November 2017 | Part 2 | Question: 42
Software re-engineering is concerned with Re-constructing the original source code from the existing machine (low-level) code program and modifying it ti make it more user-friendly Scrapping the source code of a software and re- ... to make them more maintainable Translating source code of an existing software to a new machine (low-level) language

Software re-engineering is concerned withRe-constructing the original source code from the existing machine (low-level) code program and modifying it ti make it more user...

1.2k views

answered Dec 12, 2017

3 answers

9

UGC NET CSE | November 2017 | Part 2 | Question: 43
Which of the following is not a key issue stressed by an agile philosophy of software engineering? The importance of self-organizing teams as well as communication and collaboration between team members and customers Recognition that ... on rapid delivery of software that satisfies the customer Having a separate testing phase after a build phase

Which of the following is not a key issue stressed by an agile philosophy of software engineering?The importance of self-organizing teams as well as communication and col...

1.6k views

answered Dec 12, 2017

0 answers

10

Inherently Ambiguous Grammar
Is every language that is generated by a NDCFG (Non Deterministic Context Free Grammar) , CSG (Context Sensitive Grammar) and Unrestricted Grammar inherently ambiguous ? I think so because they dont have a DPDA accepting that language. And as far as I ... there are no "parse trees" as such. So how do I determine if the language is inherently ambiguous or not?

Is every language that is generated by a NDCFG (Non Deterministic Context Free Grammar) , CSG (Context Sensitive Grammar) and Unrestricted Grammar inherently ambiguous ?I...

1.4k views

edited Nov 17, 2017

1 answer

11

Minimum DFA Construction
Construct the minimum DFA accepting language L over {a, b} where the 5th symbol and the 10th symbol from LHS is different. It is given that the minimum DFA has 12 states. But I am getting many more states. Could someone please provide a diagram that involves only 12 states?

Construct the minimum DFA accepting language L over {a, b} where the 5th symbol and the 10th symbol from LHS is different. It is given that the minimum DFA has 12 states....

992 views

asked Nov 16, 2017

1 answer

12

Binary Tree construction
Given the preorder/postorder and inorder traversal of a binary tree, we can always construct a unique binary tree (I think so, correct me if I am wrong) Construct a binary tree with the nodes A, B, C such that its preorder traversal is ABC and its inorder traversal is CAB.

Given the preorder/postorder and inorder traversal of a binary tree, we can always construct a unique binary tree (I think so, correct me if I am wrong)Construct a binary...

1.2k views

commented Nov 10, 2017

1 answer

13

Cut Sets in graph
Question: Number of cut sets possible a tree with 10 vertices _________ My approach : Number of edges in a tree with 10 vertices = 9. Each of these can be considered as a cut set as deleting one edge necessarily disconnects the graph. Also any combination (I mean ... cut sets = 2^9 - 1 = 511. But the answer is written 9. Apparently they are not considering the super sets. Why?

Question: Number of cut sets possible a tree with 10 vertices _________My approach : Number of edges in a tree with 10 vertices = 9. Each of these can be considered as a...

3.5k views

commented Nov 9, 2017

0 answers

14

Question regarding BCNF Normalization
I came across a statement that says that in BCNF, a prime attribute cannot be transitively dependent on a key. But consider a relation R (A, B, C) where, A --> ABC , B --> ABC , C --> ABC Clearly it is in BCNF and each of A ... > C . Thus, we can tell C(a prime attribute) is transitively dependent on A (a candidate key) !! Where am I making mistake?

I came across a statement that says that in BCNF, a prime attribute cannot be transitively dependent on a key.But consider a relation R (A, B, C) where, A ABC , ...

264 views

asked Nov 8, 2017

2 answers

15

Number of states in a minimal DFA construction
Suppose L is a regular language of all a's and b's where the number of a's is divisible by m and the number of b's is divisible by n. If M is the minimal DFA accepting language L, then what is the number of states in M ? Is it nm or (n+1)(m+1) ?

Suppose L is a regular language of all a's and b's where the number of a's is divisible by m and the number of b's is divisible by n. If M is the minimal DFA accepting la...

1.7k views

asked Nov 2, 2017

1 answer

16

NIELIT Exam date
I have applied for NIELIT "Scientist B" post through http://apply-delhi.nielit.gov.in/. The last date for submission for online application was 22 September. However I don't know when the exam will be held. Neither the official website nor the internet has ... but they dont reply to any of the emails. If someone could tell me the date of the exam, it would be great.

I have applied for NIELIT "Scientist B" post through http://apply-delhi.nielit.gov.in/. The last date for submission for online application was 22 September. However I do...

602 views

asked Oct 20, 2017

1 answer

17

Number System
How do I calculate (-54)10 in hexadecimal? The way I am doing it currently is that I am first converting (54)10 into hexadecimal which is (34)16. Next I am taking 16's complement. i.e. I am doing (FF)16 - (34)16 + 1, which comes to (CA)16. Thus, (-54)10 = (CA)16. Is this the right way to convert or is there some better method ?

How do I calculate (-54)10 in hexadecimal? The way I am doing it currently is that I am first converting (54)10 into hexadecimal which is (34)16. Next I am taking 16's co...

1.1k views

asked Sep 25, 2017

0 answers

18

Cannot understand a field while filling TIFR Online application
This is regarding TIFR Online application. I am unable to understand what value to enter in a particular field in the online application form for GS-2018. In the section under "Educational Details", there are 5 columns - ... etc). So what should I type in the Class column, provided that it is not accepting empty values ?

This is regarding TIFR Online application. I am unable to understand what value to enter in a particular field in the online application form for GS-2018. In the section ...

440 views

retagged Sep 16, 2017

6 answers

19

GATE IT 2006 | Question: 51
Which one of the choices given below would be printed when the following program is executed? #include <stdio.h> int a1[] = {6, 7, 8, 18, 34, 67}; int a2[] = {23, 56, 28, 29}; int a3[] = {-12, 27, -31}; int *x[] = {a1, a2, a3}; void print(int *a[]) { printf("%d," ... (x); } $8, -12, 7, 23, 8$ $8, 8, 7, 23, 7$ $-12, -12, 27, -31, 23$ $-12, -12, 27, -31, 56$

Which one of the choices given below would be printed when the following program is executed? #include <stdio.h int a1[] = {6, 7, 8, 18, 34, 67}; int a2[] = {23, 5...

13.0k views

commented Aug 18, 2017

4 answers

20

paging
Q. Suppose you have a computer system with a 48-bit logical address, page size of 16KB and 4 bytes per page table entry. If we have a 48MB program such that the entire program and all necessary page tables are in memory. Assume that each page table at diff level fits in a single page.How much memory is used by program, including its page tables?

Q.Suppose you have a computer system with a 48-bit logical address, page size of 16KB and 4 bytes per page table entry. If we have a 48MB program such that the entire pro...

6.9k views

commented Jul 19, 2017

2 answers

21

OS PAGING William stallings
Consider a virtual memory system with 32-bit virtual addresses and 1 KB pages. Each page table entry requires 32- bits. It is desired to limit the page table size to one page. How many levels of page tables required? Also find the size memory ... solution. I am weak in understanding these concepts. Answer for the first one is 3 and for the second one is 8208 bytes.

Consider a virtual memory system with 32-bit virtual addresses and 1 KB pages. Each page table entry requires 32- bits. It is desired to limit the page table size to one ...

9.3k views

comment edited Jul 19, 2017

1 answer

22

Kenneth Rosen Edition 6th Exercise 7.5 Question 3 d (Page No. 507)
R is a relation on the set of all functions from Z to Z. R = { (f, g) | for some C ∈ Z , for all x ∈ Z , f(x) - g(x) = C } is it Equivalence relation or not ?

R is a relation on the set of all functions from Z to Z.R = { (f, g) | for some C ∈ Z , for all x ∈ Z , f(x) - g(x) = C } is it Equivalence relation or not ?

611 views

answered Jul 7, 2017

2 answers

23

gray code
Consider numbers represented in 4-bit gray code. Let h3h2h1h0 be the gray code representation of a number n and let g3g2g1g0 be the gray code of (n + 1) (modulo 16) value of the number. Which one of the following functions is correct? (a) g0 (h3,h2, h1, h0) = Ʃ (1, 2, 3, 6, 10, 13, 14, 15) (b) g1 ( ... = Ʃ (2, 4, 5, 6, 7, 12, 13, 15) (d) g3 (h3,h2, h1, h0) = Ʃ (0, 1, 6, 7, 10, 11, 12, 13)

Consider numbers represented in 4-bit gray code. Let h3h2h1h0 be the gray code representationof a number n and let g3g2g1g0 be the gray code of (n + 1) (modulo 16) value ...

1.1k views

answered Jul 7, 2017

1 answer

24

computer network
how to find 8^11 mod 65 please help

how to find 8^11 mod 65please help

522 views

answered Jul 7, 2017

1 answer

25

explain the output please.
#include <stdio.h> int main() { char a = '\''; printf("%c", a); return 0; }

#include <stdio.h>int main(){char a = '\'';printf("%c", a);return 0;}

343 views

answered Jul 7, 2017

1 answer

26

Relation and Partial order
Is (S, R) a poset if S is the set of all people in the world and (a, b) ∈ R, where a and b are people, if a is not taller than b?

Is (S, R) a poset if S is the set of all people in the world and (a, b) ∈ R, where a and b are people,if a is not taller than b?

2.6k views

answered Jul 7, 2017

1 answer

27

algorithm
.a A nswer is nlogn by master method , but iam not able to solve this equation by this method can any one solve this and please tell me where iam wrong thanks

.a A nswer is nlogn by master method , but iam not able to solve this equation by this method can any one solve this and please t...

347 views

answered Jul 7, 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