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 vikash_thakur
1
votes
1
Recurrence relation
T(n) = T(n/4) + T(3n/4) + n How to solve these type of problems? Can I solve this using master theorm by considering X = T(3N/4) +N THEN T(N) = T(N/4) +X CAN WE SOLVE LIKE THIS? PLEASE HELP
T(n) = T(n/4) + T(3n/4) + nHow to solve these type of problems?Can I solve this using master theorm by considering X = T(3N/4) +N THEN T(N) = T(N/4) +XCAN WE SOLVE LIKE T...
1.3k
views
answered
Jun 15, 2019
Algorithms
recurrence-relation
time-complexity
algorithms
+
–
0
votes
2
Made easy Workbook 2020
Question: $T(1)=1$ $T(n) = 2 T(n - 1) + n$ evaluates to? Can anyone solve it by substitution method? Given answer $T(n) = 2^{n+1} - (n+2)$ How?
Question:$T(1)=1$$T(n) = 2 T(n - 1) + n$evaluates to?Can anyone solve it by substitution method?Given answer $T(n) = 2^{n+1} - (n+2)$How?
6.0k
views
answered
Jun 15, 2019
Algorithms
time-complexity
algorithms
recurrence-relation
made-easy-booklet
+
–
0
votes
3
Can we solve the recurrence T(n) = T(n/2) + 2^n by masters theorem, if possible?
I was wondering whether the recurrence T(n) = T(n/2) + 2n could be solved by using master theorem, and what would be the way. I tried solving the recurrence but can't. There is no mention to it in CLRS book. Please help. Thanks in advance.
I was wondering whether the recurrence T(n) = T(n/2) + 2n could be solved by using master theorem, and what would be the way. I tried solving the recurrence but can't. Th...
19.7k
views
answered
Jun 15, 2019
Algorithms
recurrence-relation
algorithms
master-theorem
time-complexity
asymptotic-notation
+
–
0
votes
4
Self Doubt Process State
For a process the termination state lies in which memory? Main or Secondary memory?
For a process the termination state lies in which memory? Main or Secondary memory?
384
views
answered
Jun 7, 2019
Operating System
process-state
process
+
–
0
votes
5
GATE2017 CE-2: GA-9
Budhan covers a distance of $19$ km in $2$ hours by cycling one fourth of the time and walking the rest. The next day he cycles (at the same speed as before) for half the time and walks the rest (at the same speed as before) and covers $26$ km in $2$ hours. The speed in km/h at which Budhan walk is $1$ $4$ $5$ $6$
Budhan covers a distance of $19$ km in $2$ hours by cycling one fourth of the time and walking the rest. The next day he cycles (at the same speed as before) for half the...
2.8k
views
answered
Jun 7, 2019
Quantitative Aptitude
gate2017-ce-2
speed-time-distance
quantitative-aptitude
+
–
0
votes
6
Nfa dfa toc ace 1
1.1k
views
answered
Jun 6, 2019
0
votes
7
Toc nfa dfa re ace
273
views
answered
Jun 6, 2019
–1
votes
8
Conversion of regular grammar to FA
A->aB/bA/b B->aC/bB C->aA/bC/a If the above regular grammar is converted into DFA then how many final states will be there? According to me there should be 2 final states: A and C But the resource from where I am reading it says only one final state will be there which will be A. Kindly explain.
A->aB/bA/bB->aC/bBC->aA/bC/a If the above regular grammar is converted into DFA then how many final states will be there?According to me there should be 2 final states: A...
4.7k
views
answered
Jun 5, 2019
Theory of Computation
theory-of-computation
finite-automata
regular-grammar
+
–
1
votes
9
Made Easy Test Series:Programming(FLT4)
#include<stdio.h> #include<iostream> int bar(int m, int n){ if(m==0)return n; if(n==0)return m; return bar(n%m,m); } int foo(int m,int n){ return(m*n/bar(m,n)); } int main(){ int x=foo(1000,1500); printf("%d",x); return 0; } Output of the program is ___________
#include<stdio.h #include<iostream int bar(int m, int n){ if(m==0)return n; if(n==0)return m; return bar(n%m,m); } int foo(int m,int n){ return(m*n/bar(m,n)); } int main(...
1.0k
views
answered
May 27, 2019
Programming in C
made-easy-test-series
programming
programming-in-c
+
–
0
votes
10
Vani Qs Bank Algorithms
.Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]=i. Ans should be O(log n) right by doing binary search ??
.Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]=i.Ans should be O(log n) right by do...
1.3k
views
answered
May 25, 2019
Algorithms
algorithms
array
searching
vani-booklet
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
