Recent activity by Spidey_guy / GATE Overflow for GATE CSE

1 answer

1

Zeal Test Series: Mathematical Logic - First Order Logic
1)How to do question no. 34,36

1)How to do question no. 34,36

573 views

commented Jan 5, 2020

1 answer

2

B+ tree sum at height 1
I am getting sum 22, answer given was 18. Here is my B+ tree :

I am getting sum 22, answer given was 18.Here is my B+ tree :

506 views

answered Jan 5, 2020

1 answer

3

Merge Sort Inplace
no of comparisons in merge sort max? how many max no swaps??[if inplace algo]

no of comparisons in merge sort max?how many max no swaps??[if inplace algo]

644 views

answered Jan 3, 2020

1 answer

4

Merge Sort
What mean by First Pass of algorithm and Second Pass of algorithm in a 2-way Merge Sort Algorithm ?

What mean by First Pass of algorithm and Second Pass of algorithm in a 2-way Merge Sort Algorithm ?

1.4k views

commented Jan 3, 2020

4 answers

5

TIFR CSE 2011 | Part A | Question: 3
The probability of three consecutive heads in four tosses of a fair coin is $\left(\dfrac{1}{4}\right)$ $\left(\dfrac{1}{8}\right)$ $\left(\dfrac{1}{16}\right)$ $\left(\dfrac{3}{16}\right)$ None of the above

