Must Read IT MCQ

Salesforce CRM is delivered as Software as a Service and accessed through the internet.

Cloud computing is built upon virtualization, SOA, and grid/distributed computing technologies.

Yahoo Messenger is an instant messaging application rather than a cloud computing service.

A Private Cloud provides dedicated infrastructure and resources for one organization.

Cloud migration is the process of transferring workloads from on-premises infrastructure to the cloud.

Multi-tenancy allows multiple customers to share underlying cloud infrastructure securely.

A hybrid cloud integrates public and private cloud resources and allows data sharing between them.

A CDN stores content closer to users, reducing latency and improving performance.

IaaS provides virtualized hardware resources such as compute, storage, and networking over the internet.

PaaS provides a platform for developing, running, and managing applications.

A CSP delivers cloud-based services such as compute, storage, networking, and software over the internet.

Google Workspace provides applications like Gmail, Docs, and Drive as a service.

Hybrid Cloud combines public and private cloud infrastructures.

Cloud computing offers scalability, redundancy, cost savings, and high availability.

IaaS gives users control over operating systems, storage, and deployed applications.

A community cloud is shared by organizations with similar requirements, such as security or compliance needs.

Cloud security focuses on protecting cloud-based data, applications, and infrastructure.

PaaS offers development tools, runtime environments, and deployment services.

Public cloud services are provided by third-party vendors and are accessible to many customers.

Cloud storage allows users to expand capacity easily and access data from anywhere.

PaaS simplifies development by providing tools, frameworks, and deployment environments.

Google Cloud Storage is a cloud-based object storage service.

In SaaS, the provider manages the infrastructure, platform, and application, leaving minimal management responsibility to the customer.

Virtualization allows multiple virtual machines (VMs) to share the same physical hardware efficiently.

According to the NIST definition, cloud computing includes resource pooling, on-demand self-service, broad network access, rapid elasticity, and measured service.

On-demand self-service allows users to provision resources whenever needed without human interaction from the provider.

Cloud computing allows organizations to scale resources up or down as needed and adapt quickly to changing requirements.

In serverless computing, the cloud provider manages the servers while developers focus on code.

AWS is one of the largest public cloud service providers.

Infrastructure as a Service (IaaS) provides virtual machines, storage, networking, and computing resources.

Elasticity refers to the automatic scaling of cloud resources according to workload.

An SLA defines the expected service performance, availability, and responsibilities between provider and customer.

SaaS delivers software applications to users through the internet.

Cloud orchestration automates the coordination and management of cloud resources and services.

A private cloud is dedicated to a single organization and offers greater control and security.

A hypervisor allows multiple virtual machines to share the same physical hardware.

Elasticity is the ability of a cloud environment to automatically expand or shrink resources based on demand.

Cloud services enable employees to access applications and data from anywhere, improving collaboration.

Dropbox is a cloud-based file storage and synchronization service.

IaaS stands for Infrastructure as a Service and provides virtualized computing resources such as servers, storage, and networking.

Security, reliability, and availability are among the primary concerns in cloud computing.

HaaS, SaaS, and AaaS are all recognized service models in different cloud computing contexts.

A Community Cloud is shared by organizations with similar security, compliance, or operational requirements.

Data breaches, cloud misconfiguration, and account hijacking are major cloud security threats.

Azure App Service is a PaaS offering that enables developers to build and deploy applications without managing infrastructure.

Measured Service enables automatic monitoring, reporting, and billing based on resource consumption.

The Infrastructure Layer provides shared computing, storage, and networking resources through virtualization.

DNS translates human-readable domain names into IP addresses.

A gateway can perform protocol conversion and operate across multiple OSI layers.

IPv6 uses 128-bit addresses, providing a vastly larger address space than IPv4.

Class C IPv4 addresses have a first octet ranging from 192 to 223.

Telnet provides remote terminal access but transmits data in plaintext.

In IPv4, each octet must be between 0 and 255. The value 256 is invalid.

A VLAN logically segments a physical network into separate broadcast domains.

The Presentation Layer handles data translation, encryption, compression, and format conversion before transmission.

The Transport Layer provides reliable communication using protocols such as TCP.

Unshielded Twisted Pair (UTP) Ethernet cables such as Cat5e and Cat6 are commonly used.

A firewall enforces security policies by allowing or blocking network traffic.

SIP (Session Initiation Protocol) is used to establish, modify, and terminate multimedia communication sessions such as VoIP and video conferencing.

In a Ring topology, each device is connected to two neighboring devices, forming a closed loop.

SSH provides encrypted remote login, command execution, and secure communication.

