UGC NET Exam  >  UGC NET Tests  >  UGC NET Mock Test Series 2024  >  UGC NET Paper 2 Computer Science Mock Test - 10 - UGC NET MCQ

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


Test Description

30 Questions MCQ Test UGC NET Mock Test Series 2024 - UGC NET Paper 2 Computer Science Mock Test - 10

UGC NET Paper 2 Computer Science Mock Test - 10 for UGC NET 2024 is part of UGC NET Mock Test Series 2024 preparation. The UGC NET Paper 2 Computer Science Mock Test - 10 questions and answers have been prepared according to the UGC NET exam syllabus.The UGC NET Paper 2 Computer Science Mock Test - 10 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 - 10 below.
Solutions of UGC NET Paper 2 Computer Science Mock Test - 10 questions in English are available as part of our UGC NET Mock Test Series 2024 for UGC NET & UGC NET Paper 2 Computer Science Mock Test - 10 solutions in Hindi for UGC NET Mock Test Series 2024 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 - 10 | 100 questions in 120 minutes | Mock test for UGC NET preparation | Free important questions MCQ to study UGC NET Mock Test Series 2024 for UGC NET Exam | Download free PDF with solutions
UGC NET Paper 2 Computer Science Mock Test - 10 - Question 1

Preorder traversal of binary search tree is 38, 14, 8, 23, 18, 20, 56, 45, 82, 70. What is the postorder traversal of binary search tree?

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

The correct option is option 3) 8, 20, 18, 23, 14, 45, 70, 82, 56, 38.

Concept:

  • To determine the postorder traversal of a binary search tree (BST) based on the given preorder traversal, we need to understand the properties of a BST and how its nodes are arranged.
  • In a BST, the preorder traversal visits nodes in the following order: root, left subtree, right subtree. Since the preorder traversal given is 38, 14, 8, 23, 18, 20, 56, 45, 82, 70, we can determine the structure of the BST as follows:
  • The first element, 38, represents the root of the BST.
  • Elements smaller than 38 will be in the left subtree, and elements greater than 38 will be in the right subtree.

Explanation:

Using this information, we can break down the preorder traversal step by step and build the BST:

Step 1: The root node is 38.
Step 2: The next element, 14, is smaller than 38, so it becomes the left child of 38.
Step 3: The next element, 8, is smaller than 38 and 14, so it becomes the left child of 14.
Step 4: The next element, 23, is greater than 14 and 8, so it becomes the right child of 8.
Step 5: The next element, 18, is greater than 14 and 8 but smaller than 23, so it becomes the left child of 23.
Step 6: The next element, 20, is greater than 14, 8, and 18, so it becomes the right child of 18.
Step 7: The next element, 56, is greater than 38, so it becomes the right child of 38.
Step 8: The next element, 45, is greater than 38 but smaller than 56, so it becomes the left child of 56.
Step 9: The next element, 82, is greater than 38 and 56, so it becomes the right child of 56.
Step 10: The final element, 70, is greater than 38 and 56 but smaller than 82, so it becomes the left child of 82.

Based on this process, the BST can be represented as follows:

Now that we have the BST structure, we can find the postorder traversal by visiting the nodes in the following order: left subtree, right subtree, root. Applying this to the BST above, the postorder traversal will be: 8, 20, 18, 23, 14, 45, 70, 82, 56, 38

Thus, the postorder traversal of the given binary search tree is 8, 20, 18, 23, 14, 45, 70, 82, 56, 38.

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

Consider the following array of elements 289, 219, 250, 217, 212, 215, 22, 25, 27, 211, 26, 29, 300. What is the minimum number of interchanges required to convert it into max-heap?

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

  • This is the original heap as per the array.
  • Swap 300 and 215.
  • Swap 300 and 250.
  • Swap 300 and 289.
  • A total of three swaps are required to convert it to max-heap.

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

The line graph L(G) of a simple graph G is defined as follows:

  • There is exactly one vertex v(e) in L(G) for each edge e in G.
  • For any two edges e and e' in G, L(G) has an edge between v(e) and v(e'), if and only if e and e' are incident with the same vertex in G.

Which of the following statements is/are TRUE?

(P) The line graph of a cycle is a cycle.

(Q) The line graph of a clique is a clique.

(R) The line graph of a planar graph is planar.

(S) The line graph of a tree is a tree.

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

The correct answer is “option 1”.

EXPLANATION:

Statement P: True

