Home Subjects Computer Knowledge Database/SQL

Computer Knowledge
Database/SQL

Programming, networking, database and OS questions

18 Q 2 Topics Take Mock Test
Advertisement
Difficulty: All Easy Medium Hard 11–18 of 18
Topics in Computer Knowledge
All C Programming 200 Database/SQL 100
Q.11 Hard Database/SQL
What does BASE model in NoSQL stand for?
A Basically Available, Soft state, Eventually consistent
B Batch Available, System Events, Eventual consistency
C Buffer Availability, Strong consistency, Event-driven
D Backup Availability, Security-first, Efficient
Correct Answer:  A. Basically Available, Soft state, Eventually consistent
EXPLANATION

BASE is an alternative to ACID, prioritizing availability and partition tolerance. It accepts temporary inconsistencies that resolve eventually (eventual consistency).

Test
Q.12 Hard Database/SQL
In cybersecurity, what is a zero-day vulnerability?
A A security flaw unknown to vendors with no patch available
B A vulnerability found on the first day of software release
C A virus that activates at midnight
D A type of brute-force attack
Correct Answer:  A. A security flaw unknown to vendors with no patch available
EXPLANATION

Zero-day vulnerabilities are previously unknown exploits with no patch. They're extremely dangerous because users have no defense until vendors develop and release fixes.

Test
Q.13 Hard Database/SQL
What does CAP theorem state in distributed systems?
A A system can guarantee at most 2 of 3: Consistency, Availability, Partition tolerance
B All distributed systems must be Consistent, Available, and Partition-tolerant
C Consistency requires Availability and Partitions
D Availability is always achieved in partitioned systems
Correct Answer:  A. A system can guarantee at most 2 of 3: Consistency, Availability, Partition tolerance
EXPLANATION

CAP theorem (Brewer's theorem) states distributed systems must choose 2 of 3 properties: strong consistency (C), continuous availability (A), or tolerance to network partitions (P).

Test
Q.14 Hard Database/SQL
In the context of graph databases, what is the primary advantage over relational databases for relationship-heavy queries?
A Lower storage requirements
B Faster execution of complex relationship traversals
C Better support for unstructured data
D Superior ACID compliance
Correct Answer:  B. Faster execution of complex relationship traversals
EXPLANATION

Graph databases excel at querying relationships with O(1) traversal time, whereas relational databases require expensive JOIN operations for similar queries.

Test
Q.15 Hard Database/SQL
What is the primary vulnerability addressed by SQL injection prevention techniques like parameterized queries?
A Buffer overflow attacks
B Injection of malicious SQL code into database queries
C Man-in-the-middle attacks
D DDoS attacks on database server
Correct Answer:  B. Injection of malicious SQL code into database queries
EXPLANATION

Parameterized queries prevent SQL injection by separating query structure from data, ensuring user input cannot be interpreted as executable code.

Test
Q.16 Hard Database/SQL
In network protocols, which layer does TCP/IP operate at?
A Physical Layer
B Data Link Layer
C Transport and Network Layers
D Application Layer only
Correct Answer:  C. Transport and Network Layers
EXPLANATION

TCP operates at Layer 4 (Transport) and IP at Layer 3 (Network) in the OSI model. Together they form the TCP/IP protocol suite.

Test
Q.17 Hard Database/SQL
Which of the following best describes eventual consistency in distributed databases?
A All nodes have identical data at all times
B Data will be consistent across all nodes eventually, not immediately
C Data consistency is never achieved
D Only primary nodes maintain consistency
Correct Answer:  B. Data will be consistent across all nodes eventually, not immediately
EXPLANATION

Eventual consistency is a model in NoSQL and distributed systems where updates propagate asynchronously, achieving consistency over time rather than immediately.

Test
Q.18 Hard Database/SQL
What is a deadlock in database management?
A A situation where transactions block indefinitely waiting for each other
B Loss of database connection
C Unauthorized access to database
D Corruption of data files
Correct Answer:  A. A situation where transactions block indefinitely waiting for each other
EXPLANATION

A deadlock occurs when two or more transactions wait for resources held by each other, creating a circular wait condition that prevents progress.

Test
IGET
IGET AI
Online · Exam prep assistant
Hi! 👋 I'm your iget AI assistant.

Ask me anything about exam prep, MCQ solutions, study tips, or strategies! 🎯
UPSC strategy SSC CGL syllabus Improve aptitude NEET Biology tips