1/23/2021 Artificial Intelligence Search Methods For Problem Solving - - Unit 3 - Week 0
https://onlinecourses.nptel.ac.in/noc20_cs81/unit?unit=110&assessment=118 1/4
X
NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Artificial Intelligence Search Methods For Problem Solving (course)
Unit 3 - Week 0
(https://swayam.gov.in)
(https://swayam.gov.in/nc_details/NPTEL)Announcements (announcements) About the Course (preview) Ask a Question (forum) Progress (student/home) Mentor (student/mentor)
Course outline
How does an NPTEL online course work?
Pre-requisite Assignment Week 0
Week 1 Week 2 Week 3 Week 4 Week 5 Week 6 Week 7 Week 8 Week 9 Week 10 Week 11 Week 12
Prologue (unit?
unit=110&lesson=102) The Winograd Schema Challenge (unit?
unit=110&lesson=103) Introduction (2013 version) (unit?unit=110&lesson=104) Can Machines Think? (unit?
unit=110&lesson=105) The Turing Test (unit?
unit=110&lesson=106) Language and Thought (unit?unit=110&lesson=107) The Willing Suspension of Disbelief (unit?
unit=110&lesson=108) Machines with Wheels and Gears (unit?
unit=110&lesson=109) Quiz : Week 0 Assignment (assessment?name=118) Lecture Materials (unit?
unit=110&lesson=171)
Due on 2020-09-14, 23:59 IST.
1 point 1)
1 point 2)
1 point 3)
Week 0 Assignment
The due date for submitting this assignment has passed.
As per our records you have not submitted this assignment.
The questions in this assignment are FAQ based. Please visit the course preview (https://swayam.gov.in/nd1_noc20_cs81/preview) page and check out videos on “ How does an NPTEL online course work? ” (https://onlinecourses.nptel.ac.in/noc20_cs81/unit?unit=1&lesson=87) and recent announcements (https://onlinecourses.nptel.ac.in/noc20_cs81/announcements) and the forum before attempting the assignment.
The reasons why you have registered for the AI:SMPS course are A certificate from NPTEL IIT will be good on your resume You are curious why AI is such a buzz word nowadays The course will help with a similar course you plan to do in college You are interested in exploring how machines can be made intelligent You are interested in cognition in general
You think this course is about machine intelligence and data science You want to explore how computers can solve problems autonomously No, the answer is incorrect.
Score: 0 Accepted Answers:
A certificate from NPTEL IIT will be good on your resume You are curious why AI is such a buzz word nowadays The course will help with a similar course you plan to do in college You are interested in exploring how machines can be made intelligent You are interested in cognition in general
You think this course is about machine intelligence and data science You want to explore how computers can solve problems autonomously
The course runs over 12 weeks culminating in a final 3 hour exam (assuming things become normal by October). Which of the following are good strategies to get a good certificate on completion?
Study only in the last two weeks since the final exam has 75% weight Sample the videos every week, and binge watch them in the last two weeks Watch the videos as soon as you can. Think about them. Then attempt the quizzes Look at the weekly quiz. Scan the videos for answers and do them quickly No, the answer is incorrect.
Score: 0 Accepted Answers:
Watch the videos as soon as you can. Think about them. Then attempt the quizzes
The online exams are evaluated automatically. Which of the following are true in your opinion when there are multiple choice questions with multiple
correct choices?
It is best to tick all answers, you will cover all correct choices
Tick all choices you think are correct. Any negative marks for wrong choices will get compensated by correct choices. This maximizes your chances Tick all answers you know are correct. Because any wrong answer will result in zero for the entire question
You need to mark all correct a nswers and no wrong answers to get any marks in the question You need to mark some correct answers and no wrong answers to get partial marks in the question No, the answer is incorrect.
Score: 0 Accepted Answers:
Tick all answers you know are correct. Because any wrong answer will result in zero for the entire question You need to mark some correct answers and no wrong answers to get partial marks in the question
1/23/2021 Artificial Intelligence Search Methods For Problem Solving - - Unit 3 - Week 0
https://onlinecourses.nptel.ac.in/noc20_cs81/unit?unit=110&assessment=118 2/4
DOWNLOAD VIDEOS 4) 1 point
1 point 5)
1 point 6)
1 point 7)
The online exams are evaluated automatically. Which of the following are true in your opinion when there are multiple choice questions with one correct choice?
If you do not know the answer it is okay to guess. There are no negative marks.
If you do not know the answer it is not okay to guess. There are negative marks
Negative marks are a fraction of the positive marks. If you can eliminate a couple of choices it is better to guess Negative marks are the same as positive marks. If you guess wrong you get full negative marks
No, the answer is incorrect.
Score: 0 Accepted Answers:
If you do not know the answer it is okay to guess. There are no negative marks.
The online exams are evaluated automatically. Which of the following are true in your opinion when there are short answer type questions?
You need to read the instructions about the expected format of the answers very carefully The answers are evaluated by string matching. Your answer needs to be exact
A natural language processing system is reading your answers. It will understand what you meant to say Extra blanks are taken care of during processing. You can insert them freely.
Extra punctuation marks, including brackets, are ignored No, the answer is incorrect.
Score: 0 Accepted Answers:
You need to read the instructions about the expected format of the answers very carefully The answers are evaluated by string matching. Your answer needs to be exact
Which of the following statements are true about this course?
You may take this course any number of times and also take the exam any number of times, there is no upper limit. Some students take this course multiple times to improve their score
It takes much more than one hour to understand the contents of a one hour lecture, so accordingly plan your time. Last minute preparation is not useful Assignments are released one week in advance. That gives you enough time to watch the videos and work out the assignments. Again, last minute preparation is not useful
Some assignment questions will be drawn from forum discussions . So regularly check the forum
Some participants try the assignments first and then watch the lectures. Some watch the lectures and then try the assignments. Some go back and forth.
Participants come from diverse backgrounds, with different skill sets and different priorities, so do not compare yourself with other participants, complete this course at your own pace.
Many talented people come from non-English speaking backgrounds, so do not worry about lack of English speaking/writing skills, feel free to post your doubts in the forum, actively participate in the forum. Language is not an issue
All the above statements are true, so do go back and read the points, then mark all the options including this option No, the answer is incorrect.
Score: 0 Accepted Answers:
You may take this course any number of times and also take the exam any number of times, there is no upper limit. Some students take this course multiple times to improve their score
It takes much more than one hour to understand the contents of a one hour lecture, so accordingly plan your time. Last minute preparation is not useful
Assignments are released one week in advance. That gives you enough time to watch the videos and work out the assignments. Again, last minute preparation is not useful
Some assignment questions will be drawn from forum discussions . So regularly check the forum Some participants try the assignments first and then watch the lectures. Some watch the lectures and then try the assignments. Some go back and forth.
Participants come from diverse backgrounds, with different skill sets and different priorities, so do not compare yourself with other participants, complete this course at your own pace.
Many talented people come from non-English speaking backgrounds, so do not worry about lack of English speaking/writing skills, feel free to post your doubts in the forum, actively participate in the forum. Language is not an issue
All the above statements are true, so do go back and read the points, then mark all the options including this option
Programming requirements for the course.
Fundamental concepts presented in this course can be understood without prior programming experience.
To work out assignments you need a Wikipedia level exposure to Algorithms, Tuple, List, Stack, Array, Tree, Graph. Some basic operations on Lists are covered in the lecture.
Participants with programming experience have the opportunity to implement and test the algorithms presented in this course For participants who are learning to program, this course is a goldmine. There is so much you can practice here
Participants who are strong in programming tend to implement the algorithms presented in this course and they use their programs to solve assignment problems. Smart move. They score well in assignments and not so well in exams. It is a disaster. Therefore, it is a good idea to work out the assignments by hand and use your programs to verify your answers
No, the answer is incorrect.
Score: 0 Accepted Answers:
Fundamental concepts presented in this course can be understood without prior programming experience.
To work out assignments you need a Wikipedia level exposure to Algorithms, Tuple, List, Stack, Array, Tree, Graph. Some basic operations on Lists are covered in the lecture.
Participants with programming experience have the opportunity to implement and test the algorithms presented in this course
1/23/2021 Artificial Intelligence Search Methods For Problem Solving - - Unit 3 - Week 0
https://onlinecourses.nptel.ac.in/noc20_cs81/unit?unit=110&assessment=118 3/4
1 point 8)
1 point 9)
1 point 10)
For participants who are learning to program, this course is a goldmine. There is so much you can practice here
Participants who are strong in programming tend to implement the algorithms presented in this course and they use their programs to solve assignment problems. Smart move. They score well in assignments and not so well in exams. It is a disaster. Therefore, it is a good idea to work out the assignments by hand and use your programs to verify your answers
Course material: Which of the following is a recommended Text book for this course?
Deepak Khemani. A First Course in Artificial Intelligence, McGraw Hill Education (India), 2013.
Patrick Henry Winston. Artificial Intelligence, Addison-Wesley, 1992.
Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach, 3rd Edition, Prentice Hall, 2009
Pamela McCorduck, Machines Who Think: A Personal Inquiry into the History and Prospects of Artificial Intelligence, A K Peters/CRC Press; 2 edition, 2004
No, the answer is incorrect.
Score: 0 Accepted Answers:
Deepak Khemani. A First Course in Artificial Intelligence, McGraw Hill Education (India), 2013.
Course material: Which of the following are recommended Reference books for this course?
Stefan Edelkamp and Stefan Schroedl. Heuristic Search: Theory and Applications, Morgan Kaufmann, 2011 John Haugeland, Artificial Intelligence: The Very Idea, A Bradford Book, The MIT Press, 1985
Pamela McCorduck, Machines Who Think: A Personal Inquiry into the History and Prospects of Artificial Intelligence, A K Peters/CRC Press; 2 edition, 2004
Zbigniew Michalewicz and David B. Fogel. How to Solve It: Modern Heuristics. Springer; 2nd edition, 2004 Judea Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, 1984 Elaine Rich and Kevin Knight. Artificial Intelligence, Tata McGraw Hill, 1991
Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach, 3rd Edition, Prentice Hall, 2009 Eugene Charniak, Drew McDermott. Introduction to Artificial Intelligence, Addison-Wesley, 1985 Patrick Henry Winston. Artificial Intelligence, Addison-Wesley, 1992
No, the answer is incorrect.
Score: 0 Accepted Answers:
Stefan Edelkamp and Stefan Schroedl. Heuristic Search: Theory and Applications, Morgan Kaufmann, 2011 John Haugeland, Artificial Intelligence: The Very Idea, A Bradford Book, The MIT Press, 1985
Pamela McCorduck, Machines Who Think: A Personal Inquiry into the History and Prospects of Artificial Intelligence, A K Peters/CRC Press; 2 edition, 2004
Zbigniew Michalewicz and David B. Fogel. How to Solve It: Modern Heuristics. Springer; 2nd edition, 2004 Judea Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, 1984 Elaine Rich and Kevin Knight. Artificial Intelligence, Tata McGraw Hill, 1991
Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach, 3rd Edition, Prentice Hall, 2009 Eugene Charniak, Drew McDermott. Introduction to Artificial Intelligence, Addison-Wesley, 1985 Patrick Henry Winston. Artificial Intelligence, Addison-Wesley, 1992
What else, in addition to the suggested readings on the course page, fall in the category of course material?
Weekly video lectures Lecture slides
New material, problems, clarifications and addendum posted in the forum Video-transcripts (subject to availability)
The mighty Google. As always Google is your friend No, the answer is incorrect.
Score: 0 Accepted Answers:
Weekly video lectures Lecture slides
New material, problems, clarifications and addendum posted in the forum Video-transcripts (subject to availability)
The mighty Google. As always Google is your friend
