What is the output in a 32 bit machine with 32 bit compiler ?#include <stdio.h>rer(int **ptr2, int **ptr1){int* ii;ii = *ptr2;*ptr2 = *ptr1;*ptr1 = ii;**ptr1 *= **ptr2;**ptr2 += **ptr1;}void main( ){int var1 = 5, var2 = 10;int *ptr1 = &var1, *ptr2 = &var2;rer(&ptr1, &ptr2);printf(“%d %d “, var2, var1);}(A) 60 70(B) 50 50(C) 50 60(D) 60 50

What is the output in a 32 bit machine with 32 bit compiler ?#include

1.	What is the output in a 32 bit machine with 32 bit compiler ?#include <stdio.h>rer(int ptr2, int ptr1){int* ii;ii = ptr2;ptr2 = ptr1;ptr1 = ii;*ptr1 = ptr2;ptr2 += *ptr1;}void main( ){int var1 = 5, var2 = 10;int ptr1 = &var1, *ptr2 = &var2;rer(&ptr1, &ptr2);printf(“%d %d “, var2, var1);}(A) 60 70(B) 50 50(C) 50 60(D) 60 50
Answer» None

Discussion

No Comment Found

Related InterviewSolutions

G is an undirected graph with vertex set {v1, v2, v3, v4, v5, v6, v7} and edge set {v1v2, v1v3, v1v4, v2v4, v2v5, v3v4, v4v5, v4v6, v5v6, v6v7}. A breadth first search of the graph is performed with v1 as the root node. Which of the following is a tree edge ?(A) v2v4(B) v1v4(C) v4v5(D) v3v4
Convert the pre-fix expression to in-fix–* + ABC* – DE + FG (A)(A – B)*C + (D*E) – (F + G)(B)(A + B)*C – (D – E)*(F – G)(C)(A + B – C)*(D – E))*(F + G)(D)(A + B)*C – (D*E) – (F + G)(E) None
Properties of ‘DELETE’ and ‘TRUNCATE’ commands indicate that(A) After the execution of ‘TRUNCATE’ operation, COMMIT and ROLLBACK statements cannot be performed to retrieve the lost data, while ‘DELETE’ allow it.(B) After the execution of ‘DELETE’ and ‘TRUNCATE’ operation retrieval is easily possible for the lost data.(C) After the execution of ‘DELETE’ operation, COMMIT and ROLLBACK statements can be performed to retrieve the lost data, while TRUNCATE do not allow it.(D) After the execution of ‘DELETE’ and ‘TRUNCATE’ operation no retrieval is possible for the lost data.
Of the following sort algorithms, which has execution time that is least dependent on initial ordering of the input ?(A) Insertion sort(B) Quick sort(C) Merge sort(D) Selection sort
Consider a 5-segment pipeline with a clock cycle time 20 ns in each sub operation. Find out the approximate speed-up ratio between pipelined and non-pipelined system to execute 100 instructions. (If an average, every five cycles, a bubble due to data hazard has to be introduced in the pipeline.).(A) 5(B) 4.03(C) 4.81(D) 4.17
A given grammar is called ambiguous if(A) two or more productions have the same non-terminal on the left hand side(B) a derivation tree has more than one associated sentence(C) there is a sentence with more than one derivation tree corresponding to it(D) brackets are not present in the grammar
Checksum field in TCP header is(A) ones complement of sum of header and data in bytes(B) ones complement of sum of header, data and pseudo header in 16 bit words(C) dropped from IPv6 header format(D) better than md5 or sh1 methods
For the distributions given below :Which of the following is correct for the above distributions ?(A) Standard deviation of A is significantly lower than standard deviation of B(B) Standard deviation of A is slightly lower than standard deviation of B(C) Standard deviation of A is same as standard deviation of B(D) Standard deviation of A is significantly higher than standard deviation of B
If x + 2y = 30, then (2y/5 + x/3) + (x/5 + 2y/3) will be equal to(A) 8(B) 16(C) 18(D) 20
The hardware implementation which provides mutual exclusion is(A) Semaphores(B) Test and set instruction(C) Both options(D) None of the options

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment