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

Both statement are wrong becoz lexical analyser uses finite autometa so it uses regular grammer ,whose expression will be for example letter(letter + digit )*  , where as syntax tree uses context free grammer which uses pda.

Modularity of program,Maintainability, Security are important to design the algorithm.

(X’)’ = X → involution law.

X + Y)’=X’.Y’ → De Morgan Law

X(X+Y) = X + XY = X → Absorption law

X + YZ = (X +Y) (X+Z) → Distributive law

Key Points
3 : 2 aspect ratio means that for every 3 units of width, there are 2 units of height.

The same applies to the 6 : 4 aspect ratio - for every 6 units of width, there are 4 units of height.

The formula for finding aspect ratio is:

AR = W / H

Where:

AR is the aspect ratio

W is the width of the displayed image

H is the height of the displayed image

Note that W and H are measured in inches or millimeters.

Hence the correct answer is 6 inches.

The correct answer is A(0, 0), B(6, 12), C(4, 20)

Key Points

• We know that to scale a point in the x-axis direction, we multiply its x-coordinate by the scaling factor, and to scale a point in the y-axis direction, we multiply its y-coordinate by the scaling factor. So, to find the new coordinates of the triangle after scaling it by a factor of 2 in the x-axis direction and 4 in the y-axis direction, we can apply these transformations to each point:
• For point A(0, 0):
  • Scaling in x-axis direction: 0 * 2 = 0
  • Scaling in y-axis direction: 0 * 4 = 0
  • The new coordinates of point A are (0, 0).
• For point B(3, 3):
  • Scaling in x-axis direction: 3 * 2 = 6
  • Scaling in y-axis direction: 3 * 4 = 12
  • The new coordinates of point B are (6, 12).
• For point C(2, 5):
  • Scaling in x-axis direction: 2 * 2 = 4
  • Scaling in y-axis direction: 5 * 4 = 20
  • The new coordinates of point C are (4, 20).
• Hence, the new coordinates of the triangle after scaling are A(0, 0), B(6, 12), and C(4, 20).

The correct answer is option 1.

Concept:

ER Diagram stands for Entity Relationship Diagram, also known as ERD is a diagram that displays the relationship of entity sets stored in a database. In other words, ER diagrams help to explain the logical structure of databases. ER diagrams are created based on three basic concepts: entities, attributes and relationships.

Note:

Minimum number of tables between two entities. Suppose R is relation between two entities E1 and E2 with some cardinality ratio like,

cardinality ratio one to one:

2 tables,

• E1R, E2 or
• E1, E2R

cardinality ratio one to many:

Given data,

Only three table are requried,

• E2 R1
• E1
• R2

Hence the correct answer is 3.

Memory Address Register:

• Memory Address Register is the CPU register that either stores the memory address from which data will be fetched to the CPU or the address to which data will be sent and stored. (statement 1 is correct)
• In other words, MAR holds the memory location of data that needs to be accessed.
• MAR holds the address of the current instruction that is to be fetched from memory or the address in the memory to which data is to be transferred.

Memory Data Register:

• Memory Data Register is the register in a computer's CPU that stores the data being transferred to and from the immediate access storage.
• In other words, MDR is the register used for holding information that is in the process of being transferred from the memory to the central processor or vice versa.
• MDR holds the contents found at the address held in the MAR or data which is to be transferred to primary memory.

This question can be solved using Generalization, in your high school mathematics u must have studied AND resemble to *, same thing happens with DFA ,

if a's divisible by x and b's divisible by y , then DFA will have minimum xy states , but REMEMBER , this is not valid in case of NFA .
In Theory of computation it can be proved by "MYHILL NERODE THEORAM", but that is time consuming to do in the exam.
If in case of 'AND " , OR is given in the question , then draw the two DFA and check , do not apply the + logic for OR .
So, here 5*4=20 (option a will be the answer )

Concept