The probability of three consecutive heads in four tosses of a fair coin is$\left(\dfrac{1}{4}\right)$$\left(\dfrac{1}{8}\right)$$\left(\dfrac{1}{16}\right)$$\left(\dfrac...

2.7k views

commented Jan 2, 2020

3 answers

6

Radix Sort Problem
The complexity of Radix Sort is $O(wn)$, for $n$ keys which are integers of word size $w$. Here, $w=log_2(n^k)=k\times log_2(n)$ So, the complexity is $O(wn)=O(k\times log_2(n)\times n)$ For instance if size is $n^3$ the complexity ... Then why we say radix sort sorts the input in linear time? Similar Concept used to solve : https://gateoverflow.in/3353/gate2008-it-43

The complexity of Radix Sort is $O(wn)$, for $n$ keys which are integers of word size $w$.Here, $w=log_2(n^k)=k\times log_2(n)$So, the complexity is $O(wn)=O(k\times log_...

1.0k views

answered Jan 1, 2020

2 answers

7

#TOC What will be the minimal DFA of this regular language?
Given L = { 0*1 + 0 + 1* + 10*1} where + symbol is UNION and NOT positive closure. Please draw the Minimal DFA for this.

Given L = { 0*1 + 0 + 1* + 10*1}where + symbol is UNION and NOT positive closure.Please draw the Minimal DFA for this.

927 views

commented Dec 31, 2019

2 answers

8

Michael Sipser Edition 3 Exercise 1 Question 71 (Page No. 93)
Let $\sum = \{0,1\}$ Let $A=\{0^{k}u0^{k}|k\geq 1$ $\text{and}$ $u\in \sum^{*}\}.$ Show that $A$ is regular. Let $B=\{0^{k}1u0^{k}|k\geq 1$ $\text{and}$ $u\in \sum^{*}\}.$Show that $B$ is not regular.

Let $\sum = \{0,1\}$Let $A=\{0^{k}u0^{k}|k\geq 1$ $\text{and}$ $u\in \sum^{*}\}.$ Show that $A$ is regular.Let $B=\{0^{k}1u0^{k}|k\geq 1$ $\text{and}$ $u\in \sum^{*}\}....

510 views

answer edited Dec 31, 2019

1 answer

9

Self Doubt : Ambiguity
Why is ambiguity in regular language is decidable and not decidable in CFL ? Can you give Example?

Why is ambiguity in regular language is decidable and not decidable in CFL ? Can you give Example?

1.1k views

commented Dec 31, 2019

5 answers

10

MadeEasy Test Series 2018: Programming & DS - Stack
Consider the following statements: S1: If stack is implemented as an array, all the operation push, pop, is_empty stack ( ), delete stack ( ) can be performed in constant time. S2: If stack is implemented as a linked list, ... S4: Circular queues can be implemented with the help of the stack data structure. Which of the following option is false?

Consider the following statements:S1: If stack is implemented as an array, all the operation push, pop, is_empty stack ( ), delete stack ( ) can be performed in constant ...

2.7k views

commented Dec 28, 2019

1 answer

11

stack operations using queue
Suppose Stack operations are implemented using Queue Operation. Push(x) and Pop() are stack operations whereas enqueue(x) and dequeue are Queue operations. Consider the code: pop() { return Q.dequeue(); } push(x) { n= Q.size(); //Q.size() returns the number of ... operation correctly (A) Q.enqueue(x) (B) Q.enqueue(Q.deqeue()) (C) Q.dequeue(Q.enqueue(x)) (D) Q.dequeue()

Suppose Stack operations are implemented using Queue Operation. Push(x) and Pop() are stack operations whereas enqueue(x) and dequeue are Queue operations.Consider the co...

1.2k views

answered Dec 28, 2019

3 answers

12

Virtual Gate Test Series: Digital Logic - Asynchronous Counter

952 views

answered Dec 12, 2019

5 answers

13

Minimization doubt in DIGITAL LOGIC

4.1k views

answered Dec 11, 2019

2 answers

14

MadeEasy Workbook: Digital Logic - Adder
x and y are two n bit numbers. these numbers are added by n bit carry look ahead adder which uses k logic levels. if the average gate delay of carry look ahead adder is d then what will be the maximum Delay of carry look ahead adder circuit? N2 Kd Nkd Nd

x and y are two n bit numbers. these numbers are added by n bit carry look ahead adder which uses k logic levels. if the average gate delay of carry look ahead adder is d...

1.7k views

answered Dec 9, 2019

2 answers

15

MadeEasy Workbook: Digital Logic - Circuit Output
What should be the answer...

What should be the answer...

429 views

answered Nov 19, 2019

5 answers

16

ISRO2008-76
The minimum number of fields with each node of doubly linked list is 1 2 3 4

The minimum number of fields with each node of doubly linked list is1234

19.6k views

commented Nov 1, 2019

2 answers

17

set theory

272 views

commented Oct 19, 2019

1 answer

18

Michael Sipser Edition 3 Exercise 0 Question 4 (Page No. 26)
If A has a elements and B has b elements, how many elements are in A × B? Explain your answer.

If A has a elements and B has b elements, how many elements are in A × B? Explain your answer.

387 views

answered Oct 19, 2019

8 answers

19

GATE CSE 2016 Set 2 | Question: 28
Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. Consider the following statements: Each compound in U \ S reacts ... \ S reacts with an even number of compounds. Which one of the above statements is ALWAYS TRUE? Only I Only II Only III None.

Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. ...

16.6k views

answered Oct 19, 2019

1 answer

20

# iit goa data strructre
Assume I have a stack s, a queue q, and a binary search tree t. Initially all of them are empty. Indicate the state of the data structures at line number 7 and at the end. What is the maximum height each of the data structures had during the execution? 1 i $\rightarrow$ 0 2 ... 0 8 while i <= 9 do 9 t.insert(s.pop()) 10 t.insert(q.get()) 11 i $\rightarrow$ i + 1 12 end

Assume I have a stack s, a queue q, and a binary search tree t. Initially all of them are empty. Indicate the state of the data structures at line number 7 and at the end...

509 views

answered Oct 17, 2019

1 answer

21

# stacks
How many enqueue and dequeue operations are required to perform a pop operation if Q1 contains n element initially?

How many enqueue and dequeue operations are required to perform a pop operation if Q1 contains n element initially?

1.4k views

commented Oct 17, 2019

1 answer

22

hashing
given keys: 224562,137456,214562 140145,214576,162145 144467,199645,234534 Using the digit-extraction method (first, third and fifth digits) and quadratic probing, stores the keys shown above in an array with 19 elements. What is the indexes of bin into which all the records are inserted? hint : digit extraction(1,3,5) for 224562->246 mod 19 = 18 and soon.

given keys:224562,137456,214562140145,214576,162145144467,199645,234534Using the digit-extraction method (first, third and fifth digits) and quadratic probing, stores the...

1.6k views

commented Oct 17, 2019

0 answers

23

Recursion Stack
My doubt is, In the stack, we will push [main()->PTN(3)->PTN(2)->PTN(1)->PTN(0)] PTN = printTwoNumbers function call Then according to answer PTN(0) won't pushed into stack, but at least to check if and return we should push it. What's the correct. My answer is 5, given is 4

My doubt is, In the stack, we will push [main()->PTN(3)->PTN(2)->PTN(1)->PTN(0)] PTN = printTwoNumbers function callThen according to answer PTN(0) won't pushed int...

729 views

commented Oct 14, 2019

1 answer

24

normalization
what is procedure to convert one normal form to another normal form ??? i.e. how to convert 1NF to 2NF ? please explain with example

what is procedure to convert one normal form to another normal form ???i.e. how to convert 1NF to 2NF ?please explain with example

368 views

answered Sep 27, 2019

0 answers

25

Normalization - transitive dependency
In the books, it is written that a transitive dependency is one in which a non-key attribute is determining another non-key attribute. So, if ${R (A,B,C,D,E,F)}$ be a relation and ${ABC}$ ... about those dependencies in which the LHS is a combination of key and non-key attributes ? for example, what about ${ABD \to E}$ ?

In the books, it is written that a transitive dependency is one in which a non-key attribute is determining another non-key attribute. So, if ${R (A,B,C,D,E,F)}$ be a rel...

627 views

commented Sep 26, 2019

1 answer

26

Ace 2019
Dependency preserving/Lossless ?

Dependency preserving/Lossless ?

591 views

answered Sep 20, 2019

1 answer

27

MadeEasy Workbook: Databases - Database Normalization

743 views

answered Sep 20, 2019

1 answer

28

self-doubt
Consider 2 tables R1 and R2 . If we perform a cross product between them the condition that should be satisfied for not generating spurious tuples is both should have a common element which should be a 1>primary key 2>candidate key 3>super key In one of the tables which of the three is correct??

Consider 2 tables R1 and R2 .If we perform a cross product between them the condition that should be satisfied for not generating spurious tuples is both should have a co...

398 views

answered Sep 20, 2019

1 answer

29

Michael Sipser Edition 3 Exercise 1 Question 70 (Page No. 93)
We define the $\text{avoids}$ operation for languages $A$ and $B$ to be $\text{A avoids B = {w| w ∈ A and w doesn’t contain any string in B as a substring}.}$ Prove that the class of regular languages is closed under the ${avoids}$ operation.

We define the $\text{avoids}$ operation for languages $A$ and $B$ to be $\text{A avoids B = {w| w ∈ A and w doesn’t contain any string in B as a substring}.}$ Prove t...

490 views

answered Aug 27, 2019

1 answer

30

MadeEasy Test Series: Operating System - Process Schedule

493 views

answered Jun 14, 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