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

Computer Networks

Q1 / 50

SSL/TLS protocol provides security between

A Data Link and Physical B Network and Data Link C Physical and Network D Transport and Application layers

Computer Networks

Q2 / 50

Wireshark display filter is applied

A Never B At driver level C Before capture D After capture to filter displayed packets

Computer Networks

Q3 / 50

What is BLAST in MIMO

A Protocol BLAST B Security BLAST C Physical BLAST D Bell Labs Layered Space-Time architecture for spatial multiplexing

Computer Networks

Q4 / 50

What is digital twin validation

A Protocol validation B Verifying configuration changes on virtual copy first C Security validation D Physical validation

Computer Networks

Q5 / 50

TCP TFO (TCP Fast Open) allows

A No 0-RTT B Physical fast open C Protocol fast open D Data in SYN packet using pre-negotiated cookie

Computer Networks

Q6 / 50

SAST analyzes code

A After deployment B While running C In production D Statically without execution

Computer Networks

Q7 / 50

What is BIMI in email

A Security BIMI B Protocol BIMI C Physical BIMI D Brand Indicators for Message Identification (displaying brand logo)

Computer Networks

Q8 / 50

What is red team vs penetration test

A Red team emulates full adversary pen test focuses on specific systems B Protocol difference C Security difference D Physical difference

Computer Networks

Q9 / 50

What is anti-entropy in distributed systems

A Physical entropy B Protocol entropy C Periodically comparing and synchronizing state between nodes D Security entropy

Computer Networks

Q10 / 50

SRv6 function identifies

A Physical function B Protocol function C Action to take at node (END END.X END.DT etc) D Security function

Computer Networks

Q11 / 50

DevSecOps integrates security

A Throughout the entire development pipeline B Before development only C At production only D After deployment only

Computer Networks

Q12 / 50

What is inter-frame gap?

A idle time between frames B idle time between frame bits C idle time between packets D none of the above

Computer Networks

Q13 / 50

Bus topology uses a central cable called

A Uplink B Backbone C Trunk D Spine

Computer Networks

Q14 / 50

OCSP is faster than CRL because

A Provides real-time per-certificate status check B Uses smaller certificates C Requires no network D Is cached permanently

Computer Networks

Q15 / 50

802.11 TWT negotiation is between

A Protocol devices B Security devices C AP and station for scheduled wake times D Physical devices

Computer Networks

Q16 / 50

What is IPv6 anycast address

A Protocol anycast B Security anycast C Physical anycast D Address assigned to multiple interfaces routing to nearest

Computer Networks

Q17 / 50

TCP flow control mechanism uses

A ICMP messages B Sliding window C Fixed rate D Stop-and-wait only

Computer Networks

Q18 / 50

What is Tendermint

A BFT consensus algorithm used in blockchains B Physical consensus C Protocol network D Security consensus

Computer Networks

Q19 / 50

Usually, the network connecting hosts located in several cities or nations is called .

A lan B wan C man D none of them

Computer Networks

Q20 / 50

VTP client mode

A Blocks updates B Same as server mode C Can create VLANs D Creates no VLANs but applies updates received

Computer Networks

Q21 / 50

NIC promiscuous mode passes

A Only unicast frames B Only multicast frames C Only broadcast frames D All frames to OS regardless of destination MAC

Computer Networks

Q22 / 50

ICMP is used by ping to test

A DNS resolution B Host reachability and round-trip time C Routing tables D TCP connections

Computer Networks

Q23 / 50

What is BGP community 65535:666

A Physical community B Security community C Protocol community D BGP blackhole community for DDoS mitigation

Computer Networks

Q24 / 50

A single channel is shared by multiple signals by

A analog modulation B digital modulation C multiplexing D none of the mentioned

Computer Networks

Q25 / 50

What is MMSE equalizer in MIMO

A Security equalizer B Protocol equalizer C Physical equalizer D Minimum Mean Square Error equalizer balancing noise and interference

DBMS

Q26 / 50

A clustered index stores

A Data randomly B Data in same sorted order as the index C Data separately from index D Only index keys

DBMS

Q27 / 50

ER diagrams are created in which design phase?

A Physical design B Implementation C Conceptual design D Logical design

DBMS

Q28 / 50

A indicates an absent value that may exist but be unknown or that may not exist at all.

A empty tuple B new value C null value D old value

DBMS

Q29 / 50

What is index maintenance overhead and how should DBAs manage it in production systems?

A The cost of creating new indexes B The cost of reading from indexes C The cost of updating indexes on every INSERT/UPDATE/DELETE which includes: additional I/O for each index page write, page splits causing fragmentation, and potential index bloat - managed by: choosing indexes carefully (only create indexes that pay off) rebuilding fragmented indexes (ALTER INDEX REBUILD) and reorganizing (ALTER INDEX REORGANIZE) on a scheduled basis D Indexes that require manual maintenance

DBMS

Q30 / 50

What is a phantom read anomaly and what does SERIALIZABLE isolation add beyond REPEATABLE READ to prevent it?

A Reading ghost records from deleted tables B A phantom record that exists in the log but not the table C Reading data from a crashed transaction D Within one transaction executing the same range query twice returns different sets of rows because another committed transaction inserted/deleted rows in the query range; SERIALIZABLE adds range locking (predicate locks) or snapshot validation beyond REPEATABLE READ which only locks existing rows

DBMS

Q31 / 50

