Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Raushank2
0
votes
1
turing machine
348
views
answered
Jan 3, 2018
5
votes
2
ISRO-2017
Q.A strictly binary tree with 10 leaves A) cannot have more than 19 nodes B) has exactly 19 nodes C)has exactly 17 nodes D) has exactly 20 nodes
Q.A strictly binary tree with 10 leavesA) cannot have more than 19 nodesB) has exactly 19 nodesC)has exactly 17 nodesD) has exactly 20 nodes
7.3k
views
answered
Dec 17, 2017
Programming in C
isro2017
non-gate
+
–
3
votes
3
#DBMS What will be the Minimum Number of Tuples?
Say we have two relations R (a,b,c) and S (b,d,e). Now, R has 200 tuples and S has 300 tuples. What will be Minimum number of tuples when we do R ⋈ S ( ⋈ = Natural Join)?
Say we have two relations R (a,b,c) and S (b,d,e).Now, R has 200 tuples and S has 300 tuples. What will be Minimum number of tuples when we do R ⋈ S ( ⋈ = Natural Joi...
1.3k
views
answered
Dec 6, 2017
Databases
general
databases
relational-algebra
natural-join
joins
+
–
0
votes
4
programming
output?
output?
240
views
answered
Nov 6, 2017
2
votes
5
test series
To merge two lists of size m and n, how many comparisons we need to perform in the worst case and best case respectively ? a) m+n-1 and m+n-1 b)m+n+1 and max(m,n) c)max(m,n) and min(m,n) d)m+n-1 and min(m,n) can someone give the worst case and best case with examples ?
To merge two lists of size m and n, how many comparisons we need to perform in the worst case and best case respectively ?a) m+n-1 and m+n-1b)m+n+1 and max(m,n)c)max(m,n)...
3.1k
views
answered
Nov 4, 2017
Algorithms
algorithms
sorting
normal
+
–
0
votes
6
GRAPH THEORY
Let G be an undirected graph on n nodes. Any two of the following statements implies the third. Is it true or False? 1. G is connected. 2. G doesn't have cycles. 3. G contain n-1 edges.
Let G be an undirected graph on n nodes. Any two of the following statements implies the third. Is it true or False?1. G is connected.2. G doesn't have cycles.3. G contai...
533
views
answered
Sep 28, 2017
Graph Theory
graph-theory
graph-connectivity
true-false
+
–
1
votes
7
UGC NET CSE | December 2008 | Part 2 | Question: 9
Suppose it takes $100$ $ns$ to access page table and $20$ $ns$ to access associative memory. If the average access time is $28$ $ns$, the corresponding hit rate is: $100$ percent $90$ percent $80$ percent $70$ percent
Suppose it takes $100$ $ns$ to access page table and $20$ $ns$ to access associative memory. If the average access time is $28$ $ns$, the corresponding hit rate is:$100$ ...
801
views
answered
Sep 25, 2017
Computer Networks
ugcnetcse-dec2008-paper2
computer-networks
cache-memory
+
–
0
votes
8
Regular Language
Given two languages L1 = Φ and L2 = {a}. What is the representation of L1L2*UL1*?
Given two languages L1 = Φ and L2 = {a}. What is the representation of L1L2*UL1*?
436
views
answered
Aug 17, 2017
Theory of Computation
regular-language
theory-of-computation
+
–
1
votes
9
Computer Network
Can anyone explain both the question don't give any random answer
Can anyone explain both the question don't give any random answer
366
views
answered
Aug 13, 2017
Computer Networks
computer-networks
+
–
3
votes
10
TOC language set difference
L1=$a^{n}b^{m}c^{n}$, n,m>=0 L2=$a^{n}c^{n}$ ,n>=0 L2-L1? a. Regular b.Finite c.DCFl d.Non regular
L1=$a^{n}b^{m}c^{n}$, n,m>=0L2=$a^{n}c^{n}$ ,n>=0L2-L1?a. Regularb.Finitec.DCFld.Non regular
1.2k
views
answered
Aug 6, 2017
Theory of Computation
theory-of-computation
finite-automata
context-free-language
+
–
0
votes
11
TOC find the language generated by grammer
Find the language generated by grammar ,where S and A are non terminals and 0 is terminal S->0A A->0 | SS
Find the language generated by grammar ,where S and A are non terminals and 0 is terminal S->0AA->0 | SS
667
views
answered
Aug 5, 2017
0
votes
12
TOC Grammer
S-> aSb What will the above grammar generates?Is it empty set?
S- aSbWhat will the above grammar generates?Is it empty set?
356
views
answered
Aug 4, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
13
Turing Decidable Languages
Are Turing decidable languages are closed under Complementation, Reversal, Homomorphism, Inverse Homomorphism and Substitution?
Are Turing decidable languages are closed under Complementation, Reversal, Homomorphism, Inverse Homomorphism and Substitution?
1.4k
views
answered
Aug 1, 2017
Theory of Computation
theory-of-computation
turing-machine
decidability
+
–
1
votes
14
Asymptotic time complexity
If f(n)=O(g(n)). && g(n) != O(f(n)) g(n) = O(h(n)). && h(n) = O(g(n)) Check following statement are true/false? 1. f(n)+h(n)=theta(g(n)) 2. f(n)*h(n)=theta(g(n)*h(n)) 3. g(n)*f(n)=big omega(h(n)*f(n)) 4. h(n)+g(n) = O(f(n))
If f(n)=O(g(n)). && g(n) != O(f(n))g(n) = O(h(n)). && h(n) = O(g(n))Check following statement are true/false?1. f(n)+h(n)=theta(g(n))2. f(n)*h(n)=theta(g(n)*h(n))3. g...
559
views
answered
Aug 1, 2017
Algorithms
algorithms
asymptotic-notation
+
–
1
votes
15
TOC NFA
Is it possible to convert NFA with e-moves to NFA without e-moves ?I have read that using e-closure we can convert the NFA with e-moves to DFA.But can we also convert NFA with e-moves to NFA without e-moves?
Is it possible to convert NFA with e-moves to NFA without e-moves ?I have read that using e-closure we can convert the NFA with e-moves to DFA.But can we also convert NFA...
418
views
answered
Jul 31, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
–1
votes
16
TOC CFL Language
Check if the following is CFL? {a^m b^n | (m/n)=10 } Can we do this with pda?
Check if the following is CFL?{a^m b^n | (m/n)=10 }Can we do this with pda?
784
views
answered
Jul 31, 2017
Theory of Computation
theory-of-computation
context-free-language
+
–
5
votes
17
GATE CSE 2008 | Question: 69
Consider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection(Title, Author, Catalog_no) with the following functional dependencies: $\text{Title Author }\rightarrow\text{ Catalog_no}$ ... $\text{2NF}$ and Collection in $\text{3NF}$ Both Book and Collection are in $\text{2NF}$ only
Consider the following relational schemes for a library database:Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection(Title, Author, Catalog_no)with the fo...
28.5k
views
answered
Jul 25, 2017
Databases
gatecse-2008
databases
database-normalization
normal
+
–
0
votes
18
normalization
https://gateoverflow.in/?qa=blob&qa_blobid=6062310458167884954
https://gateoverflow.in/?qa=blob&qa_blobid=6062310458167884954
319
views
answered
Jul 19, 2017
0
votes
19
digital logic
To implement a 5 bit binary adder, the minimum number of half adders required is ______________
To implement a 5 bit binary adder, the minimum number of half adders required is ______________
831
views
answered
Jul 19, 2017
1
votes
20
Insertion Sort
How to get Time Complexity of finding the number of inversions in an array?
How to get Time Complexity of finding the number of inversions in an array?
383
views
answered
Jul 8, 2017
Algorithms
sorting
time-complexity
+
–
0
votes
21
Optimal Merge Pattern
What will be the time complexity to obtain optimal merge pattern to merge files using greedy technique?
What will be the time complexity to obtain optimal merge pattern to merge files using greedy technique?
10.2k
views
answered
Jul 7, 2017
Algorithms
algorithms
time-complexity
greedy-algorithm
+
–
0
votes
22
Recurrance Relation-Recursion Tree
T(n) = T(n/3)+T(2n/3)+n What is the solution of Above Given recurrence relation? Give full method to solve this
T(n) = T(n/3)+T(2n/3)+n What is the solution of Above Given recurrence relation?Give full method to solve this
1.9k
views
answered
Jul 3, 2017
Algorithms
recurrence-relation
+
–
0
votes
23
Data Structures AVL Tree
Which sequence If inserted in AVL tree will cause No adjustment in tree? a) 1 2 3 4 5 b) 5 4 3 2 1 c) 3 2 4 1 5 d) 4 3 1 2 5
Which sequence If inserted in AVL tree will cause No adjustment in tree? a) 1 2 3 4 5 ...
805
views
answered
May 8, 2017
Programming in C
avl-tree
data-structures
+
–
1
votes
24
thegatebook
22) S1: A formula is valid iff its complement is not satisfiable S2: A formula is satisfiable iff its complement is not valid. Which statement is/are true? a) Only S1 b) Only S2 c) both S1 and S2 d) none
22) S1: A formula is valid iff its complement is not satisfiable S2: A formula is satisfiable iff its complement is not valid.Which statement is/are true? a) Only S1 ...
813
views
answered
May 5, 2017
Mathematical Logic
propositional-logic
mathematical-logic
+
–
7
votes
25
GATE CSE 1994 | Question: 1.19, ISRO2016-31
Algorithm design technique used in quicksort algorithm is? Dynamic programming Backtracking Divide and conquer Greedy method
Algorithm design technique used in quicksort algorithm is?Dynamic programmingBacktrackingDivide and conquerGreedy method
18.6k
views
answered
May 3, 2017
Algorithms
gate1994
algorithms
algorithm-design-technique
quick-sort
easy
isro2016
+
–
0
votes
26
CAT1998-1
Select the option that best replaces the underlined part. British Airspace has been focusing on building European links. Concentrating on creating European links Pursuing ways of building European connectivity. Stressing on building European links Focusing on forging European links
Select the option that best replaces the underlined part.British Airspace has been focusing on building European links.Concentrating on creating European linksPursuing wa...
1.0k
views
answered
Apr 16, 2017
Verbal Aptitude
cat1998
verbal-aptitude
+
–
1
votes
27
it's related to c programming input and output questions
4. Which of the following is not a valid variable name declaration and why? a) float PI = 3.14; b) double PI = 3.14; c) int PI = 3.14; d) #define PI 3.14
4. Which of the following is not a valid variable name declaration and why?a) float PI = 3.14;b) double PI = 3.14;c) int PI = 3.14;d) #define PI 3.14
3.3k
views
answered
Apr 16, 2017
Programming in C
programming-in-c
+
–
1
votes
28
ISRO2013-ECE 2s compliment number
The two numbers represented in signed $\text{2s}$ complement form are $\text{P}= 11101101$ and $\text{Q}= 11100110.$ If $\text{Q}$ is subtracted from $\text{P},$ the value obtained in signed $\text{2s}$ complement form is: $1000001111$ $00000111$ $11111001$ $111111001$
The two numbers represented in signed $\text{2s}$ complement form are $\text{P}= 11101101$ and $\text{Q}= 11100110.$ If $\text{Q}$ is subtracted from $\text{P},$ the valu...
9.1k
views
answered
Apr 16, 2017
Digital Logic
isro-ece
isro2013-ece
digital-logic
number-representation
+
–
1
votes
29
self doubt
Is IIITB better than IIITA for mtech (IT)?
Is IIITB better than IIITA for mtech (IT)?
526
views
answered
Apr 8, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register