Hardest C Programming Trivia Quiz! Test

Approved & Edited by ProProfs Editorial Team

The editorial team at ProProfs Quizzes consists of a select group of subject experts, trivia writers, and quiz masters who have authored over 10,000 quizzes taken by more than 100 million users. This team includes our in-house seasoned quiz moderators and subject matter experts. Our editorial experts, spread across the world, are rigorously trained using our comprehensive guidelines to ensure that you receive the highest quality quizzes.

Learn about Our Editorial Process

| By Sumakshi Chauhan

Sumakshi Chauhan

Community Contributor

Quizzes Created: 1 | Total Attempts: 370

Questions: 40 | Attempts: 370 | Updated: Mar 21, 2023

Questions

Settings

Feedback

During the Quiz End of Quiz

Play as

Quiz Flashcard

Create your own Quiz

Hardest C Programming Trivia Quiz! Test - Quiz

Questions and Answers

Quiz Review Timeline +

Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.

Current Version
Mar 21, 2023

Quiz Edited by
ProProfs Editorial Team
Mar 31, 2019

Quiz Created by
Sumakshi Chauhan

Hardest C Programming Trivia Quiz! Test

When a computer is first turned on or restarted, a special type of absolute loader called ____ is executed

The time factor when determining the efficiency of algorithm is measured by

Which of the following case does not exist in complexity theory

The Worst case occur in linear search algorithm when

Linked lists are best suited

Multiprogramming systems:

Given the language L = {ab, aa, baa}, which of the following strings are in L*? (Multiple correct type)

Which one of the following is an example of storage class in C?

Which one of the following is the correct way of declaring main() function when it receives command line arguments?

Which of the following is a correct way of defining a symbolic constant pie in C

What should be the output of the following C code : #include <stdio.h> int main() { static int y; printf(“%d\n”, y); return 0; }

The output of the below C code is : #include <stdio.h> float func(int aa, float bb) { return ((float)aa + bb); } int main() { int a; a = func(10, 3.14); printf("%d\n", a); return 0; }

What is the output of the following program? #include<stdio.h> void main() { struct { int x;} var = {5}, p = &var; printf("%d %d %d", var.x, p->x, (p).x); }

What is the output of this C code? #include <stdio.h> void main() { int y = 97; int x = y++; printf("x is %d", x); }

What is the output of the below C code? #include <stdio.h> void main() { char s = "hello"; char p = s; printf("%p %p", p, s); }

What is common in three different types of traversals (Inorder, Preorder, and Postorder)?

Find out the correct statement for the following program #include "stdio.h" int * arrPtr[5]; int main() { if((arrPtr+2) == (arrPtr+4)) { printf("Equal!"); } else { printf("Not Equal"); } return 0; }

#include <stdio.h> void 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); return 0; }

Is it possible to create a doubly linked list using only one pointer with every node?

The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree?

What is the return type of malloc() or calloc() ?

Predict the output of the below program: #include <stdio.h> #define EVEN 0 #define ODD 1 int main() { int i = 3; switch (i & 1) { case EVEN: printf("Even"); break; case ODD: printf("Odd"); break; default: printf("Default"); } return 0; }

Consider the following C declaration struct { short s[5]; union { float y; long z; }u; } t; Assume that objects of the type short, float and long occupy 2 bytes, 4 bytes, and 8 bytes, respectively. The memory requirement for variable t, ignoring alignment considerations, is

What is the time complexity to search for an element using hashing.

Output of following program? #include<stdio.h> int main() { int a[] = {1, 2, 3, 4, 5, 6}; int ptr = (int)(&a+1); printf("%d ", *(ptr-1) ); return 0; }

What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0.

Which of the following is TRUE?

Consider the following declaration of a ‘two-dimensional array in C: char a[100][100]; Assuming that the main memory is byte-addressable and that the array is stored starting from memory address 0, the address of a[40][50] is:

The output of the following C program is : #include <stdio.h> #include <string.h> int main() { char p[20]; char *s = "string"; int length = strlen(s); int i; for(i = 0;i < length;i++) { p[i] = s[length-1-i]; } printf("%s",p); }

Which of the following requires a device driver?

An operating system uses the Shortest Remaining Time First (SRTF) process scheduling algorithm. Consider the arrival times and execution times for the following processes: Process Execution time Arrival time P1 20 0 P2 25 15 P3 10 30 P4 15 45 What is the total waiting time for process P2?

Which of the following indicates the end of file in C ?

If a function's return type is not explicitly defined then it defaults to ………. (in C).

The worst case running time complexity of Euclid's GCD algorithm is :

Which of the following C string functions can be used for comparing two strings :