In a P2P network, all nodes have equal roles and share resources directly without a dedicated server.

A wireless repeater extends Wi-Fi coverage by receiving and retransmitting wireless signals.

A gateway connects networks that may use different protocols or architectures and performs protocol conversion.

SFTP securely transfers files over an encrypted SSH connection.

An IPv6 address is 128 bits long, providing a much larger address space than IPv4.

PAT (NAT Overload) maps multiple private IP addresses to a single public IP address using different port numbers.

Cisco ACLs are primarily classified as Standard ACLs and Extended ACLs. Standard ACLs filter based on source IP, while Extended ACLs filter using multiple criteria.

Cisco ACLs are primarily of two types: Standard ACLs and Extended ACLs.

POP3 downloads email from the server to the client. IMAP also retrieves email but keeps it synchronized on the server.

A repeater regenerates weak signals to extend network distance.

UDP is connectionless and does not guarantee delivery, making it suitable for real-time applications.

In a Star topology, all devices connect to a central hub or switch.

Routers connect different networks and forward packets using IP addresses.

SSH encrypts remote login sessions, unlike Telnet which transmits data in plain text.

The standard Cisco IOS command is 'copy running-config startup-config'. 'wr mem' is an older equivalent.

A hub shares its total bandwidth among all connected devices. With 10 hosts sharing 10 Mbps, each gets approximately 1 Mbps.

IEEE 802.11g provides up to 54 Mbps while operating in the 2.4 GHz frequency band.

A repeater regenerates signals to extend the maximum transmission distance.

NTP synchronizes the clocks of networked computers with high accuracy.

A bridge connects LAN segments and forwards frames based on MAC addresses.

IPv6 uses Multicast instead of Broadcast for one-to-many communication.

Routers perform packet forwarding, filtering (using ACLs), internetwork communication, and path selection.

Each octet in a subnet mask must be between 0 and 255. The value 256 is invalid.

SNMP is used by administrators to monitor and manage routers, switches, servers, and other network devices.

Ethernet uses MAC (Media Access Control) addresses for communication at the Data Link Layer.

A multilayer switch performs both Layer 2 switching and Layer 3 routing.

A LAN covers a relatively small geographic area such as a building, office, or campus.

The Transport Layer provides end-to-end communication, segmentation, flow control, and error recovery.

A switch connects devices within the same LAN and forwards frames using MAC addresses.

The OSI model divides networking into manageable layers, simplifying design, implementation, and troubleshooting.

Reducing the TCP window size decreases the amount of unacknowledged data in transit, improving reliability under poor network conditions.

Routers work at Layer 3, switches at Layer 2, hubs at Layer 1, and word processing is an Application Layer (Layer 7) activity.

A proxy server acts as an intermediary between clients and servers, improving security, filtering, and caching.

A bridge operates at the Data Link Layer (Layer 2) and forwards frames based on MAC addresses.

HTTPS is HTTP over TLS/SSL, providing encrypted and secure web communication.

ARP resolves an IPv4 address into the corresponding MAC address.

In a Star topology, every device has a dedicated connection to a central device.

Routers connect multiple networks and forward packets using IP routing.

DHCP automatically assigns IP addresses and other network configuration parameters.

A router forwards packets between different networks using IP addresses and routing tables.

A hub operates at the Physical Layer and simply broadcasts incoming signals to all connected ports.

SMTP (Simple Mail Transfer Protocol) is used to send email between mail servers and clients.

ARP maps an IPv4 address to its corresponding MAC address within the local network.

A router operates at Layer 3 (Network Layer) and connects different IP networks.

Class D addresses (224.0.0.0–239.255.255.255) are reserved for multicast communication.

A Mesh topology provides a dedicated link between every pair of devices.

ICMP is used for error reporting and network diagnostics such as ping and traceroute.

The Network Layer uses logical (IP) addresses for routing packets.

DHCP automatically assigns IP addresses and other network configuration parameters to clients.

A Layer 2 switch forwards frames using MAC address tables.

SFTP (SSH File Transfer Protocol) securely transfers files over an encrypted SSH connection.

10.x.x.x, 172.16.x.x–172.31.x.x, and 192.168.x.x are private ranges. The given 203.0.113.1 is a public IPv4 address (reserved for documentation but not private).

NAT enables multiple private devices to share one or more public IP addresses.

LANs may use twisted pair, fiber optic, or coaxial cables depending on the network design.

The default subnet mask for Class C networks is 255.255.255.0 (/24).

Latency is the transmission delay experienced by a packet traveling through a network.

A firewall monitors and filters incoming and outgoing traffic according to security rules.

The Data Link Layer creates frames and uses MAC addresses for physical addressing.

