UGC NET Exam  >  UGC NET Tests  >  UGC NET Mock Test Series 2025  >  UGC NET Paper 2 Computer Science Mock Test - 1 - UGC NET MCQ

UGC NET Paper 2 Computer Science Mock Test - 1 - UGC NET MCQ


Test Description

30 Questions MCQ Test UGC NET Mock Test Series 2025 - UGC NET Paper 2 Computer Science Mock Test - 1

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

A 4-bit synchronous UP counter is holding a state 0101. What will be the count after 27th clock pulse?

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 1

After every modulus the initial state will repeat hence after 16 clock pulses the counter holds the same state i.e decimal 5

The remaining clock pulses 27-16=11,so the final state is 11+5=16

For this counter means 0000.

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 2

A slotted ALOHA network transmits 200 bits frames using a shared channel with 200 kbps bandwidth. If the system (all stations put together) produces 1000 frames per second, then the throughput of the system is

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 2

For pure aloha Throughput(S) = Ge-2G.

For Slotted aloha Throughput(S) = Ge-G. (it is maximum at G = 1).

i.e. S = 1 × e-1.

S = 1 / e.

S = 1 / 2.71

S = 0.368.

So, option (C) is correct

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 3

Directions: Match the following.

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 3

a-iii    is directly implied

b-i    function oriented metrics measuring the following parameters:- 

Number of user inputs:  Each user input that provides distinct application oriented data to the software is counted.  

Number of user outputs: Each user output that provides application oriented information to the user is counted. In this context output refers to reports, screens, error messages, etc.  

Number of user inquiries: An inquiry is defined as an on-line input that 

Results in the generation of some immediate software response in the form of an on-line output. Each distinct inquiry is counted. 

Number of files: Each logical master file (i.e., a logical grouping of data that may be one part of a large database or a separate file) is counted. 

Number of external interfaces: All machine readable interfaces (e.g., data files on storage media) that are used to transmit information to another system.

c-iv: A function point extension called feature points, is a superset of the function point measure that can be applied to systems and engineering software applications.The feature point measure accommodates applications in which algorithmic complexity is high. Real-time, process control and embedded software applications tend to have high algorithmic complexity and are therefore amenable to the feature point.

d-ii: A function point is a "unit of measurement" to express the amount of business functionality an information system (as a product) provides to a user. Function points are used to compute a functional size measurement (FSM) of software. The cost (in dollars or hours) of a single unit is calculated from past projects.

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 4
Requirements established during requirements analysis are validated against developed software in
Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 4

According to the Capability Maturity Model (CMMI-SW v1.1),

Software Verification: The process of evaluating software to determine whether the products of a given development phase satisfy the conditions imposed at the start of that phase. [IEEE-STD-610]

Software Validation: The process of evaluating software during or at the end of the development process to determine whether it satisfies specified requirements.

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 5

For a program of k variables, boundary value analysis yields ______ test cases.

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 5

For a program of k variables boundary value analysis yields 4 × k + 1 test

Robustness testing yields 6 × k + 1

worst case testing yields 5 × k.

So, option (C) is correct.

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 6
Which of the following process models is also called as classic life cycle model?
Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 6

 The Waterfall Model was first Process Model to be introduced.

  • It is also referred to as a linear-sequential life cycle model.
  • It is very simple to understand and use. In a waterfall model, each phase must be completed fully before the next phase can begin.
  • This type of model is basically used for the for the project which is small and there are no uncertain requirements.
  • At the end of each phase, a review takes place to determine if the project is on the right path and whether or not to continue or discard the project.
  • In this model the testing starts only
  • after the development is complete.
  • In waterfall model phases do not overlap.
UGC NET Paper 2 Computer Science Mock Test - 1 - Question 7

Which of the following statements are useful for the Internet of Things to Grow Ecommerce Businesses?

Statement 1:Better tracking and logistics

Statement 2: Automated management of inventory

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 7

The correct answer is option 1.

Concept:

Better tracking and logistics:

IoT technology allows eCommerce companies to track consumer orders from the minute they are placed to the moment they arrive at the customer's door. It also aids in the automation of shipping and delivery to avoid missing goods while optimizing vehicle routes.

Hence the given statement is useful for Ecommerce Businesses.

Automated management of inventory:

To know what is in and out of stock, eCommerce companies like to have control over the products leaving and entering their warehouses. With IoT sensors and RFID tags implemented in inventory systems, corporate processes may be greatly simplified, and merchants no longer need to engage store managers to physically inspect items because they have real-time information on their stock.

In this approach, IoT enhances eCommerce by collecting and transmitting new and relevant data about goods to ERP systems.

Hence the given statement is useful for Ecommerce Businesses.

Hence the correct answer is Both statement 1 and statement 2 are true.

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 8

Which of the following is/are the examples of symmetric encryption methods?

