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

Computer Networks

Q1 / 50

What is certificate transparency requirement

A Security requirement B All publicly trusted TLS certs must be logged in CT logs C Physical requirement D Protocol requirement

Computer Networks

Q2 / 50

IS-IS advantage over OSPF is

A Less features B Vendor specific C Multi-protocol support IPv4 IPv6 and others natively D More complex

Computer Networks

Q3 / 50

What is DAS (Distributed Antenna System)

A Physical DAS B Security DAS C Distributed antenna infrastructure for indoor wireless coverage D Protocol DAS

Computer Networks

Q4 / 50

What is BYOD security challenge

A Personal unmanaged devices accessing corporate network B Security challenge C Physical challenge D Protocol challenge

Computer Networks

Q5 / 50

ANR in SON stands for

A Advanced Network Routing B Automatic Neighbor Relation C Autonomous Network Relay D Automatic Network Routing

Computer Networks

Q6 / 50

ARP suppression in EVPN means

A ARP is flooded B ARP is disabled C EVPN responds locally to ARP requests D ARP uses broadcast

Computer Networks

Q7 / 50

HTTP status 200 means

A Redirect B Server Error C Not Found D OK Success

Computer Networks

Q8 / 50

nmap -O attempts

A Port scan B Script scan C OS fingerprinting D Service detection

Computer Networks

Q9 / 50

What is PDSCH scheduling in 5G NR

A Security scheduling B Protocol scheduling C Physical scheduling D DCI in PDCCH allocates resources for PDSCH data

Computer Networks

Q10 / 50

What is stress testing

A Security stress B Protocol stress C Physical stress D Testing beyond normal capacity to find breaking points

Computer Networks

Q11 / 50

What is IPv6 multicast FF02::2

A Security multicast B All routers on local link (all-routers) C Protocol multicast D Physical multicast

Computer Networks

Q12 / 50

TCP 3-way handshake sequence is

A ACK SYN SYN-ACK B SYN ACK SYN-ACK C SYN SYN-ACK ACK D SYN-ACK SYN ACK

Computer Networks

Q13 / 50

Single-mode fiber eliminates modal dispersion by

A Using special wavelength B Using special connectors C Using plastic fiber D Using tiny core allowing only one light mode

Computer Networks

Q14 / 50

What is living off the land attack

A Physical attack B Protocol attack C Using legitimate system tools to avoid detection D Security attack

Computer Networks

Q15 / 50

What is WAN emulator used for

A Security emulation B Protocol emulation C Physical emulation D Simulating WAN conditions (latency loss jitter) in lab

Computer Networks

Q16 / 50

What is DNS management in IPAM

A Integrating DNS with IPAM for consistent management B Protocol DNS C Security DNS D Physical DNS

Computer Networks

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

Q18 / 50

_______codes are special linear block codes with one extra property. If a codeword is rotated, the result is another codeword.

A Non-linear B Convolution C Cyclic D none of the above

Computer Networks

Q19 / 50

What is IKEv2 advantage over IKEv1

A Fewer features B Simpler fewer messages faster and more secure C More complex D Higher overhead

Computer Networks

Q20 / 50

Byzantine fault tolerance handles

A Network delays B Nodes acting maliciously or arbitrarily C Software bugs D Physical faults

Computer Networks

Q21 / 50

PE-router in MPLS is

A Provider core router B Customer edge router C Provider Edge router connecting customer to MPLS D Peering router

Computer Networks

Q22 / 50

NAT stands for

A Network Address Translation B Network Address Transfer C None of these D Node Address Table

Computer Networks

Q23 / 50

Shodan is

A Protocol analyzer B Network scanner C Internet search engine for connected devices D Physical search engine

Computer Networks

Q24 / 50

ICMP type 0 is

A Time Exceeded B Echo Reply C Destination Unreachable D Echo Request

Computer Networks

Q25 / 50

ECMP load balances across

A Physical links only B Tunnels only C VPNs only D Multiple equal-cost paths simultaneously

DBMS

Q26 / 50

What is database tokenization and how does it differ from encryption?

A Tokenization is a weaker form of encryption B Tokenization: replacing sensitive data (credit card numbers) with randomly generated tokens that have no mathematical relationship to the original data; tokens are stored in a secure token vault. Encryption: mathematically transforms data using a key (can be decrypted with key). Tokenization cannot be reversed without vault access C Replacing tokens in SQL with actual data D They are identical data protection techniques

DBMS

Q27 / 50

What is the concept of database abstraction layers (DAL) in application development?

A A network layer for database communication B A physical layer of database hardware C A software layer between the application code and the database that abstracts specific database implementation details allowing the application to work with multiple database systems or switch databases without major code changes; examples include ORM frameworks and database adapter libraries D A caching layer that stores database results

DBMS

Q28 / 50

M:N relationship requires in relational schema

A One table B Two tables merged C Junction table with FKs to both entity tables D Single foreign key

DBMS

Q29 / 50

What is the purpose of the WITH READ ONLY clause in Oracle view creation?

A It restricts the view to SELECT statements from read-only users B It creates a read-only backup of the base table C It explicitly prevents DML operations (INSERT UPDATE DELETE) on the view even if the view would otherwise be updatable according to the rules - used to enforce that a view is intentionally read-only and prevent accidental data modifications through the view D It makes the view read-faster

