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 | Inductive Learning Takes Examples And Generalizes Rather Than Starting With __________Knowledge | Existing | Inductive | Deductive | None Of Given | A | |
| CS607 | Is The Process Of Deriving Logical Conclusions From Given Facts | Representation | Execution | Reasoning | Planning | C | |
| CS607 | Machine Learning Is A Prerequisite For Any Mature Program Of Artificial Intelligence | True | False | Na | Na | A | |
| CS607 | Machine Learning Typically Follows__________Phases According To Finaly | Two | Three | Four | Five | B | |
| CS607 | Mamdani’S Method Was Among The Irst __________Built Using Fuzzy Set Theory | Control System | Expet System | Decision Analysis System | None Of Given | A | |
| CS607 | Mamdanis Method Was Among The First __________ Built Using Fuzzy Set Theory | Control Systems | Expert Systems | Decision Analysis Systems | None Of The Given | A | |
| CS607 | Many Machine Learning Systems Are Classifiers | True | False | Na | Na | A | |
| CS607 | Measure Of The Effectiveness Of An Attribute In Classifying The Training Data Is Called | Information Gain | Measure Gain | Information Goal | None Of The Given | A | |
| CS607 | Most Of The Solution Spaces For Problems Can Be Represented In A __________ | Graph | Table | Demo | None Of The Given | A | |
| CS607 | Mse Stands For __________ | Mean Square Error | Mean Standard Error | Mean Square Entry | None Of The Given | A | |
| CS607 | Mutation Can Be As Simple As Just Flipping A Bit At Random Or Any Number Of Bits | True | False | Na | Na | A | |
| CS607 | Outputs Of Learning Are Determined By The __________ | Application | Validation | Training | None Of The Given | A | |
| CS607 | Procedures That Search The Solution Space In An Uninformed Manner Are Usually Costly With Respect To __________ | Time | Space | Time And Space Both | All Of The Given | D | |
| CS607 | Progressive Deepening Guarantees To Find The Solution At A Minimum Depth Like __________ | Dfs | Bfs | Both Of These | None Of The Given | B | |
| CS607 | Reasoning In Backward Chaining Is Known As | Data-Driven Reasoning | Rule-Driven Reasoning | Intelligence-Driven Reasoning | Goal-Driven Reasoning | D | |
| CS607 | Reasoning In Fuzzy Logic Is Just A Matter Of Generalizing The Familiar ___________ Logic | Boolean | Complex | Coagnitive | Supervised | A | |
| CS607 | Rule Which May Have A Priority In Expert Systems Is Called | Meta Rule | Conflict Resolution Rule | Forward Chain Rule | None Of The Given Options | C | |
| CS607 | Search Algorithms Used In Web Hunter Is__________ | Uninformed And Informed | Blind And Uninformed | Informed And Heuristic | Any Path And Non-Optimal | A | |
| CS607 | Searching Is A Formal Mechanism To Explore | Alternatives | Recursive | Best | Fitness | A | |
| CS607 | Semantic Networks Are Computationally Expensive At __________ | Run Time | Compile Time | Start Time | End Time | A |