Data Wrangling -1 MCQs

 Data Wrangling -1 MCQs _______________________________________________


  1. JSON stands for _______
A. JavaScript Object Notation            
B. Java Object Notation
C. JavaScript Object Normalization
D. JavaScript Object-Oriented Notation

    ANS: A 

           2. JSON is a _____ for storing and transporting data.

      A. xml format
      B. text format
      C. JavaScript
      D. php format

              ANS: B 

          3. The JSON syntax is a subset of the _____ syntax.

      A. Ajax
      B. Php
      C. HTML
      D. javaScript

              ANS: D


      No comments:

      4. Excel File Reader

       

      Excel File Reader






















      No comments:
      Labels: , , ,

      ARTIFICIAL INTELLIGENCE - MCQs - 2

       

      ARTIFICIAL INTELLIGENCE - MCQs - 2

      1. Which search is equal to minimax search but eliminates the branches that can’t influence the final decision?

      A. Depth-first search

      B. Breadth-first search

      C. Alpha-beta pruning

      D. None of the mentioned

      Ans: C

      2. Which values are independent in minimax search algorithm?

      A. Pruned leaves x and y

      B. Every states are dependent

      C. Root is independent

      D. None of the mentioned

      Ans: A

      3. To which depth does the alpha-beta pruning can be applied?

      A. 10 states

      B. 8 States

      C. 6 States

      D. Any depth

      Ans: D

      4. Which search is similar to minimax search?

      A. Hill-climbing search

      B. Depth-first search

      C. Breadth-first search

      D. All of the mentioned 

      Ans: B

      5. Which value is assigned to alpha and beta in the alpha-beta pruning?

      A. Alpha = max

      B. Beta = min

      C. Beta = max

      D. Both Alpha = max & Beta = min

      Ans: D

      6. Where does the values of alpha-beta search get updated?

      A. Along the path of search

      B. Initial state itself

      C. At the end

      D. None of the mentioned

      Ans: A

      7. How the effectiveness of the alpha-beta pruning gets increased?

      A. Depends on the nodes

      B. Depends on the order in which they are executed

      C. All of the mentioned

      D. None of the mentioned

      Ans: A

      8. What is called as transposition table?

      A. Hash table of next seen positions

      B. Hash table of previously seen positions

      C. Next value in the search

      D. None of the mentioned

      Ans: B

      9. Which is identical to the closed list in Graph search?

      A. Hill climbing search algorithm

      B. Depth-first search

      C. Transposition table

      D. None of the mentioned

      Ans: C

      10. Which function is used to calculate the feasibility of whole game tree?

      A. Evaluation function

      B. Transposition

      C. Alpha-beta pruning

      D. All of the mentioned

      Ans: A

      11. General games involves ____________

      A. Single-agent

      B. Multi-agent

      C. Neither Single-agent nor Multi-agent

      D. Only Single-agent and Multi-agent

      Ans: D

      12. Adversarial search problems uses ____________

      A. Competitive Environment

      B. Cooperative Environment

      C. Neither Competitive nor Cooperative Environment

      D. Only Competitive and Cooperative Environment

      Ans: A

      13. Zero sum games are the one in which there are two agents whose actions must alternate and in which the utility values at the end of the game are always the same.

      A. True

      B. False

      Ans: B

      14. Zero sum game has to be a ______ game.

      A. Single player

      B. Two player

      C. Multiplayer

      D. Three player

      Ans: C

      15. A game can be formally defined as a kind of search problem with the following components.

      A. Initial State

      B. Successor Function

      C. Terminal Test

      D. All of the mentioned

      Ans: D

      16. The initial state and the legal moves for each side define the __________ for the game.

      A. Search Tree

      B. Game Tree

      C. State Space Search

      D. Forest

      Ans: B

      17. General algorithm applied on game tree for making decision of win/lose is ____________

      A. DFS/BFS Search Algorithms

      B. Heuristic Search Algorithms

      C. Greedy Search Algorithms

      D. MIN/MAX Algorithms

      Ans: D

      18. The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds.

      A. True

      B. False

      Ans: A

      19. Which is the most straightforward approach for planning algorithm?

      A. Best-first search

      B. State-space search

      C. Depth-first search

      D. Hill-climbing search

      Ans: B

      20. What are taken into account of state-space search?

      A. Postconditions

      B. Preconditions

      C. Effects

      D. Both Preconditions & Effects

      Ans: D

      21. Which approach is to pretend that a pure divide and conquer algorithm will work?

      A. Goal independence

      B. Subgoal independence

      C. Both Goal & Subgoal independence

      D. None of the mentioned

      Ans: B

      22. Which is the best way to go for Game playing problem?

      A. Linear approach

      B. Heuristic approach (Some knowledge is stored)

      C. Random approach

      D. An Optimal approach

      Ans: B

      23. A production rule consists of ____________

      A. A set of Rule

      B. A sequence of steps

      C. Set of Rule & sequence of steps

      D. Arbitrary representation to problem

      Ans: C

      24. Which search method takes less memory?

      A. Depth-First Search

      B. Breadth-First search

      C. Linear Search

      D. Optimal search

      Ans: A

      25. What is the major component/components for measuring the performance of problem solving?

      A. Completeness

      B. Optimality

      C. Time and Space complexity

      D. All of the mentioned

      Ans: D

      26. The Set of actions for a problem in a state space is formulated by a ___________

      A. Intermediate states

      B. Initial state

      C. Successor function, which takes current action and returns next immediate state

      D. None of the mentioned

      Ans: C

      27. What is state space?

      A. The whole problem

      B. Your Definition to a problem

      C. Problem you design

      D. Representing your problem with variable and parameter

      Ans: D

      28. What is the objective of tower of hanoi puzzle?

      A. To move all disks to some other rod by following rules

      B. To divide the disks equally among the three rods by following rules

      C. To move all disks to some other rod in random order

      D. To divide the disks equally among three rods in random order

      Ans: A

      29. Which of the following is NOT a rule of tower of hanoi puzzle?

      A. No disk should be placed over a smaller disk

      B. Disk can only be moved if it is the uppermost disk of the stack

      C. No disk should be placed over a larger disk

      D. Only one disk can be moved at a time

      Ans: C

      30. Recursive solution of tower of hanoi problem is an example of which of the following algorithm?

      A. Dynamic programming

      B. Backtracking

      C. Greedy algorithm

      D. Divide and conquer

      Ans: D


      No comments:

      Artificial Intelligence - MCQs - 1

       Artificial Intelligence - MCQs - 1


      1. What is Artificial Intelligence?
      A. Artificial Intelligence is a field that aims to make humans     more intelligent
      B. Artificial Intelligence is a field that aims to improve the 
         security
      C. Artificial Intelligence is a field that aims to develop           intelligent machines
      D. Artificial Intelligence is a field that aims to mine the data

      Ans: C 

      2. Who is the inventor of Artificial Intelligence?

                A. Geoffrey Hinton 

                B. Andrew Ng

                C. John McCarthy    

                D. Jürgen Schmidhuber

      Ans: C

      3. Which of the following is the branch of Artificial Intelligence?

      A. Machine Learning

      B. Cyber forensics

      C. Full-Stack Developer

      D. Network Design 

      Ans: A 

      4. What is the goal of Artificial Intelligence?

      A. To solve artificial problems

      B. To extract scientific causes

      C. To explain various sorts of intelligence

      D. To solve real-world problems

      Ans: C

      5. Which of the following is an application of Artificial Intelligence?

      A. It helps to exploit vulnerabilities to secure the firm

      B. Language understanding and problem-solving (Text analytics and NLP)

      C. Easy to create a website

      D. It helps to deploy applications on the cloud

      Ans:  B

      6. Which of the following is not the commonly used programming language for Artificial Intelligence?
      A. Perl
      B. Java
      C. PROLOG
      D. LISP
      Ans: A

      7. Which of the following is not an application of artificial intelligence?
      A. Face recognition system
      B. Chatbots
      C. LIDAR
      D. DBMS
      Ans: D

      8. Which of the following is an advantage of artificial intelligence?
      A. Reduces the time taken to solve the problem
      B. Helps in providing security
      C. Have the ability to think hence makes the work easier
      D. All of the above

      Ans: D

      9. Which search method takes less memory?
      A. Depth-First Search
      B. Breadth-First search
      C. Optimal search
      D. Linear Search
      Ans: A

      10. A heuristic is a way of trying __________
      A. To discover something or an idea embedded in a program
      B. To search and measure how far a node in a search tree seems to be from a goal
      C. To compare two nodes in a search tree to see if one is better than the other is
      D. All of the mentioned

      Ans: D

      11. A.M. Turing developed a technique for determining whether a computer could or could not demonstrate the artificial Intelligence, Presently, this technique is called __________
      A. Turing Test
      B. Algorithm
      C. Boolean Algebra
      D. Logarithm

      Ans: A

      12. DARPA, the agency that has funded a great deal of American Artificial Intelligence research, is part of the Department of __________

      A. Defense
      B. Energy
      C. Education
      D. Justice
      Ans: A

      13. Which of these schools was not among the early leaders in Artificial Intelligence research?
      A. Dartmouth University
      B. Harvard University
      C. Massachusetts Institute of Technology
      D. Stanford University
      Ans: B

      14. A certain Professor at the Stanford University coined the word ‘artificial intelligence’ in 1956 at a conference held at Dartmouth college. Can you name the Professor?
      A. David Levy
      B. John McCarthy
      C. Joseph Weizenbaum
      D. Hans Berliner

      Ans: B

      15. The conference that launched the AI revolution in 1956 was held at?
      A. Dartmouth
      B. Harvard
      C. New York
      D. Stanford
      Ans: A

      16. What is a heuristic function?
      A. A function to solve mathematical problems
      B. A function which takes parameters of type string and returns an integer value
      C. A function whose return type is nothing
      D. A function that maps from problem state descriptions to measures of desirability
      Ans: D

      17. A search algorithm takes _________ as an input and returns ________ as an output.
      A. Input, output
      B. Problem, solution
      C. Solution, problem
      D. Parameters, sequence of actions
      Ans: B

      18. The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour.
      A. Finding shortest path between a source and a destination
      B. Travelling Salesman problem
      C. Map coloring problem
      D. Depth first search traversal on a given map represented as a graph
      Ans: B

      19. Which search method takes less memory?
      A. Depth-First Search
      B. Breadth-First search
      C. Linear Search
      D. Optimal search
      Ans: A

      20. Which search strategy is also called as blind search?
      A. Uninformed search
      B. Informed search
      C. Simple reflex search
      D. All of the mentioned
      Ans: A

      21. Which search is implemented with an empty first-in-first-out queue?
      A. Depth-first search
      B. Breadth-first search
      C. Bidirectional search
      D. None of the mentioned
      Ans: B

      22. Which search implements stack operation for searching the states?
      A. Depth-limited search
      B. Depth-first search
      C. Breadth-first search
      D. None of the mentioned
      Ans: B

      23. What is the other name of informed search strategy?
      A. Simple search
      B. Heuristic search
      C. Online search
      D. None of the mentioned
      Ans: B

      24. Which function will select the lowest expansion node at first for evaluation?
      A. Greedy best-first search
      B. Best-first search
      C. Depth-first search
      D. None of the mentioned
      Ans: B

      25. _________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.
      A. Constraints Satisfaction Problems
      B. Uninformed Search Problems
      C. Local Search Problems
      D. All of the mentioned
      Ans: A

      26. A heuristic is a way of trying ___________
      A. To discover something or an idea embedded in a program
      B. To search and measure how far a node in a search tree seems to be from a goal
      C. To compare two nodes in a search tree to see if one is better than another
      D. All of the mentioned
      Ans: D

      27. A* algorithm is based on ___________
      A. Breadth-First-Search
      B. Depth-First –Search
      C. Best-First-Search
      D. Hill climbing
      Ans: C

      28. Uninformed search strategies are better than informed search strategies.
      A. True
      B. False
      Ans: B

      29. Best-First search can be implemented using the following data structure
      A. Queue
      B. Stack
      C. Priority Queue
      D. Circular Queue
      Ans: C

      30. What is the evaluation function in A* approach?
      A. Heuristic function
      B. Path cost from start node to current node
      C. Path cost from start node to current node + Heuristic cost
      D. Average of Path cost from start node to current node and Heuristic cost
      Ans: C

      No comments:
      Subscribe to: Posts (Atom)

      About Machine Learning

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

      • About
        This blog provides information for the following subjects 👉 Artificial Intelligence  👉 Machine Learning 👉 Machine Learning Programs   👉 ...
      • About Machine Learning
          Machine Learning 👉    About Machine Learning 1 The Machine Learning Landscape Classification Support Vector Machines Decision Trees Ensem...
      • Machine Learning 1: UNIT 3 : Support Vector Machines MCQs
        UNIT 3 Support Vector Machines MCQs  -------------------------------------------------------------------------------------------------------...