A primary key is a special relational database table column (or combination of columns) designated to uniquely identify each table record.

A primary key is used as a unique identifier to quickly parse data within the table. A table cannot have more than one primary key.

A primary key’s main features are:

• It must contain a unique value for each row of data.
• It cannot contain null values.
• Every row must have a primary key value.

Correct answer: Option 4

Explanation:

• The DATE data type is used for storing a date in database tables. The supported dates range from 1000-01-01 to 9999-12-31.
• The default format of this data type is the 4-digit year, followed by 2-digit month and 2-digit day. The 3 values are separated by hyphens (-).

Important points:

• The default format can be changed using the date_format method. The first parameter in this function is the date value and the second parameter is a string specifying the required format.

• For example, select date_format(curdate(), ‘%d.%m.%Y’); prints the current date in a DD.MM.YYYY format.

Given:

G = {1, -1, i, -i} is a cyclic group of order 4.

⇒ o(a) = o(G)

Evidently;

⇒ i = i, i² = -1, i³ = -i, i⁴ = 1

Here identity element e of G is 1.

Thus, i4 = 1and -1⁴ = 1 i.e i^r ≠ 1 for Any r < 1.

This → o(i) = 4 = o(G)

⇒ i and -i are the generator of G.

Concept:

Shortest Job First (SJF):

Shortest Job First (SJF) is an algorithm in which the process having the smallest execution time is chosen for the next execution. This scheduling method can be preemptive or non-preemptive. It significantly reduces the average waiting time for other processes awaiting execution. The full form of SJF is Shortest Job First.

Non-Preemptive SJF:

In non-preemptive scheduling, once the CPU cycle is allocated to process, the process holds it till it reaches a waiting state or is terminated.

Algorithm:

• Start with sorting all the processes based on their time of arrival at the processor.
• Then select the earliest arriving process with the shortest burst time.
• While executing the current process, all the waiting processes are pushed in the waiting queue, and when the current process ends, choose the process with the shortest burst time among the waiting processes.

Analysis:

Shortest Job First uses Insert and Extract-Min operations. Both the Insert and the Extract-Min operations have a running time of O(log n). There are n tasks and each task has to be inserted into the heap and later extracted from the heap, resulting in a running time of O(n 2 log n).

Insert has an O(log n) running time because we first add the new job to the heap's final position when inserting.

• This does not guarantee that the heap property is preserved, because the priority of the new task may be higher than the priority of its parent. This is why the Insert operation includes the Heapify-Up method, which restores heap order. The Heapify-Up operation takes O minutes to complete (log n).

The Extract-Min operation takes O(log n) time because it deletes the heap's root first and then moves the final task to the first slot.

• The Extract-Min process includes the execution of the Heapify-Down procedure, which may violate the heap property. The Heapify-Down operation takes O seconds to complete (log n).

The time complexity of this algorithm is O(N* 2* log(N)).

Hence the correct answer is O(n log n).

The correct answer is option 2.

Concept:

Let us consider X, Y, and Z are sets of attributes in a relation to R.

Reflexive Functional Dependencies:

Let R be a relation scheme and let X ⊆ R and Y ⊆ R. We say that a relation instance r(R) satisfies a functional dependency X → Y if for every pair of tuples t1 ∈ r and t2 ∈ r if t1[X] = t2[X] then t1[Y ] = t2[Y ]. (or)

Reflexivity:

If X is a set of attributes, and Y is a set of attributes that are completely contained in X, then X implies Y.

If Y is a subset of X, then X → Y

Example:

Mobile, Name →Name

Augmentation:

If X implies Y, and Z is a set of attributes, then if X implies Y, then XZ implies YZ.

If X → Y, then XZ → YZ

Example:

Id→Name then Id, address→Name, address

Transitivity:

If X implies Y and Y imply Z, then X implies Z.

If X → Y and Y → Z, then X → Z

Example:

