Graduate Engineer Trainee

 #include "stdio.h"int main() {   int x, y = 5, z = 5;   x = y == z;   printf("%d", x);     getchar();   return 0; }

#includevoid f(int *p, int *q){  p = q; *p = 2;}int i = 0, j = 1;int main(){  f(&i, &j);  printf("%d %d n", i, j);  getchar();  return 0;}

Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes?
(A) In deadlock prevention, the request for resources is always granted if the resulting state is safe
(B) In deadlock avoidance, the request for resources is always granted if the result state is safe
(C) Deadlock avoidance is less restrictive than deadlock prevention
(D) Deadlock avoidance requires knowledge of resource requirements a priori

 

Which property of transaction protects data from system failure?

Look at this series: 7, 10, 8, 11, 9, 12, ... What number should come next?
 

Which of the following is not the type of queue?
A) Priority Queue
B) Single-ended queue
C) Circular Queue
 

A graph having an edge from each vertex to every other vertex is called a
 

#include "stdio.h"int main() {   int x, y = 5, z = 5;   x = y == z;   printf("%d", x);     getchar();   return 0; }

A fruit seller had some apples. He sells 40% apples and still has 420 apples. What is the total number of apples he had originally?
 

You are given an infinite supply of coins of each of denominations D = {D0, D1, D2, D3, ...... Dn-1}. You need to figure out the total number of ways W, in which you can make a change for value V using coins of denominations from D. Print 0, if a change isn't possible.

Given a singly linked list of 'N' nodes. The objective is to determine the middle node of a singly linked list. However, if the list has an even number of nodes, we return the second middle node.

Note:

1. If the list is empty, the function immediately returns None because there is no middle node to find.
2. If the list has only one node, then the only node in the list is trivially the middle node, and the function returns that node.