Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
prateekdwv
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by prateekdwv
2
votes
31
ADA Testbook
What is the time complexity to count the number of leaf nodes in a tree? I am getting O(nlogn) but answer is O(n) please anybody explain in detail
What is the time complexity to count the number of leaf nodes in a tree? I am getting O(nlogn) but answer is O(n) please anybody explain in detail
409
views
answered
Dec 23, 2016
Algorithms
algorithms
time-complexity
testbook-test-series
+
–
1
votes
32
is null production allowed in all type of grammar
is null production allowed in all type of grammar
is null production allowed in all type of grammar
1.7k
views
answered
Aug 5, 2016
–2
votes
33
TOC
What wud be THE DFA for the following expression ? 0*1* + 1*0*
What wud be THE DFA for the following expression ?0*1* + 1*0*
1.2k
views
answered
Jul 26, 2016
0
votes
34
SHUFFLE PROPERTY OVER REGULAR LANGUAGES
The shuffle of two strings w and x is the set of all strings that one can get by interleaving the positions of w and x in any way.More precisely,shuffle(w,x) is the set of strings z such that 1)Each position of z canbe assigned to w ... {01110,01101,10110,01011,11001,11010}. Q) Show that if L1 and L2 are both regular languages,then so is shuffle(L1,L2)
The shuffle of two strings w and x is the set of all strings that one can get by interleaving the positions of w and x in any way.More precisely,shuffle(w,x) is the set o...
1.2k
views
answered
Jun 20, 2016
Theory of Computation
pushdown-automata
+
–
12
votes
35
ISRO2008-72
Which of the following operations is performed more efficiently by doubly linked list than by linear linked list? Deleting a node whose location is given Searching an unsorted list for a given item Inserting a node after the node with a given location Traversing the list to process each node
Which of the following operations is performed more efficiently by doubly linked list than by linear linked list?Deleting a node whose location is givenSearching an unsor...
14.6k
views
answered
Jun 13, 2016
DS
isro2008
data-structures
linked-list
+
–
41
votes
36
GATE CSE 2003 | Question: 62
In a permutation $a_1\ldots a_n$, of $n$ distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i > a_j.$ What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations of $1. . . n$ with at most $n$ inversions? $\Theta(n^2)$ $\Theta(n\log n)$ $\Theta(n^{1.5})$ $\Theta(n)$
In a permutation $a_1\ldots a_n$, of $n$ distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i a_j.$What would be the worst case time complex...
19.5k
views
answered
Apr 26, 2016
Algorithms
gatecse-2003
algorithms
sorting
normal
insertion-sort
+
–
7
votes
37
How to solve reccurence relation of type t(n)=t(n/5)+t(7n/10)+n ?plz specify in detail.
8.5k
views
answered
Apr 26, 2016
Algorithms
algorithms
recurrence-relation
+
–
1
votes
38
Solve recurrence using Master theorem
$T(a)=0 \hspace{0.2cm} if \hspace{0.2cm} a=1$ $T(a)=2T(a/2) + ak \hspace{0.2cm} if \hspace{0.2cm} a=2^{p}, p>0$ where $a=\frac{n}{k}$ Answer: $\Theta (n \log (\frac{n}{k}))$, This is while (n/k) is power of 2. How can I solve it using master theorem?
$T(a)=0 \hspace{0.2cm} if \hspace{0.2cm} a=1$$T(a)=2T(a/2) + ak \hspace{0.2cm} if \hspace{0.2cm} a=2^{p}, p>0$where $a=\frac{n}{k}$Answer: $\Theta (n \log (\frac{n}{k}))$...
817
views
answered
Apr 8, 2016
Algorithms
master-theorem
algorithms
time-complexity
+
–
2
votes
39
How to solve this using recursion tree method
407
views
answered
Mar 20, 2016
Algorithms
algorithms
recurrence-relation
+
–
7
votes
40
Find oder of this algorithm:T(n)=T(n-1)+1\n ? if n>1
14.5k
views
answered
Mar 10, 2016
Algorithms
algorithms
recurrence-relation
+
–
3
votes
41
If we store n keys in a hash table of size m=n^2 , then what is the probability of any collision ?
The hash function is randomly chosen from a universal class of hash functions , then what is the probability of any collision ?
The hash function is randomly chosen from a universal class of hash functions , then what is the probability of any collision ?
2.7k
views
answered
Mar 8, 2016
4
votes
42
Output and please explain
#include<stdio.h> int main() { char *s = "Geeks Quiz"; int n = 7; printf("%.*s", n, s); return 0; }
#include<stdio.h>int main(){char *s = "Geeks Quiz";int n = 7;printf("%.*s", n, s);return 0;}
2.5k
views
answered
Feb 26, 2016
Programming in C
programming-in-c
pointers
array
+
–
2
votes
43
Full outer join
538
views
answered
Jan 5, 2016
Databases
databases
+
–
3
votes
44
UGC NET CSE | December 2015 | Part 3 | Question: 42
In an operating system, indivisibility of operation means: Operation is interruptable Race Condition may occur processor can not be prempted All of the above
In an operating system, indivisibility of operation means:Operation is interruptableRace Condition may occurprocessor can not be premptedAll of the above
2.0k
views
answered
Jan 4, 2016
Operating System
ugcnetcse-dec2015-paper3
operating-system
+
–
1
votes
45
data structure
describe in details
describe in details
638
views
answered
Jan 4, 2016
DS
data-structures
programming-in-c
+
–
2
votes
46
How many tuples appear in this following relational algebra
976
views
answered
Jan 3, 2016
Databases
databases
+
–
8
votes
47
Below is the question, Please explain it..
A sort method is said to be stable if the relative order of keys is the same after the sort as it was before the sort. In which of the following pairs both sorting algorithms are stable? a) Quick sort and insertion sort b) Insertion sort and Bubble sort c) Quick sort and Heap sort d) Quick sort and Bubble sort
A sort method is said to be stable if the relative order of keys is the same after the sort as it was before the sort. In which of the following pairs both sorting algori...
1.8k
views
answered
Dec 30, 2015
Algorithms
sorting
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register