CUET Exam  >  CUET Tests  >  CUET UG Mock Test Series 2026  >  Computer Science: CUET Mock Test - 6 - CUET MCQ

Computer Science: CUET Mock Test - 6 - CUET MCQ


Test Description

30 Questions MCQ Test CUET UG Mock Test Series 2026 - Computer Science: CUET Mock Test - 6

Computer Science: CUET Mock Test - 6 for CUET 2025 is part of CUET UG Mock Test Series 2026 preparation. The Computer Science: CUET Mock Test - 6 questions and answers have been prepared according to the CUET exam syllabus.The Computer Science: CUET Mock Test - 6 MCQs are made for CUET 2025 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Computer Science: CUET Mock Test - 6 below.
Solutions of Computer Science: CUET Mock Test - 6 questions in English are available as part of our CUET UG Mock Test Series 2026 for CUET & Computer Science: CUET Mock Test - 6 solutions in Hindi for CUET UG Mock Test Series 2026 course. Download more important topics, notes, lectures and mock test series for CUET Exam by signing up for free. Attempt Computer Science: CUET Mock Test - 6 | 50 questions in 60 minutes | Mock test for CUET preparation | Free important questions MCQ to study CUET UG Mock Test Series 2026 for CUET Exam | Download free PDF with solutions
Computer Science: CUET Mock Test - 6 - Question 1

Two statements are given below:

Statement I: Normalization is the process of organizing data in a database into tables to reduce redundancy.
Statement II: Normalization is the process of organizing data in a database into tables to reduce dependancy.

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 1

Normalization is a process that is used to eliminate redundant data and to ensure that data is stored in a way that minimizes data dependency. It involves dividing a larger table into smaller tables and defining relationships between them to reduce data redundancy and improve data integrity.

Computer Science: CUET Mock Test - 6 - Question 2

________ is world wide interoperability for microwave access, uses a larger spectrum to deliver connections to various devices.

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 2

The correct answer is WiMax

Key Points

  • WiMax stands for Worldwide Interoperability for Microwave Access.
  • It's a wireless technology designed to provide broadband internet access over a large area.
  • Wi-Fi, while also wireless, offers connectivity to a local network with a shorter range.
Computer Science: CUET Mock Test - 6 - Question 3

Examples of Guided media are _______.

A. Radio Waves

B. Optical - fiber

C. Micro waves

D. Twisted pair

E. Coaxial cable

Choose the correct answer from the options given below:

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 3

The correct answer is B, D and E only

Key PointsGuided media refers to physical cables or wires that confine and direct the transmission of signals. These cables provide a structured pathway for data to travel, ensuring reliability and protection from interference. Here's a breakdown of the options:

  • A. Radio Waves: Radio waves are a form of unguided media, meaning they travel freely through the air or space.
  • B. Optical fiber: This is a type of guided media that uses light pulses to transmit data. It offers high bandwidth and resistance to interference.
  • C. Microwaves: Similar to radio waves, microwaves are unguided media used for short-range wireless communication.
  • D. Twisted pair: This is a common type of guided media consisting of two insulated copper wires twisted together. It's widely used in telephone and Ethernet networks.
  • E. Coaxial cable: Another guided media option, coaxial cable has a single copper conductor surrounded by an insulating layer and a braided metal shield. It provides better protection against interference compared to twisted pair.

In conclusion, only optical fiber, twisted pair, and coaxial cable are examples of guided media because they act as physical channels for data transmission.

Computer Science: CUET Mock Test - 6 - Question 4

Consider the following function for insertion_sort
def insertion_sort(list3):
n = len(list3)
for i in _______ : # [statement-1]
temp = ________ : # [ statement-2]
j = i - 1
while j>= 0 and : # [statement-3]
list3 [j+1] = list3 [j]
j = _______ # [statement-4]
_______ = temp # [statement-5]

Given the following options for the statements.
A. temp <list3[j]
B. list3[i]
C. list3 [j+1]
D. range(n)
E. j-1

Choose the correct sequence of statement.

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 4

The correct answer is DBAEC

Key Points

Insertion sort works by iterating over each element in the list starting from the second element. For each element, it compares it to the previous elements and inserts it into the correct position in the sorted subarray on its left.

Statement-1: This should be a loop over the indices of the list starting from 1 to n-1. The range function returns a sequence of numbers, so range(n) would be appropriate.

  • Correct option: D
  • The loop should be for i in range(n):

Statement-2: Before we start comparing the element at the current index i with the elements before it, we need to store its value in a variable. We call this temp.

  • Correct option: B
  • temp = list3[i]

Statement-3: The while loop condition must ensure that it runs as long as j is non-negative and the current element (pointed by temp) is less than list3[j].

  • Correct option: A
  • while j >= 0 and temp < list3[j]:

