Scribd
Upload
57 views4 pages

Important Co and Os

Uploaded by

Akhila Akula
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
57 views4 pages

Important Co and Os

Uploaded by

Akhila Akula
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

UNIT 1

1. Feature the functional units of a basic computer


2. Deliver a note on memory- reference instructions
3. Emphasize on Logic and Shift micro operations
4. Depict the instruction cycle flow diagram
5. With suitable examples describe all types of addressing modes supported
by a computer.
6. What are the functional units of computer? Explain.
7. Write about various instructions along with examples.
8. With neat sketch explain multiple bus organization within processor
9. Discuss the importance of stacks in computer during instruction
execution.
10.Explain the instruction cycle with a neat flow chart
11.How index addressing mode is different from relative addressing mode?
Explain with suitable illustrations.
12.Describe about stack organization
13.Give explanation about the fixed point and floating point representations in
detail.

UNIT 2
1. Highlight the memory operations in cache and virtual memories
2. Focus on the presentation of Control memory functions
3. Illustrate the micro programmed control unit with a design
4. Explain the various memories and their specialties
5. Write about hardwired control unit along with neat diagram.
6. Write notes on the following
a. i) Control Memory ii) Address Sequencing iii) Micro-
Instructions & microprogram
7. With neat diagram explain microprogrammed control unit organization
8. Write notes on cache memory mapping techniques and virtual memory.
9. Outline the Cache Memories Performance Considerations and demonstrate
with examples.
10.Illustrate virtual memory with a neat diagram.
11.Demonstrate the Micro-Program example with a neat diagram.
12.Express about control memory in detail with neat diagram.
13.Explain in detail about 4-bit Arithmetic circuit.
14.Describe about Arithmetic Logic Shift Unit.
15.What is Virtual Memory? Explain in detail
16.Give a brief note on RAID

UNIT 3
1. Interpret the peripheral interface and their interconnection
2. Compare the Standard Serial communication protocols
3. Analyze the priority interrupt procedures in I-O processing
4. Justify the types of data transfer modes in I-O processing
5. What is importance of DMA an explain with neat diagram
6. Using block diagram explain the working of DMA Controller
7. Discuss about interrupt priorities.
8. Explain in detail about Input-Output Interface
9. Describe in detail IOP and write about RS232 protocol
10.What is the difference between subroutine and an interrupt-service routine?
11.Discuss in detail asynchronous data transfer modes.
12.Model the operations performed using Direct memory Access and explain
its importance
13.Select the concept of Input output organization and explain the
14.Asynchronous data transfer method in detail.
15.With neat diagrams explain about the following Standard Serial
Communication Protocol i) USB ii) IEEE1394
16.Describe in detail I/O structures and Storage structures in Computer
Systems Structures
17.Describe peripheral connect interface (PCI) in detail
18.Choose any serial communication protocol and explain in detail

UNIT 4
1. Determine the various processes and their states
2. Detail the styles of various memory management schemes
3. Conceptualize the Process Management and Scheduling
4. Elaborate the memory page replacement algorithms
5. Explain the services offered by operating system.
6. Explain different process states and its transition with a neat diagram.
7. Distinguish between short term and long term CPU schedulers.
8. Write about page replacement algorithms.
9. Consider the following processes along with CPU burst time.

a. Process CPU Burst


b. P1 15
c. P2 5
d. P3 10
10.P4 8
a. P5 6
i. Draw Gantt chart, and Calculate Turnaround time, Response
time, Waiting time each of the following CPU scheduling
algorithms.
b. i)FCFS
c. ii) SJF
d. iii)Round Robin scheduling
11.Explain Fixed size and Variable size partitions in the contiguous memory
i. and compare paging and demand paging.
12.Consider the following page reference string: 1, 2,3, 4, 2, 1, 5, 6, 2, 1, 2, 3,
a. 7, 6, 3, 2, 1, 2, 3, 6. How many page faults would occur for the
optimal
i. page replacement algorithm, assuming three frames and all
frames are initially empty.
13.Demonstrate 5 states process with a neat sketch and explain each state in
detail
14.13.Describe the three general methods for passing parameters to the
operating system.
15.What are the differences between paging and segmentation?
16.Explain preemptive and non preemptive scheduling.
17.What are the goals of memory management? Explain the Contiguous
Memory Allocation techniques

UNIT 5

1. Using an example of data file sharing, justify the deadlock avoidance


2. Interpret the directory structure and issues in it
3. Contrast the terms detection, prevention, avoidance processes in deadlock
management
4. Specify the analysis carried out in file system interface
5. Write about deadlock detection algorithm in detail.
6. With a suitable example explain bankers algorithm.
7. Distinguish various disk based file allocation methods and disk-file access
methods.
8. Explain the different file allocation methods.
9. With a suitable example Explain the Deadlock Prevention Technique
10.Discuss about File Access methods and Protection.
11.Explain how the remote file sharing can be done in RFS.
12.Write short notes on files and operations on files.
13.Select the concepts of Files, explain in detail about File directory structure
and File system mounting
14.List out all the file-sharing and protection mechanisms.

You might also like