UGC NET Exam  >  UGC NET Tests  >  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 Paper 2 Computer Science Mock Test - 1

UGC NET Paper 2 Computer Science Mock Test - 1 for UGC NET 2024 is part of UGC NET 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 2024 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 course for UGC NET & UGC NET Paper 2 Computer Science Mock Test - 1 solutions in Hindi for UGC NET 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 for UGC NET Exam | Download free PDF with solutions
UGC NET Paper 2 Computer Science Mock Test - 1 - Question 1

A reduced state table has 18 rows. The minimum number of Flips flops needed to implement the sequential machine is:

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

For sequential machine min no. of flip flop = log2 n= log2 18= 4.16

Hence minimum 5 will be required.

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

Directions: Match the following.

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

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.

1 Crore+ students have signed up on EduRev. Have you? Download the App
UGC NET Paper 2 Computer Science Mock Test - 1 - Question 3

Requirements established during requirements analysis are validated against developed software in

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

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 4

Consider the following three SQL queries (Assume the data in the people table).

(a) Select name from people where age > 21.
(b) Select name from people where height > 180.
(c) Select name from people where age > 21 or height > 180.

If the SQL queries (a) and (b) return 10 rows and 7 rows in the result set, respectively, then what is one possible number of rows returned by the SQL query (c)?

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

When set a and set b all rows are distinct ans would be = 10+7 = 17

When set b is subset of set a than 

10+7-7 = 10

Only these two options are preferable.

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

The statement ~ (p↔~q) is equivalent to

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

Concept:

  • A tautology is a mathematical statement that is true in every possible interpretation.
  • ~ symbol represents Negation (NOT).
  • symbol represents biconditional operation.

Explanation:

1→ True

0→ False

Now, option (1) p ↔ q,

Hence, the correct answer is option (1).

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 6
One needs to subnet a network that has 5 subnets, each with at least 16 hosts. Which of the following can be true?
Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 6

Concept:

For sub-netting, bits are borrowed from host section of subnet mask, and these bits are then used for creating subnets. Below are subnet masks for Class A, Class B and Class C.

As you can see, in Class C, the subnet mask can only be created from the last 8 bits.

Explanation:

Option 1: In 255.255.255.192, we get 22 = 4 subnets and 26 - 2 = 62 hosts

Hint – When you write 192 in binary you get, 11000000. The 1’s can be used for subnet id, and 0’s for hosts. Hence, number of subnets is 4 and number of hosts is 64, out of which we eliminate all 0’s and all 1’s of Host id part for local address and broadcast address respectively.

Option_2: In 255.255.255.248, we get 25 = 32 subnets and 23 – 2 = 6 hosts

Option_3: In 255.255.255.240, we get 24 = 16 subnets and 24 – 2 = 12 hosts

Option_4: In 255.255.255.224, we get 23 = 8 subnets and 25 – 2 = 30 hosts

Hence, for 5 subnets and 16 hosts, we can use 255.255.255.224

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

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 8

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 9

Which of the following statements are False for cache misses?

I. Larger blocks reduce compulsory misses by improving temporal locality.

II. A direct mapped cache of size N has the miss rate of half of the 2-way cache of size N/2.

III. Victim cache does not affect cycle time or miss penalty.

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

I. Compulsory miss can be reduced by increasing the cache block size. Larger blocks reduce compulsory misses by improving spatial locality.

II. Higher associativity reduces conflict misses but increases hit time. A direct mapped cache of size N has the same miss rate as a 2-way cache of size N/2.

III. A small cache of “victim” blocks, which were thrown out recently reduces conflict misses. It does not affect cycle time or miss penalty.

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

Take the function f: R→ {0,1} such that Which of the following is true?

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

Concept:

(i)Let f(x) be any function.

Then f(x) is onto if range of f(x) = codomain

(ii) The function f is said to be many-one function if there exist two or more than two different elements X having same image in Y.

Explanation:

The function f: R→ {0,1} such that

Codomain = {0,1}

Since, on taking straight line parallel to the x-axis, the group of function intersect it many points.

⇒ f(x) is many-one

Range of function is {0,1}

As range of f(x) = codomain

⇒ f(x) is onto

Hence, f(x) is many-one and onto

Hence, (4) is true.

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

which of the following is not true?

i) Image Registration is the process of aligning two or more images of the same scene.

ii) The homogeneity and additivity properties together are called the Superposition Property.

iii) Colour enhancement is used to highlight a specific range of colors in an image to separate objects from their surroundings.

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

Key Points

Option 1: ​ Image Registration is the process of aligning two or more images of the same scene.

True, Image Registration is the process of aligning two or more images of the same scene with reference to a particular image. The images are captured from various sensors at different times and at multiple viewpoints.

Option 2: The homogeneity and additivity properties together are called the Superposition Property.

True, Systems that satisfy both homogeneity and additivity are considered to be linear systems. These two rules, taken together, are often referred to as the principle of superposition.

Option 3: Colour enhancement is used to highlight a specific range of colors in an image to separate objects from their surroundings.

False, Color Slicing is used to highlight a specific range of colors in an image to separate objects from their surroundings.

Hence the correct answer is only iii is false.

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