Every edge in a given cycle graph will become a vertex in the new defined graph L(G) and every vertex of the cycle graph will become an edge in the new graph.

Statement R: False

Consider a planar graph with 5 vertices and 9 edges.

Also assume, the degree of one vertex is 2 and the rest is 4.

So L(G) has 9 vertices (since G has 9 edges) and 25 edges.

But, the planar graph must satisfy the condition:

|E| < = 3|V| - 6

So for 9 vertices,

|E| < = 3×9- 6

|E| < = 21

But L(G) has 25 edges & hence it is not planar.

So this statement is false.

Since Option 2 and 3 contains R, these options are eliminated.

Statement S: False

From this tree:

By drawing its line graph, a cycle graph can be formed of 3 vertices.

So this statement is wrong.

Hence, option 4 is wrong.

Hence, the correct answer is “option 1”.

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

The regular expression  denotes the same set as

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

NOTE THAT:

TRY TO DRAW AN NFA AND THEN OBTAIN REGULAR EXPRESSION.

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

Assume a program with the following memory requirements.

What is the total size of memory required to load and run this program?

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

Overlay: Whenever a program is running or is loaded in the RAM, it will not use the complete program, but only some part of it. Whenever the part of the program is required, it will load up and then once the part of the program will be of no use, it will unload itself. When it is needed again, it can be reloaded and run again.

Total memory requirement:

For A  BD = 2 + 3 + 9 = 14 KB

For A  BE = 2 + 3 + 8 = 13 KB

For A  CF = 2 + 4 + 7 = 13 KB

For A  CG = 2 + 4 + 5 = 11 KB

As we can see, the largest program part size is 14 KB. Hence, we need 14 KB maximum size to run the given program

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

Consider the following grammar G:

What is the FOLLOW(A)?

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

Concept:

Follow(X) is the set of terminals that can appear immediately to the right of non-terminal X in some sentential form. Rules for finding the follow (X) are given here as:

1) Follow (S) = {$}, where S is the start symbol.

2) If A → bBC is the production, where b, B and C are grammar symbols, then Follow (B) is first (C).

3) If A → bB is production then follow (B) is follow (A).

4) If A → bBC is production and first(c) contains ε, then follow (B) contains {first (C) - ε} U follow (A).

Explanation:

FIRST(B) = {r, ε}

FIRST(C) = {q, ε}

FIRST(D) = {p}

FIRST(A) = FIRST (BCD) = {r, q, p}

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

Which one of the following fields is present in both TCP header and UDP header?

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

Concept:

Source Port number, Destination Port number and Checksum is present in both TCP header and UDP header.

Diagram:

Important Point:

Header length in TCP header and Length in UDP header are different.

UGC NET Paper 2 Computer Science Mock Test - 10 - Question 8
The maximum value of the objective function z = 5x + 2y under the linear constraints x ≥ 0, y ≥ 0, x ≥ y and 2 ≤ x + y ≤ 4 is
Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 10 - Question 8

Explanation:

objective function z = 5x + 2y under the linear constraints

x ≥ 0, y ≥ 0, x ≥ y and 2 ≤ x + y ≤ 4

So, LPP is

Maximize z = 5x + 2y

subject to

x + y ≥ 2

x + y ≤ 4

x ≥ 0, y ≥ 0

Feasible region is ABCDA whose corner points are

A(2, 0), B(4, 0), C(0, 4), D(0, 2)

z = 5x + 2y

Z(2, 0) = 10, Z(4, 0) = 20, Z(0, 4) = 8, Z(0, 2) = 4

So, max z = 20 at (4, 0)

Hence option (2) is correct

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

Which of the following statement are true about Feasibility Analysis?

Statement 1: Feasibility Analysis is used to obtain the outline of the problem and decide whether a feasible or appropriate solution exists or not.

Statement 2: A feasibility study can be considered as the final investigation that helps the software development life cycle.

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

The correct answer is option 1.

Concept:

Statement 1: Feasibility Analysis is used to obtain the outline of the problem and decide whether a feasible or appropriate solution exists or not.

True, A feasibility study examines all important aspects of a project to assess the viability and probability of completion. Feasibility Analysis is performed to outline the problem and determine whether or not a viable or adequate solution exists.

Statement 2: A feasibility study can be considered as the final investigation that helps the software development life cycle.

False, Feasibility studies are preliminary investigations that assist management in determining if a system study is viable for development or not.