TCP provides reliable, connection-oriented communication with sequencing, acknowledgments, and error recovery.

UDP is a connectionless protocol that provides fast transmission without guaranteed delivery.

The TCP/IP model consists of Application, Transport, Internet, and Network Access layers.

The Network Layer performs routing and logical addressing.

DNS resolves domain names into IP addresses.

DHCP dynamically assigns IP addresses and network configuration.

HTTP uses TCP port 80.

HTTPS uses TCP port 443.

FTP uses port 21 for control commands and port 20 for data transfer in active mode.

SSH uses TCP port 22.

DNS uses port 53 for both UDP and TCP queries.

SMTP uses TCP port 25 for mail transfer.

POP3 retrieves emails using TCP port 110.

IMAP uses TCP port 143.

SNMP agents listen on UDP port 161.

Telnet uses TCP port 23 for remote terminal access.

TFTP uses UDP port 69.

DHCP servers use port 67 and clients use port 68.

127.0.0.1 is reserved for loopback testing.

255.255.255.255 is the local broadcast address.

Standard Ethernet supports an MTU of 1500 bytes.

IPv4 addresses are 32 bits long.

A MAC address consists of 48 bits (6 bytes).

ICMP reports network errors and supports diagnostic tools like ping.

The ping command sends ICMP Echo Requests to verify connectivity.

tracert (Windows) or traceroute (Linux) shows the path packets take.

ipconfig displays IP addresses, subnet masks, and gateway information.

Spanning Tree Protocol (STP) prevents Layer 2 loops.

Cut-through switching forwards frames immediately after reading the destination MAC address.

Heap Sort always performs in O(n log n) time regardless of input order.

Failure to produce a complete topological ordering indicates a cycle in a directed graph.

Recursive function calls are stored and managed using a stack.

The balance factor equals Height(Left Subtree) − Height(Right Subtree).

Separate Chaining resolves collisions by storing multiple elements in linked lists.

Kahn's Algorithm performs topological sorting using indegree values and a queue.

Adjacency List requires O(V+E) space, making it ideal for sparse graphs.

Merge Sort recursively divides the array into smaller subarrays before merging them.

Undo operations follow the Last In, First Out (LIFO) principle and are implemented using a stack.

Binary Search works only on sorted data and repeatedly divides the search interval into halves.

A Hash Table provides O(1) average-case search using hashing.

Binary Search repeatedly halves the search space, resulting in O(log n) time.

Merge Sort is a stable sorting algorithm because equal elements preserve their relative order.

Counting Sort uses counting rather than comparisons and runs in O(n+k) time.

Every function call is pushed onto the call stack and popped after execution.

A tree with n vertices always contains exactly n−1 edges.

Breadth-First Search finds the shortest path in terms of the number of edges in an unweighted graph.

Kruskal's Algorithm uses the Union-Find data structure to detect cycles efficiently.

A simple undirected graph can have at most n(n−1)/2 edges.

Inorder traversal of a BST visits nodes in ascending sorted order.

Heap Sort always performs in O(n log n) time regardless of input order.

Failure to produce a complete topological ordering indicates a cycle in a directed graph.

Recursive function calls are stored and managed using a stack.

The balance factor equals Height(Left Subtree) − Height(Right Subtree).

Separate Chaining resolves collisions by storing multiple elements in linked lists.

Kahn's Algorithm performs topological sorting using indegree values and a queue.

Adjacency List requires O(V+E) space, making it ideal for sparse graphs.

Merge Sort recursively divides the array into smaller subarrays before merging them.

Undo operations follow the Last In, First Out (LIFO) principle and are implemented using a stack.

A heap is a complete binary tree and is a non-linear data structure.

BFS explores nodes level by level using a Queue.

DFS uses a Stack, either explicitly or through the recursion call stack.

An AVL Tree automatically maintains balance after insertion and deletion operations.

Hash table insertion is O(1) on average due to efficient hashing, though collisions may increase the time.

Each node in a doubly linked list contains pointers to both the next and previous nodes.

Kruskal's Algorithm is a greedy algorithm used to find the Minimum Spanning Tree (MST) of a connected weighted graph.

Recursion is implemented using the call stack, which stores function calls.

Array elements can be accessed directly using their index in constant time.

In a circular linked list, the last node links back to the first node.

B-Trees minimize disk accesses by storing multiple keys in each node, making them ideal for databases and file systems.

An AVL tree is self-balancing but is not necessarily a complete binary tree.

A stack is used to temporarily store operators while converting infix expressions to postfix notation.

Function calls and recursion are managed using the call stack.

