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

Computer Networks

Q1 / 50

CE-router in MPLS VPN is

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

Computer Networks

Q2 / 50

TCP delayed ACK waits up to

A 500 ms B 200 ms C 1000 ms D 100 ms

Computer Networks

Q3 / 50

What is ETS (Enhanced Transmission Selection) in DCB

A Protocol ETS B Bandwidth allocation across traffic classes C Physical ETS D Security ETS

Computer Networks

Q4 / 50

OSPF uses which PDU for neighbor discovery

A DBD B Hello packet C LSR D LSA

Computer Networks

Q5 / 50

IPSec transport mode protects

A Outer IP header B Payload only keeping original IP header C Entire packet D Nothing

Computer Networks

Q6 / 50

NETCONF transport is

A ICMP B SSH (TCP port 830) C UDP D HTTP

Computer Networks

Q7 / 50

What is peer review for network changes

A Protocol review B Physical review C Having another engineer verify change plan before implementation D Security review

Computer Networks

Q8 / 50

ADC stands for

A Asymmetric Data Controller B Advanced Data Center C Application Delivery Controller D Automatic Data Controller

Computer Networks

Q9 / 50

TELNET default port is

A 23 B 25 C 21 D 22

Computer Networks

Q10 / 50

OSI model defines an open system as

A a set of protocols that allows any two different systems to communicate B a set of rules for open access C a standard D None of the above

Computer Networks

Q11 / 50

Encapsulation refers to

A Routing data B Decrypting data C Adding headers/trailers at each layer D Removing headers

Computer Networks

Q12 / 50

BPDU Guard shuts port when

A No BPDUs received B MAC table full C Traffic exceeds threshold D BPDU received on PortFast port

Computer Networks

Q13 / 50

RabbitMQ implements

A HTTP messaging B AMQP protocol C Custom protocol D REST messaging

Computer Networks

Q14 / 50

What is DH group in IKE

A Diffie-Hellman group defining key exchange parameters B Physical DH C Protocol DH D Security DH

Computer Networks

Q15 / 50

MQTT QoS level 1 is

A At least once delivery B Exactly once C No guarantee D At most once

Computer Networks

Q16 / 50

What is Business Email Compromise (BEC)

A Protocol BEC B Security BEC C Impersonating executives to trick employees into wire transfers D Physical BEC

Computer Networks

Q17 / 50

ICMP type 0 is

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

Computer Networks

Q18 / 50

What is IANA protocol number registry

A Security registry B Physical registry C Protocol registry D Maintaining assigned protocol numbers for IP and transport layers

Computer Networks

Q19 / 50

Flooding sends packets on

A Only incoming line B Every outgoing line except incoming C Only best line D Random lines

Computer Networks

Q20 / 50

Using FTP, working directory on the local host can be changed using the command .

A pwd B bye C cd D lcd

Computer Networks

Q21 / 50

The Network topology that supports bi-directional links between each possible node is

A Ring B Star C Tree D Mesh

Computer Networks

Q22 / 50

What is array gain

A Physical gain B Improvement in SNR from combining multiple antenna signals C Protocol gain D Security gain

Computer Networks

Q23 / 50

Using FTP, a file on the remote host may be deleted using the command .

A delete B bye C cd D lcd

Computer Networks

Q24 / 50

In-band management uses

A Production network for device management B Serial console C Dedicated hardware D Separate management network

Computer Networks

Q25 / 50

Wi-Fi 6 standard is

A 802.11ac B 802.11n C 802.11ax D 802.11ad

DBMS

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

Q27 / 50

What is the lock ordering deadlock prevention strategy?

A Establishing a total ordering on all lockable resources and requiring ALL transactions to acquire locks in that predefined order; since every transaction acquires locks in the same order no circular wait can form B Preventing more than two transactions from holding locks simultaneously C Ordering locks alphabetically by column name D Ordering transactions by their start time for lock acquisition

DBMS

Q28 / 50

SELECT retrieves

A Only first row B Data from one or more tables C Only distinct rows D Only numeric data

DBMS

Q29 / 50

What is query rewriting through views in materialized view-based optimization?

A The query optimizer automatically recognizes when a user query can be answered using a pre-computed materialized view (even if the query does not reference the view directly) and rewrites the query to use the materialized view for improved performance B Manually rewriting queries to avoid using views C Rewriting view definitions to improve their performance D Converting views into stored procedures

DBMS

Q30 / 50

Optimistic CC performs best when

A Conflicts are frequent B All transactions write C Conflicts are RARE - mostly reads few conflicts D Data is very large