Hence the correct answer is Only statement 1.

UGC NET Paper 2 Computer Science Mock Test - 10 - Question 10
The truth values of traditional set theory is ____________ and that of fuzzy set is __________
Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 10 - Question 10

Fuzzy logic:

  • Fuzzy logic is a concept of certain degree. Boolean logic is a subset of fuzzy logic.
  • Fuzzy logic is a form of many-valued logic which deals with reasoning that is approximate rather than fixed and exact.
  • Compared to traditional binary sets (where variables may take on true or false values), fuzzy logic variables may have a truth value that ranges in degree between 0 and 1.
  • It is employed to handle the concept of partial truth, where the truth value may range between completely true and completely false.
UGC NET Paper 2 Computer Science Mock Test - 10 - Question 11
What is defuzzification?
Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 10 - Question 11

Crisp Logic - In this, the values are of boolean nature and strictly precise values, that is, either 0 or 1.

Fuzzy Logic - It is a type of logic that allows for the inclusion of uncertain or ambiguous information.

Defuzzification - It is the process of producing a quantifiable result in crisp logic, given fuzzy sets and corresponding membership degrees. It is the process that maps a fuzzy set to a crisp set. It is typically needed in fuzzy control systems.

  • It converts imprecise data into precise data.
  • Methods of Defuzzification - Maximum membership principle, centroid method, weighted average method, centre of sums, etc.
  • Complicated in nature.
  • Uses centre of gravity method to find centroids of given sets.
UGC NET Paper 2 Computer Science Mock Test - 10 - Question 12

Database table by name Employee_Records is given below

What is the output of the following SQL query?

SELECT Count(*) FROM

( ( SELECT Employee, Manager FROM Employee_Records)

AS S NATURAL JOIN

( SELECT Manager, Salary FROM Employee_Records) AS T );

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

Correct answer is Option C
Key Points
Following will be contents of temporary table S

Following will be contents of temporary table T

  • Following will be the result of natural join of above two tables.
  • The key thing to note is that the natural join happens on column name with same name which is Manager in the above example.
  • “Hari” appears two times in Manager column, so there will be four entries with Manager as “Hari”.

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

Given below are some famous algorithms and some algorithm design paradigms

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 10 - Question 13
  • Dijkstra’s Shortest Path uses the greedy method to find the shortest path of a graph G(V, E).
  • Floyd Warshall algorithm is based on the principle of dynamic programming. It is used to solve the all pair shortest path problem.
  • Kruskal algorithm is a minimum spanning tree algorithm in which in every iteration, minimum weighted edge is found and then it is added to the construction of minimum spanning tree. Edges are added in increasing order of the edge weights. That’s why it is a greedy approach.
  • Merge sort is an efficient sorting algorithm that uses a divide-and-conquer approach to order elements in an array.
UGC NET Paper 2 Computer Science Mock Test - 10 - Question 14

Name the system in which the end-user must not be able to see that the data is distributed over various locations.

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 10 - Question 14
In Distribution Independence, the end-user must not be able to see that the data is distributed over various locations. Users should always get the impression that the data is located at one site only. This rule has been regarded as the foundation of distributed database systems. This is the third major rule of DBMS.
UGC NET Paper 2 Computer Science Mock Test - 10 - Question 15

The addressing mode which makes use of in-direction pointers is ______.

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 10 - Question 15
In Indirect addressing mode, the value of the register serves as another memory location and so we use pointers to get the data. Indirect addressing is a scheme in which the address specifies which memory word or register contains not the operand but the address of the operand. For example, LOAD R1, @100 Load the content of memory address stored at memory address 100 to the register R1.
UGC NET Paper 2 Computer Science Mock Test - 10 - Question 16

The minimum number of stacks required to implement a queue is __________.

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 10 - Question 16
The minimum number of stacks required to implement a queue is 2. In Queue, one stack is required for the enqueue operation, and another stack will be used for the dequeue operation. The first stack is considered as the input stack whereas the second stack is considered as the output stack.
UGC NET Paper 2 Computer Science Mock Test - 10 - Question 17

How many bit strings of length ten either start with a 1 bit or end with two bits 00?

Detailed Solution for UGC NET Paper 2 Computer Science Mock Test - 10 - Question 17
Strings of length 10 with starting bit as 1:

As, 1 bit is fixed, we have left with 9 positions, bit used are 2(0 & 1). So, total possible strings with this are 29.