Merge Sort has an average-case time complexity of O(n log n), which is better than Bubble, Selection, and Insertion Sort.

Recursion is implemented using the call stack, which stores function calls.

Red-Black Trees require fewer rotations during insertions and deletions, making them more efficient for update-heavy workloads.

The standard tree traversal methods are In-order, Pre-order, Post-order, and Level-order. Reverse-order is not a standard traversal.

In a complete binary tree, every level except possibly the last is completely filled, and the last level is filled from left to right.

By definition, each node in a binary tree can have at most two children.

An adjacency matrix is efficient for dense graphs because edge lookup takes O(1), although it requires O(V²) space.

Linear Search may examine every element before finding the target or determining it is absent.

Insertion Sort performs very efficiently on nearly sorted data, with a best-case time complexity of O(n).

A queue stores the vertices that are discovered but not yet processed during BFS.

Circular Queue, Priority Queue, and Ordinary (Linear) Queue are standard queue types. 'Single-ended Queue' is not a standard queue type.

Appending an element at the end of an array takes O(1) time on average when sufficient space is available.

Dijkstra's Algorithm finds the shortest path from a source vertex to all other vertices in a weighted graph.

Insertion Sort performs efficiently on nearly sorted arrays with an average complexity close to O(n).

Quick Sort is an in-place sorting algorithm but is not stable because equal elements may change their relative order.

A deque is commonly implemented using a doubly linked list, allowing insertion and deletion from both ends efficiently.

Finding the kth smallest element in a min-heap generally requires extracting the minimum k times, resulting in O(k log k) time.

Trees naturally represent hierarchical relationships such as file systems and organizational structures.

DFS visits a node before recursively exploring its adjacent nodes, similar to Pre-order traversal in trees.

Sparse matrices are efficiently represented using linked lists or similar structures that store only non-zero elements.

Merge Sort has a worst-case time complexity of O(n log n) because it consistently divides and merges the array.

Quick Sort uses the divide-and-conquer technique by partitioning the array around a pivot and recursively sorting the partitions.

A hash table provides average-case O(1) insertion, deletion, and lookup operations using hashing.

Insertion into a binary heap requires percolating the new element upward, taking O(log n) time.

Function calls are managed using a stack, whereas queues are used in scheduling and Breadth-First Search.

Separate chaining resolves hash collisions by storing colliding elements in linked lists.

A singly linked list requires sequential traversal from the head to access a specific element, resulting in O(n) time.

An array is a linear data structure because its elements are stored sequentially. Graphs and trees are non-linear data structures.

BFS explores vertices level by level using a queue.

Function calls and recursion are managed using the call stack.

DFS visits a node before recursively exploring its adjacent nodes, similar to Preorder traversal in trees.

Quick Sort is generally unstable because equal elements may not retain their original relative order.

Dijkstra's Algorithm commonly uses a priority queue (min-heap) to efficiently select the next vertex with the minimum tentative distance.

A balanced binary tree has a height proportional to O(log n).

A binary heap is the standard implementation of a priority queue.

Quick Sort achieves O(n log n) in the best case when partitions are balanced.

A Stack follows the LIFO (Last In, First Out) principle, where the last inserted element is removed first.

A Queue follows the FIFO (First In, First Out) principle, where the first inserted element is removed first.

A Tree is a non-linear data structure because its elements are organized hierarchically rather than sequentially.

In the worst case, a BST becomes skewed, making search complexity O(n).

A linked list can grow or shrink dynamically without requiring contiguous memory.

BFS uses a queue that may store up to O(n) vertices in the worst case.

Deleting a node requires locating it first, which takes O(n) in a singly linked list unless a direct reference to the node is available.

An LRU cache is commonly implemented using a HashMap and a doubly linked list, often provided as a LinkedHashMap in Java.

Insertion Sort runs in O(n) time when the array is already sorted because only one comparison per element is needed.

Quick Sort selects a pivot element and partitions the array around it recursively.

A balanced BST maintains a height of O(log n), allowing search operations in O(log n) time.

A balanced BST maintains a height of O(log n), allowing search operations in logarithmic time.

Traversal is the process of visiting or processing each element of a data structure exactly once.

A stack is used to temporarily store operators while converting infix expressions to postfix expressions.

In a full (proper/strict) binary tree, every node has either zero or exactly two children.

Merge Sort recursively divides the array into smaller parts and merges them after sorting, following the divide-and-conquer paradigm.

Merge Sort guarantees O(n log n) time complexity in the worst case.

The height of a complete binary tree is Θ(log n).

Depth-First Search requires O(V) auxiliary space for the recursion stack or explicit stack in the worst case.