Register

Recent questions tagged jest-2019

1 1 vote
1 1 answer
1.3k
1.3k views
JEST 2019
Solve the recurrence relation given as: T(n)=2T(n-2)+n; where T(2)=2 and T(1)=0What is the solution?
User Avatar
0 0 votes
0 0 answers
930
930 views
JEST 2019 Descriptive Q3 (8 Marks)
Determine the number of functions f:{1,2,3…,n}→{1995,1996} satisfying the condition that f(1)+f(2)+…f(n) is odd.
User Avatar
To see more, click for the full list of questions or popular tags.