Trending ▼   ResFinder  

1997 Course Computer Architecture

3 pages, 31 questions, 0 questions with responses, 0 total responses,    0    0
pune_eng
  
+Fave Message
 Home > pune_eng >

Instantly get Model Answers to questions on this ResPaper. Try now!
NEW ResPaper Exclusive!

Formatting page ...

Total No. of Questions : 10] P1453 [Total No. of Pages : 3 [3764]-1024 B.E. (E & TC) COMPUTER ARCHITECTURE (1997 Course) Time : 3 Hours] [Max. Marks :100 Instructions to the candidates : 1) Answer any 3 questions from each section. 2) Answer 3 questions from Section I and 3 questions from Section II. 3) Attempt not more than six questions of which at least 3 questions must be from each section. 4) Answers to the two sections should be written in separate books. 5) Neat diagrams must be drawn wherever necessary. 6) Your are advised to attempt not more than six questions. 7) Your answers will be valued as a whole. 8) Assume suitable data, if necessary. SECTION - I Q1) a) State computer architectural classification schemes, and explain Flynn s classification in brief. [8] b) State and explain the trends of sophistication being used in computers from application point of view. [8] Q2) a) Define Parallel Processing . State and explain four programmatic levels in which parallel processing can be challenged. [8] b) Explain Memories in a hierarchy can be classified on the basis of several attributes. [8] Q3) a) Justify that virtual memory gives programmers the illusion that there is a very large memory at their disposal, irrespective of the small actual (Physical) memory available. [8] b) State and explain classification scheme for pipeline processors, according to the levels of processing. [8] P.T.O. Q4) a) With proper block diagram explain in brief any one of cache organizations. [8] b) Describe the following terminologies associated with pipeline computers. i) Unifunctional pipeline. ii) Instruction pipeline. iii) Pipeline efficiency. iv) Pipeline throughput. [8] Q5) a) Compare the advantages and disadvantages of the three interleaved memory organizations. S-access, C-access and C/S - access. [10] b) With the help of block diagram explain the characteristics of I/O subsystem in dual processor system. [8] SECTION - II Q6) a) b) What are Array Processors ? Explain SIMD computer organizations.[8] Consider an array of n n data elements; A = {A(i, j), 0 i, j n 1}; then show how indexing can be used to address the local memories. Q7) a) [8] Explain the following terminologies associated with SIMD computers. i) Masking of processing elements. ii) Barrel-shifting functions. iii) Associative Memory. iv) Recirculating Networks. [8] b) Explain with proper block diagram the communication between processes in a multiprocessor environment. [8] Q8) a) Compare loosely coupled multiprocessors with tightly coupled multiprocessors. [8] b) Classify multiprocessor operating systems. Explain in brief the Masterslave operating system. [8] [3764]-1024 2 Q9) a) Classify the various types of Parallel Algorithms, and explain in brief Synchronized Algorithms. [8] b) Describe the following terms associated with data flow computers. [8] i) Data-driven computation. ii) Control flow computers. iii) Static data flow computers. iv) Dynamic data flow computers. Q10)Write short notes on (Any three): [18] a) VLSI Algorithmic Processors. b) Space-time diagram for pipelined and Non pipelined processors. c) Parallel Memory Allocation. d) Cube-routing functions in SIMD computers. Y [3764]-1024 3

Formatting page ...

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 


Tags : Pune, Engineering, University of Pune, Engineering question papers, Pune University, previous year question papers, question papers, india, model question paper, pune university paper pattern, pune university syllabus, old question papers  

© 2010 - 2025 ResPaper. Terms of ServiceContact Us Advertise with us

 

pune_eng chat