Bayes Theorem, Naive Bayes Algorithm, KNN Algorithm MCQs

 

Bayes Theorem, Naive Bayes Algorithm, KNN Algorithm MCQs


1.     Formula for Bayes theorem is _______



Ans: A

2.     The bayesian network can be used to answer any query by using:-
(A) Full distribution
(B) Joint distribution
(C) Partial distribution
(D) All of the above

Ans: B

3.      Which of the following is correct about the Naive Bayes?
(A) Assumes that all the features in a dataset are independent
(B) Assumes that all the features in a dataset are equally important
(C) Both
(D) None of the above

Ans: C

4.      Naïve Bayes Algorithm is a ________ learning algorithm.
(A) Supervised
(B) Reinforcement
(C) Unsupervised
(D) None of these

Ans: A

 

5.     Examples of Naïve Bayes Algorithm is/are
(A) Spam filtration
(B) Sentimental analysis
(C) Classifying articles
(D) All of the above

Ans: D

6.      Naïve Bayes algorithm is based on _______ and used for solving classification problems.
(A) Bayes Theorem
(B) Candidate elimination algorithm
(C) EM algorithm
(D) None of the above

Ans: A

7.     Disadvantages of Naïve Bayes Classifier:

(A) Naive Bayes assumes that all features are independent or unrelated, so it cannot learn the relationship between features.

(B) It performs well in Multi-class predictions as compared to the other Algorithms. 

(C) Naïve Bayes is one of the fast and easy ML algorithms to predict a class of datasets. 

(D) It is the most popular choice for text classification problems.

Ans: A

8.     The benefit of Naïve Bayes:-

(A) Naïve Bayes is one of the fast and easy ML algorithms to predict a class of datasets.

(B)  It is the most popular choice for text classification problems.

(C)  It can be used for Binary as well as Multi-class Classifications.

(D) All of the above

Ans: D

9. Identify the distance matrix used in KNN Algorithm___________

A.    Euclidean Distance.

B.    Cosine Similarity.

C.    Manhattan Distance.

D.    All.

Ans: D

10. ______in KNN is a parameter that refers to the number of nearest neighbors to include in the majority of the voting process.

A.    K.

B.    First N.

C.    Second N.

D.    All of the above.

Ans: A


Genetic Algorithm MCQs

 Genetic Algorithm MCQs


1.     Produces two new offspring from two parent string by copying selected bits from each parent is called

(A) Mutation

(B) Inheritance

(C) Crossover

(D) None of these

Ans: C

2.     Genetic operators includes

(A) Crossover

(B) Mutation

(C) Both A & B

(D) None of these

Ans: C

3.     What is the correct representation of GA?

(A) GA(Fitness, Fitness_threshold, p)

(B) GA(Fitness, Fitness_threshold, p, r )

(C) GA(Fitness, Fitness_threshold, p, r, m)

(D) GA(Fitness, Fitness_threshold)

      Ans: C

4. When would the genetic algorithm terminate?

(A) Maximum number of generations has been produced

(B) Satisfactory fitness level has been reached for the population.

(C) Both A & B

(D) None of these

Ans:  C

5.     Genetic algorithm is a

(A) Search technique used in computing to find true or approximate solution to optimization and search problem

(B) Sorting technique used in computing to find true or approximate solution to optimization and sort problem

(C) Both A & B

(D) None of these

Ans:  A

6.     GA techniques are inspired by _________ biology.

(A) Evolutionary

(B) Cytology

(C)  Anatomy

(D)  Ecology

Ans: A

7.     _________ evolution over many generations was directly influenced by the experiences of individual organisms during their lifetime

(A) Baldwin

(B) Lamarckian

(C) Bayes

(D) None of these

Ans: B

8. ILP stand for

(A) Inductive Logical programming

(B) Inductive Logic Programming

(C) Inductive Logical Program

(D) Inductive Logic Program

Ans: B

9. What is/are the requirement for the Learn-One-Rule method?

(A) Input, accepts a set of +ve and -ve training examples.

(B) Output, delivers a single rule that covers many +ve examples and few -ve.

(C) Output rule has a high accuracy but not necessarily a high coverage.

(D) All of the above

Ans: D

10. _________ is any predicate (or its negation) applied to any set of terms.

(A) Literal

(B) Null

(C) Clause

(D) None of these

Ans: A

11. Ground literal is a literal that

(A) Contains only variables

(B) does not contains any functions

(C) does not contains any variables

(D) Contains only functions

 Ans: C


Reinforcement Learning MCQs

 Reinforcement Learning MCQs

1.     _________________ is a type of machine learning in which an agent learns to make decisions by interacting with an environment.

 

A. Supervised learning

B. Reinforcement learning

C. Semi-supervised learning

D. Unsupervised learning

Ans: B

 

