Department of Computer Engineering©

Syllabus & Model Questions

Artificial Intelligence

Topics:

Problem solving by searching / knowledge, reasoning, and planning - First order

logic, Classical Planning and Knowledge Representation.

Uncertain knowledge and reasoning / Learning - probabilistic reasoning and

probabilistic reasoning over time. Making simple decision and complex decisions.

Learning- knowledge in learning, learning probabilistic methods.

Communicating, perceiving and action – Natural language and communication.

Robotics- hardware, perception and planning to move. Robotic software

architecture.

References:

1. Artificial Intelligence A modern Approach

[Publisher: Russell/Norvig, ISBN: 9780136042594]

Example question:

The missionaries and cannibals problem is usually stated as follows. Three

missionaries and three cannibals are on one side of the river, along with a boat that

can hold at most two people. Find a way to get everyone from one side of the river

to the other side of the river, without leaving any group of missionaries (on either

side of the river or in the boat) outnumbered by the cannibals in that place.

a) Devise a way to describe the states of the puzzle and the moves between the states. Note that it is not necessary to consider times in which people are in the boat and in transit across the river. Describe the banks as “left bank” and “right bank”.

b) In terms of these descriptions, specify the start and final state.

c) Do a Web search, find a single article on this problem, and write a one paragraph comment on the article. Show that you understand the article.

d) Why do you think that many people have difficulty solving the problem, given that the state space is so simple?

Department of Computer Engineering©

Design and Analysis of Algorithms:

Topics:

Brute-force string matching

Closest-Pair and Convex-Hull Problems by Brute Force

Multiplication of Large Integrated and Stassen’s Matrix Multiplication

Closest-Pair and Convex-Hull Problems by Divide and conquer

Topological Sorting

Algorithms for Generating Combinatorial objects- Generating permutations,

Input Enhancement in String Matching

Hashing

Backtracking

Branch-and-Bound References: Anany Levitin, "Introduction to the Design and Analysis of Algorithm", Pearson Education Asia, 2003. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, "Introduction to Algorithms", PHI Pvt. Ltd., 2001 Sara Baase and Allen Van Gelder, "Computer Algorithms - Introduction to Design and Analysis", Pearson Education Asia, 2003.

A.V.Aho, J.E. Hopcroft and J.D.Ullman, "The Design and Analysis of Computer Algorithms", Pearson Education Asia, 2003.

Example question:

1. Determine the number of character comparisons made by the brute-force algorithm in searching for the pattern KUMAR in the text THERE_IS_MORE_TO_LIFE_THAN_INCREASING_ITS_SPEED Assume that the length of the text—it is 47 characters long—is known before the search starts.

Data Structures Using Java and C++:

Data structures: Inheritance, Templates (C++), Vectors (C++), Lists (List-C++, Array List-Java), Iterators, Linked list (single, double, circular), Stacks, Queues, De-queues.

Trees: Binary trees, Binary search trees, Heap and priority queues, Huffman trees, Tree balance and rotation, AVL Trees, Red-black trees, 2-3 trees, 2-3-4 and B-trees. Graphs: Graphs, Traversals, Applications of graphs and algorithms using weighted graphs. Sets and maps: Maps, Multi-maps, Sets, Hash table’s implementations. Sorting techniques:

Department of Computer Engineering©

Selection, Bubble, Insertion, Shell, Merge, Quick, Heap sorts’ implementations with time complexity analysis. Advanced concepts: Exception (Errors, handling), Stubs, Drivers and Recursion.

Example question:

1) Implement double linked list using Java

Theory of Automata

Topics:

Languages, Recursive definitions, Regular expressions, Finite Automata, Regular and

Non-regular Languages, Context-Free Grammars and Languages.

Pushdown Automata, Context-Free Grammar and Languages, Decidability,

Reducibility, Turing Machines, Church – Turing Thesis, and the Chomsky Hierarchy.

References:

1. Introduction to Computer Theory, Second Edition by Daniel I A Cohen.

[Publisher: Wiley, ISBN: 9780471137726]

2. Introduction to the Theory of Computation, Second Edition by Michael Sipser.

[Publisher: Course Technologies, ISBN: 9780534950972]

Example question:

1. Let ,a b . Given a CFG generating the language of strings with twice as

many a’s as b’s. Prove that the grammar is correct.

2. Show that this PDA accepts the language of all words with an even number of letters (excluding ). Remember, it is also necessary to show that all words with odd length can never lead to ACCEPT.