Statement-4: If the condition in the while loop is true, shift list3[j] one position to the right (i.e., to index j+1), and decrement j to continue comparing temp with the next element on the left.

  • Correct option: E
  • j = j - 1

Statement-5: Finally, insert temp in its correct position in the sorted subarray. This position is j + 1 because j was decremented one extra time in the while loop.

  • Correct option: C
  • list3[j + 1] = temp

Putting all of these together, the correct sequence of statements is: D→B→A→E→C

Computer Science: CUET Mock Test - 6 - Question 5

Which of the following is (are) attribute(s) of file object?

A. closed

B. mode

C. next

D. name

E. tell

Choose the correct answer from the options given below:

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 5

The correct answer is A, B and D only

Key Points

  • A. closed - This is an attribute that indicates whether the file is closed or not. If the file is closed, it returns True; otherwise, it returns False.
  • B. mode - This attribute represents the mode in which the file was opened, such as 'r' for reading, 'w' for writing, etc.
  • C. next - This is not an attribute of a file object; it refers to a built-in function in Python that retrieves the next item from an iterator.
  • D. name - This attribute holds the name of the file.
  • E. tell - This is not an attribute but a method of a file object that tells you the current position within the file.

Therefore, the attributes of a file object include closed, mode, and name, making the correct choice 4) A, B, and D only.

Computer Science: CUET Mock Test - 6 - Question 6

In SQL ______ is an aggregate function.

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 6

Concept:

Aggregate functions return a single result row based on groups of rows, rather than on single rows. Aggregate functions can appear in select lists and in ORDER BY and HAVING clauses.

Key Points

In SQL, AVG is an aggregate function

Computer Science: CUET Mock Test - 6 - Question 7
Consider attributes ID, CITY and NAME. Which one of this can be considered as a super key?
Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 7

The correct option is (2)

ID

Concept:-

Here the ID is the only attribute that can be assumed as a primary key in this scenario. Other attributes are not valid choices.

Explanation:

Let me take an example to clarify the above statement.

Consider that the ID attribute is unique to every employee. In that case, we can say that the ID attribute can uniquely identify the tuples of this table, and it can be treated as a primary key. The primary key is a minimal super key, consequently, ID is also a super key.

Key Points

  • A group of one or more columns (attributes) used to specifically identify rows in a database is known as a super key.
  • The super key is created by adding 0–more attributes to the candidate key. Super keys are candidate keys, but the opposite is not true.
  • An alternate key serves as an alternate unique identifier for each entity instance in addition to the primary key.
  • To get records from tables, super keys and candidate keys are both used. The associations between tables are also established using these keys.

Note: If any attribute is combined with candidate or primary key, then the combination becomes super key. Hence the given option 4 (CITY, ID) can also be a valid answer. But as per the official answer, option 2 is correct.

Computer Science: CUET Mock Test - 6 - Question 8

A sort algorithm works on the following principle.

  1. Find the smallest item in the list, and exchange it with the left-most unsorted element.
  2. Repeat the process from the first unsorted element.

Which of the following sorting algorithms does it correspond to?

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 8

Answer: Option 3

Concept:

Quick sort:

  • Quicksort is an efficient sorting algorithm also known as a partition-exchange sort
  • Quicksort is a comparison sort, meaning that it can sort items of any type for which a "less-than" relation is defined
  • Quicksort is a divide-and-conquer algorithm in which the pivot element is chosen, and this pivot element reduced the given problem into two smaller set
  • In the efficient implementations, it is not a stable sort, meaning that the relative order of equal sort items is not preserved
  • Quicksort can operate in place on an array, requiring small additional amounts of memory to perform the sorting.

In Quicksort, the worst-case takes Θ (n2) time. The worst case of quicksort is when the first or the last element is chosen as the pivot element.


This will give Θ (n2) time complexity.
Recurrence relation for quick sort algorithm will be,
T (n) = T (n - 1) + Θ (n)
This will give the worst-case time complexity as Θ (n2).

Merge sort:

  • Merge sort is an efficient sorting algorithm that uses a divide-and-conquer approach to order elements in an array.
  • Mergesort has two steps:
    • Merging
    • Sorting.
  • The algorithm uses a divide-and-conquer approach to merge and sort a list.

The recursive mergesort algorithm is
1. If the list has only one element, Return the list and terminate. (Base case)
2. Split the list into two halves that are as equal in length as possible. (Divide)
3. Using recursion, sort both lists using mergesort. (Conquer)
4. Merge the two sorted lists and return the result. (Combine).

In Merge sort, the worst-case takes Θ (n log n) time. Merge sort is based on the divide and conquer approach. It is out of place sorting algorithms

Recurrence relation for merge sort will become:
T(n) = 2T (n/2) + Θ (n)
T(n) = n + Θ (n)
T (n) = n × logn