2. Which of the following are applications of Reinforcement learning?

 

A. Robotics

B. video games

C. self-driving cars

D. All of the above

Ans: D

 3._________________ is defined as when an event, occurs due to a particular behavior, increases the strength and the frequency of the behavior.

 

A. Positive Reinforcement

B. Negative Reinforcement

C. Both A and B

D. None of the above

Ans : A

 

4. Which type of feedback does an agent in reinforcement learning receive?

A. Predictions
B. Labels
C. Clusters
D. Rewards or penalties

Ans: D

 5. ______________ is the Q-learning algorithm used for in reinforcement learning.

 

A. Image recognition

B. Clustering

C. Finding the optimal decision-making strategy

D. Natural language processing

Ans: C

 6. Which of the following are Advantages of reinforcement learning?

 

A. Maximizes Performance

B. Sustain Change for a long period of time

C. Too much Reinforcement can lead to an overload of states which can diminish the results

D. All of the above

Ans: D

 7.  In Reinforcement learning, the decision is made on the initial input or the input given at the start

  A. TRUE

B. FALSE

C. Can be true or false

D. Can not say

 Ans : B

 8. Which of the following is true about reinforcement learning?

 A. The agent gets rewards or penalty according to the action

B.    The agent navigates in an environmental building the example experiences or the training dataset.

C.    The target of an agent is to maximize the rewards and minimize the penalty.

D.    All of the above

Ans: D

 9. Q-Learning algorithm is off-policy algorithm because

A.    Policy being trained is exactly the one being executed

B.    Policy being trained is not necessarily the one being executed.
There is nothing called Q-Learning algorithm but Q-Value Iteration
D.    None of the above


Ans: B

 10. In Reinforcement learning decision is dependent, So we give labels to sequences of dependent decisions.

 

A. TRUE

B. FALSE

C. Can be true or false

D. Can not say

Ans: A



ARTIFICIAL INTELLIGENCE SYLLABUS

 ARTIFICIAL INTELLIGENCE

UNIT I
Introduction to Artificial Intelligence:

Introduction, History, Intelligent Systems, Foundations of AI, Applications, Tic- tac toe game playing, development of AI languages, Current trends in AI

Problem Solving:

State-Space Search and Control Strategies: Introduction, General Problem Solving, Characteristics of Problem, Exhaustive searches, heuristic search techniques, iterative deepening a*, Constraint Satisfaction

UNIT II

Problem Reduction and Game Playing: Introduction, problem reduction, game playing, alpha-beta pruning, two-player perfect information games Logic Concepts: Introduction, propositional calculus, proportional logic, natural deduction system, axiomatic system, semantic tableau system in proportional logic, resolution refutation in proportional logic, predicate logic

UNIT III

Knowledge Representation: Introduction, Approaches to Knowledge representation, Knowledge representation using Semantic Network, Extended Semantic Network for KR, Knowledge representation using Frames 

Advance Knowledge Representation Techniques: Introduction, Conceptual Dependency Theory, Script Structure, CYC Theory, Case Grammars, Semantic Web

UNIT IV

Expert Systems:

Expert Systems, Phases in building expert systems, Expert System Architecture, Rule Based Systems, Forward Chaining, Blackboard Systems, Blackboard architecture, Blackboard System vs Rulebased system, Truth maintenance system.

UNIT V

Uncertainty measure & Fuzzy sets and fuzzy logic:

Uncertainty measure: probability theory: Introduction, probability theory, Bayesian belief networks, certainty factor theory, dempster-shafer theory Fuzzy. 

sets and fuzzy logic: Introduction, fuzzy sets, fuzzy set operations, types of membership functions, multi valued logic, fuzzy logic, linguistic variables and hedges, fuzzy propositions, inference rules for fuzzy propositions, fuzzy systems.

Text Books:

1. Artificial Intelligence by Elaine Rich, Kevin Knight and Shivashankar B Nair, Tata McGraw Hill.

2. Introduction to Artificial Intelligence and Expert Systems by Dan W. Patterson, Pearson Education.

Reference Books:

1. Artificial Intelligence: A Modern Approach by S. Russell and P. Norvig, Prentice Hall

Software Engineering Syllabus

 Software Engineering

UNIT-I: Software and Software Engineering: The Nature of Software, The Unique Nature of WebApps, Software Engineering, Software Process, Software Engineering Practice, Software Myths. Process Models: A Generic Process Model, Process Assessment and Improvement, Prescriptive Process Models, Specialized Process Models, The Unified Process, Personal and Team Process Models, Process Terminology, Product and Process.

UNIT-II: Requirements Analysis And Specification: Requirements Gathering and Analysis, Software Requirement Specification (SRS), Formal System Specification. Software Design: Overview of the Design Process, How to Characterise of a Design?, Cohesion and Coupling, Layered Arrangement of Modules, Approaches to Software Design

