question answers

Saturday, June 29, 2013

Draw the functional block diagram or architecture of 8085.

Posted by Ankit Agarwal at 8:30 PM

Email This BlogThis!Share to X Share to Facebook Share to Pinterest

Labels: Microprocessor

No comments:

Popular Posts

What is the difference between schedule and questionnaire?

The differences between schedule and questionnaire are:- Schedule S.N. Questionnaire A schedule i...
What do you mean by stack underflow and stack overflow?

The condition in which the stack is empty denoted by ‘top=-1’ is known as stack underflow. The condition in which the stack is full d...
Explain Arithmetic Logic Shift Unit.

Arithmetic logic shift unit is a digital circuit that performs arithmetic calculations, logical manipulation and shift operation. I...
What do you mean by Experiment?

An experiment is a way or a tool of getting solution to a problem that is under consideration. Each experiment can be classified into t...
Explain shift microoperation.

The operation that changes the adjacent bit position of the binary values stored in the register is known as shift microoperation. They...
When do page fault occur? Describe the actions taken by an OS when a page fault occur?

Any computations and executions take place only when the program is resided in the main memory and it is getting the CPU time. This sta...
Write an algorithm to count total number of nodes in the singly linked list.

Conditions: · ‘SingleNode’ is the node representation of singly linked list, where, struct my_node{ //structure name...
Write an algorithm to convert infix expression to prefix expression. Give a suitable example.

An algorithm to convert infix expression to prefix expression is: INITIALLY: ‘stackop’ is an empty stack. ‘prefix’, is an empty s...
What is questionnaire? Explain. Write down the pre-requisite of a good questionnaire.

A questionnaire is written list of questions which are answered by lot of people in order to provide information for a report or a surv...
Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2,1,2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How many page faults would occur for the LRU replacement? Remember all frames are Initially empty, so your first unique pages will all cost one fault each.

For LRU replacement algorithm: :: for 3 page frames Request 1 2 3 4 2 1 ...