M.Sc I-Semester Examination Nov./Dec 2007, Microprocessors and Microcontrollers

Faculty of Science
M.Sc I-Semester Examination Nov 2007
COMPUTER SCIENCE

*******************************************************************************************************

`````````````````````````````````````````````
Paper -- 1.3 (Microprocessors and Microcontrollers)
`````````````````````````````````````````````


SECTION -- A (Marks : 8 X 4 = 32)
************************************
1. Convert the Binary number 1011.011 to Decimal number.
2. Draw the Block diagram of UPS and explain.
3. Draw Program Status Word(PSW) of 8085 and explain.
4. Discuss Arithmetic instructions of 8085, with simple examples.
5. Explain Assembler Directives and the importance.
6. Discuss the Interrupts of 8086.
7. Discuss the Cache Controllers.
8. Explain Internal RAM Organization of 8051.

SECTION -- B (Marks : 4 X 12 = 48)
*************************************

9. (a) Discuss different types of Counters and explain Binary Counter, with neat diagram, waveforms and truth table.

(OR)

(b) Mention different types of D/A converters and explain R-2R ladder D/A converter, with neat circuit diagram.

10. (a) Mention different groups of instruction set of 8085 and explain Data Transfer group of instructions with suitable examples.

(OR)

(b) Draw the block diagram of Intel 8085 microprocessor and explain the important blocks.

11. (a) Draw the block diagram of 8255 Programmable Peripheral Interface (PPI), and explain the important blocks.

(OR)

(b) Mention different groups of instruction set of 8086 and explain Data transfer group of instructions with suitable examples.

12. (a) Mention different groups of instruction set of 8051 and explain Arithmetic group of instructions with suitable examples.

(OR)

(b) Draw the block diagram of 8051 microcontroller and explain the important blocks.

M.Sc I Semester 2008 Osmania University M.Sc Computer Science Discrete Mathematical Structure Question paper

Faculty of Science
M.Sc I-Semester Examination Nov./Dec 2008
COMPUTER SCIENCE