What is a partitioned table in DDL and how is RANGE partitioning defined?

A A table with multiple primary keys partitioning the data B A table replicated across multiple servers C A table divided into smaller physical storage units (partitions) based on partition key values; RANGE partitioning: each partition holds rows where partition key falls within specified ranges D A table split across multiple databases

DBMS

Q32 / 50

What does it mean for FD X to Y to be implied by a set of FDs F?

A X to Y involves attributes in F B X to Y is explicitly listed in F C X to Y holds in every relation that satisfies all FDs in F - equivalently X to Y is derivable from F using Armstrong axioms D X and Y are semantically related in the real world

DBMS

Q33 / 50

The Shared Disk architecture (e.g. Oracle RAC) has which characteristic?

A Each node has completely independent storage B Multiple nodes share the same storage but have separate memory using cache coherency protocols C Nodes are completely independent with no shared resources D Nodes share both memory and storage

DBMS

Q34 / 50

R(A,B,C,D,E) with FDs: AB→C, C→D, D→E, E→A. What is the closure AB+?

A AB B ABCD C ABE D ABCDE

DBMS

Q35 / 50

The complexity of the average case of an algorithm is

A much more complicated to analyze than that of worst case B much more simpler to analyze than that of worst case C sometimes more complicated and some other times simpler than that of worst case D none of the mentioned

DBMS

Q36 / 50

M:N cardinality means

A One entity relates to one only B One entity relates to many only C Each entity can relate to many instances on the other side D Many relate to one only

DBMS

Q37 / 50

The CREATE TRIGGER statement is used to create the trigger. THE _____ clause specifies the table name on which the trigger is to be attached. The ______ specifies that this is an AFTERINSERT trigger.

A for insert, on B On, for insert C For, insert D Both a and c

DBMS

Q38 / 50

What is the database-per-service pattern in microservices?

A All services use the same database technology B All microservices share a single central database C Services share database tables but not schemas D Each microservice owns its private database preventing direct access by other services

DBMS

Q39 / 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

Q40 / 50

DCL stands for

A Data Control Language B Data Console Language C Data Console Level D Data Control Level

DBMS

Q41 / 50

The term is used to refer to a row.

A attribute B tuple C field D instance

DBMS

Q42 / 50

What is a dirty read anomaly and which isolation level(s) allow it?

A Reading uncommitted changes of another concurrent transaction - if that other transaction later rolls back the read data never existed. Only READ UNCOMMITTED isolation level allows dirty reads; all higher levels prevent them B Reading the same row twice with different values C Reading data that contains incorrect values D Reading rows that were inserted by another transaction

DBMS

Q43 / 50

1NF requires

A No transitive dependencies B All attributes atomic and no repeating groups C No partial dependencies D Only one candidate key

DBMS

Q44 / 50

A conﬁguration can make takeover by the backup site almost instantaneous.

A hot-spare B remote C direct D spare

DBMS

Q45 / 50

Which CREATE TABLE statement is valid?

A CREATE TABLE ord_details (ord_no NUMBER(2) PRIMARY KEY, item_no NUMBER(3) PRIMARY KEY, ord_date date NOT NULL); 50 B CREATE TABLE ord_details (ord_no NUMBER(2) UNIQUE, NOT NULL, item_no NUMBER(3), ord_date date DEFAULT SYSDATE NOT NULL); C CREATE TABLE ord_details (ord_no NUMBER(2) , item_no NUMBER(3), ord_date date DEFAULT NOT NULL, CONSTRAINT ord_uq UNIQUE (ord_no), CONSTRAINT ord_pk PRIMARY KEY (ord_no)); D CREATE TABLE ord_details (ord_no NUMBER(2), item_no NUMBER(3), ord_date date DEFAULT SYSDATE NOT NULL, CONSTRAINT ord_pk PRIMARY KEY (ord_no, item_no));

DBMS

Q46 / 50

What is the difference between disjoint and overlapping constraints in ER specialization?

A Disjoint means all subtypes must be populated; overlapping means subtypes can be empty B They apply to different relationship types C Disjoint applies to weak entities; overlapping to strong entities D Disjoint (d): an entity can belong to at most one subtype; Overlapping (o): an entity can belong to multiple subtypes simultaneously

DBMS

Q47 / 50

What is the SQL HAVING clause and why is it necessary (can WHERE replace it)?

A HAVING and WHERE are interchangeable B HAVING is only for numeric data; WHERE handles text C HAVING filters groups after GROUP BY aggregation and can reference aggregate function results (e.g. HAVING COUNT(*) > 5); WHERE cannot reference aggregate functions because it runs before aggregation - HAVING is necessary for filtering based on aggregated data D WHERE is always more efficient than HAVING

DBMS

Q48 / 50

To add assignment_id=3 and copy all questions from assignment 1 in SQL

A INSERT INTO questions(assignment_id,...) SELECT 3,...FROM questions WHERE assignment_id=1 B UPDATE questions SET assignment_id=3 C COPY TABLE questions D ALTER TABLE questions ADD assignment_id=3

DBMS

Q49 / 50

Logical design of database is called

A all of the options B database schema C database instance D database snapshot

DBMS

Q50 / 50

SERIALIZABLE isolation

A Highest concurrency most anomalies B Prevents dirty reads only C Prevents ALL anomalies - highest isolation, lowest concurrency D Allows non-repeatable reads

Submit Test?