Hot questions / GATE Overflow for GATE CSE

2 votes

1 answer

19321

Made Easy Test Series:Programming & DS
Suppose a queue $Q$ and two stacks $S_{1}$ and $S_{2}$ as given below. void enqueue(Q,x){ push(S1,x); } void dequeue(Q,x){ if(stack-empty(S2))then if(stack-empty(S1))then{ print("Q is empty"); return; } else while ... $Enqueue(4),Enqueue(3),Enqueue(2),Dequeue, Enqueue(6),Dequeue,Dequeue, Dequeue,Enqueue(5)$ Please tell value of X and Y are u getting

Suppose a queue $Q$ and two stacks $S_{1}$ and $S_{2}$ as given below.void enqueue(Q,x){ push(S1,x); } void dequeue(Q,x){ if(stack-empty(S2))then if(stack-empty(S1))then{...

srestha

533 views

srestha asked Apr 24, 2019

0 votes

1 answer

19322

IIT Guwahati Form Filling
I couldn't find separate application forms for mtech in cs and mtech in data science at IIT Guwahati. The following is the link to apply for mtech: http://www.iitg.ac.in/acad/Admission_July2019/mtech.html But nowhere have they mentioned to choose data science or computer science in the form. Is there a separate form for both?

I couldn't find separate application forms for mtech in cs and mtech in data science at IIT Guwahati.The following is the link to apply for mtech:http://www.iitg.ac.in/ac...

shraddha priya

1.2k views

shraddha priya asked Mar 31, 2019

0 votes

1 answer

19323

For All & There Exist property
is For All V is distributive on AND operator? ----1 is ‘’there exist’’ is distributive over OR operator? ----2 I have example in which this is true , but is true in general? so logically checking without using any property above four statements are correct. But is 1 and 2 always correct?

is For All V is distributive on AND operator? 1is ‘’there exist’’ is distributive over OR operator? 2I have example in which this is true , but is true in ...

mehul vaidya

2.3k views

mehul vaidya asked Feb 14, 2019

0 votes

2 answers

19324

UGC NET CSE | June 2014 | Part 3 | Question: 07
Given $U=\{1, 2, 3, 4, 5, 6, 7 \} \\ A =\{(3, 0.7), (5, 1), (6, 0.8) \}$ then $\tilde{A}$ will be: (where $\sim \rightarrow$ complement) $\{(4, 0.7), (2, 1), (1, 0.8)\}$ $\{(4, 0.3), (5, 0), (6, 0.2)\}$ $\{(1, 1), (2, 1), (3, 0.3), (4, 1), (6, 0.2), (7, 1) \}$ $\{(3, 0.3), (6, 0.2)\}$

Given$U=\{1, 2, 3, 4, 5, 6, 7 \} \\ A =\{(3, 0.7), (5, 1), (6, 0.8) \}$then $\tilde{A}$ will be: (where $\sim \rightarrow$ complement)$\{(4, 0.7), (2, 1), (1, 0.8)\}$$\{(...

go_editor

6.4k views

go_editor asked Jan 5, 2017

1 votes

0 answers

19325

Morris Mano Edition 3 Exercise 6 Question 3 (Page No. 252)
The D FLip-flop can be constructed with the four NAND gates only. This can be done by removing gate number 5 from the circuit and, instead, connecting the output of gate number 3 the input of gate number 4. Draw the Modified circuit and show that it operates in the same way as the original circuit operates .

The D FLip-flop can be constructed with the four NAND gates only. This can be done by removing gate number 5 from the circuit and, instead, connecting the output of gate ...

ajaysoni1924

830 views

ajaysoni1924 asked Apr 4, 2019

0 votes

1 answer

19326

DBMS Korth Edition 4 Exercise 12 Question 10 (Page No. 491)
Explain the distinction between closed and open hashing. Discuss the relative merits of each technique in database applications.

Explain the distinction between closed and open hashing. Discuss the relative merits of each technique in database applications.

akash.dinkar12

1.1k views

akash.dinkar12 asked Apr 1, 2019

1 votes

2 answers

19327

Test by Bikram | Algorithms | Test 2 | Question: 1
Which of the following theorems can solve all Recurrence Relations? Mater Tehorem Akra-Bazzi Theorem Both [A] and [B] Akra-Bazzi can be applied to some cases but not for all.

Which of the following theorems can solve all Recurrence Relations?Mater TehoremAkra-Bazzi TheoremBoth [A] and [B]Akra-Bazzi can be applied to some cases but not for all....

Bikram

488 views

Bikram asked May 26, 2017

2 votes

2 answers

19328

pigeonhole
Prove that at a party where there are at least two people, there are two people who know the same number of other people there.

Prove that at a party where there are at least two people, there are two people who know the same number of other people there.

Anu

2.1k views

Anu asked Jul 14, 2015

0 votes

1 answer

19329

IIT Madras MS written test 2019 - TOC - 1
Let L1 and L2 be 2 languages which are not regular. Which of these is true? The union of L1 and L2 is not regular. The intersection of L1 and L2 is not regular. Both I and II are true I is true, II is false I is false, II is true Both I and II are false

Let L1 and L2 be 2 languages which are not regular. Which of these is true?The union of L1 and L2 is not regular.The intersection of L1 and L2 is not regular.Both I and I...

SPluto

615 views

SPluto asked May 2, 2019

1 votes

1 answer

19330

NIELIT 2018-28
For the function $(z) = \frac{1}{z^2(e^z-1)}, z=0$ is a pole of order: $1$ $2$ $3$ None of these

For the function $(z) = \frac{1}{z^2(e^z-1)}, z=0$ is a pole of order:$1$$2$$3$None of these

Arjun

1.7k views

Arjun asked Dec 7, 2018

0 votes

1 answer

19331

Probability - Gravner-49.c
You have $16$ balls, $4$ green, and $9$ red. You also have $3$ urns. For each of the $16$ balls. you select an urn at random and put the ball into it.(Urns are large enough to accommodate any number of balls.) (c) What is the probability that each urn contains all three colors?

You have $16$ balls, $4$ green, and $9$ red. You also have $3$ urns. For each of the $16$ balls. you select an urn at random and put the ball into it.(Urns are large enou...

Pooja Khatri

589 views

Pooja Khatri asked Sep 24, 2018

0 votes

2 answers

19332

Morris Mano Edition 3 Exercise 1 Question 7 (Page No. 33)
Convert the hexadecimal number F3A7C2 to the binary

Convert the hexadecimal number F3A7C2 to the binary

ajaysoni1924

1.5k views

ajaysoni1924 asked Mar 30, 2019

0 votes

1 answer

19333

BOOLEAN FUNCTION (Morris Mano)

altamash

519 views

altamash asked May 6, 2019

0 votes

1 answer

19334

Made Easy Test Series: Programming-Recursive and Iterative Program
$I=$Iterative Program $R=$ Recursive Program $(A)$ For every program belonging to class $I$, there is an equivalent program to class $R.$ $(B)$ Every program in $R$ uses strictly more stack space compared to equivalent program in $I.$ Among $(A)$ and $(B)$ which one is correct?

$I=$Iterative Program$R=$ Recursive Program$(A)$ For every program belonging to class $I$, there is an equivalent program to class $R.$$(B)$ Every program in $R$ uses str...

srestha

339 views

srestha asked May 3, 2019

2 votes

0 answers

19335

Morris Mano Edition 3 Exercise 4 Question 17,18 (Page No. 150)
Analyze the two output combinational circuit shown in the figure. find the boolean fi=unction for the two outputs as the function of the three inputs and explain the circuit operation. derive the truth table of the circuit shown in the figure.

Analyze the two output combinational circuit shown in the figure. find the boolean fi=unction for the two outputs as the function of the three inputs and explain the circ...

ajaysoni1924

660 views

ajaysoni1924 asked Apr 2, 2019

1 votes

1 answer

19336

Subnetting
An ISP granted the block of addresses starting with 10.80.0.0/16 . ISP want to distribute it four groups of customers . A)first group has 64 customers, each need 256 addresses B) second gp has 128 customers, each need 128 addresses C) third gp ... D) and last gp also has 64 customers, each need 32 addresses. Design the subblock and how many addresses still available after allocation ?

An ISP granted the block of addresses starting with 10.80.0.0/16 . ISP want to distribute it four groups of customers .A)first group has 64 customers, each need 256 ad...

Aks9639

5.7k views

Aks9639 asked Dec 19, 2018

27 votes

3 answers

19337

GATE CSE 2004 | Question: 35
Consider the label sequences obtained by the following pairs of traversals on a labeled binary tree. Which of these pairs identify a tree uniquely? preorder and postorder inorder and postorder preorder and inorder level order and postorder I only II, III III only IV only

Consider the label sequences obtained by the following pairs of traversals on a labeled binary tree. Which of these pairs identify a tree uniquely?preorder and postorderi...

Kathleen

9.1k views

Kathleen asked Sep 18, 2014

0 votes

0 answers

19338

What would be the upper and lower bound for this decreasing function or invalid case? #Algorithm #Asymtotic-notations

aniketpatil32

497 views

aniketpatil32 asked May 10, 2019

0 votes

0 answers

19339

set associative (carl hamacher)
Block set associative cache consists of a total of 64blocks divided into 4blocks sets .The main memory contains 4096blocks ,each consisting of 128 words. how many bits for Main memory how many bits for TAG,SET,WORD . solution: MM=block size*words 2^12 * 2^7=19 bits TAG=9 SET=4 WORD=6 is this correct method or not please correct me

Block set associative cache consists of a total of 64blocks divided into 4blocks sets .The main memory contains 4096blocks ,each consisting of 128 words.how many bits for...

altamash

504 views

altamash asked May 13, 2019

2 votes

0 answers

19340

Morris Mano Edition 3 Exercise 9 Question 3 (Page No. 392)
an asynchronous circuit is described by the following excitation and output functions: $Y = x _1x _2’ + (x _1 + x _2’)y$ $z = y$ Draw the logic diagram of the circuit. Derive the transition table and the output map. obtain a two-state flow table. Describe in the words the behavior of the circuit.

an asynchronous circuit is described by the following excitation and output functions:$Y = x _1x _2’ + (x _1 + x _2’)y$$z = y$Draw the logic diagram of the circuit.D...

ajaysoni1924

741 views

ajaysoni1924 asked Apr 7, 2019

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