Networking, DBMS [Computer Networks (25) + DBMS (25)] — 15 Aug 2026 — Free Online Test

Computer Networks

Q1 / 50

What is the role of RFC in networking

A Security RFC B Protocol RFC C Physical RFC D Defining and documenting internet standards and protocols

Computer Networks

Q2 / 50

SMTP default port is

A 80 B 21 C 23 D 25

Computer Networks

Q3 / 50

NFC operates at

A 2.4 GHz B 5 GHz C 13.56 MHz D 900 MHz

Computer Networks

Q4 / 50

URL stands for

A Uniform Resource Locator B Universal Route Locator C Uniform Routing Link D Unique Resource Link

Computer Networks

Q5 / 50

SLO is

A Protocol objective B Routing objective C Service Level Objective (target for SLI) D Physical objective

Computer Networks

Q6 / 50

RTBH stands for

A Remotely Triggered Black Hole B Real Traffic Block Hub C Route Table Black Hole D Real-Time BGP Hijack

Computer Networks

Q7 / 50

TCP send buffer should be at least

A Full BDP (bandwidth delay product) B 1 MSS C Half BDP D MTU size

Computer Networks

Q8 / 50

Anycast DNS routes to

A Nearest DNS server by broadcast B Nearest DNS server by routing metric C Random DNS server D All DNS servers

Computer Networks

Q9 / 50

What is port-to-port latency in switch

A Physical latency B Security latency C Time to forward frame from ingress to egress port D Protocol latency

Computer Networks

Q10 / 50

eBPF kprobe is for

A Protocol tracing B Physical tracing C Kernel function tracing D User space tracing

Computer Networks

Q11 / 50

What is SPF +all risk

A Protocol risk B Security risk C Physical risk D Allowing all servers to send as domain (insecure)

Computer Networks

Q12 / 50

What is transit-free network

A Physical transit B Protocol transit C Network exchanging traffic with all others without paying transit D Security transit

Computer Networks

Q13 / 50

TCP/IP Internet layer corresponds to OSI layer

A 2 B 1 C 4 D 3

Computer Networks

Q14 / 50

Go-Back-N with n-bit sequence max window size is

A 2^n B 2^(n-1) C 2^n-1 D n

Computer Networks

Q15 / 50

RARP maps MAC address to

A Physical location B IP address C Domain name D Port number

Computer Networks

Q16 / 50

PLR in MPLS FRR is

A Physical Link Repair B Packet Loss Rate C Point of Local Repair D Protocol Link Recovery

Computer Networks

Q17 / 50

MODEM is used to convey data over .

A air B telephone line C train track D bus route

Computer Networks

Q18 / 50

What is maintenance window in networking

A Physical window B Scheduled time for network changes with reduced business impact C Protocol window D Security window

Computer Networks

Q19 / 50

SIP stands for

A Signal IP Protocol B Secure Internet Protocol C Session Internet Protocol D Session Initiation Protocol

Computer Networks

Q20 / 50

PDU at the Data Link layer is called

A Segment B Frame C Bit D Packet

Computer Networks

Q21 / 50

Streaming telemetry advantage over SNMP polling is

A More overhead B Less data C Protocol overhead D Real-time push reduces latency and missed events

Computer Networks

Q22 / 50

Zigbee mesh extends range by

A Physical extension B Devices acting as routers to relay messages C Direct connections only D Protocol extension

Computer Networks

Q23 / 50

DHCP uses which transport protocol

A TCP B UDP C ICMP D IP directly

Computer Networks

Q24 / 50

What is PKI hierarchy depth

A Root CA - Intermediate CA - End-entity certificates B Security hierarchy C Protocol hierarchy D Physical hierarchy

Computer Networks

Q25 / 50

What is EF (Exposure Factor)

A Protocol EF B Physical EF C Security EF D Percentage of asset value lost in single incident

DBMS

Q26 / 50

EXPLAIN output 'type=ALL' in MySQL means

A Index is being used B Only 1 row examined C Join uses ref lookup D Full table scan - no index used (worst case for large tables)

DBMS

Q27 / 50

What is the Chen notation for a multi-valued attribute in ER diagrams?

A Double ellipse (ellipse within an ellipse) B Dashed ellipse C Rectangle with double border D Single ellipse with bold text

DBMS

Q28 / 50

What is join selectivity and how does it affect query optimization?

A The number of join conditions in a query B The number of tables that can be joined simultaneously C The speed of different join algorithms D The fraction of rows in the cross product that actually match the join condition (result_rows / (|R| times |S|)); low selectivity (few matches) is better; optimizer uses statistics to estimate selectivity and choose between join methods

DBMS

Q29 / 50

Which join refers to join records from the write table that have no matching key in the left table are include in the result set:

A left outer join B right outer join C full outer join D half outer join

DBMS

Q30 / 50

Shadow paging has

A no redo B no undo C redo but no undo D neither redo nor undo

DBMS

Q31 / 50