Selection sort:
Algorithm:

  • Find the smallest item in the list, and exchange it with the leftmost unsorted element.
  • Repeat the process from the first unsorted element.

Insertion sort:

In Insertion sort, the worst-case takes Θ (n2) time, the worst case of insertion sort is when elements are sorted in reverse order. It is an in-place sorting algorithm.

In that case, the number of comparisons will be like:

This will give Θ (n2) time complexity.

Computer Science: CUET Mock Test - 6 - Question 9

Modes of communication are :

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 9

The correct answer is All of these

 

Key Points

  • Simplex Communication: This is a one-way communication where one party can send data but cannot receive, like a radio or television broadcast.
  • Duplex Communication: This allows for two-way communication, with both parties able to send and receive data simultaneously, like a telephone conversation.
  • Half-Duplex Communication: This is also a two-way communication but not at the same time. When one party sends data, the other can only receive it, and vice versa. Walkie-talkies are a good example of this mode of communication.
Computer Science: CUET Mock Test - 6 - Question 10

A repeater is a device which operates only in the:

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 10

A repeater is a device that operates only in the physical layer. Signals that carry information within a network can travel a fixed distance before attenuation endangers the integrity of the data.

Computer Science: CUET Mock Test - 6 - Question 11

Which of the following string functions in 'C' converts lowercase input string into uppercase?

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 11

The strupr( ) function is used to convert a given string to uppercase.

Computer Science: CUET Mock Test - 6 - Question 12

What is the fundamental unit of data transport on computer networks?

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 12

A network packet is a formatted unit of data carried by a packet-switched network. Computer communications links that do not support packets, such as traditional packet switching, simply transmit data as a bit stream. When data is formatted into packets, the bandwidth of the communication medium can be better shared among users than with circuit switching. A packet consists of control information and user data, which is also known as the payload. Control information provides data for delivering the payload, for example: source and destination network addresses, error detection codes, and sequencing information. Typically, control information is found in packet headers and trailers.

Computer Science: CUET Mock Test - 6 - Question 13

172.16.122.204 IP address belongs to which IP addresses class?

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 13

Option 1 is the correct answer. The address range of this class is from 128.0.0.0 to 191.255.255.255.

Computer Science: CUET Mock Test - 6 - Question 14

Two statements are given below:

Statement I: Hashing technique is very fast and efficient for large collections, but requires additional memory to store the hash table.
Statement II: Binary search technique is suitable for small collections but can be slow for larger collections.

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 14

Statement I is correct. Hashing technique is very fast and efficient for large collections, but requires additional memory to store the hash table. Statement II is a fact for Linear Search not for a Binary Search. Binary Search technique reduces the search space by half at each step, making it faster than linear search for larger collections.

Computer Science: CUET Mock Test - 6 - Question 15

The CSV files can be accessed:

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 15

Opening a CSV file is simpler than you may think. In almost any text editor or spreadsheet program, just choose File > Open and select the CSV file.

Computer Science: CUET Mock Test - 6 - Question 16

Directions: Match the contents under List I with those under List II.

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 16
  • Join command combines rows from two or more tables.
  • Group By command groups the result set by specified columns.
  • Order By command sorts the result set based on a specified column.
  • Where clause filters the result set based on specified conditions.
Computer Science: CUET Mock Test - 6 - Question 17

What is sorting?

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 17

Sorting is the process of arranging data into meaningful order so that you can analyze it more effectively.

Computer Science: CUET Mock Test - 6 - Question 18

Which of the following operators cannot be used with string data type?

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 18

The ''/'' operator cannot be used with string data type, while the rest three can be used for strings data type.

Computer Science: CUET Mock Test - 6 - Question 19

Database management systems are intended to:

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 19

Database management systems are intended to eliminate data redundancy, establish relationships among records in different files and manage file access. Since all of the given options are true, option 4 is the correct answer.

Computer Science: CUET Mock Test - 6 - Question 20

Which statement is true about denial of service (DOS attack)?

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 20

Dos attack is the type of attack intended to make resources or service unavailable to its intended users. Such DOS attacks are carried out on websites to stop them from functioning.

Computer Science: CUET Mock Test - 6 - Question 21

To prevent infection by a computer virus:

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 21

The most reliable way to make sure you are safe is to open an email attachment or click on a link is to scan it with anti-virus software.

Computer Science: CUET Mock Test - 6 - Question 22

Consider a tuple tup1 = (10, 15, 25 and 30). Identify the statement that will result in an error.

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 22

'tup1[2]=20' will make an error.
Here, the first option 'print(tup1[2])' will display the value at the position.
Therefore, print(tup1[2])=25. The starting position is 0.
print(min(tup1)) will display the minimum value in that tuple.
Here, print(min(tup1))=10
print(len(tup1)) will give output as the tuple length.
print(len(tup1)) = 4
But, tup1[2]=20 means assigning a new value to the position.
In tuples, values are constant.
So, tup1[2]=20 will result in an error.

