Ques 1.

Write the output of the following C codes, with proper justification for each. 
i) main()
{
int a = 2, b = 4, c = 5;
a = b + c;
b = a + c;
c = a - b;
printf("%d,%d,%d", a, b, c);
}
ii) main()
{
printf("%d", ‘C’ + ‘P’ + ‘r’ + ‘o’ + ‘g’ + ‘r’ + ‘a’ + ‘m’);
}
iii) main()
{
int i, j = 1;
for(i = 1; i <= 10; i = i + 2)
{
j = i - j;
while(j <= 2)
printf("%d ", i+j++);
}
}
iv) main()
{
int a = 10, b = 20, c = 30;
int *p = 2;
a = c/*p;
b = c;
printf("a = %d, b = %d", a, b);
}
v) func(int x)
{
static int a = 0;
a += x;
return(a);
}
main()
{
int p;
for(p = 1; p <= 5; ++p)
printf("%d", fun(p));
}

Ques 2.

Explain the use of the functions getchar(), putchar(), gets() and puts() functions, with a suitable program

Ques 3.

Arrange the following operators in descending order of their priority. If any two operators have the same priority, then specify their associativity. + =, %, +, ∗, ∗(unary), ! =, −, ++

Ques 4.

Write a loop that examines each character in a character type array called text, and determines how many of the characters are letters, how many are digits, how many are whitespace characters, and how many are other characters.

Ques 5.

Explain how will you read a three-dimensional array using for loops.

Ques 6.

Suppose you wish to solve the equation  for x. Rearrange this equation to get an appropriate fixed point iteration method. Then write a program to get an approximate value of the root of the equation. The initial guess must be entered by the user. Your programme must be able to flag a warning message if the initial guess is too far from the exact root. In that case, your program must be able to suggest an initial guess to the user. Terminate the program and print the current value of the root as soon as the difference between two successive approximations becomes smaller than 0.005

Ques 7.

How is an external variable defined? How is it initialised? What happens when an external variable definition does not include the assignment of an initial value?

Ques 8.

When passing an argument to a function, what is the difference between passing by value and passing by reference?

Ques 9.

Explain the use of the string library functions strncpy() and strncat(), with the help of an example for each.

Ques 10.

A C program contains the following statements:
char u, v = ‘A’;
char *pu, *pv = &v;
*pv = v+1;
u = *pv + 1;
pu = &u;

Suppose each character occupies one byte of memory. If the value assigned to u is stored in (hexadecimal) address F8C and the value assigned to v is stored in the address F8D, then
i) What value is represented by &v?
ii) What value is assigned to pv?
iii) What value is represented by *pv?
iv) What value is assigned to u?
v) What value is represented by &u?
vi) What value is assigned to pu?

Ques 11.

How would you differentiate between the terms pointer to an array and array of pointers? Give proper examples.

Ques 12.

What does the following C function compute? Discover. 
int some fun(int n)
{
if(n%2 == 0)
return 2;
int d, s = sqrt(n);
2
for(d = 3; d <= s; d = d+2)
if(n%d == 0)
return d;
return n;
}

Ques 13.

What do you understand by a nested structure? Explain with an example. Also, explain how would you access the members of a structure or a nested structure using pointers?

Ques 14.

Consider the following structure declaration of a doubly linked list:
struct dlink
{
int nodeid;
dlink *next;
dlink *prev;
} dlink t;
A pointer of the head of the linked list is maintained as a global variable, whose
definition is
dlink t *head;
The function remove element(dlink t *rp) defined below needs to remove the
node pointed to rp and adjust the head. The first node’s prev and the last node’s
next are NULL.
remove element(dlink t *rp)
{
rp->prev->next = rp->next;
rp->next->prev = rp->prev;
if(head == rp)
head = rp->next;
}
Explain whether the function remove element() works properly or not.

Ques 15.

Write a C program which reads a line of text from keyboard, and writes the line to a file with lower case letters converted to upper case and vice-versa

Ques 16.

Write the inorder, preorder and postorder traversals of the following binary search tree

Ques 17.

Define a structure of type hms containing three integer members, called hour, minute and second, respectively. Then define a union containing two members, each a structure of type hms. Call the union members local and home, respectively. Declare a pointer variable called time that points to this union.

Ques 18.

Write a function that evaluates an expression in RPN that is given as a string.

Ques 19.

Explain the meaning of the terms garbage collection, fragmentation, relocation and compaction.

Ques 20.

What do you understand by file organisation? Explain the methods of file organisation.