,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
Paper -- 1.1 (Discrete Mathematical Structure)
```````````````````````````````````````
SECTION -- A (Marks : 8 X 4 = 32)
************************************

1. Prove that ~(p^q) is equivalent to ~pv~q.
2. Given p, p->q and q --> r, prove r without using truth table.
3. In any graph, show that the sum of the degrees of vertices is twice the number of edges.
4. Show that every tree has at least two vertices of degree one.
5. How many ways can we get a sum of 4 or of 8 when two distinguishable dice are rolled?
6. How many thre-digits numbers are there which are even and have no repeated digits?
7. Find the coefficient of X^23 in (1+x^5+x^9)^10.
8. Solve the recurrence relation:

A(n)-7A(n-1)+10A(n-2) =0 for n>=2.

SECTION -- B (Marks : 4 X 12 = 48)
*************************************

9. (a) (i) Show that P <->q is equivalent to (P^q)v(~p^~q).
(ii) Show that syllogism is a valid rule of interface.

(OR)

(b) (i) Show that P^q is equivalent to (p NAND q) NAND (p NAND q).
(ii) Write the dual of the expression [(a+b)+(a+c)}ac1.

10. (a) (i) Show that in a connected plannar graph with e edges and v vertices , 3v-e >=6.
(ii) State and prove Euler's formula.

(OR)

(b) Use Dijkstra's algorithm to find the shortest path from A to Z.

(Graph Diagram is there...)

11. (a) (i) How many binary sequences are there of lenth 15?
(ii) How many integral solutions are there to X1+X2+X3+X4+X5 = 20 where X1>= 3, x2 >=2, X3>=4, x4>=6 and x5>=0?

(OR)

(b) Prove that the number of derangement of {1,2,3,......,n} is Dn = n![ 1-1/1!+1/2!+1/3!+....+(-1)^n/n!].

12 (a) (i) Show that the sum of the first n+1 Fibonacci numbers is one less than Fn+2.
(ii) Solve An-7An-1+10An-2 = 4^n for n >= 2.

(OR)

(b) (i) Solve An-An-1+9An-2+9An-3 = 0 for n>=3 and A0 =0, a1 = 1, a2 =2 using generating funtions.
(ii) Solve Sq.r(An)-Sq.r(An-1)-2Sq.rt(An-2) = 0 where A0 = A1 = 1.

M.Sc I-Semester Examination 2007 Osmania University M.Sc Computer Science Computer Graphics Question paper

Faculty of Science
M.Sc I-Semester Examination Nov./Dec 2007
COMPUTER SCIENCE

Computer Graphics Maximum Marks : 80
*******************************************************************

Section A (Marks 8 X 4 = 32)
*****************************

1. Explain about Raster scan display.
2. Write short notes on boundary fill method.
3. write about line attributes.
4. Explain briefly about reflection transformation.
5. Define window, viewport and viewing transformation.
6. Write short notes on Weiler-Atherton Plygon CLipping.
7. Write about interpolation and approximation of splines.
8. Write short notes on depth buffer method.

Section B (Marks: 4 X 12 = 48)
********************************

9. (a) (i) Explain Bresenham's line algorithm.
(ii) Write about different types of graphic software.

(OR)

(b) (i) Write and explain midpoint circle algorithm.
(ii) Write about modelling coordinates, world coordinates, device coordinates and normalized device coordinates.

10. (a) (i) Write shor notes on composite transformation.
(ii) Show that two successive rotations about origin in 2-D is additive and commutative.

(OR)

(b) (i) Derive transformation matrix in 2-D for rotation about a pivot point.
(ii)Define shear transformation. Write transformation matrices for x-shear and y-shear about the line y=0 and x=0

respectively.

11. (a) Explain Cohen-Sutherland line clipping method.

(OR)

(b) Explain Sutherland-Hodgeman plygon clipping method.

12. (a) Explain the steps used to obtain transformation matrix for rotation about an arbitrary axis in 3-D.

(OR)
(b) Write short notes on the following :-
(i) Parallel and perspective projections
(ii) Visible surface detection
(iii) Depth sorting method.

M.Sc I-Semester Examination Nov./Dec 2008, Microprocessors and Microcontrollers

Faculty of Science
M.Sc I-Semester Examination Nov./Dec 2008
COMPUTER SCIENCE

,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
Paper -- 1.3 (Microprocessors and Microcontrollers)
`````````````````````````````````````````````

SECTION -- A (Marks : 8 X 4 = 32)
************************************
1. Write short note on Decoder.
2. Explain R-2R ladder D/A converter.
3. Write note on ISA BUS Architecture.
4. Discuss Machine control instructions of 8085.
5. Write short notes on segment registers.
6. Explain briefly 8257(DMA Controller).
7. Discuss about Register A and Register B of 8051 Microcontroller.
8. Write about scanners.

SECTION -- B (Marks : 4 X 12 = 48)
*************************************

9. (a) Mention different types of counters and explain binary counter with diagram and timing diagram.

(OR)
(b) Explain any two types of A/D Converters.

10. (a) Describe architecture of 8085 Microprocessor with neat diagram.

(OR)
(b) Explain the addressing modes of 8085 with examples.

11. (a) Describe the following :-(i) Register Organization in 8086. (ii) Status flags of 8086.

(OR)
(b) Draw the block diagram of 8253 Counter/Timer and explain.

12. (a) Explain the arithmetic group instructions of 8051 with examples.

(OR)
(b) Describe the addressing modes of 8051 with examples.

M.Sc I-Semester Examination Nov 2007, Microprocessors and Microcontrollers

Faculty of Science
M.Sc I-Semester Examination Nov 2007
COMPUTER SCIENCE

`````````````````````````````````````````````
Paper -- 1.3 (Microprocessors and Microcontrollers)
`````````````````````````````````````````````

SECTION -- A (Marks : 8 X 4 = 32)
************************************
1. Convert the Binary number 1011.011 to Decimal number.
2. Draw the Block diagram of UPS and explain.
3. Draw Program Status Word(PSW) of 8085 and explain.
4. Discuss Arithmetic instructions of 8085, with simple examples.
5. Explain Assembler Directives and the importance.
6. Discuss the Interrupts of 8086.
7. Discuss the Cache Controllers.
8. Explain Internal RAM Organization of 8051.

SECTION -- B (Marks : 4 X 12 = 48)
*************************************