DBMS

Q30 / 50

REBUILD INDEX vs REORGANIZE: REBUILD

A Is lighter weight operation B Drops and recreates the index completely eliminating all fragmentation C Only reorganizes leaf pages D Cannot be done online

DBMS

Q31 / 50

WITH clause (CTE) creates

A Permanent table B Named temporary result set valid within one SQL statement C A view D A stored procedure

DBMS

Q32 / 50

Relation dept year(dept name, total inst 2007, total inst 2008, total inst 2009). Here the only functional dependencies are from dept name to the other attributes. This relation is in

A Fourth NF B BCNF C Third NF D Second NF

DBMS

Q33 / 50

The language used in application programs to request data from the DBMS is referred to as the

A DML B DDL C VDL D SDL

DBMS

Q34 / 50

In the above teaches relation ” Select * from teaches where Year = ‘2010’” displays how many rows?

A 2 B 4 C 5 D 1

DBMS

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

Q36 / 50

What are the diﬀerent in triggers?

A deﬁne, create B drop, comment C insert, update, delete D all of the mentioned

DBMS

Q37 / 50

Updating the value of the view

A will aﬀect the relation from which it is deﬁned B will not change the view deﬁnition C will not aﬀect the relation from which it is deﬁned D cannot determine

DBMS

Q38 / 50

Given R(A,B,C,D) with F={A to B, BC to D, A to C}. Is this in 3NF?

A No there is a partial dependency violating 2NF B Yes it is in BCNF C No: candidate key is A (A+ = ABCD). FD BC to D: BC is not a superkey and D is not a prime attribute. This violates 3NF. The relation is in 2NF (PK is single attribute so no partial dependencies) but NOT in 3NF D No it is only in 1NF

DBMS

Q39 / 50

B+tree with height h requires how many I/Os for point query?

A h I/Os only B h+1 I/Os (h for tree traversal + 1 to fetch actual record) C 1 I/O only D h×2 I/Os

DBMS

Q40 / 50

What is lock escalation and when does it trigger?

A A mechanism to extend lock timeout duration B A mechanism to upgrade S-locks to X-locks C A mechanism to transfer locks between transactions D When a transaction acquires too many fine-grained locks (row/page level) the DBMS automatically escalates to a coarser-grained lock (table level) to reduce lock management overhead - reduces memory used for lock structures at the cost of reduced concurrency

DBMS

Q41 / 50

PAXOS consensus protocol is used in

A Single-node databases B Only file systems C Only two-node systems D Distributed systems for fault-tolerant consensus among multiple nodes

DBMS

Q42 / 50

Consider R(A,B,C) with FDs A to B, B to C, C to A. The candidate keys are:

A No candidate keys exist B Only AB C A, B, and C are all candidate keys (since each determines all others via transitivity forming an equivalence class) D Only A

DBMS

Q43 / 50

Which rules are defined in relational models they from as an essential part of any relation database:

A Integrity rules B Database C Record D Memory

DBMS

Q44 / 50

What is denormalization and in what scenario is it a justified design decision?

A Denormalization converts relational tables to NoSQL format B Denormalization means removing all constraints from a table C Denormalization is always a database design mistake D Denormalization is the intentional introduction of redundancy by reversing normalization justified when the performance cost of joins in read-heavy workloads significantly outweighs the storage and update overhead

DBMS

Q45 / 50

Which of the following is an advantage of using database system?

A Security enforcement B Avoidance of redundancy C Reduced inconsistency D All of these.

DBMS

Q46 / 50

What does UPDATE...SET col = DEFAULT accomplish in SQL?

A Sets the column value to its defined DEFAULT value (as specified in the column definition) resetting it to the default without needing to know the actual default value B Is invalid SQL syntax C Sets the column to NULL D Sets the column to 0

DBMS

Q47 / 50

Renaming operator in relational algebra is

A σ B π C ρ D ÷

DBMS

Q48 / 50

What is a hash index and in what scenarios is it superior to a B-tree index?

A A distributed index across multiple hash partitions B An index using a hash function to map key values to bucket positions - supports only equality lookups (O(1) average) but NOT range queries or ordering; superior for equality-only workloads with no range/ordering requirements C An index using a sorted hash table D A B-tree index using hash-based key comparison

DBMS

Q49 / 50

What is horizontal vs vertical view partitioning concept in database design using views?

A Horizontal view: restricts ROWS (WHERE clause on base table) exposing a subset of rows to a user group. Vertical view: restricts COLUMNS (SELECT only certain columns) limiting which attributes are visible - both used for security and interface simplification B Splitting view processing into parallel steps C Partitioning materialized views across servers D Physical partitioning of view storage

DBMS

Q50 / 50

Find the names of these cities with temperature and condition whose condition is neither sunny nor cloudy.

A SELECT city, temperature, condition FROM weather WHERE condition NOT IN (‘sunny’, ‘cloudy’) B SELECT city, temperature, condition FROM weather WHERE condition NOT BETWEEN (‘sunny’, ‘cloudy’) C SELECT city, temperature, condition FROM weather WHERE condition IN (‘sunny’, ‘cloudy’) D SELECT city, temperature, condition FROM weather WHERE condition BETWEEN (‘sunny’, ‘cloudy’);

Submit Test?