0% found this document useful (0 votes)
273 views

M. Tech. Semester - I: Advanced Computer Architecture (MCSCS102IBMCSCS 902)

This document contains instructions for an end-term examination for a distributed computing course. It lists 7 questions related to topics in distributed computing, each with 2 sub-parts. Students must attempt any 5 questions out of the 7 listed. The questions cover topics such as distributed system models, distributed algorithms, applications of distributed computing, and concepts like consensus, leader election, and fault tolerance.

Uploaded by

saurabh1116
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
273 views

M. Tech. Semester - I: Advanced Computer Architecture (MCSCS102IBMCSCS 902)

This document contains instructions for an end-term examination for a distributed computing course. It lists 7 questions related to topics in distributed computing, each with 2 sub-parts. Students must attempt any 5 questions out of the 7 listed. The questions cover topics such as distributed system models, distributed algorithms, applications of distributed computing, and concepts like consensus, leader election, and fault tolerance.

Uploaded by

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

Roll No. ………………..

M. Tech. Semester – I
End-Term Examination, January 2015
Advanced Computer Architecture
(MCSCS102IBMCSCS 902)
Time: Three Hours
Max. Marks: 100
Note: Attempt any five questions. All questions carry equal
marks.

1. (a) Classify various categories of parallel computers and


write characteristics of each.
(b) Differentiate between control flow and data flow
approaches of parallelism with example.
2. (a) Briefly Compare CISC, RISC and VLIW.
(b) Describe the architecture of a typical superscalar
VLIW processor with the help of a block diagram.
3. (a) What is multithreaded architecture and what are the
advantages of multithreaded architecture.
(b) Discuss the synchronization techniques used in
multiprocessor systems.
4. (a) Explain the basic architecture of a symmetric
multiprocessor system with the help of a block
diagram.
(b) Describe the term coarse-grained and fine-grained
multithreading.
5. (a) What is pipelining? Explain instruction pipeline
design.
(b) Describe the design of various arithmetic pipeline.
6. (a) Discuss about the major challenges and issues in the
design of multi-core architecture.
(b) Explain the compiler optimizations to reduce miss rate.
7. (a) Explain Enterprise RAS feature sets.
(b) Explain snooping with respect to cache coherence
protocols.
8. Write short notes on
(a) Alpha 364 and HT protocol
(b) Memory based directory protocols
Roll No. ………………..

M. Tech. Semester – I
End-Term Examination, January 2015
Data Mining and Data Warehousing
(MCSCS104/IBMCSCS 904)
Time: Three Hours
Max. Marks: 100
Note: Attempt any five questions. All questions carry equal
marks.

1. (a) Discuss the importance of data mining.

(b) Enumerate the applications of data mining.

2 (a) Write the process of data pre processing.

(b) What is discretization and concept hierarchy


generation?

3. (a) What is OLAP? How is it different from OLTP?

(b) Explain multi-dimensional data model.

4. (a) How can you implement data warehouse?

(b) Differentiate between data mining and data


warehousing.

5. (a) With the help of suitable examples explain apriori


algorithm.
(b) Differentiate between multilevel and multidimensional
association rules.

6. (a) Discuss ID3 algorithm in detail.

(b) What is back propagation? How can it be used for


classifications?

7. (a) With the help of example explain K-means of


clustering algorithm.

(b) Describe the process of clustering using portioning.

8. Write short notes on:

(a) Data mining primitives

(b) Characterization and comparision

(c) Analytical Charaterization

(d) Mining class comparision


Roll No. ………………..

M. Tech. Semester – I
End-Term Examination, January 2015
Advanced Communication Networks
(MCSCS103/IBMCSCS 903)
Time: Three Hours
Max. Marks: 100
Note: Attempt any five questions. All questions carry equal
marks.

1 (a) What are reasons for using layered protocols? Compare