(i) Data Encryption Standard (DES)

(ii) Advanced Encryption Standard (AES)

(iii) Rivest – Shamir – Adleman (RSA)

(iv) Public Key Infrastructure (PKI)

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 8

The correct answer is Only (i), (ii).

Key Points

Symmetric encryption methods utilize the same key for both encryption and decryption. They are usually faster compared to asymmetric methods because they handle data directly using a single key. Here's the classification for the methods you listed:

(i) Data Encryption Standard (DES) - Symmetric encryption method

(ii) Advanced Encryption Standard (AES) - Symmetric encryption method

(iii) Rivest – Shamir – Adleman (RSA) - Asymmetric encryption method

(iv) Public Key Infrastructure (PKI) - This is not an encryption method itself. Rather, it's a framework for services that create, distribute, manage, store, and revoke digital certificates. However, it does use asymmetric encryption as part of its functioning.

The Data Encryption Standard:

  • It is a symmetric-key algorithm for the encryption of digital data.
  • Although its short key length of 56 bits makes it too insecure for modern applications.
  • It has been highly influential in the advancement of cryptography.

The Advanced Encryption Standard:

  • It is also known by its original name Rijndael.
  • It is a specification for the encryption of electronic data established by the U.S.
  • National Institute of Standards and Technology in 2001.

RSA:

  • It is a public-key cryptosystem that is widely used for secure data transmission.
  • It is also one of the oldest.
  • The acronym "RSA" comes from the surnames of Ron Rivest, Adi Shamir and Leonard Adleman, who publicly described the algorithm in 1977.

The Public key infrastructure (PKI):

  • It is the set of hardware, software, policies, processes, and procedures required to create, manage, distribute, use, store, and revoke digital certificates and public-keys.
UGC NET Paper 2 Computer Science Mock Test - 1 - Question 9

Taking into account the provided weighted graph, the Bellman-Ford algorithm is applied with vertex P serving as the source. The minimum distance from the starting point P to the target vertex T is determined as _______.

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 9

The correct answer is 2

EXPLANATION:

  • The Bellman-Ford algorithm solves the single-source shortest-paths problem in the general case in which edge weights may be negative.
  • Initialize all distance from the source to itself as 0 and to remaining vertices as infinite.

Process remaining edges.​

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 10

Which of the following statements are TRUE?

1. The problem of determining whether there exists a cycle in an undirected graph is in P.

2. The problem of determining whether there exists a cycle in an undirected graph is in NP.

3. If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 10

The correct answer is option 1.

Key Points

BFS or DFS can be used to find whether there is a cycle in an undirected graph. For example, see DFS based implementation to detect cycle in an undirected graph. The time complexity is O(V+E) which is polynomial and it is a P problem. Every p problems are NP problem (since P⊂NP). So, statement 1 and statement 2 are true.

NP-Complete ⊂ NP, for every NP problem, has a non-deterministic polynomial-time algorithm. Hence statement 3 is true.

Hence the all the statements are correct

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 11

Match all items in Group 1 with the best match from the options given in Group 2.

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 11

The correct answer is option 3.

Concept:

Min-and max-heaps:

It's either a Min Heap or a Max Heap is a Binary Heap. In a Min Binary Heap, the root key must be the smallest of all the keys in the Binary Heap. For all nodes in a Binary Tree, the same property must be true recursively. Similarly, with a Max Binary Heap, the root key must be the largest of all the keys in the Binary Heap. For all nodes in a Binary Tree, the same property must be true recursively.

Min heap and max-heap are implemented by a Priority queue. The default PriorityQueue is implemented with Min-Heap, that is the top element is the minimum one in the heap.

P. Min-and max-heaps = 2. Priority queue implementations.

B-tress:

A B-tree is a self-balancing tree data structure that keeps sorted data and permits logarithmic time searches, sequential access, insertions, and removals. B-tresses are used to implement a file system.

Q. B-tress= 1. File system implementation.

Arrays:

Insertion and Deletion operations are costlier since the memory locations are consecutive and fixed. Insertion and Deletion operations are fast and easy in a linked list.

R. Arrays= 3. Expensive insertion and deletion operations

Graphs:

The network graph is simply called a graph. It consists of a set of nodes connected by branches. In graphs, a node is a common point of two or more branches. Sometimes, only a single branch may connect to the node. A branch is a line segment that connects two nodes.

Any electric circuit or network can be converted into its equivalent graph by replacing the passive elements and voltage sources with short circuits and the current sources with open circuits. That means, the line segments in the graph represent the branches corresponding to either passive elements or voltage sources of the electric circuit.

S. Graphs= 4. Electronic circuit design analysis

Hence the correct answer is P - 2, Q - 1, R - 3, S - 4.

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 12
The maximum number of spanning tree possible for graph K5 is _____.
Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 12

Data:

