Register
Filter

Recent activity by mohitjarvissharma

1 answer
2
sorting
Given 2-sorted arrays each of n-elements and distinct. How much time it will take to find middle element of the union sorted array? a) O(1) b) O(logn) c) O(n) d) None of these explain briefly.
Given 2-sorted arrays each of n-elements and distinct. How much time it will take to find middle element of the union sorted array?a) O(1)b) O(logn)c) O(n)d) None of thes...
3 answers
4
GATE CSE 2014 Set 1 | Question: 2
Suppose you break a stick of unit length at a point chosen uniformly at random. Then the expected length of the shorter stick is ________ .
Suppose you break a stick of unit length at a point chosen uniformly at random. Then the expected length of the shorter stick is ________ .
5 answers
7
GATE CSE 2003 | Question: 60, ISRO2007-45
A program consists of two modules executed sequentially. Let $f_1(t)$ and $f_2(t)$ ... $\int_0^t f_1(x)f_2(t-x)dx$ $\max\{f_1(t),f_2(t)\}$
A program consists of two modules executed sequentially. Let $f_1(t)$ and $f_2(t)$ respectively denote the probability density functions of time taken to execute the two ...
3 answers
10
ISI2013-PCB-CS-4b
Write a regular expression for all strings of $0$’s and $1$’s in which the total number of $0$’s to the right of each $1$ is even. Justify your answer.
Write a regular expression for all strings of $0$’s and $1$’s in which the total number of $0$’s to the right of each $1$ is even. Justify your answer.
1 answer
11
self doubt
Given a pointer to a node to be deleted what is the time complexity to delete a node in the circular linked list : i think answer is O(1). Am i right?
Given a pointer to a node to be deleted what is the time complexity to delete a node in the circular linked list :i think answer is O(1).Am i right?
2 answers
13
fallacy , contradiction and invalid argument are same ?
fallacy , contradiction and invalid argument are same or different
fallacy , contradiction and invalid argument are same or different
2 answers
14
C programming
#include <stdio.h> main() { char *p = "Sanfoundry C-Test"; p[0] = 'a'; p[1] = 'b'; printf("%s", p); }
#include <stdio.h main() { char *p = "Sanfoundry C-Test"; p[0] = 'a'; p = 'b'; printf("%s", p); }
2 answers
15
c program output
#include <stdio.h> main() { char *p = 0; *p = 'a'; printf("value in pointer p is %c\n", *p); }
#include <stdio.h>main(){char *p = 0;*p = 'a';printf("value in pointer p is %c\n", *p);}
1 answer
16
Study Material
which is the best book for Gate cse topicwise previous year solved paper solution ?
which is the best book for Gate cse topicwise previous year solved paper solution ?
1 answer
17
recurrence relation
what is the recurrence relation for binary search and linear search? please explain how to derive them.
what is the recurrence relation for binary search and linear search?please explain how to derive them.
1 answer
19
Radix sort
How radix sort considered to be an application of linked list? Tell me clearly
How radix sort considered to be an application of linked list? Tell me clearly
1 answer
20
self doubt
i could not remember the strassen matrix multiplication equation is it necessary to remember the equation which is given by https://www.geeksforgeeks.org/easy-way-remember-strassens-matrix-equation/??
i could not remember the strassen matrix multiplication equation is it necessary to remember the equationwhich is given by https://www.geeksforgeeks.org/easy-way-remember...
0 answers
22
Peter Linz questions
Should i leave out the proving questions in peter linz? I have a good idea about how to use theorems but struggle with proving questions. Since there is a constraint on time, I was thinking about leaving them.
Should i leave out the proving questions in peter linz?I have a good idea about how to use theorems but struggle with proving questions. Since there is a constraint on ti...
0 answers
26
Reema Thareja
Is reema thareja a suitable book for GATE Data structures?
Is reema thareja a suitable book for GATE Data structures?
1 answer
29
Confusion between Kurose/Ross and Tanenbaum
My college's library has both Tanenbaum and Kurose/Ross. The answers on the internet only added to my confusion as there is an equal support for both the books. Since I have limited time which book would you like to suggest and why?
My college's library has both Tanenbaum and Kurose/Ross. The answers on the internet only added to my confusion as there is an equal support for both the books.Since I ha...
2 answers
30
Operating Systems concepts(Galvin)
Hello I am reading chapters from Galvin and attempting its back exercises. However, there is nothing to compare my answers to, I mean there are no answers given anywhere. Do you guys have any idea of any answer key thank you
HelloI am reading chapters from Galvin and attempting its back exercises.However, there is nothing to compare my answers to, I mean there are no answers given anywhere.Do...