What will be the output of the following C code?
#include <stdio.h>
void main()
{
int x = 4, y, z;
y = –x;
z = x–;
printf(“%d%d%d”, x, y, z);
}
a) 323
b) 233
c) 322
d) 234
Answer: b
Related Posts
What is the space complexity for deleting a linked list?
What is the time complexity to count the number of elements in the linked list?
What is the time complexity of inserting at the end in dynamic arrays?
Which of the following is not a disadvantage to the usage of array?
What is the space complexity of a linear queue having n elements?
Given an array of size n, let’s assume an element is ‘touched’ if and only if some operation is performed on it(for example, for performing a pop operation the top element is ‘touched’). Now you need to perform Dequeue operation. Each element in the array is touched atleast?
Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?
Join The Discussion