UNIT – III: Function-Oriented Software Design: Overview of SA/SD Methodology, Structured Analysis, Developing the DFD Model of a System, Structured Design, Detailed Design, Design Review, over view of Object Oriented design. User Interface Design: Characteristics of Good User Interface, Basic Concepts, Types of User Interfaces, Fundamentals of Component-based GUI Development, A User Interface Design Methodology.

UNIT – IV: Coding And Testing: Coding, Code Review, Software Documentation, Testing, Unit Testing, Black-Box Testing, White-Box Testing, Debugging, Program Analysis Tool, Integration Testing, Testing Object-Oriented Programs, System Testing, Some General Issues Associated with Testing

UNIT – V: Software Reliability And Quality Management: Software Reliability, Statistical Testing, Software Quality, Software Quality Management System, ISO 9000, SEI Capability Maturity Model. Computer Aided Software Engineering: Case and its Scope, Case Environment, Case Support in Software Life Cycle, Other Characteristics of Case Tools, Towards Second Generation CASE Tool, Architecture of a Case Environment.

UNIT – VI Software Maintenance: Software maintenance, Maintenance Process Models, Maintenance Cost, Software Configuration Management. Software Reuse: what can be reused? Why almost No Reuse So Far? Basic Issues in Reuse Approach, Reuse at Organization Level.


TEXT BOOKS:

1.     Software engineering A practitioner’s Approach, Roger S. Pressman, Seventh Edition McGrawHill International Edition.

2.     Fundamentals of Software Engineering, Rajib Mall, Third Edition, PHI.

3.     Software Engineering, Ian Sommerville, Ninth edition, Pearson education

REFERENCE BOOKS:

1.     Software Engineering : A Primer, Waman S Jawadekar, Tata McGraw-Hill, 2008

2.     Software Engineering, A Precise Approach, Pankaj Jalote, Wiley India, 2010.

3.     Software Engineering, Principles and Practices, Deepak Jain, Oxford University Press.

4.     Software Engineering1: Abstraction and modeling, Diner Bjorner, Springer International edition, 2006

Data Wrangling Syllabus

 DATA WRANGLING

UNIT-1

Introduction to Data Wrangling: What Is Data Wrangling?- Importance of Data Wrangling -How is Data Wrangling performed?- Tasks of Data Wrangling-Data Wrangling Tools-Introduction to Python-Python Basics-Data Meant to Be Read by Machines-CSV Data-JSON Data-XML Data.

UNIT-2

Working with Excel Files and PDFs: Installing Python Packages-Parsing Excel Files-Parsing Excel Files -Getting Started with Parsing-PDFs and Problem Solving in Python-Programmatic Approaches to PDF Parsing-Converting PDF to Text-Parsing PDFs Using pdf miner-Acquiring and Storing Data-Databases, A Brief Introduction-Relational Databases, MySQL and PostgreSQL-Non-Relational Databases, NoSQL-When to Use a Simple File-Alternative Data Storage.

UNIT-3

Data Cleanup: Why Clean Data? - Data Cleanup Basics-Identifying Values for Data Cleanup-Formatting Data-Finding Outliers and Bad Data-Finding Duplicates-Fuzzy Matching-RegEx Matching-Normalizing and Standardizing the Data-Saving the Data-Determining suitable Data Cleanup-Scripting the Cleanup- Testing with New Data.

UNIT-4

Data Exploration and Analysis: Exploring Data-Importing Data-Exploring Table Functions-Joining Numerous Datasets-Identifying Correlations-Identifying Outliers-Creating Groupings-Analyzing Data-Separating and Focusing the Data-Presenting Data-Visualizing the Data-Charts-Time-Related Data-Maps- Interactives -Words-Images, Video, and Illustrations-Presentation Tools-Publishing the Data-Open Source Platforms.

UNIT-5

Web Scraping: What to Scrape and How-Analyzing a Web Page-Network/Timeline-Interacting with JavaScript-In-Depth Analysis of a Page-Getting Pages-Reading a Web Page-Reading a Web Page with LXML-XPath-Advanced Web Scraping-Browser-Based Parsing-Screen Reading with Selenium-Screen Reading with Ghost.Py, Spidering the Web-Building a Spider with Scrapy-Crawling Whole Websites with Scrapy.


TEXT BOOKS:

1. Jacqueline Kazil& Katharine Jarmul, “Data Wrangling with Python”, O’Reilly Media, Inc,2016
2. McKinney, William, Python for Data Analysis: Data Wrangling with Pandas, NumPy, and IPython, 2 nd Edition, O’Reilly, 2017

About Machine Learning

Welcome! Your Hub for AI, Machine Learning, and Emerging Technologies In today’s rapidly evolving tech landscape, staying updated with the ...