DBMS

Q31 / 50

OLAP stands for

A online analytical processing B online analysis processing C online transaction processing D online aggregate processing

DBMS

Q32 / 50

To safely drop a column that might not exist in migration

A $table->dropColumn('old_col') B $table->dropIfExists('old_col') C DROP COLUMN IF EXISTS old_col D Schema::table('questions',fn($t)=>$t->dropColumn('old_col')) in a try-catch or use Schema::hasColumn() check first

DBMS

Q33 / 50

What is the %TYPE and %ROWTYPE attribute in PL/SQL and why is it preferred?

A Deprecated features replaced by explicit types B Pct TYPE is only for numeric columns C Pct ROWTYPE creates a physical copy of the table D Pct TYPE: declares a variable with the same data type as a specific column automatically adapting if the column type changes. Pct ROWTYPE: declares a record with the same structure as a table row or cursor result with fields matching all column names and types

DBMS

Q34 / 50

FIRST_VALUE(salary) OVER(PARTITION BY dept ORDER BY hire_date) returns

A Highest salary in dept B Average salary in dept C NULL for first row D First hire's salary in each department

DBMS

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

Q36 / 50

The SQL statement to create a view is:

A CREATE VIEW B MAKE VIEW C SELECT VIEW D INSERT VIEW

DBMS

Q37 / 50

You have a column that will only contain values from 0 to 256. What is the most economical data type to use for the column?

A tinyint B smallint C int D decimal(1)

DBMS

Q38 / 50

What is the performance implication of an UPDATE on an indexed column?

A Indexes always make UPDATEs faster B Indexes have no effect on UPDATE performance C Updating an indexed column requires updating both the table row AND all indexes on that column making writes more expensive (each index requires a delete+insert in the B-tree structure) - the more indexes the slower the UPDATE D Only primary key indexes affect UPDATE performance

DBMS

Q39 / 50

What is the purpose of CREATE TABLE AS SELECT (CTAS) and what is NOT copied?

A Creates a new physical table populated with data from the SELECT query results - but does NOT copy constraints (primary keys, foreign keys, indexes, check constraints) from the source B Creates a temporary table with the SELECT schema C Creates a view based on a SELECT query D Creates a materialized view from the SELECT

DBMS

Q40 / 50

To set q_level for all NULL questions in assignment 1 to level 2 in Laravel

A Question::all()->update(['q_level'=>2]) B DB::table('questions')->whereNull('q_level')->where('assignment_id',1)->update(['q_level'=>2]) C Question::where('assignment_id',1)->q_level=2 D DB::table('questions')->insert(['q_level'=>2])

DBMS

Q41 / 50

BCNF requires: for every non-trivial FD X→Y

A Y is a prime attribute B Y must be NULL C X is a non-key only D X must be a superkey

DBMS

Q42 / 50

What does DML stand for?

A Different Mode Level B Data Model Language C Data Mode Lane D Data Manipulation language

DBMS

Q43 / 50

Object based logical model(s) are used to describe data at - [Select Appropriate Option(s)]

A View Level B Logical Level C Physical Level D None of these

DBMS

Q44 / 50

In Crow Foot notation how is zero or one relationship cardinality represented?

A A double vertical line B A single vertical line and a crow foot C A circle (zero) and a vertical line (one) on the same end of the relationship line D A circle and a crow foot

DBMS

Q45 / 50

dump, writes out SQL DDL statements and SQL insert statements to a ﬁle, which can then be reexecuted to re- create the database.

A archival B fuzzy C sql D all of the mentioned

DBMS

Q46 / 50

In relational algebra the natural join differs from equi-join in that:

A Natural join automatically joins on all common attribute names and eliminates duplicate columns; equi-join requires explicit equality conditions and may keep duplicate columns B Natural join requires explicit join conditions; equi-join does not C Natural join only works on 1:1 relationships; equi-join works on all D They are functionally identical operations

DBMS

Q47 / 50

Dedicated server configuration is

A One server process – Many user processes B Many server processes – One user process C One server process – One user process D Many server processes – Many user processes

DBMS

Q48 / 50

A superkey is

A Exactly one attribute uniquely identifying a tuple B A set of one or more attributes uniquely identifying a tuple C Only the primary key D A foreign key

DBMS

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

Q50 / 50

Which of the following has each related entity set has its own schema and there is an additional schema for the relationship set.

A A many-to-many relationship set B A multivalued attribute of an entity set C A one-to-many relationship set D All of the mentioned

Submit Test?