OSI and TCP/IP Model.
(b) What are the design issues in data link layer? Explain.
2 (a) Explain why the protocol field used in the IPv 4 header is
not present in the fixed IPv6 header?
(b) Contrast and compare distance vector routing with link
state routing.
(c) Explain different types of addressing in IPv 6.
3 (a) Show the FSM for an imaginary machine with three states:
state A (starting state), state B, and state C, and four
events: events 1, 2, 3 and 4. The following specify the
behaviour of the machine.
(i) When in state A, two events may occur: event 1 and
event 2. If event 1 occurs, the machine performs
action 1 and moves to state B. If event 2 occurs, the
machine moves to state C (no action).
(ii) When in state B, two events may occur: event 3 and
event 4. If event 3 occurs, the machine performs
action 2, but remains in state B. If event 4 occurs, the
machine just moves to state C.
(iii) When in state C, the machine remains in this state
forever.
(b) Write the difference between TCP and UDP.
4 (a) Differentiate between static web pages and dynamic web
pages.
(b) What are firewalls? Explain packet filter and proxy
firewall.
5 (a) Compare and contrast PGP and S/MIME? What are
advantages and disadvantages each?
(b) Explain RIP protocol in detail.
6 (a) Explain the token passing technologies used in FDDI.
How are new tokens generated on an FDDI network?
What advantages does this method have when adding and
deleting stations to/from the network of when error
occurs?
(b) Differentiate between congestion control and flow control.
7 (a) Draw the message format of DNS protocol and explain its
fields.
(b) What are services provided by the transport layer? Explain
with the help of neat diagram the three way handshaking
process for the connection establishment done by the TCP
prior to send the data over transmission channel.
8 Write short notes on:
(a) Quantum Cryptography
(b) IP over ATM
Roll No. ………………..

M. Tech. Semester – I
End-Term Examination, January 2015
Distributed Operating System
(MCSCS 105/IBMCSCS 905)
Time: Three Hours
Max. Marks: 100
Note: Attempt any five questions. All questions carry equal
marks.

1 (a) What are the main differences between a network


operating system and a distributed operating system?
(b) Discuss the main guiding principles that a distributed
operating system designer must keep in mind for the good
performance of his or her system.
2 (a) Draw diagram showing the architecture of the OSI model.
Briefly describe the functions of each layer of this
architecture.
(b) Is it always necessary for the sender of a message to know
that the message arrived safely at its destination? If yes,
explain why. If no, give two examples in support of your
answer.
3 (a) What are the main similarities and differences between the
RPC model and the ordinary procedure call model?
(b) Why do most RPC systems support call by value
semantics for parameter passing?
4 (a) What are the three main approaches for designing a DM
system?
(b) What is file sharing? When is it likely to occur? Can this
problem lead to any other problem in a DSM system? Give
reasons for your answer.
5 (a) What is a ‘deadlock’? What are the four necessary
conditions for a deadlock to occur? Give suitable examples
to prove that if any one of the four conditions is absent, no
deadlock is possible.
(b) Write the preudocode of an algorithm that determines
whether an given resource allocation graph contains a
deadlock.
6 (a) List the main differences and similarities between threads
and process.
(b) What are some of the main issues involved in designing a
process migration facility for a heterogeneous distributed
system?
7 (a) What are the main issues in handling signals in a
multithreaded environment? Describe a method for
handling each of these issues.
(b) What is file sharing? Discuss the importance of granularity
of locks in combating the false sharing problem.
8 (a) Name the main components of a distributed file system.
What might be the reasons for separating the various
functions of distributed file system into these components?
(b) In the design of a distributed file system, high performance
and high reliability are conflicting properties. Discuss.
Roll No. ………………..

M. Tech. Semester – I
End-Term Examination, January 2015
Distributed Computing
(MCSCS101/IBMCSCS 901)
Time: Three Hours
Max. Marks: 100
Note: Attempt any five questions. All questions carry equal
marks.

1. Compare following –

(a) Synchronous Distributed Computing and


Asynchronous Distributed System

(b) Point to Point Communication and Broad Cast


Communication

(c) Stopping Failure of process and Byzantine Failure of


Process

(d) Distributed Computing, Grid Computing

2 Write Short notes on following –

(a) High Performance Computing (HPC)

(b) Distributed Computing Environment (DCE)

(c) CORBA (d) PVM


3 (a) Write Algorithm for Fault Tolerant Clock
Synchronization.

(b) Write an algorithm for Fault Tolerate Consensus in


distributed System.

4 (a) Explain various applications of Consensus and Leader


Election.

(b) Describe message ordering in distributed Computing


System.

5 Explain Following with reference to distributed System-

(a) Wait for simulation of arbitrary Object

(b) Stable Storage

(c) Adaptability in Mobile Computing

(d) Parallel Programming Environment

6 Comment on following-

(a) Client Server Model (b) Network Naming

(c) Causality and Time (d) Idempotency

7 (a) Explain Architecture models for distributed system and


mobile system.

(b) Compare Stateless and Stateful Servers


8 (a) Distinguish between the following -

(i) Distributed Operating System and Network


Operating System

(ii) Parallel Processing and Distributed Processing

(b) Write Short note on simulation and Remote Method


Invocation.

You might also like