A stack is a linear structure, while a queue is a circular structure.

A stack uses FIFO, while a queue uses LIFO.

A stack allows random access, while a queue does not.

A stack uses LIFO, while a queue uses FIFO.

A binary search tree is a data structure where each node has at most two children, with left children having lesser values and right children having greater values than the parent.

A binary search tree is a collection of nodes with random value assignments.

A binary search tree is a type of graph with no specific value ordering.

A binary search tree is a structure where nodes can have any number of children.

Recursion involves using loops to repeat a function until a condition is met.

Recursion in algorithms is a method where a function solves a problem by calling itself with a reduced input until a base case is reached.

Recursion is a technique where a function iterates over a list until all elements are processed.

Recursion is a method where a function divides a problem into smaller subproblems without self-calling.

The purpose of a hash table is to provide efficient data storage and retrieval using key-value pairs.

To manage user sessions in web applications.

To encrypt sensitive information securely.

To store data in a linear format for easy access.

Normalization is the process of combining all data into a single table.

Normalization involves encrypting data for security purposes.

Normalization in database design is the process of organizing data to minimize redundancy and dependency by dividing it into related tables.

Normalization is the method of backing up data to prevent loss.

Atomicity, Consistency, Integrity, and Durability.

ACID properties in database management are Atomicity, Consistency, Isolation, and Durability.

Availability, Consistency, Isolation, and Durability.

Atomicity, Consistency, Isolation, and Reliability.

SQL databases are non-relational and flexible; NoSQL databases are structured and fixed.

SQL databases are relational and structured; NoSQL databases are non-relational and can handle unstructured data.

SQL databases are designed for unstructured data; NoSQL databases are for structured data.

SQL databases use JSON format; NoSQL databases use XML format.

Planning, Development, Testing, Support, Review

Requirements, Design, Implementation, Review, Maintenance

Analysis, Design, Testing, Review, Release

Planning, Requirements Analysis, Design, Implementation, Testing, Deployment, Maintenance

Agile methodology is a rigid and sequential process for software development.

Agile methodology is a traditional approach that discourages team collaboration.

Agile methodology is a flexible and iterative approach to software development that promotes collaboration and responsiveness to change.

Agile methodology focuses solely on documentation and planning before coding.

#include int fact(int n) { return n == 1 ? 1 : n * fact(n - 1); } int main() { int number; scanf("%d", &number); printf("%d! = %d\n", number, fact(number)); return 0; }

#include int factorial(int n) { if (n == 0) return 1; return n * factorial(n - 1); } int main() { int num; printf("Enter a number: "); scanf("%d", &num); printf("Factorial of %d is %d\n", num, factorial(num)); return 0; }

#include int main() { int num; printf("Enter a number: "); scanf("%d", &num); printf("Factorial of %d is %d\n", num, num); return 0; }

#include int factorial(int n) { if (n < 0) return -1; return n * factorial(n - 1); } int main() { int num = 5; printf("Factorial of %d is %d\n", num, factorial(num)); return 0; }

A pointer is a data type that defines a function in C programming.

A pointer is a constant value that cannot change in C programming.

A pointer is a special kind of loop used in C programming.

A pointer is a variable that holds the address of another variable in C programming.

'malloc' is a function for input/output operations in C.

'malloc' is used to declare global variables in C.

'malloc' is used to free static memory in C.

'malloc' is used to allocate dynamic memory in C.

A 'struct' shares memory among its members, while a 'union' allocates separate memory for each member.

A 'struct' allocates separate memory for each member, while a 'union' shares memory among its members.

A 'struct' is used for functions, while a 'union' is used for arrays in C.

A 'struct' can only hold one type of data, while a 'union' can hold multiple types simultaneously.

Fixed size and slower insertions/deletions

Advantages of linked lists over arrays include dynamic size, efficient insertions/deletions, and no need for contiguous memory.

Easier memory management and faster access

Better performance for random access and sorting