Register

Recent questions tagged bad-question

1 votes
1 answer
32
#arrays
User Avatar
0 votes
0 answers
34
ACE test series
User Avatar
0 votes
0 answers
38
Common bus system
User Avatar
3 votes
1 answer
41
Output of program
Consider the following code int main(){ char *str = "ABCDEF"; printf("%d",fun(str)); return 0; } int fun(int *p1){ int *p2 = p1; while(*++p1); return (p2-p1); } The output of given program is_________. Assume object of data type int occupies 2 bytes.
Consider the following codeint main(){ char *str = "ABCDEF"; printf("%d",fun(str)); return 0; } int fun(int *p1){ int *p2 = p1; while(*++p1); return (p2-p1); }The output ...
User Avatar
–2 votes
0 answers
43
program output
User Avatar
0 votes
1 answer
44
Practice Question #5
Let language L1 = {0,1}* if another language L2 is CFL. L1 = empty set if another language L2 is not CFL. L2 = a language the is R.E and its complement is R.E. What can we say about L1 and L2? is L1 and L2 are regular, CFL, CSL, R.E or finite or infinite.
Let language L1 = {0,1}* if another language L2 is CFL.L1 = empty set if another language L2 is not CFL.L2 = a language the is R.E and its complement is R.E.What can we s...
User Avatar
0 votes
0 answers
45
Dining philosophers Algorithem
What is the minimum number of forks required to prevent deadlock in dining philosophers Algorithem a. 5 b. 6 c. 10 d. None of these
What is the minimum number of forks required to prevent deadlock in dining philosophers Algorithem a. 5b. 6c. 10d. None of these
User Avatar
1 votes
1 answer
47
Pointers and arrays
Please can somebody explain how the answer is 3 not 6??
Please can somebody explain how the answer is 3 not 6??
User Avatar
0 votes
1 answer
50
array
User Avatar
2 votes
0 answers
51
Gate forum Online Test Series
Do any one know when the self administrator and other extra edge test can be seen in the login page.. after login I am only able to see section test, unit test and one extra edge test?
Do any one know when the self administrator and other extra edge test can be seen in the login page.. after login I am only able to see section test, unit test and one ex...
User Avatar
1 votes
1 answer
52
#MemoryManagement
suppose we have a memory system with 32 bit virtual addresses and 4KB pages.If the 20 level paging is used and the memory required to store all the page tables if page table entry size is 4bytes is 2^a(2^b-1)bytes then a*b is
suppose we have a memory system with 32 bit virtual addresses and 4KB pages.If the 20 level paging is used and the memory required to store all the page tables if page ta...
User Avatar
1 votes
0 answers
53
algorithm
consider a problem defined on input of size n, if it is solved usuing greedy strategy then its time complexity is never less than a) O(n^2) b)O(n log n) c)O(logn) d) O(n)
consider a problem defined on input of size n, if it is solved usuing greedy strategy then its time complexity is never less thana) O(n^2)b)O(n log n)c)O(logn)d) O(n)
User Avatar
–1 votes
0 answers
54
algorithm time complexity
User Avatar
3 votes
1 answer
55
Prefix Property
Can anyone explain each option in detail. I am unable to get this property. .!!
Can anyone explain each option in detail. I am unable to get this property. .!!
User Avatar
0 votes
0 answers
56
Comparator
#
#
User Avatar
0 votes
0 answers
57
pipelining
User Avatar
4 votes
3 answers
58
ISRO2017-26
Advantage of synchronous sequential circuits over asynchronous one is : Lower hardware requirement Better noise immunity Faster operation All of the above
Advantage of synchronous sequential circuits over asynchronous one is :Lower hardware requirementBetter noise immunityFaster operationAll of the above
User Avatar
6 votes
2 answers
59
ISRO2017-16
Given two statements Insertion of an element should be done at the last node of the circular list Deletion of an element should be done at the last node of the circular list Both are true Both are false First is false and second is true None of the above
Given two statementsInsertion of an element should be done at the last node of the circular listDeletion of an element should be done at the last node of the circular lis...
User Avatar
4 votes
4 answers
60
ISRO2017-53
In a doubly linked list the number of pointers affected for an insertion operation will be 4 0 1 Depends on the nodes of doubly linked list
In a doubly linked list the number of pointers affected for an insertion operation will be401Depends on the nodes of doubly linked list
User Avatar
Page: