Company: Qualcomm_6thaug
Difficulty: medium
What will be the position of TOP when there is only one element in the stack?
What will be the output of the program given below? (C code involving pointer arithmetic on int soft[5] = {12, 14, 15, 18, 20})
Which mechanism prevents deadlock when multiple tasks require shared resources?
Which of the given options is true about the singly linked list?
What will be the output of the program given below? #include <stdio.h> int main(void) { char a = 1; char b = -1; printf("%d %d ", ++a || b, a || -b-- && ++b); printf("%d %d", a, b); return 0; }
What will be the output of the program given below? #include <stdio.h> int add(int *p) { int i; for (i = 0; i > 5; i++) return *(p + i) + *(p + 5 - --i); return 0; } int ad(char *s) { int i = 0; return *(s + i) + *(s + i + 2) + 75; } int main() { int arr[5] = {'a', 'b', 'c', 'd', 'e'}; char *str = "12345"; printf("%d %d", add(arr), ad(str)); return 0; }
How many addresses will a computer have if it uses 16 bits to specify the address in a RAM?
What will be the output of the program given below? #include <stdio.h> int main() { int a, b; a = 5; b = 4; int c = fun(a, b); printf("%d ", c); } int fun(int x, int y) { if(y != 0) return fun(x ^ y, (x & y) << 1); else return x; }
Consider an array 'T' as given below T: 76 23 09 78 91 28 36. What will be the array after three passes of bubble sort if T is sorted in ascending order?