Computer Science: CUET Mock Test - 6 - Question 23

Which of the following statements correctly describe stack operations?
(A) A stack follows the Last-In, First-Out (LIFO) principle.
(B) The PUSH operation adds an element to the top of the stack.
(C) The POP operation removes an element from the bottom of the stack.
(D) A stack can be implemented using lists in Python.

Choose the correct answer from the options given below:

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 23
  • Statement (A) is correct: A stack follows the Last-In, First-Out (LIFO) principle, meaning the last element added is the first to be removed.
  • Statement (B) is correct: The PUSH operation adds an element to the top of the stack.
  • Statement (C) is incorrect: The POP operation removes an element from the top, not the bottom, of the stack.
  • Statement (D) is correct: A stack can be implemented using Python lists, where append() is used for PUSH, and pop() is used for POP.

Thus, the correct answer is (1) (A), (B), and (D) only.

Computer Science: CUET Mock Test - 6 - Question 24

A text file student.txt is stored in the storage device. Identify the correct option out of the following options to open the file in read mode.
(i) myfile = open('student.txt','rb')
(ii) myfile = open('student.txt','w')
(iii) myfile = open('student.txt','r')
(iv) myfile = open('student.txt')

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 24
  • There are some codes to handle a file in a programming language.
  • myfile=open('student. txt', 'w') is the mode that allows opening a file in write mode.
  • myfile=open('student.txt', 'r') is the mode that open file in only read mode.
  • myfile= open ('student.txt') is also allowed to open in reading mode.
Computer Science: CUET Mock Test - 6 - Question 25

Which module is to be imported for working in binary file?

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 25

The pickle module implements binary protocols for serializing and de-serializing a Python object structure.

Computer Science: CUET Mock Test - 6 - Question 26

What will be the output of the following program?
tuple=("Check")*3
print (tuple)

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 26

Here, Check will be treated as a string, not a tuple, as there is no comma after the element.

Computer Science: CUET Mock Test - 6 - Question 27

Convert the following infix expression to postfix expression using stack:

(A+B*(C-D)^E+(F/G)^H-I)

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 27

The conversion using stack is as follows:


Computer Science: CUET Mock Test - 6 - Question 28

Match the following:

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 28

The correct option is B
A → III, B → I, C → IV, D → II

Concept:
Match the following:

A: Modem → III: The device used for conversion between electric signals and digital bits.
B: Ethernet card → I: A network adapter is used to set up a wired network.
C: Repeater → IV: Regenerate the signals.
D: Switch → II: Connect multiple computers.

Computer Science: CUET Mock Test - 6 - Question 29

In python, Which of the following method  is used find weather the queue is empty or not?

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 29

The correct answer is option C.

Concept:
Queues:

The queue is an abstract data structure, somewhat similar to Stacks.
Unlike stacks, a queue is open at both ends. One end is always used to insert data (en queue) and the other is used to remove data (de queue). Queue follows the First-In-First-Out methodology, i.e., the data item stored first will be accessed first.
Queue follows the principle of First In First Out (FIFO) and Last In Last Out (LILO)
maxsize:
The maximum number of items in the queue. 
put(item): 
Add something to the queue. Wait until a free spot becomes available if the queue is filled before adding the item. 
qsize(): 
Return the number of items in the queue.
full():
If there are maxsize items in the queue, return True. 
get():
A queue item can be removed and returned. Wait until an item is available if the queue is empty.
empty():
Return True if the queue is empty, False otherwise. Here queue is not empty because the still elements are there in the queue. Example:
Explanation:
from queue import Queue
q=Queue(maxsize=10)
q.put('A')
q.put('AA')
q.put('AAA')
print(q.qsize())
print(q.full())
print(q.get())
print(q.empty())
Hence the correct answer is empty().

Computer Science: CUET Mock Test - 6 - Question 30

Match List-I with List-II:

Choose the correct answer from the options given below:

Detailed Solution for Computer Science: CUET Mock Test - 6 - Question 30
  • (A) DDL → (I) Used to define and modify database structures such as tables, indexes, and constraints (CREATE, ALTER, DROP).
  • (B) DML → (III) Includes commands like INSERT, UPDATE, and DELETE, modifying database records.
  • (C) DQL → (II) Used to retrieve data using the SELECT statement.
  • (D) DCL → (IV) Grants and revokes user access permissions using commands like GRANT and REVOKE.
View more questions
39 docs|145 tests
Information about Computer Science: CUET Mock Test - 6 Page
In this test you can find the Exam questions for Computer Science: CUET Mock Test - 6 solved & explained in the simplest way possible. Besides giving Questions and answers for Computer Science: CUET Mock Test - 6, EduRev gives you an ample number of Online tests for practice
Download as PDF