Non-recursive implementation of Depth First Search algorithm uses which data structure :

Regular expression for all strings starts with ab and ends with bba is.

If the time quantum of Round robin algorithm is very large, then it is equivalent to :

Hardest C Programming Trivia Quiz! Test

When a computer is first turned on or restarted, a special type of absolute loader called ____ is executed

The time factor when determining the efficiency of algorithm is measured by

Which of the following case does not exist in complexity theory

The Worst case occur in linear search algorithm when

Linked lists are best suited

Multiprogramming systems:

Given the language L = {ab, aa, baa}, which of the following strings are in L*? (Multiple correct type)

Which one of the following is an example of storage class in C?

Which one of the following is the correct way of declaring main() function when it receives command line arguments?

Which of the following is a correct way of defining a symbolic constant pie in C

What should be the output of the following C code : #include <stdio.h> int main() { static int y; printf(“%d\n”, y); return 0; }

The output of the below C code is : #include <stdio.h> float func(int aa, float bb) { return ((float)aa + bb); } int main() { int a; a = func(10, 3.14); printf("%d\n", a); return 0; }

What is the output of the following program? #include<stdio.h> void main() { struct { int x;} var = {5}, *p = &var; printf("%d %d %d", var.x, p->x, (*p).x); }

What is the output of this C code? #include <stdio.h> void main() { int y = 97; int x = y++; printf("x is %d", x); }

What is the output of the below C code? #include <stdio.h> void main() { char *s = "hello"; char *p = s; printf("%p %p", p, s); }

What is common in three different types of traversals (Inorder, Preorder, and Postorder)?

Find out the correct statement for the following program #include "stdio.h" int * arrPtr[5]; int main() { if(*(arrPtr+2) == *(arrPtr+4)) { printf("Equal!"); } else { printf("Not Equal"); } return 0; }

#include <stdio.h> void 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); return 0; }

Is it possible to create a doubly linked list using only one pointer with every node?

The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree?

What is the return type of malloc() or calloc() ?

Predict the output of the below program: #include <stdio.h> #define EVEN 0 #define ODD 1 int main() { int i = 3; switch (i & 1) { case EVEN: printf("Even"); break; case ODD: printf("Odd"); break; default: printf("Default"); } return 0; }

Consider the following C declaration struct { short s[5]; union { float y; long z; }u; } t; Assume that objects of the type short, float and long occupy 2 bytes, 4 bytes, and 8 bytes, respectively. The memory requirement for variable t, ignoring alignment considerations, is

What is the time complexity to search for an element using hashing.

Output of following program? #include<stdio.h> int main() { int a[] = {1, 2, 3, 4, 5, 6}; int *ptr = (int*)(&a+1); printf("%d ", *(ptr-1) ); return 0; }

What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0.

Which of the following is TRUE?

Consider the following declaration of a ‘two-dimensional array in C: char a[100][100]; Assuming that the main memory is byte-addressable and that the array is stored starting from memory address 0, the address of a[40][50] is:

The output of the following C program is : #include <stdio.h> #include <string.h> int main() { char p[20]; char *s = "string"; int length = strlen(s); int i; for(i = 0;i < length;i++) { p[i] = s[length-1-i]; } printf("%s",p); }

Which of the following requires a device driver?

An operating system uses the Shortest Remaining Time First (SRTF) process scheduling algorithm. Consider the arrival times and execution times for the following processes: Process Execution time Arrival time P1 20 0 P2 25 15 P3 10 30 P4 15 45 What is the total waiting time for process P2?

Which of the following indicates the end of file in C ?

If a function's return type is not explicitly defined then it defaults to ………. (in C).

The worst case running time complexity of Euclid's GCD algorithm is :

Which of the following C string functions can be used for comparing two strings :

Non-recursive implementation of Depth First Search algorithm uses which data structure :

Regular expression for all strings starts with ab and ends with bba is.

If the time quantum of Round robin algorithm is very large, then it is equivalent to :

What is the output of the following program? #include<stdio.h> void main() { struct { int x;} var = {5}, p = &var; printf("%d %d %d", var.x, p->x, (p).x); }

What is the output of the below C code? #include <stdio.h> void main() { char s = "hello"; char p = s; printf("%p %p", p, s); }

Find out the correct statement for the following program #include "stdio.h" int * arrPtr[5]; int main() { if((arrPtr+2) == (arrPtr+4)) { printf("Equal!"); } else { printf("Not Equal"); } return 0; }

#include <stdio.h> void 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); return 0; }

Output of following program? #include<stdio.h> int main() { int a[] = {1, 2, 3, 4, 5, 6}; int ptr = (int)(&a+1); printf("%d ", *(ptr-1) ); return 0; }