CS6601 Distributed system

INSTITUTE OF TECHNOLOGY

Department of Computer Science and Engineering

Sub. Name: Distributed System                                              Sub.Code: CS6601

Max.Marks: 50                                                                                      Time: 90 min

Department: Computer Science and Engineering                        Sem/Year: IV/III Date:

Internal Assessment – I

PART – A 5x 2=10

1. Define distributed systems?(CO1)
2. Give examples of distributed systems . (CO1)
3. What is meant by interprocess Communication? (CO2)
4. What is the difference between RMI and RPC? (CO2)
5. Define Intranet.(CO1)

Part b

6. a. Explain the Differences between intranet and internet (5) (CO1)

b. Write in detail about resources of Distributed system (8) (CO1)

OR

6. Explain the various challenges of distributed systems (13) (CO1)

7. a. Explain the Communication between distributed objects (8) (CO2)

b. Explain in detail about Events and Notifications (5) (CO2)

OR

7. Explain in detail about Remote Procedure call with a case study (13) (CO2)

Part C

8 Write in detail about www (14)

INSTITUTE OF TECHNOLOGY

Department of Computer Science and Engineering

Sub. Name: Distributed System                                              Sub.Code: CS6601

Max.Marks: 50                                                                                      Time: 90 min

Department: Computer Science and Engineering                        Sem/Year: IV/III Date:

Internal Assessment – I

PART – A 5x 2=10

1. Write the following (i)HTTP (ii) HTML (iii) URL (CO1)
2. What are the uses of web services? (CO1)
3. Define Datagram. (CO2)
4. What is the use of UDP? (CO2)
5. Define internet (CO1)

Part B

6. a. Explain the Differences between intranet and internet (5) (CO1)

Write in detail about resources of Distributed system (8) (CO1)

OR

6. Explain the various challenges of distributed systems (13) (CO1)

7. a. Explain the Communication between distributed objects (8) (CO2)

b. Explain in detail about Events and Notifications (8) (CO2)

OR

Explain in detail about Remote Procedure call with a case study (13) (CO2)

Part C

8. Write in detail about www (8) (CO1)

INSTITUTE OF TECHNOLOGY

Department of Computer Science and Engineering

Sub. Name: Distributed System                                              Sub.Code: CS6601

Max.Marks: 50                                                                                      Time: 90 min

Department: Computer Science and Engineering                        Sem/Year: VI/III Date:

Internal Assessment – II

PART – A 5x 2=10

1. Define Datagram.(CO2)
2. What is the use of UDP? (CO2)
3. What are core OS Components? (CO3)
4. What is meant by cluster? (CO3)
5. What is the use of cryptography? (CO3)

Part B

6.Explain about the group and Client server communication (13) (CO2)

OR

6. Explain the various type communications with examples(13)(CO2)

7. Explain about the Andrew file system. (13) (CO3)

OR

7.Describe Operating system architecture (13) (CO3)

Part C

8. Explain about the Andrew file system. (14) (CO3)

INSTITUTE OF TECHNOLOGY

Department of Computer Science and Engineering

Sub. Name: Distributed System                                              Sub.Code: CS6601

Max.Marks: 50                                                                                      Time: 90 min

Department: Computer Science and Engineering                        Sem/Year: VI/III Date:

Internal Assessment – II

PART – A 5x 2=10

1. What are the methods provides by datagram socket? (CO2)
2. What are the characteristic of network hidden by streamabstraction? (CO2)
3. What is meant by invocation performance? (CO3)
4. Difference between monolithic and micro kernels(CO3)

Part B

6. a. Explain characteristics of interprocess communication. (5) (CO2)

b. Explain UDP datagram communication (8) (CO2)

OR

6. Explain in detail about Remote Procedure call with a case study (13)(CO2)

7. a. Discuss about threads in distributed systems (5) (CO3)

b. Discuss about the distributed file system. (8) (CO3)

OR

7. Explain about the file server architecture. (13) (CO3)

Part C

8. Describe detail about Java RMI with simple example (14)

Department of Computer Science and Engineering

Sub. Name: Distributed System                                              Sub.Code: CS6601

Max.Marks: 50                                                                                      Time: 90 min

Department: Computer Science and Engineering                        Sem/Year: VI/III Date:

Internal Assessment – III

PART – A 5x 2=10

1. What is the Name Spaces?(CO4)
2. What is the domain name system? (CO4)
3. Define Concurrency control. (CO5)
4. What is meant by nested transactions? (CO5)

Part B

6.Explain the case study of X.500 directory services. (13) (CO4)

OR

6.Explain about the Events and process state. (13) (CO4)

7.Describe in detail about distributed deadlocks (13) (CO5)

OR

7.Explain the concurrency control in distributed transactions (13) (CO5)

Part C

8. Describe detail about CODA with simple example (14) (CO4)

Department of Computer Science and Engineering

Sub. Name: Distributed System                                              Sub.Code: CS6601

Max.Marks: 50                                                                                      Time: 90 min

Department: Computer Science and Engineering                        Sem/Year: VI/III Date:

Internal Assessment – III

PART – A 5x 2=10

1. Define strict two phase locking. (CO4)
2. Define deadlock. (CO4)
3. Difference between validation phase and update phase(CO5)
4. Define time stamp ordering. (CO5)