Id→contact_number and Contact_number→ state then Id→Contact_number, state.

Hence the correct answer is Reflexive.

The correct answer is option 2

Some laws of Boolean Algebra:

Distributive Law:

Inverse Law:

EXPLANATION:

F = (P + Q̅ + R̅)⋅(P + Q̅ + R)⋅(P + Q + R̅)

F= ((P + Q̅) + R̅.R)(P + Q + R̅)

F = (P + Q̅)(P + Q + R̅)

F = P + Q̅.(Q + R̅)

F = P + Q̅R̅

Non-repudiation is the assurance that someone cannot deny the validity of something. Non-repudiation is a legal concept that is widely used in information security and refers to a service, which provides proof of the origin of data and the integrity of the data. In other words, non-repudiation makes it very difficult to successfully deny who/where a message came from as well as the authenticity and integrity of that message.

Let 'S' sends a message 'M' to 'R' in an e-commerce transaction. Non-repudiation typically involves using methods designed to ensure that a sender can't deny having sent a particular message, or that a message recipient can't deny having received it. So preventing 'S' from denial, being the sender of M.

Hence the correct answer is preventing 'S' from denial, being the sender of M.

TRAP is a vectored interrupt also known as RST 4.5

The address of various vectored interrupts are given as:

For 8085 the interrupt service routine address is given as:

RST 4.5 (TRAP)

ISR address: 4.5 x 8 = (36)₁₀ = (0024) H

RST 5.5

ISR address: 5.5 x 8 = (44)₁₀ = (002C) H

RST 6.5

ISR address: 6.5 x 8 = (52)₁₀ = (0034) H

RST 7.5

ISR address: 7.5 x 8 = (60)₁₀ = (003C) H

When TRAP interrupt is triggered in an Intel 8085A, the program control is transferred to 0024 H

Software companies are responsible for making policies and providing working atmosphere for the software development, so in turn these companies become a part of software development process. Bugs from developers side is no new thing, even the slightest mistake in the program causes a bug.

• The design variables
• The objective function
• The constraints

Apple talk is not of the same group. Apple talk is a discontinued proprietary suite of networking protocols developed by Apple Inc. for their Macintosh computers. AppleTalk includes a number of features that allow local area networks to be connected with no prior setup or the need for a centralized router or server of any sort.

Bus topology uses one main cable to which all nodes are directly connected. The main cable acts as a backbone for the network.

Ring topology, the computers in the network are connected in a circular fashion, and the data travels in one direction.

The Internet is a vast network that connects computers all over the world.

A line drawn in the background color is always invisible because both are the same color. Because white lines are nearly invisible against the pale yellow background. The background can be any color, but typically is white or black. If you want to change the background color, use the dialog box to access the options, display, color menu sequence.

Uninformed search strategy is also called as blind search. In blind search, you can search the states without having any additional information. So, the uninformed search method is blind search.

In Artificial Intelligence, Uninformed search is a type of search algorithm that operated in a brute force way. Uninformed search algorithms are also called as blind search algorithms because they do not have any domain-specific knowledge other than how to traverse a tree.

The circular queue is also known as a ring buffer. A circular queue is similar to a linear queue as it is also based on the FIFO (First In First Out) principle except that the last position is connected to the first position in a circular queue that forms a circle. Therefore, the structure of a circular queue is also known as a ring structure.

The load instruction is basically used to load the contents of a memory location onto a register. Load instructions move data from memory into a register. The address for the load is the sum of a register specified in the instruction and a constant value that is coded into the instruction. LOAD is used to load data from memory to the accumulator. STORE is used to store the accumulator result in memory.

Entries in the bundle table for line attributes are set using the function setPolylineRepresentation (ws, li, lt, lc). Parameter ws is the workstation identifier, and line index parameter li defines the bundle table position. Parameters It, lw, and lc are then bundled and as signed values to set the line type, line width, and line color specifications, respectively, for the designated table index.