TCS NQT Sample Question Paper | Programming Logic

Consider the following definition in a c programming language.
struct node
{
int data;
struct node * next;
}
typedef struct node NODE;
NODE *ptr;
Which of the following c code is used to create a new node?

What differentiates a circular linked list from a normal linked list?

What will be the output of the following C code?
#include
int main()
{
int i = -3;
int k = i % 2;
printf("%d\n", k);
}

Consider these functions:
push() : push an element into the stack
pop() : pop the top-of-the-stack element
top() : returns the item stored in top-of-the-stack-node
What will be the output after performing this sequence of operations

push(20);
push(4);
top();
pop();
pop();
pop();
push(5);
top();

What will be the output of the following C code on a 32-bit machine?
#include
int main()
{
int x = 10000;
double y = 56;
int *p = &x;
double *q = &y;
printf("p and q are %d and %d", sizeof(p), sizeof(q));
return 0;
}

What will be the output?
#include
int main() {
// printf() displays the string inside quotation
printf("Hello, World!");
return 0;
}

What will be the output of the following C code?
#include
int main()
{
int a = 10, b = 5, c = 5;
int d;
d = a == (b + c);
printf("%d", d);
}

What does the following function do for a given Linked List with the first node as head?
void fun1(struct node* head)
{
if(head == NULL)
return;
fun1(head->next);
printf("%d ", head->data);
}

What will be the output of the following C function?
#include
int main()
{
reverse(1);
}
void reverse(int i)
{
if (i > 5)
exit(0);
printf("%d\n", i);
return reverse(i++);
}

Consider an implementation of an unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time?
i) Insertion at the front of the linked list
ii) Insertion at the end of the linked list
iii) Deletion of the front node of the linked list
iv) Deletion of the last node of the linked list