K5 is a complete graph with 5 vertex, that is, n = 5

Formula:

maximum number of spanning tree possible = nn - 2

Calculation:

maximum number of spanning tree = 55-2 = 125

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 13

Which of the following statements are true?

A) Classification and Regression are supervised learning techniques.

B) Clustering and Density Estimation are unsupervised learning techniques.

C) Supervised learning is learn input and output map.

D) Unsupervised learning is discover pattern in the input data.

E) Reinforcement learning describes a class of problems where an agent operates in an environment and must learn to operate using feedback.

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 13

The correct answer is option 4.

Key Points

  • Supervised learning describes a class of problem that involves using a model to learn a mapping between input examples and the target variable.
    • Classification: Supervised learning problem that involves predicting a class label.
    • Regression: Supervised learning problem that involves predicting a numerical label.
  • Unsupervised learning describes a class of problems that involves using a model to describe or extract relationships in data.
    • Clustering: Unsupervised learning problem that involves finding groups in data.
    • Density Estimation: Unsupervised learning problem that involves summarizing the distribution of data.
  • Reinforcement learning describes a class of problems where an agent operates in an environment and must learn to operate using feedback.

Hence the correct answer is A, B, C, D, and E only.

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 14

Which of the following is true?

(i) On average, neural networks have higher computational rates than conventional computers.

(ii) Neural networks learn by example.

(iii) Neural networks mimic the way the human brain works.
Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 14

Neural networks have the following advantages compared to conventional computers.

  • Neural networks have higher computational rates than conventional computers because a lot of the operation is done in parallel.
  • The idea behind neural nets is based on the way the human brain works. Neural nets cannot be programmed, they can only learn by examples.
  • They are always able to respond and small changes in the input do not normally cause a change in the output. Hence, they are more fault tolerant.
UGC NET Paper 2 Computer Science Mock Test - 1 - Question 15

Maximal matching of a wheel graph W4 is W, chromatic number of cycle graph C4 is X, vertex connetivity of bipartite graph K2,3 is Y and Edge connectivity of bipartite graph K2,3 is Z. Then W+X+Y+Z= _________?

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 15

Key Points

Maximal matching of graph G is a matching to which no other edges of the graph G can be added.

Maximal matching of a wheel graph with n vertices = ⌊n/2 ⌋

For the W4 graph is Maximal matching is =2=W

The chromatic number of a graph is the smallest number of colors needed to color the vertices of so that no two adjacent vertices share the same color

The chromatic number of cycle graph C4 is = 2 colours are sufficient.=X

Vertex connectivity is the smallest number of vertices whose deletion causes a connected graph to not be connected.

Vertex connectivity of bipartite graph K2,3 is = minimum of {2,3}=2= Y

Edge connectivity is the minimum number of edges whose deletion from a graph disconnects. , also called line connectivity.

Edge connectivity of bipartite graph K2,3 is= Maximum of {2,3} =2= Z

So W+X+Y+Z= 2+2+2+2=8

Hence the correct answer is 8.

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 16

State whether True or False.

I. A Packet-Filter Firewall filters at the Application Layer whereas a Proxy Firewall filter at the Network or Transport Layer.

II. The idea that the cryptanalyst knows the algorithms and that the secrecy lies exclusively in the keys is called Kerckhoff’s principle.

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 16

Concept:

  • Packet filter firewall operates at the network and transport layer.
  • Proxy firewall filter operates at the application layer.

Kerckhoff’s principle :

All algorithm must be public only the keys are secret.

A cryptographic system should be designed to be secure even if all its details except for the key are publicly known.

Explanation:

From above two points it is clear that statement 1 is false and second statement is nothing but

kerckhoff’s principle so option 2 is the correct answer.

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 17
Which of the following is an NP-complete problem?
Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 17

Concept:

NP complete problem is a class of computational problems for which no efficient solution algorithm has been found. No polynomial time algorithm is there for NP complete problem.

NP complete problem examples:

Travelling salesman problem, Hamiltonian cycle problem, clique problem, Subset set problem, CNF – Satisfiability problem.
UGC NET Paper 2 Computer Science Mock Test - 1 - Question 18

A digital circuit has 3 input lines, 1 enable line and 8 output lines. This circuit will be called:

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 18

Concept:

Encoder:

An encoder has 2n input lines and n output lines. In the encoder, the output lines generate the binary code corresponding to the input value which is active high.

Decoder:

It is a multi-input and multi-output logic circuit that converts coded inputs into coded outputs where input and output codes are different. Input code has fewer bits than output code. There is a one-to-one mapping from input to output.

Hence Decoder is the correct answer.

Multiplexer:

It is a digital switch. It allows digital information from several sources to be routed onto a single output line. A basic multiplexer has several data input lines and a single output line. The selection of a particular input line is controlled by selection lines. It is many to one mapping and provides the digital equivalent of an analog selector switch.

