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

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.

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.

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.

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.​

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.

Data:

K₅ 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 = 5^5-2 = 125

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

Counting:​

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.

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.

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

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 W₄ 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.

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

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

The correct answer is option 4.

Concept:

The given program is,

While (p! = 0)

{

If (p>q)

p=p-q;

else,

q=q-p;

printf("%d",p);

}

Explanation:

Scenario 1:

Consider p= 10 and q=5

While loop checks the p is not zero and p is greater than q. So

p updates the 10-5.

p=5 and q=5.

Again checks the while loop condition p is not zero and p is not greater than q. q updates q=5-5

So p=5 and q=0.

Again checks the while loop condition p is not zero and p is greater than q. So p updates the 5-0.

p=5 and q=0.

The above step repeats again and again. And prints the q i.e for the above p=10 and q=5 values it prints 5 5 5 5 infinitely.

Hence the above program runs infinitely.

Scenario 2:

Consider p= 5 and q=10

While loop checks the p is not zero and p is less than q. So else the loop executes

p=5, q=10-5

p=5 and q=5

Again checks the while loop condition p is not zero and p is not greater than q. q updates q=5-5

So p=5 and q=0.

Again checks the while loop condition p is not zero and p is greater than q. So p updates the 5-0.

p=5 and q=0.

The above step repeats again and again. And prints the q i.e for the above p=10 and q=5 values it prints 5 5 5 5 infinitely.

Hence the above program runs infinitely.

Scenario 3:

Consider p= 5 and q=5

While loop

checks the while loop condition p is not zero and p is not greater than q. q updates q=5-5

So p=5 and q=0.

Again checks the while loop condition p is not zero and p is greater than q. So p updates the 5-0.

p=5 and q=0.

The above step repeats again and again. And prints the q i.e for the above p=10 and q=5 values it prints 5 5 5 5 infinitely.

Hence the above program runs infinitely.

Hence the correct answer is the loop will run infinitely.

Note:

The answer given in the answer key is not satisfying the given code. For the three scenarios p and q, one of them should be there so the correct answer is option 4. I.e The loop will run infinitely.

Concepts:

Sequence: 80, 102, 26, 160, 35, 10, 135

Algorithm: shortest seek time first

Arrange in ascending order: 10, 26, 35, 80, 102, 135, 160

Head is at cylinder: 40

Diagram:

Calculation:

Total Head movements= (40 - 35) + (35 - 26) + (26 - 10) + (80 - 10) + (102 - 80) + (135 - 102) + (160 - 135)

Total Head movements to serve all request = 5 + 9 + 16 + 70 + 22 + 33 + 25 = 180

Tips and Tricks:

Since the direction changes only once:

Total Head movements to serve all request = (40 – 10) + (160 – 10) = 180

The correct answer is option 4:

Key Points

In stack organized architecture push and pop instruction is needs a address field to specify the location of data for pushing into the stack and destination location during pop operation but for logic and arithmetic operation the instruction does not need any address field as it operates on the top two data available in the stack.

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

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

Given, K = 10

So, maximum number of nodes = 2¹⁰ - 1 .

= 1023.

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.

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.

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).

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.

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.

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.

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.

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.