CS101
532
CS201
225
CS301
232
CS302
174
CS304
192
CS401
224
CS402
258
CS403
228
CS408
113
CS411
121
CS502
249
CS504
268
CS601
679
CS604
381
CS605
261
CS607
184
CS609
230
CS610
300
CS614
100
CS703
65
| Code | Question | Option A | Option B | Option C | Option D | Answer | |
|---|---|---|---|---|---|---|---|
| CS607 | In Anns. Mse Is Known As | Most Sequared Error | Mean Squared Error | Medium Squared Error | None Of Given | B | |
| CS607 | In Artificial Intelligence Ga Stands For Genetic Algorithms | True | False | Na | Na | A | |
| CS607 | In Backward Chaining Terminology The Hypothesis To Prove Is Called The __________ | Proof | Goal | Plan | None Of The Given | B | |
| CS607 | In Basic Genetic Algorithm The Term Mutation Refers To A Small Random __________ | Number | Change | Operator | Operand | B | |
| CS607 | In Breadth First Search The Node With The Largest Value Of Height Will Be At The ___________ Priority To Be Picked | Maximum | Minimum | Zero | None Of The Given | A | |
| CS607 | In Candidate-Elimination Algorithm Version Spaces Is Represented By Two Sets Named | G And S | G And F | And F | H And S | A | |
| CS607 | In Depth First Search The Node With The Largest Value Of Height Will Be At The Priority To Be Picked | Minimum | Maximum | Zero | Both Maximum And Minimum | B | |
| CS607 | In Fuzzy Inputs We Resolve All Fuzzy Statements In The Antecedent To A Degree Of Membership Between 0 And | 1 | 2 | 3 | 4 | A | |
| CS607 | In Fuzzy Inputs We Resolve All Fuzzy Statements In The Antecedent To A Degree Of Membership Between 0 And | 1 | 2 | 3 | 4 | A | |
| CS607 | In Ga The Random Process Is Repeated Until An Individual With Required ___________ Level Is Found | Higher | Lower | Fitness | Logical | C | |
| CS607 | In General The Antecedent Of A Rule Compares An Object With A Possible Value Using An Operator | True | False | Na | Na | A | |
| CS607 | In Optimal Path Searches We Try To Find The __________ Solution | Worst | Least | Least But Not Worst | Best | D | |
| CS607 | In Some Cases The Rules Provide Definite Actions Such As Move Left Or Close Door In Which Case The Rules Are Being Used To Represent __________ | Recommendations | Directives | Relations | None Of The Given Option | C | |
| CS607 | In Some Cases The Rules Provide More Definite Actions Such As “Move Left” Or “Close Door” In Which Case The Rules Are Being Used To Represent ___________ | Recommendation | Directives | Relation | None Of The Given Options | B | |
| CS607 | In The Statement “If A Then B” A Is Called | Antecedent | Consequent | Na | Na | A | |
| CS607 | In The Statement “If A Then B” B Is Called | Antecedent | Consequent | Na | Na | B | |
| CS607 | In The Worst Case Of Semantic Network We May Need To Traverse The Entire Network And Then Discover That The Requested Info __________ | Does Not Exist | Exists | Is Incorrect | Is Correct | A | |
| CS607 | In Theoretical Computer Science There Are Two Mail Branches Of Problem | Tractable And Intactable | Intractable And Induction | Tractable And Induction | None Of Given | A | |
| CS607 | In Theoretical Computer Science There Are Two Main Branches Of Problems | Tractable And Intractable | Intractable And Induction | Tractable And Induction | None Of The Given | A | |
| CS607 | Inductive Learning Is Based On The Knowledge That If Something Happens A Lot It Is Likely To Be Generally ___________ | True | False | Ambiguous | None Of The Given | A |