100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
APT 3010 INTRODUCTION TO ARTIFICIAL INTELLIGENCE EXAM REVIEW QUESTIONS WITH 100% COMPLETE SOLUTIONS; BEST STUDY EXAM EVER FOR THE AI; GRADED A+ R246,85
Add to cart

Exam (elaborations)

APT 3010 INTRODUCTION TO ARTIFICIAL INTELLIGENCE EXAM REVIEW QUESTIONS WITH 100% COMPLETE SOLUTIONS; BEST STUDY EXAM EVER FOR THE AI; GRADED A+

 6 views  0 purchase
  • Course
  • APT
  • Institution
  • APT
  • Book

This exam gives a comprehensive revision summary for scholar to achieve great heights in ARTIFICIAL INTELLIGENCE courses

Preview 2 out of 8  pages

  • December 15, 2024
  • 8
  • 2024/2025
  • Exam (elaborations)
  • Questions & answers
  • APT
  • APT
avatar-seller
APT 3010 INTRODUCTION TO
ARTIFICIAL INTELLIGENCE EXAM
REVIEW QUESTIONS (100% SOLVED)

in lisp, the function returns the list that results after the first element is removed (the rest
of the list), is - cdr

which of the following contains the output segments of artificial intelligence
programming - printed language and synthesized speech, manipulation of physical
object, locomotion

lisp was created by? - jon mcCarthy

expert ease was developed under the direction of - donald michie

an artificial intelligence system developed by terry a winograd to permit an interactive
dialogue about a domain he called blocks-world - SHRDLU

MLMenu, a natural language interface for the TI explorer is similar to - natural link

strong artificial intelligence is - the embodiment of human intellectual capabilities within
a computer

the traditional way to exit and lisp system is to enter - exit

in which of the following situations might a blind search be acceptable - small search
space

what is artificial intelligence? - making a machine intelligent

which search method takes less memory - depth first search

a heuristic is a way of trying ________ - to discover something or an idea embedded in
a program,
to search and measure how far a node in a search tree seems to be from a goal,
to compare two nodes in a search tree to see if one is better than the other is

how do you represent "all dogs have tails" - vx:dog(x) ahastail(x)

which is not a property of representation of knowledge - representational verification

, a series of artificial intelligence systems developed by pat langley to explore the role of
heuristics in scientific discovery is - BACON

A.M turing developed a technique for determining whether a computer could or could
not demonstrate the artificial intelligence, presently this technique is called - turing test

a personal consultant knowledge base contains information in the form of - parameters,
contexts, production rules

which approach to speech recognition avoids the problem caused by the variation in
speech patterns among different speakers? - speaker dependent recognition

which of the following is a component of an expert system - inference engine,
knowledge base, user interface

a computer vision technique that relies on image templates is - model-based vision

DARPA, the agency that has funded a great deal of american artificial intelligence
research is part of the department of _____________ - defense

which of these schools was not among the early leaders in artificial intelligence
research? - harvard university

a certain professor at the stanford university coined the word 'artificial intelligence' in
1956 at a conference held at darthmouth college. can you name the professor? - john
mcCarthy

in lisp, the function (copy-list<list>) - returns a new list that is equal to <list> by copying
the top level element of <list>

who is the father of artificial intelligence? - john mcCarthy

in 1985, the famous chess player david levy beat a world champion chess program in
four straight games by using orthodox moves that confused the program. what was the
name of the chess program? - CRAY BLITZ

the explanation facility of an expert system may be used to - expedite the debugging
process and explain the system's reasoning process

a process that is repeated, evaluated and refined is called - iterative

visual clues that are helpful in computer vision include - color and motion, depth and
texture

the conference that launched the AI revolution in 1956 was held at? - dartmouth

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through EFT, credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying this summary from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller Knowledgekings. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy this summary for R246,85. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

53068 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy summaries for 14 years now

Start selling
R246,85
  • (0)
Add to cart
Added