Search Previous Year Questions

The correct answer is : option 3

Key Points

In JavaScript, the String.prototype.match() method is used to retrieve the result of matching a string against a regular expression.

If the regular expression has the g flag, it returns an array of all matches.

Code:

Step-by-Step Explanation:

1. qpt = "First come, first served"
2. pattern = /first/g → case-sensitive match for "first"
3. qpt.match(pattern) will return: ["first"]
4. match()[1] tries to access the second element (index 1) of the result array.
5. But only one match ("first") is found → match() returns an array with 1 element.
6. match()[1] → undefined

Important Note: The pattern does not match "First" because regular expressions are case-sensitive by default.

Final Output: undefined

Correct Answer: Option 3) undefined ✅

The correct answer is : option 1

Key Points

This function rem_dup() removes duplicates from a sorted array and stores only the unique elements in-place in the original array using a temporary array b[]. However, the function does not return the updated value of n, so the main function still uses the original value of n = 12 in the loop.

Initial Array:

int a[] = {1, 1, 1, 3, 4, 4, 5, 8, 8, 10, 11, 11}; int n = 12;

Step-by-Step Execution of rem_dup():

• b[0] = a[0] = 1
• Skip repeated 1s → j = 3, insert 3
• Skip one 4 → insert 4
• Insert 5
• Skip one 8 → insert 8
• Insert 10
• Skip one 11 → insert 11

Resulting b[] = {1, 3, 4, 5, 8, 10, 11}

These values are copied back to a[] at the beginning of the array.

But in main():

• n remains 12 because the function does not return or update it outside.
• So the loop prints first 12 elements of array a[].

Final content of a[]:

a[] = {1, 3, 4, 5, 8, 10, 11, 8, 8, 10, 11, 11}

Output Printed:

After removing duplicates: 1 3 4 5 8 10 11 8 8 10 11 11

Correct Answer: Option 1) After removing duplicates: 1 3 4 5 8 10 11 8 8 10 11 11 ✅

The correct answer is Kbps

Key Points

• Kbps (Kilobits per second): ✅ Kbps is a unit of measurement used to define the speed of data transfer or network access. It indicates how many kilobits of data can be transmitted per second over a network connection.
• RAM: ❌ RAM (Random Access Memory) refers to the memory used by a device to store temporary data, not network speed.
• MHz: ❌ MHz (Megahertz) is a unit of frequency, often used to measure the speed of a processor or clock cycles, not network access speed.
• Megabytes: ❌ Megabytes measure data storage or file size, not the speed of network access.

Additional Information

• Speed Measurement: Network speeds are commonly measured in units such as Kbps, Mbps (Megabits per second), or Gbps (Gigabits per second).
• Modern Standards: Modern internet speeds are often measured in Mbps or Gbps, which are much faster than Kbps. However, Kbps was commonly used for older technologies like dial-up connections.

Hence, the correct answer is: option 3) Kbps

The correct answer is : option 1 

Key Points

When a signal is attenuated, it means that the output power is less than the input power. Decibels (dB) provide a logarithmic way to express this ratio.

Formula for attenuation in dB (for power):

Loss (in dB) = 10 × log₁₀(P_in / P_out)

Given:

• Signal is attenuated by a factor of 10
• So, P_out = P_in / 10

Substitute in the formula:

Loss = 10 × log₁₀(P_in / (P_in / 10)) = 10 × log₁₀(10) = 10 × 1 = 10 dB

Final Answer: 10 dB

Correct Option: Option 1) 10 ✅

The correct answer is Set it to undefined

Key Points

• Set to undefined: ✅ Setting an element in an array to undefined removes its value without impacting the length of the array. The index remains in the array but becomes undefined.
• Set to false: ❌ Setting an element to false does not delete it; it simply assigns the boolean value false to that index.
• Set to null: ❌ Setting an element to null assigns the value null to that index but does not delete it or remove it from the array.
• Set to –1: ❌ Setting an element to -1 simply assigns the value -1 to that index. It does not remove or delete the element.

Additional Information

• Array Length: Using undefined will not reduce the length of the array. If you want to remove an element and adjust the array length, use methods like splice() or filter().
• Best Practice: While setting an element to undefined is one way to "delete" its value, it is generally better to use splice() to remove the element entirely if you want to reindex the array.

Hence, the correct answer is: option 3) Set it to undefined

The correct answer is Compile time polymorphism

Key Points

• Overloading: ✅ Overloading is an example of compile-time polymorphism because it is resolved during the compilation of the program. It occurs when multiple methods have the same name but differ in the number or type of parameters.
• Runtime polymorphism: ❌ Runtime polymorphism is achieved through method overriding, which is resolved during program execution and involves dynamic dispatch.
• Abstraction: ❌ Abstraction refers to hiding implementation details and showing only the essential features, which is a different concept unrelated to overloading.
• None of the above: ❌ This option is incorrect because overloading clearly falls under compile-time polymorphism.