Demultiplexer:

It is a circuit that receives information on a single line and transmits information on one of the 2n output lines. The selection of the output line is controlled by values of n selection lines.

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 19
In asymmetric key cryptography, the private key to decrypt an encrypted message is kept by
Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 19
In asymmetric key cryptography each node has 2 keys private key and public key public key is as the name suggests is public that is known to sender while the private key held by the receiver which decrypts the data encrypted by sender using public key of receiver.
UGC NET Paper 2 Computer Science Mock Test - 1 - Question 20

Name the database that must be independent of the application that uses it.

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 20
A database must be independent of the application that uses it. All its integrity constraints can be independently modified without the need for any change in the application. This rule makes a database-independent of the front-end application and its interface.
UGC NET Paper 2 Computer Science Mock Test - 1 - Question 21

Which of the following is correct statement?

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 21
HBase is a data model that is similar to Google’s big table designed to provide quick random access to huge amounts of structured data. HBase is a distributed column-oriented database built on top of the Hadoop file system. It is an open-source project and is horizontally scalable.
UGC NET Paper 2 Computer Science Mock Test - 1 - Question 22

While using the iterative construct (Branching) in execution _____________ instruction is used to check the condition.

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 22
While using the iterative construct (Branching) in execution branch instruction is used to check the condition. A branch is an instruction in a computer program that may, when executed by a computer, cause the computer to begin execution of a different instruction sequence. Branch instruction is used to check the test condition and to perform the memory jump with the help of offset.
UGC NET Paper 2 Computer Science Mock Test - 1 - Question 23

The public key of a given user, in an RSA encryption system is e = 57 and n = 3901. What is the value of Euler’s totient function ϕ(n) for calculating the private key of the user?

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 23

Given,

n=3901 and e=31. 

We know that,

n = p × q where, p and q are prime numbers, which gives 3901 = 47 × 83. 

Now, ϕ(n) is Euler’s totient function i.e., 

ϕ(n) = (p−1) × (q−1)

ϕ(n) = (47−1) × (83−1)

ϕ(n) = 46 × 82 

ϕ(n) = 3772.

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 24

Which transformation distorts the shape of an object such that the transformed shape appears as if the object were composed of internal layers that had been caused to slide over each other?

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 24

Shearing transformation distorts the shape of an object such that the transformed shape appears as if the object were composed of internal layers that had been caused to slide over each other. Two common shearing transformations are the type of transformations that shift coordinate x values coordinate y values. In shear transformation, the transformed shape appears as if the object were composed of internal layers that had been caused to slide over each other.

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 25

The assembler stores the object code in ___________.

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 25

The assembler stores the object code in Magnetic disk. After compiling the object code, the assembler stores it in the magnetic disk and waits for further execution. A magnetic disk is a storage device that uses a magnetization process to write, rewrite and access data. It is covered with a magnetic coating and stores data in the form of tracks, spots and sectors. Hard disks, zip disks and floppy disks are common examples of magnetic disks.

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 26

The open source movement has meant that there is a huge reusable code base available at ____________.

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 26

The open source movement has meant that there is a huge reusable code base available at low cost. This may be in the form of program libraries or entire applications. The open-source movement created equal opportunities for people all over the world to participate in the global economy.

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 27

What field type is best to store serial numbers?

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 27

AutoNumber field type is best to store serial numbers. AutoNumber is a type of data used in Microsoft Access tables to generate an automatically incremented numeric counter. The serial data type stores a sequential integer, of the int data type, that is automatically assigned by the database server when a new row is inserted. The default serial starting number is 1, but you can assign an initial value, n when you create or alter the table.

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 28

Which of the following is not a component of relational database?

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 28

Except, hierarchy all other, are components of relational database. The traditional storage of data that is organized by customer, stored in separate folders in filing cabinets is an example of hierarchy type of 'database' system.

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 29

A particular text index value is chosen with the function:

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 29

The function setTextIndex(ti) is used to chose the particular text index value. Bundles values for text font, precision, expansion factor, size, and color in a table position for workstation ws that is specified by the value assigned to text index parameter ti. Each text function that is then invoked is displayed on each workstation with the set of attributes referenced by this table position.

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 30

The memory allocation scheme subject to "external" fragmentation is:

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 30

Segmentation is a memory management technique in which the memory is divided into variable size parts. Each part is known as a segment that can be allocated to a process. The details about each segment are stored in a table called a segment table.

View more questions
92 docs|125 tests
Information about UGC NET Paper 2 Computer Science Mock Test - 1 Page
In this test you can find the Exam questions for UGC NET Paper 2 Computer Science Mock Test - 1 solved & explained in the simplest way possible. Besides giving Questions and answers for UGC NET Paper 2 Computer Science Mock Test - 1, EduRev gives you an ample number of Online tests for practice
Download as PDF