What will be the output of: int x = 5, y = 10; if (x < y) printf("yes"); else printf("no");

The correct answer is A: yes. The condition x < y evaluates to true (5 < 10), so the if block executes, printing 'yes'. The else block is skipped.

Which loop construct will execute at least once even if the condition is false?

The correct answer is C: do-while loop. The do-while loop executes the body first and then checks the condition, ensuring at least one execution. while and for loops check the condition first.

In a B-tree of order m, what is the maximum number of keys that a non-root node can contain?

The correct answer is C: 2m-1. A B-tree of order m can have at most 2m-1 keys in any node and minimum m-1 keys in non-root nodes.

Which operator has the highest precedence in C?

The correct answer is C: Parentheses (). Parentheses () have the highest precedence among all operators in C. They are always evaluated first in any expression.

What will be the output of: #define MAX 10; int x = MAX; printf("%d", x);

The correct answer is A: 10. The #define directive replaces MAX with 10 during preprocessing. So x = 10 and output is 10. (Note: semicolon after MAX is not needed but doesn't affect the output)

Corporate & IT Interview Preparation

Q.61 Easy C Programming

What will be the value of 'x' after execution of the following code? int x = 10; x += 5; x *= 2;

A 15

B 30

C 50

D 20

Correct Answer: B. 30

Explanation:

Step 1: x = 10 initially. Step 2: x += 5 means x = x + 5 = 10 + 5 = 15. Step 3: x *= 2 means x = x * 2 = 15 * 2 = 30. Therefore, x = 30.

Take Test

Q.62 Easy C Programming

Which header file must be included to use the printf() function in C?

A #include

B #include

C #include

D #include

Correct Answer: B. #include

Explanation:

The printf() function is defined in the Standard Input/Output library. Therefore, '#include <stdio.h>' must be included at the beginning of the program to use printf() and other I/O functions like scanf(), getchar(), putchar(), etc.

Take Test

Q.63 Easy Database/SQL

Which normal form eliminates transitive dependencies in a database table?

A Third Normal Form (3NF)

B Second Normal Form (2NF)

C Boyce-Codd Normal Form (BCNF)

D First Normal Form (1NF)

Correct Answer: A. Third Normal Form (3NF)

Explanation:

3NF removes transitive dependencies where a non-key attribute depends on another non-key attribute. BCNF is stricter but 3NF is the standard answer for eliminating transitive dependencies.

Take Test

Q.64 Easy Database/SQL

What is the time complexity of a binary search algorithm on a sorted array?

A O(n)

B O(log n)

C O(n²)

D O(n log n)

Correct Answer: B. O(log n)

Explanation:

Binary search divides the search space in half with each iteration, resulting in logarithmic time complexity O(log n).

Take Test

Q.65 Easy Database/SQL

Which SQL command is used to remove a table structure along with its data?

A DELETE

B DROP

C TRUNCATE

D REMOVE

Correct Answer: B. DROP

Explanation:

DROP removes the entire table structure and data. DELETE removes only data. TRUNCATE removes data but is faster than DELETE.

Take Test

Q.66 Easy Database/SQL

In a hash table, what is the primary cause of collision?

A Two different keys hashing to the same index

B Insufficient memory allocation

C Poor sorting algorithm

D Network latency issues

Correct Answer: A. Two different keys hashing to the same index

Explanation:

Hash collisions occur when two different keys hash to the same table index. Resolution techniques include chaining and open addressing.

Take Test

Q.67 Easy Database/SQL

Which of the following is NOT a characteristic of a relational database?

A Uses tables with rows and columns

B Enforces ACID properties

C Supports unstructured data storage by default

D Uses primary keys for unique identification

Correct Answer: C. Supports unstructured data storage by default

Explanation:

Relational databases store structured data in tables. Unstructured data is typically stored in NoSQL or document databases.

Take Test

Q.68 Easy Database/SQL

What does the acronym ACID stand for in database transactions?

A Atomicity, Consistency, Isolation, Durability

B Access, Control, Integration, Distribution

C Accuracy, Completeness, Integrity, Detection

D Authorization, Concurrency, Indexing, Duration

Correct Answer: A. Atomicity, Consistency, Isolation, Durability

Explanation:

ACID properties ensure reliable database transactions: Atomicity (all-or-nothing), Consistency (valid state), Isolation (concurrent independence), Durability (permanent storage).

Take Test

Q.69 Easy Database/SQL

Which of the following is a non-relational database designed for handling unstructured data at scale?

A MongoDB

B PostgreSQL

C Oracle Database

D MySQL

Correct Answer: A. MongoDB

Explanation:

MongoDB is a NoSQL document database that handles unstructured and semi-structured data efficiently, unlike relational databases like PostgreSQL, Oracle, and MySQL.

Take Test

Q.70 Easy Database/SQL

What does ACID stand for in database transactions?

A Atomicity, Consistency, Isolation, Durability

B Availability, Consistency, Integrity, Distribution

C Atomicity, Concurrency, Isolation, Data

D Authorization, Consistency, Integration, Durability

Correct Answer: A. Atomicity, Consistency, Isolation, Durability

Explanation:

ACID properties ensure reliable database transactions: Atomicity (all-or-nothing), Consistency (valid state), Isolation (concurrent independence), and Durability (permanent storage).

Take Test

All Subjects & Topics