9. (a) Discuss different types of Counters and explain Binary Counter, with neat diagram, waveforms and truth table.

(OR)

(b) Mention different types of D/A converters and explain R-2R ladder D/A converter, with neat circuit diagram.

10. (a) Mention different groups of instruction set of 8085 and explain Data Transfer group of instructions with suitable examples.

(OR)

(b) Draw the block diagram of Intel 8085 microprocessor and explain the important blocks.

11. (a) Draw the block diagram of 8255 Programmable Peripheral Interface (PPI), and explain the important blocks.

(OR)

(b) Mention different groups of instruction set of 8086 and explain Data transfer group of instructions with suitable examples.

12. (a) Mention different groups of instruction set of 8051 and explain Arithmetic group of instructions with suitable examples.

(OR)

(b) Draw the block diagram of 8051 microcontroller and explain the important blocks.

M.Sc I Semester Examination, 2007, Modern Operating System

Faculty of Science
M.Sc I Semester Examination, Nov/Dec 2007
Computer Science Paper 1.2
************************************************
Modern Operating System

Section A (Marks : 8 X 4 = 32)
*******************************

1. Explain briefly the critical section problem.
2. Explain different process states.
3. What is thrashing? What is it required?
4. Write page replacement and why is it required?
5. Explain any two failure classifications in detail.
6. What is log? Explain its role in serializability.
7. Explain about kernel and demons in Unix System.
8. Write ps Commands with its field structure and example.

Section -- B (Marks: 4 X 12 = 32)
*************************************

9. (a) What is deadlock? Explain prevention and recovery measures.

(OR)
(b) Explain the distributed system architecture and different issues involved in it.

10. (a) What is thread? Explain different levels of threads used in distributed operating system.

(OR)

(b) What are the differences between paging and segmentation? Explain their uses in detail.

11. (a) What is a protocol? Explain two phase commit protocol in detail.

(OR)

(b) What are different security facilities available in windows and Unix system.

12. (a) What is the necessity of a backup? Explain different medias used for system backup.

(OR)

(b)(i) Write the procedure for disk installation in Unix System.
(ii) Explain about ps command and field values available while using it.

Faculty of Science
M.Sc I Semester Examination, April/May 2009
Computer Science Paper 1.2
************************************************
Modern Operating System

Section A (Marks : 8 X 4 = 32)
*******************************

1. Explain briefly the critical section problem.
2. Explain different process states.
3. What is thrashing? What is it required?
4. Write page replacement and why is it required?
5. Explain any two failure classifications in detail.
6. What is log? Explain its role in serializability.
7. Explain about kernel and demons in Unix System.
8. Write ps Commands with its field structure and example.

Section -- B (Marks: 4 X 12 = 32)
*************************************

9. (a) What is deadlock? Explain prevention and recovery measures.

(OR)
(b) Explain the distributed system architecture and different issues involved in it.

10. (a) What is thread? Explain different levels of threads used in distributed operating system.

(OR)

(b) What are the differences between paging and segmentation? Explain their uses in detail.

11. (a) What is a protocol? Explain two phase commit protocol in detail.

(OR)

(b) What are different security facilities available in windows and Unix system.

12. (a) What is the necessity of a backup? Explain different medias used for system backup.

(OR)

(b)(i) Write the procedure for disk installation in Unix System.
(ii) Explain about ps command and field values available while using it.

M.Sc I Semester Examination, April/May 2008, Modern Operating System

Faculty of Science
M.Sc I Semester Examination, April/May 2008
Computer Science Paper 1.2
************************************************

Modern Operating System

Section A(Marks : 8x4 = 32)
****************************************************

1. List out issues in Distributed Operating System?
2. Explain different process states.
3. Discuss varies access methods.
4. Discuss about free space management.
5. Explain abut access matrix with copy rights.
6. What are commit protocols?
7. Expain user's ie of fil system in Unix.
8. Write about backup devices.


Section B (Marks : 4 X 12 = 48)
****************************************************

9(a) (i) Explain inherent limitations of distributed system.
(ii) Explain SJF scheduling algorithm with example.

(OR)
(b) Define Deadlock and explain prevention and recovery management.