Consider the following C program:

int main() {

int x = 50, y, z;

y = &x;

printf("Address is: %d", y);

}

Count the number of tokens in the above program.

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

Tokens: It is a collection of characters having some meaning which is separated by a lexical analyser and is passed to a parser.

Counting:​

UGC NET Paper 2 Computer Science Mock Test - 1 - Question 14
______ is a line drawing algorithm based only on integer calculation.
Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 14

Concept:

Digital Differential Analyzer (DDA) line drawing algorithm

DDA stands for Digital Differential Analyzer. It is an incremental method of scan conversion of line. In this method calculation is performed at each step but by using results of previous steps.

Bresenham’s line drawing algorithm

This algorithm is used for scan converting a line. It was developed by Bresenham. It is an efficient method because it involves only integer addition, subtractions, and multiplication operations. These operations can be performed very rapidly so lines can be generated quickly. In this method, next pixel selected is that one who has the least distance from true line.

Important Points

Bresenham's Algorithm is faster than DDA Algorithm in line because it involves only addition & subtraction in its calculation and uses only integer arithmetic.

Hence Correct answer is Option 2

Additional Information

Caman’s line drawing algorithm Is not a type of line drawing algorithm.

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

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 15

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 16

Consider the following graph:

i) Minimum spanning tree is unique with weight 7.

ii) Second best minimum spanning tree is unique with weight 8.

iii) Maximum spanning tree is unique with weight 15.

Which of the above statements is/are TRUE?

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

i) If the graph has distinct edge weights, minimum spanning tree is always unique.

ii) There exist two second best spanning trees.

iii) A maximum spanning tree is also unique for a graph with distinct edge weights

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

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 17

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 18

MergeSort algorithm given with (n × k) sorted subarrays, where each subarray is having size of , What is the time complexity for finding single sorted array?

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

Merging two (n3)/k subarray takes [2× (n3)]/k moves most (worst case) And total we have to combine n.k subarray.

Finding single sorted array takes (n4) log(n.k).

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

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 21
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 22

Name the database object in MS Access that stores a question about the data in the database?

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 22
Query in the database object in MS Access stores a question about the data in the database. Databases in MS Access are composed of four objects that is tables, queries, forms, and reports. Together, these objects allow you to enter, store, analyze, and compile your data however you want.
UGC NET Paper 2 Computer Science Mock Test - 1 - Question 23

“Sharding” a database across many server instances can be achieved with _______________.

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 1 - Question 23
“Sharding” a database across many server instances can be achieved with SQL databases, but usually is accomplished through SANs and other complex arrangements for making hardware act as a single server. Sharding is a method for distributing a single dataset across multiple databases, which can then be stored on multiple machines. This allows for larger datasets to be split in smaller chunks and stored in multiple data nodes, increasing the total storage capacity of the system.
UGC NET Paper 2 Computer Science Mock Test - 1 - Question 24

The maximum number of nodes in a binary tree of depth 10 is:

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

The maximum number of nodes in a binary tree of depth K is 2K - 1.

Where K is the depth of binary tree, K > 1.

Given, K = 10

So, maximum number of nodes = 210 - 1 .

= 1023.

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

Determine the value of x, where y = 7, e = 12 and n = 566 using modular exponentiation method (x ≡ ye (mod n)).

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

Given: y = 7, e = 12, and n = 566.

So, x ≡ 512 (mod 566).

Now 512 comes out to 244140625 and taking this value modulo 566, x is determined to be 487.

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

Dynamic programming developed in optimization techniques are widely applied in __________.

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

Dynamic programming developed in optimization techniques by Bellman in the early 1950s and widely applied in operations research and economics is basically a mathematical approach for multi-stage decision problems and this approach is well suited to the optimal design of certain kinds of structure, in general, those in which the interaction between different parts is rather simple.

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

Direction:- A binary search tree is constructed by inserting the following numbers in order:

60, 25, 72, 15, 30, 68, 101, 13, 18, 47, 70, 34

The number of nodes in the left subtree is:

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

Given:

It is Binary search tree but note that it doesn't said it is balanced.

So, First insertion element is ROOT, in the left sub tree of ROOT, we have all elements which are less than ROOT.

Given Sequence of insertion is 60,25,72,15,30,68,101,13,18,47,70,34,

∴ In the inserting elements 25,15,30,13,18,47,34 are less than 60 and 72,68,101,70 are grater than 60 .

No. of Nodes in the left subtree of ROOT = number of nodes less than ROOT =7.

According to the given numbers, and the algorithm, we construct a binary tree i.e.

So, the number of nodes in the left subtree is 7 (13,15,18,25,30,34,47).

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

The assembler stores the object code in ___________.

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

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 29

What field type is best to store serial numbers?

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

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 30

The language used in application programs to request data from the DBMS is referred to as __________.

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

A data manipulation language (DML) is a computer programming language used for adding (inserting), deleting, and modifying (updating) data in a database. And it is the language used in application programs to request data from the DBMS. A DML is often a sub-language of a broader database language such as SQL, with the DML comprising some of the operators in the language.

View more questions
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

Top Courses for UGC NET

Download as PDF

Top Courses for UGC NET