MICROPROCESSORS & INTERFACING

UNIT 1 PART A 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. PART B 1. 2. 3. amples. 4. 5. 6. 7. 8. 9. Explain the architecture of 8085 with neat labelled sketch. Describe the functional pin diagram of 8085. List out the instruction set of 8085 and explain each group with four ex Explain the various types of addressing modes of 8085 with an example. Explain the 8085 interrupt system in detail. Explain the execution of the following instructions a) SHLD addr16 b) POP rp c) DAA d) CMP M e) LDAX rp f) CMA g) PUSH rp h) SIM Explain various machine cycles supported by 8085. Draw and explain the timing diagram for STA 4050 Design a microprocessor system to interface an 8K 8 EPROM and 8K * 8 RAM Define Microprocessors. What is the use of ALE signal? Give the format of flag register of 8085. What is the function of DAD? What is the difference between call and jump instruction? What is the instruction format of 8085 microprocessor? Define interrupt and its types Differentiate memory mapped I/O and I/O mapped I/O. Differentiate XCHG and XTHL. What is the need for interfacing? Define i) Instruction cycle ii) Machine cycle Define T-state and In which T-cycle the ALE signal is activated?

UNIT I 1. 2. 3. i. ii. iii. iv.

INTRODUCTION PART A Define Mapping. Give Example.* Write the two parts in VLSI layout. List any four components of problem definition. There are four components. They are initial state Successor function Goal test Path cost

4.

What do you mean by DFS?

5.

Define Artificial Intelligence. The study of how to make computers do things at which at the moment, people are better. b. Systems that think like humans c. Systems that act like humans d. Systems that think rationally e. Systems that act rationally 6. Mention the four kinds of agents.

7. Define State Space.* The set of all possible states reachable from the initial state by any sequence of action is called state space. 8. 9. i. ii. iii. iv. v. vi. a. b. 10. i) ii) iii) Give example for AI problems. Mention any four properties of task environment. Fully Observable Vs Partially Observable Deterministic Vs Stochastic Episodic Vs Sequential Static Vs Dynamic Discrete Vs Continuous Single Agent Vs Multi agent Competitive Multi agent operative Multi agent Co Give any two examples for toy problems. Toy problem Examples: Vacuum world problem. 8 queen problem 8 puzzle problem

11. What is an agent? An Agent is anything that can be viewed as perceiving (i.e.) understanding its e nvironment through sensors and acting upon that environment through actuators. 12. Define Path.* A path in the state space is a sequence of state connected by sequence of actions.

13. Give any four examples for real world problems. Real world problem examples: vii. Airline travel problem. viii. Touring problem. ix. Traveling salesman problem. x. VLSI Layout problem xi. Robot navigation xii. Automatic Assembly xiii. Internet searching 14. Define Path Cost.*

A function that assigns a numeric cost to each path, which is the sum of the cos t of the each action along the path. 15. Give the expansion of PEAS PEAS P- Performance measure E - Environment A- Actuators S Sensors

16. Define branching factor. The number of nodes which is connected to each of the node in search tree is cal led Branching factor. 17. Differentiate Best First Search, Depth First Search with Breadth First S earch. 18. What is the use of Heuristic Functions?* 19. Write short notes on Search Tree* The tree which is constructed for the search process over the state space is cal led search tree. 20. List the steps involved in simple problem solving technique*

PART-B 1. Discuss on Toy problems (16) 2. Explain any two kinds of agent Program. (16) 3. Describe the properties of task environment with suitable example (16) 4. Write about Real World problems with examples. (16) 5. Write short notes on Depth First Search with algorithm. (8) 6 .Explain Breadth First Search with algorithm. (8) 7. Explain the following uninformed search strategies with examples.* (16) a) Uniform Cost Search b) Depth Limited Search c) Bidirectional Search 8. Define the Vacuum World Problem and draw the corresponding state set (16) Representations *

space