Strings of length 10 that end with 00:

In this, 2 position are fixed, we are left with only 8 positions. Total possible strings with this are 28.

Strings of length 10 that starts with 1 and end with 00:

In this, 3 position are already fixed, and we have only 7 positions. Total strings possible are 27.

Now strings possible that starts with 1 or end with 00:

A U B = A + B - A ꓵ B

A U B = 29 + 28 - 27 = 512 + 256 - 128 = 640

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

DML language is used to ____________.

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

DML refers to the tools used to add, update and access the data within a database, including things like artists, albums, and so on in our music database example. DML is a categorization of existing SQL commands. DML commands include SELECT, INSERT, UPDATE, and DELETE.

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

________ sorting algorithms has the lowest worst-case complexity.

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

Merge Sort sorting algorithms has the lowest worst-case complexity. It is based on the divide and conquer approach. It divides the complete array into small sub arrays until each sub array contains an element and then sort them and merge them. Time complexity in this case is O(nlogn).

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

Forward engineering is also known as-

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

Forward engineering, also called renovation or reclamation, not only recovers design information from existing software, but uses this information to alter or reconstitute the existing system in an effort to improve its overall quality.

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

Which of the following is a scientific computer language?

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

Fortran is a scientific computer language.

It was originally developed by a team at IBM in 1957 for scientific calculations. It also allows the compiler to generate efficient binary code. It is a scientific computing language. It is also used in organizations such as weather forecasters, financial trading, and engineering simulations.

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

In geometric programming, the emphasis is on __________.

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

In geometric programming, the emphasis is on Variable distribution. A geometric program (GP) is a type of mathematical optimization problem characterized by objective and constraint functions that have a special form. Application of geometric programming to structures optimization problems has been attempted by temple man and of the total cost among the various terms in the objective function instead of on the values of the variables.

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

Which component of MVC architecture deals the database?

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

Model–view–controller (MVC) is a software design pattern commonly used for developing user interfaces that divide the related program logic into three interconnected elements Model, View and Controller. But the Model element is deal with the database. Model is the central component of the architecture. It is the application's dynamic data structure, independent of the user interface. It directly manages the data, logic and rules of the application.

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

Which is a software configuration management concept that helps us to control change without seriously impeding justifiable change?

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

Baselines is a software configuration management concept that helps us to control change without seriously impeding justifiable change. A baseline is a milestone and reference point in software development that is marked by completion or delivery of one or more software configuration items and formal approval of a set of predefined products is obtained through formal technical review. Baseline is a shared project database.

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

Which of the following feature is also known as run-time binding or late binding?

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

Dynamic binding or run-time binding or late binding is that type of binding which happens at the execution time of the program or code. Function or method overriding is the perfect example of this type of binding. Virtual functions are used to achieve the concept of function overriding.

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

What is a Multiprogramming?

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

Multiprogramming allows multiple programs to reside in separate areas of the core at the time. Multiprogramming is a rudimentary form of parallel processing in which several programs are run at the same time on a uniprocessor. Instead, the operating system executes part of one program, then part of another, and so on. To the user, it appears that all programs are executing at the same time.

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

Which of the following parser is a top-down parser?

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

Recursive descent parser is a kind of top-down parser built from a set of mutually recursive procedures (or a non-recursive equivalent) where each such procedure implements one of the nonterminal of the grammar. Thus the structure of the resulting program closely mirrors that of the grammar it recognizes.

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

Which search implements stack operation for searching the states?

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

Depth-first search implements stack operation because it always expands the deepest node in the current tree. Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking.

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

ZooKeeper is especially fast in ___________ workloads.

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

ZooKeeper applications run on thousands of machines, and it performs best where reads are more common than writes, at ratios of around 10:1. ZooKeeper is replicated over a set of hosts (called an ensemble) and the servers are aware of each other. Zookeeper in Hadoop can be viewed as a centralized repository where distributed applications can put data and get data out of it. It is used to keep the distributed system functioning together as a single unit, using its synchronization, serialization and coordination goals.

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

The post-order traversal of a binary tree is OPQRST. Then possible pre-order traversal will be ________.

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

Given, the post order traversal of a binary tree is OPQRST. The method is use is post order traversing is- Left, Right, Root

So, the binary tree is-


Now, the pre order traversal,

Method- Root, Left, Right.

So, traversal is TQOPSR.

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

Top Courses for UGC NET

Download as PDF

Top Courses for UGC NET