Additional Information

• Compile-time polymorphism: This type of polymorphism is determined at compile time and does not involve dynamic method invocation.
• Examples: Method overloading and operator overloading are classic examples of compile-time polymorphism.

Hence, the correct answer is: option 2) Compile time polymorphism

The correct answer is broadcast

Key Points

• Unicast: ❌ Unicast communication involves a single sender and a single receiver. It is a one-to-one communication. Since 10 out of 14 stations received the transmission, this is not a unicast address.
• Multicast: ❌ Multicast communication involves sending data to a specific group of recipients rather than all the devices on the network. However, in this scenario, the transmission is accepted by 10 stations, which doesn't indicate group-specific targeting.
• Broadcast: ✅ Broadcast communication sends the data to all devices on the LAN. If 10 out of 14 stations accept the transmission, it is likely a broadcast address, as all devices on the network are targeted, and only the ones configured to accept the broadcast respond.
• None of the above: ❌ This option is incorrect, as the correct category is clearly broadcast.

Additional Information

• Broadcast Address: A broadcast address allows the transmission of data to all devices within the same network segment. In Ethernet LANs, the broadcast address is typically represented as FF:FF:FF:FF:FF:FF (all bits set to 1 in the MAC address).
• LAN Communication: On a LAN, devices may either ignore or process broadcast transmissions based on their configuration or relevance of the data.

Hence, the correct answer is: option 3) broadcast

Correct Answer: Option 2) ❌ False

Key Points

Arrays and linked lists are both linear data structures, but they differ significantly in memory allocation, access methods, and internal representation.

Given:

int a[] = {1, 2, 3, 4, 5}; // An array of 5 integers

struct node { int n; struct node *next; }; // A singly linked list of 5 nodes

Option Analysis:

Option 1: Elements of a will be contiguous in memory but the nodes of the linked list will be non-contiguous.

✅ True — Arrays are stored in contiguous memory locations. Linked list nodes are dynamically allocated and may be scattered in memory.

Option 2: Both a and the linked list will occupy same amount of memory space.

❌ False — Arrays of 5 integers use 5 × sizeof(int) bytes. But in linked lists, each node stores: int n + pointer to next, which is sizeof(int) + sizeof(pointer) per node. So total memory used is higher in linked list.

Option 3: To reach the ith element of the linked list, it is necessary to traverse all the nodes before it but not so for array elements.

✅ True — Arrays support direct access using indexing (O(1)). Linked lists require traversal from the head to reach the ith node (O(i)).

Option 4: Both array and the linked list will have homogeneous elements.

✅ True — Both structures store integers (homogeneous data type).

Correct Answer: Option 2) ❌ False

The correct answer is Sparse Matrix

Key Points

• Sparse Matrix: ✅ Sparse matrices are matrices in which most of the elements are zero. These matrices are common in applications like numerical computations, graph theory, and machine learning.
• Square Matrix: ❌ A square matrix has the same number of rows and columns, but does not necessarily have a high proportion of zeros.
• Zero Matrix: ❌ A zero matrix is a matrix where all elements are zero. However, this is not the definition of matrices with a high proportion of zeros, as sparse matrices can have non-zero elements.
• Identity Matrix: ❌ An identity matrix is a square matrix with ones on the main diagonal and zeros elsewhere, not a matrix with a high proportion of zeros in general.

Additional Information

• Applications: Sparse matrices are used in solving large systems of linear equations, storing graphs in adjacency matrices, and data compression techniques.
• Efficiency: Sparse matrices are stored using specialized data structures (like compressed sparse row or compressed sparse column formats) to optimize memory usage and computation speed.

Hence, the correct answer is: option 3) Sparse Matrix

Correct Answer: Option 4) ✅ Infinite Loop

Key Points

An infinite loop is a loop that never terminates due to a missing or incorrect exit condition or due to a logic error that prevents reaching the exit condition.

Option Analysis:

Option 1:

i = 0; while (i < 10) { if (i == 3) break; printf("%d", i); i++; }

✅ NOT an infinite loop — The loop breaks when i == 3.

Option 2:

i = 0; do { if (i++ == 3) continue; printf("%d", i); } while (i < 10);

✅ NOT an infinite loop — i increments on every iteration due to i++ in if(), and will eventually reach 10.

Option 3:

for (i = 0; i < 10; i++) { if (i == 3) continue; printf("%d", i); }

✅ NOT an infinite loop — The continue skips printing for i==3, but the loop continues and terminates at i==10.

Option 4:

int i = 0; while (i < 10) { if (i == 3) continue; printf("%d", i); i++; }

❌ Infinite loop — When i == 3, the continue skips the i++ statement, so i remains 3 forever. The loop keeps checking i == 3 and never exits.

Correct Answer: Option 4) ✅ Infinite Loop