Aspire Faculty ID #18979 · Topic: UGC NET Computer Science Nov 2020 (Paper II) · Just now
UGC NET Computer Science Nov 2020 (Paper II)

Match List I with List II.
List I List II
(A) Branch-and-bound (I) Keeps track of all partial paths which can be candidate for further exploration.
(B) Steepest-accent hill climbing (II) Detects difference between current state and goal state.
(C) Constraint satisfaction (III) Discover problem state(s) that satisfy a set of constraints.
(D) Means-end-analysis (IV) Consider all moves from current state and select best move.
Choose the correct answer from the options given below:

Solution

Branch-and-bound keeps track of partial paths which can be candidates for further exploration.

So, (A) matches with I.

Steepest-accent hill climbing considers all possible moves from the current state and selects the best move.

So, (B) matches with IV.

Constraint satisfaction means finding state or states that satisfy a given set of constraints.

So, (C) matches with III.

Means-end-analysis detects the difference between current state and goal state.

So, (D) matches with II.

Final matching is:

A-I, B-IV, C-III, D-II

Previous 10 Questions — UGC NET Computer Science Nov 2020 (Paper II)

Nearest first
1
Match List I with List II.With reference to CMM developed by Software Engineering Institute (SEI) …
Topic: UGC NET Computer Science Nov 2020 (Paper II)
2
Match List I with List II.Choose the correct answer from the options given below:
Topic: UGC NET Computer Science Nov 2020 (Paper II)
3
Match List-I with List-II.List I gives $3\times 3$ matrices representing $2D$ transformations and List-II shows the cor…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
4
Match List I with List II. List I List II (A) Hand…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
5
Match List I with List II.Let $R_1=\{(1,1),(2,2),(3,3)\}$ and$R_2=\{(1,1),(1,2),(1,3),(1,4)\}$ …
Topic: UGC NET Computer Science Nov 2020 (Paper II)
6
Which of the following statements are true?(A) Minimax search is breadth-first; it processes all the nodes at a level b…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
7
Which of the following statements are true?(A) A sentence $\alpha$ entails another sentence $\beta$ if $\beta$ is true …
Topic: UGC NET Computer Science Nov 2020 (Paper II)
8
Consider the statement below.A person who is radical $(R)$ is electable $(E)$ if he or she is conservative $(C)$, but o…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
9
Firewall is a device that filters access to the protected network from the outside network.Firewalls can filter the pac…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
10
Post office protocol $(POP)$ is a message access protocol which is used to extract message for client. In this regard, …
Topic: UGC NET Computer Science Nov 2020 (Paper II)

Next 10 Questions — UGC NET Computer Science Nov 2020 (Paper II)

Ascending by ID
1
Match List I with List II. List I List II (A) Topo…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
2
Match List I with List II.$L_R$ : Regular language, $L_{CF}$ : Context free language$L_{REC}$ : Recursive language, $L_…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
3
Match List I with List II. List I List II (A) Seri…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
4
Match List I with List II. List I List II (A) Gree…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
5
In lexicographic ordering, comparison is done from left to right.Given order is:$0<1$Now compare the given strings:$…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
6
Arrange the following types of machine in descending order of complexity.(A) SISD(B) MIMD(C) SIMDChoose the correct ans…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
7
Given below are different properties of $3D$ projections from A-D. Identify the correct order on the basis of property …
Topic: UGC NET Computer Science Nov 2020 (Paper II)
8
Arrange the following types of Cohesion from best to worst type.(A) Logical Cohesion(B) Sequential Cohesion(C) Communic…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
9
Consider the undirected graph below.Using Prim's algorithm to construct a minimum spanning tree starting with node $a$,…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
10
Consider the following regular expressions:(a) $r=a(b+a)^*$(b) $s=a(a+b)^+$(c) $t=aa^*b$Choose the correct answer from …
Topic: UGC NET Computer Science Nov 2020 (Paper II)
Ask Your Question or Put Your Review.

loading...