Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a $2\times2\times2$ table as shown below.
| toothache | $\neg$toothache | |||
|---|---|---|---|---|
| catch | $\neg$catch | catch | $\neg$catch | |
| cavity | $0.108$ | $0.012$ | $0.072$ | $0.008$ |
| $\neg$cavity | $0.016$ | $0.064$ | $0.144$ | $0.576$ |
Previous 10 Questions — UGC NET Computer Science Nov 2021 (Paper II)
Nearest first
1
2
3
4
5
6
7
8
9
10
Consider the sentence below.There is a country that borders both India and Pakistan.Which of the following logical expr…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Which among the following statement(s) is(are) FALSE?A. Greedy best-first search is not optimal but is often efficient.…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Consider the given tree below. Calculate the
value at the root of the tree using alpha‐beta
pruning algorithm.
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Given below are two statementsStatement I: Breadth-First Search is optimal when all the step costs are equal whereas un…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Which agent deals with the happy and unhappy state?
Topic: UGC NET Computer Science Nov 2021 (Paper II)
In the following table, the left column contains the names of standard graph algorithms and the right column contains t…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
A hash function $h$ defined as $h(key)=key\ mod\ 7$, with linear probing, is used to insert the keys $44,45,79,55,91,18…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
The order of a leaf node in a $B+$ tree is the maximum number of value, data record pointer pairs it can hold. Given th…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Which of the given options provides the increasing order of asymptotic complexity of functions $f_1,\ f_2,\ f_3$ …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Given below are two statementsStatement I: In an undirected graph, number of odd degree vertices is even.Statement II: …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Next 10 Questions — UGC NET Computer Science Nov 2021 (Paper II)
Ascending by ID
1
2
3
4
5
6
7
8
9
10
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Consider following two statements:Statement I: Relational database schema represents the logical design of the database…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Given a fixed-length record file that is ordered on the key field. The file needs $B$ disk blocks to store $R$ number o…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Given the following STUDENT-COURSE scheme:STUDENT(Rollno, Name, courseno)COURSE(courseno, coursename, capacity)where Ro…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
STUDENT(Rollno, Name, Courseno)COURSE(Courseno, Coursename, Capacity)where Rollno is the primary key of relation STUDEN…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Suppose a B tree is used for indexing a database file. Consider the following information:size of the search key field …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