10(a) What is thrashing? Discuss about various fram allocation methods.

(OR)
(b) Explain :

(i) Exception Handeling
(ii) Disk Structure.

11(a) Explain in detail revocation of access rights.

(OR)
(b) Explain:
(i) Fault Tolerence
(ii) Network management.

12. (a) (i) Explain security management in Unixe Operating System.
(ii) Discuss Resource Management in Unix.

(OR)
(b) Write the detailed procedure in Linux to create and remove users with the required commands.

M.Sc I Semester Examination, 2009, Operating System

Faculty of Science
M.Sc I Semester Examination, April/May 2009
Computer Science Paper 1.2
************************************************

Modern Operating System

Answer all the questions.

Section - A (Marks : 8 X 4 = 32)
*********************************

1. What is PCB? Discuss briefly?
2. What is priority scheduling? Explain with an example.
3. What is thrashing? What is its use?
4. What is SCAN scheduling? Explain with an example.
5. Explain how domain is protected.
6. What is authentication in security?
7. Explain security features in management.
8. What is recovery? Explain.


Section - B (Marks : 4 X 12 = 48).
***********************************

9. (a) Explain the distributed system architecture and different issues involved in it.

(OR)

(b) What is dead lock? Explain Banker's algorithm with an example.

10 (a) What is paging? Explain hardware structure of paging.

(OR)

(b) Explain (i) Thread Scheduling (ii) Directory structure.

11. (a) Explain in detail how does windows handle process.

(OR)
(b) What is two pahse protocol? Explain in detail.

12. (a) (i) Explain about network management in Unix.
(ii) Write about backup devices.

(OR)

(b) What is network file system? Explain the file structure at both server and clients.

M.Sc (CS) I-Semester Examination Nov./Dec 2008, Discrete Mathematical Structure

Faculty of Science
M.Sc I-Semester Examination Nov./Dec 2008
COMPUTER SCIENCE

Paper -- 1.1 (Discrete Mathematical Structure)


SECTION -- A (Marks : 8 X 4 = 32)
************************************

1. Prove that ~(p^q) is equivalent to ~pv~q.
2. Given p, p->q and q --> r, prove r without using truth table.
3. In any graph, show that the sum of the degrees of vertices is twice the number of edges.
4. Show that every tree has at least two vertices of degree one.
5. How many ways can we get a sum of 4 or of 8 when two distinguishable dice are rolled?
6. How many thre-digits numbers are there which are even and have no repeated digits?
7. Find the coefficient of X^23 in (1+x^5+x^9)^10.
8. Solve the recurrence relation:

A(n)-7A(n-1)+10A(n-2) =0 for n>=2.

SECTION -- B (Marks : 4 X 12 = 48)
*************************************

9. (a) (i) Show that P <->q is equivalent to (P^q)v(~p^~q).
(ii) Show that syllogism is a valid rule of interface.

(OR)

(b) (i) Show that P^q is equivalent to (p NAND q) NAND (p NAND q).
(ii) Write the dual of the expression [(a+b)+(a+c)}ac1.

10. (a) (i) Show that in a connected plannar graph with e edges and v vertices , 3v-e >=6.
(ii) State and prove Euler's formula.

(OR)

(b) Use Dijkstra's algorithm to find the shortest path from A to Z.

(Graph Diagram is there...)

11. (a) (i) How many binary sequences are there of lenth 15?
(ii) How many integral solutions are there to X1+X2+X3+X4+X5 = 20 where X1>= 3, x2 >=2, X3>=4, x4>=6 and x5>=0?

(OR)

(b) Prove that the number of derangement of {1,2,3,......,n} is Dn = n![ 1-1/1!+1/2!+1/3!+....+(-1)^n/n!].

12 (a) (i) Show that the sum of the first n+1 Fibonacci numbers is one less than Fn+2.
(ii) Solve An-7An-1+10An-2 = 4^n for n >= 2.

(OR)

(b) (i) Solve An-An-1+9An-2+9An-3 = 0 for n>=3 and A0 =0, a1 = 1, a2 =2 using generating funtions.
(ii) Solve Sq.r(An)-Sq.r(An-1)-2Sq.rt(An-2) = 0 where A0 = A1 = 1.