Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Spidey_guy
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Spidey_guy
0
votes
1
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 :
492
views
answered
Jan 5, 2020
Databases
b-tree
databases
+
–
0
votes
2
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]
626
views
answered
Jan 3, 2020
Algorithms
algorithms
sorting
merge-sort
+
–
0
votes
3
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
Algorithms
algorithms
radix-sort
time-complexity
sorting
+
–
0
votes
4
#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.
871
views
answered
Dec 31, 2019
Theory of Computation
finite-automata
regular-expression
regs
theory-of-computation
+
–
0
votes
5
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
answered
Dec 28, 2019
DS
data-structures
stack
queue
made-easy-test-series
+
–
0
votes
6
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
DS
data-structures
stack
queue
priority-queue
+
–
0
votes
7
Virtual Gate Test Series: Digital Logic - Asynchronous Counter
900
views
answered
Dec 12, 2019
Digital Logic
digital-logic
synchronous-asynchronous-circuits
digital-counter
virtual-gate-test-series
+
–
1
votes
8
Minimization doubt in DIGITAL LOGIC
4.0k
views
answered
Dec 11, 2019
Digital Logic
digital-logic
k-map
+
–
0
votes
9
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.6k
views
answered
Dec 9, 2019
Digital Logic
digital-logic
adder
made-easy-test-series
+
–
0
votes
10
MadeEasy Workbook: Digital Logic - Circuit Output
What should be the answer...
What should be the answer...
412
views
answered
Nov 19, 2019
Digital Logic
digital-logic
circuit-output
made-easy-booklet
+
–
0
votes
11
set theory
262
views
answered
Oct 19, 2019
Set Theory & Algebra
set-theory&algebra
discrete-mathematics
engineering-mathematics
set-theory
+
–
0
votes
12
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.
368
views
answered
Oct 19, 2019
Theory of Computation
michael-sipser
theory-of-computation
set-theory
easy
+
–
0
votes
13
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.4k
views
answered
Oct 19, 2019
Set Theory & Algebra
gatecse-2016-set2
set-theory&algebra
difficult
set-theory
+
–
0
votes
14
# 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...
497
views
answered
Oct 17, 2019
DS
queue
stack
+
–
0
votes
15
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
359
views
answered
Sep 27, 2019
Databases
database-normalization
+
–
0
votes
16
Ace 2019
Dependency preserving/Lossless ?
Dependency preserving/Lossless ?
564
views
answered
Sep 20, 2019
Databases
gb2019-gt-dbms
databases
database-normalization
+
–
0
votes
17
MadeEasy Workbook: Databases - Database Normalization
712
views
answered
Sep 20, 2019
Databases
databases
made-easy-booklet
database-normalization
+
–
1
votes
18
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...
385
views
answered
Sep 20, 2019
Databases
databases
database-normalization
+
–
0
votes
19
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...
480
views
answered
Aug 27, 2019
Theory of Computation
michael-sipser
theory-of-computation
finite-automata
regular-language
proof
descriptive
+
–
0
votes
20
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^{*}\}....
482
views
answered
Aug 27, 2019
Theory of Computation
michael-sipser
theory-of-computation
finite-automata
regular-language
proof
descriptive
+
–
0
votes
21
MadeEasy Test Series: Operating System - Process Schedule
469
views
answered
Jun 14, 2019
Operating System
operating-system
process-scheduling
made-easy-test-series
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register