Register
Filter

Answers by mohitjarvissharma

0 votes
2
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.
0 votes
3
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 votes
4
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
3 votes
5
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...
0 votes
6
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);}
0 votes
7
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); }
1 votes
8
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 ?
2 votes
9
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.
0 votes
10
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 votes
11
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...