Aspire Faculty ID #17502 · Topic: UGC NET Computer Science August 2024 (Paper II) · Just now
UGC NET Computer Science August 2024 (Paper II)

Arrange the following steps in proper sequence involved in a Genetic Algorithm :

(A) Selection
(B) Initialization
(C) Crossover
(D) Mutation
(E) Evaluation

Choose the correct answer from the options given below :

Solution

Typical steps of Genetic Algorithm:

Initialization

Evaluation

Selection

Crossover

Mutation

Thus order:

(B) → (E) → (A) → (C) → (D)

Previous 10 Questions — UGC NET Computer Science August 2024 (Paper II)

Nearest first
1
Which of the following statements about pointers in C are TRUE.(A) Pointers can be used to access array elements(B) Poi…
Topic: UGC NET Computer Science August 2024 (Paper II)
2
Consider the Grammar :$S \rightarrow A$$A \rightarrow S B S \mid id$$B \rightarrow B, A \mid A$If $I_0 = CLOSURE({[S' \…
Topic: UGC NET Computer Science August 2024 (Paper II)
3
In a schema $R(A, B, C, D, E, F, G, H)$, each field of $R$ contains only atomic values.$F = {CH \rightarrow C, A \right…
Topic: UGC NET Computer Science August 2024 (Paper II)
4
Arrange the following steps in a proper sequence for the typical process of a DNS query :(A) Query authoritative DNS Se…
Topic: UGC NET Computer Science August 2024 (Paper II)
5
A graph $G$ with number of vertices greater and equal than three i.e. $(n \ge 3)$ is a Hamiltonian graph, if the degree…
Topic: UGC NET Computer Science August 2024 (Paper II)
6
Arrange the given steps required for a Direct Memory Access (DMA) transfer in the correct order.(A) Initiate DMA transf…
Topic: UGC NET Computer Science August 2024 (Paper II)
7
Match List-I with List-II. List-I List-II A. Dijkstra’s Algorithm I. Find the shortest path between…
Topic: UGC NET Computer Science August 2024 (Paper II)
8
Arrange the following Language Classes in ascending order according to their expressive power, as defined by Chomsky hi…
Topic: UGC NET Computer Science August 2024 (Paper II)
9
Arrange the following Language Classes in ascending order according to their expressive power, as defined by Chomsky hi…
Topic: UGC NET Computer Science August 2024 (Paper II)
10
Match List-I with List-II. List-I (Testing Type) List-II (Description) A. Unit testing I. Testing i…
Topic: UGC NET Computer Science August 2024 (Paper II)

Next 10 Questions — UGC NET Computer Science August 2024 (Paper II)

Ascending by ID
1
Arrange the following steps in a proper sequence for the process of training a neural network.(A) Weight initialization…
Topic: UGC NET Computer Science August 2024 (Paper II)
2
Which of the following C++ statements correctly declares an abstract class ?
Topic: UGC NET Computer Science August 2024 (Paper II)
3
Match List-I with List-II. List-I (computing systems)List-II (working/output)  (A) Half Adder (I) H…
Topic: UGC NET Computer Science August 2024 (Paper II)
4
Arrange the following steps in the correct order to solve the Knapsack problem using Dynamic Programming. (A) Define th…
Topic: UGC NET Computer Science August 2024 (Paper II)
5
Match List - I with List - II. List - I List - II (A) The activation function (I) is called the del…
Topic: UGC NET Computer Science August 2024 (Paper II)
6
In a token ring network the transmission speed is $10^7$ bps and the propagation speed is $200 , m/\mu s$. The 1-bit de…
Topic: UGC NET Computer Science August 2024 (Paper II)
7
Consider the following statements regarding combinational and sequential circuits. (A) Output of combinational circuits…
Topic: UGC NET Computer Science August 2024 (Paper II)
8
Consider the following C program :#include<stdio.h>int main(){    int x[]={2,4,6,8,10};    in…
Topic: UGC NET Computer Science August 2024 (Paper II)
9
Translate $\forall x \exists y (x < y)$ in English. Consider domain as a real number for both the variables.
Topic: UGC NET Computer Science August 2024 (Paper II)
10
For all real numbers $x$, there exists a real number $y$ such that $x$ is less than $y$.(A) $L_1 = { w \in {0,1}^* \mid…
Topic: UGC NET Computer Science August 2024 (Paper II)
Ask Your Question or Put Your Review.

loading...