What is NUMA and how does it affect database architecture?

A A new SQL standard for distributed databases B A type of disk storage architecture C A memory architecture where processors have different latencies to different memory regions requiring NUMA-aware data placement D A network protocol for database replication

DBMS

Q32 / 50

In property graph models (Neo4j) what can both nodes and edges have?

A Only nodes can have properties; edges cannot B Only edges can have properties C Neither nodes nor edges can have properties D Both nodes and edges can have key-value property maps and labels/types

DBMS

Q33 / 50

Security problem in file processing systems is that

A Data is always encrypted B Enforcing access constraints is difficult in ad hoc file-based systems C All users have equal access D Data is always secure

DBMS

Q34 / 50

What is livelock in database concurrency control and how does it differ from deadlock?

A Livelock involves more transactions than deadlock B Livelock is a synonym for deadlock C Livelock is easier to detect than deadlock D Deadlock: transactions are stuck waiting indefinitely (no progress possible). Livelock: transactions are active (not blocked) but keep aborting and restarting in response to each other without making progress - e.g. two transactions using Wait-Die that repeatedly abort each other

DBMS

Q35 / 50

Given the FDs F={A to B, B to C, C to D, D to A} what is the canonical cover Fc?

A Fc = A to B, B to C, C to D, D to A - each FD is individually necessary (no FD is derivable from the others) since removing any one breaks the cycle B Fc has 1 FD C Fc has 4 FDs (same as F) D Fc has 2 FDs

DBMS

Q36 / 50

In total participation every entity instance

A Does not participate B Participates in the relationship C May or may not participate D Participates only once

DBMS

Q37 / 50

What is a snowflake schema and how does it differ from a star schema?

A Snowflake schema normalizes dimension tables into multiple related tables reducing redundancy but requiring more JOINs than star schema B Snowflake schema eliminates all fact tables C Snowflake schema uses only two dimension tables D They are identical

DBMS

Q38 / 50

In DBMS terminology a schema is:

A The overall design or logical structure of the database B A query execution plan C A backup copy of the database D A type of database index

DBMS

Q39 / 50

Which Laravel config file sets database connection settings

A .env only B config/app.php C config/cache.php D config/database.php (reads from .env variables)

DBMS

Q40 / 50

To identify the deleted records we use the

A existence bitmap B current bitmap C final bitmap D deleted bitmap

DBMS

Q41 / 50

DB::table('questions')->max('id') executes

A SELECT * FROM questions B SELECT MAX(id) FROM questions C SELECT id FROM questions ORDER BY id DESC D UPDATE questions

DBMS

Q42 / 50

What is the DBMS_CRYPTO package in PL/SQL and how does it support application-level encryption?

A A PL/SQL package providing cryptographic functions: symmetric encryption/decryption (AES 3DES DES) hashing (SHA-1 SHA-256 MD5) MAC generation and random key/data generation - enabling column-level application encryption separate from TDE B A package for database-level encryption only C A package that replaces TDE D A package only for hashing passwords

DBMS

Q43 / 50

____ is a translates into low-level instruction that a query processor understands:

A DBA B DBMS C DBS D DDL compiler

DBMS

Q44 / 50

The result of unknown is unknown.

A xor B or C and D not

DBMS

Q45 / 50

According to the ANSI SQL standard, when does a transaction begin?

A with use of the START command B when the first SQL statement is encountered C with the BEGIN command D with the BEGIN TRANSACTION command

DBMS

Q46 / 50

What is differential privacy in the context of database query systems?

A A privacy technique requiring data to be stored differently B A privacy technique that differentiates user access levels C A mathematical framework that adds calibrated noise to query results providing a formal guarantee: the probability of learning any specific fact about an individual is nearly the same whether or not that individuals data is in the database (epsilon-differential privacy) D A method for encrypting differential updates to the database

DBMS

Q47 / 50

Which of the following is not an advantage of the database approach

A elimination of data redundancy B ability of associate deleted data C increased security and program/data independence D all of the above

DBMS

Q48 / 50

What is deadlock detection using a wait-for graph and how does the DBMS resolve detected deadlocks?

A A wait-for graph has one node per transaction and a directed edge T1 to T2 if T1 is waiting for a lock held by T2; a cycle in this graph indicates a deadlock; DBMS resolves by selecting a victim transaction to abort (typically the youngest cheapest or least-work-done transaction) B A graph showing the order of lock acquisitions C Deadlocks are prevented rather than detected D A graph used to optimize lock ordering

DBMS

Q49 / 50

A single further allows the user to be authenticated once, and multiple applications can then verify the user’s identity through an authentication service without requiring reauthentication.

A openid B sign-on system C security assertion markup language (saml) D virtual private database (vpd)

DBMS

Q50 / 50

To retrieve only active non-deleted questions in Laravel

A Question::all() B DB::table('questions')->where('is_deleted',0)->get() C Question::find(0) D Question::where('is_deleted',NULL)->get()

Submit Test?