Part B

6.Explain in detail about Name services (13) (CO4)

OR

6.Explain the case study of Global name services. (13) (CO4)

7. Explain about distributed deadlocks (13) (CO5)

OR

7. Describe in detail about distributed deadlocks (13) (CO5)

Part C

8. Describe detail about CODA with simple example (14) (CO4)

Nazareth Railway station , TamilNadu.

https://www.youtube.com/watch?v=RbT6zBG3mPI

CS6303 CS8491 Computer Architecture

CS6303 Computer Architecture Nov/Dec 2016 Anna University Question Paper

ec8552-syllabus-computer-architecture-and-organization-regulation-2017-anna-university

CS6303 Computer Architecture Nov/Dec 2016 Anna University Question paper Nov/Dec 2016 Here you can get Previous Year Question paper Recent Question Papers 2marks syllabus 2013 regulation etc.  To Score more in your semester exams Get best score in your semester exams without any struggle. Just refer the previous year questions from our website. At the last time of examination you won’t be able to refer the whole book. We know students find it difficult to score better in university exams so we make it easy to assemble, use, and even reuse the frequently asked questions. We are a library of questions which are asked frequently, all you need to do is to refer our website and get the CS6303 Computer Architecture Anna university Question paper Nov/Dec 2016

Students who are already keeping good score should use previous questions only for reference. It may help you to get full score. For such students a small advice is that, after studying the entire portions, one can use these recent year questions for revision. Our recentquestionpaper.com is meant for practicing and revising what one has studied and for you to assure pass mark who find it difficult to study the full portion. It helps you to know the range of questions asked in semester exam.

Department of Computer Science and Engineering

Sub. Name: Computer Architecture                                   Sub.Code: CS6303

Max.Marks: 100                                                                     Time: 180 min

Department: Computer Science and Engineering             Sem/Year: III/II       Date:

Model Exam – I

PART – A                              10x 2=20

1.        What is instruction register?                                                                    (CO1)

In computing, an instruction register (IR) is the part of a CPU's control unit that holds the instruction currently being executed or decoded

2.        What is program counter?                                                                       (CO1)

A program counter is a register in a computer processor that contains the address (location) of the instruction being executed at the current time. As each instruction gets fetched, the program counter increases its stored value by 1.

3.        What is arithmetic overflow?                                                                   (CO2)

In computer programming, an integer overflow occurs when an arithmetic operation attempts to create a numeric value that is outside of the range that can be represented with a given number of bits – either larger than the maximum or lower than the minimum representable value.

4.        What is Carry Save addition?                                                  (CO2)

A carry-save adder is a type of digital adder, used in computer microarchitecture to compute the sum of three or more n-bit numbers in binary.

5.        What is meant by data hazard in pipelining?                                            (CO3)

Data hazards occur when the pipeline changes the order of read/write accesses to operands so that the order differs from the order seen by sequentially executing instructions on the unpipelined machine. 

6.        What is side effect?                                                                                 (CO3)

Side effect (computer science) In computer science, a function or expression is said to have a side effect if it modifies some state outside its scope or has an observableinteraction with its calling functions or the outside world besides returning a value.

7.        Define Reorder buffer.                                                                            (CO4)

A re-order buffer (ROB) is used in a Tomasulo algorithm for out-of-order instruction execution. It allows instructions to be committed in-order. 

8.        What is In order commit?                                                                        (CO4)

A re-order buffer (ROB) is used in a Tomasulo algorithm for out-of-order instruction execution. It allows instructions to be committed in-order. 

9.        Define write through and write buffer.                                                    (CO5)

Write-through cache directs write I/O onto cache and through to underlying permanent storage before confirming I/O completion to the host. 

10.     What is write-back?                                                                                 (CO5)

Write-back cache is where write I/O is directed to cache and completion is immediately confirmed to the host. This results in low latency and high throughput for write-intensive applications, but there is data availability exposure risk because the only copy of the written data is in cache. 

PART – B                                              13 x 5=65

11.a.Discuss in detail about Instruction performance and CPU performance of a computer                                                                                                                                   (CO1)

Or

11.b What are the various logical operations and explain the instructions supporting the logical operations.                                                                                                          (CO1)

12.a.Explain the floating point addition and subtraction                                          (CO2)(7+6)

Or

12.b. Give the block diagram for a adder and revised  and discuss its operation. (CO2)

13. a. Explain the data path and control consideration of a pipeline organization and explain                                                                                                                 (CO3)

Or

13.b. What is instruction hazards? Explain in detail how to handle the instruction hazards in pipelining with relevant examples                                                                           (CO3)(4+9)

14.a. Explain challenges in parallel processing                                                        (CO4)

Or

14.b. Explain in detail about Hardware multithreading                                            (CO4)

15.a. Discuss DMA controller with block diagram                                 (CO5)

Or

15.b. Explain the need for cache memory and discuss the different types of mapping functions with necessary block diagram                                                                             (CO5) (5+8)

Part C                                                                                     1 x 15=15

16. Explain details about the Instruction architecture used in graphical system(CO3)

Or

16. Explain details about the Intel core Processor and its architecture.(CO4)