I) The Question paper contains 40 multiple choice questions with four choices and student will have

Similar documents
Performance of Computer Systems. CSE 586 Computer Architecture. Review. ISA s (RISC, CISC, EPIC) Basic Pipeline Model.

DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING QUESTION BANK

Advanced Parallel Architecture. Annalisa Massini /2017

Multiprocessors and Thread-Level Parallelism. Department of Electrical & Electronics Engineering, Amrita School of Engineering

COURSE DESCRIPTION. CS 232 Course Title Computer Organization. Course Coordinators

Lecture 2 Parallel Programming Platforms

Main Points of the Computer Organization and System Software Module

Honorary Professor Supercomputer Education and Research Centre Indian Institute of Science, Bangalore

QUESTION BANK UNIT-I. 4. With a neat diagram explain Von Neumann computer architecture

Non-Uniform Memory Access (NUMA) Architecture and Multicomputers

101. The memory blocks are mapped on to the cache with the help of a) Hash functions b) Vectors c) Mapping functions d) None of the mentioned

Types of Parallel Computers

Non-Uniform Memory Access (NUMA) Architecture and Multicomputers

Computer and Information Sciences College / Computer Science Department CS 207 D. Computer Architecture. Lecture 9: Multiprocessors

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIT-1

Non-Uniform Memory Access (NUMA) Architecture and Multicomputers

Chapter 9 Multiprocessors

4. Hardware Platform: Real-Time Requirements

Parallel Computing: Parallel Architectures Jin, Hai

Computer and Information Sciences College / Computer Science Department CS 207 D. Computer Architecture. Lecture 9: Multiprocessors

CS 770G - Parallel Algorithms in Scientific Computing Parallel Architectures. May 7, 2001 Lecture 2

Physical Organization of Parallel Platforms. Alexandre David

Parallel Architectures

Computer Systems Architecture

Parallel Processing. Computer Architecture. Computer Architecture. Outline. Multiple Processor Organization

3. Which of the following is volatile? [ ] A) Bubble memory B) RAM C) ROM D) Magneticdisk

Chapter Seven Morgan Kaufmann Publishers

Pipelining and Vector Processing

Keywords and Review Questions

Academic Course Description. EM2101 Computer Architecture

Fundamentals of. Parallel Computing. Sanjay Razdan. Alpha Science International Ltd. Oxford, U.K.

ECE 3055: Final Exam

Computer Systems Architecture

MaanavaN.Com CS1202 COMPUTER ARCHITECHTURE

An Overview of MIPS Multi-Threading. White Paper

ECE 30 Introduction to Computer Engineering

1. Draw general diagram of computer showing different logical components (3)

Computer Architecture

Parallel Architectures

Parallel Processing SIMD, Vector and GPU s cont.

SMP and ccnuma Multiprocessor Systems. Sharing of Resources in Parallel and Distributed Computing Systems

CS425 Computer Systems Architecture

Outline. Distributed Shared Memory. Shared Memory. ECE574 Cluster Computing. Dichotomy of Parallel Computing Platforms (Continued)

CS2253 COMPUTER ORGANIZATION AND ARCHITECTURE 1 KINGS COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY

EE/CSCI 451: Parallel and Distributed Computation

Serial. Parallel. CIT 668: System Architecture 2/14/2011. Topics. Serial and Parallel Computation. Parallel Computing

PIPELINE AND VECTOR PROCESSING

Interconnect Technology and Computational Speed

WHY PARALLEL PROCESSING? (CE-401)

Model Questions and Answers on

Pipeline and Vector Processing 1. Parallel Processing SISD SIMD MISD & MIMD

This chapter provides the background knowledge about Multistage. multistage interconnection networks are explained. The need, objectives, research

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE) UNIT-I

CMSC 313 Lecture 27. System Performance CPU Performance Disk Performance. Announcement: Don t use oscillator in DigSim3

INTELLIGENCE PLUS CHARACTER - THAT IS THE GOAL OF TRUE EDUCATION UNIT-I

Data-Centric Consistency Models. The general organization of a logical data store, physically distributed and replicated across multiple processes.

4. Networks. in parallel computers. Advances in Computer Architecture

High Performance Computing

Multiprocessors & Thread Level Parallelism

2 MARKS Q&A 1 KNREDDY UNIT-I

Handout 3 Multiprocessor and thread level parallelism

Parallel Architectures

ASSEMBLY LANGUAGE MACHINE ORGANIZATION

4.1 Introduction 4.3 Datapath 4.4 Control 4.5 Pipeline overview 4.6 Pipeline control * 4.7 Data hazard & forwarding * 4.

Interconnection Networks. Issues for Networks

INTEL Architectures GOPALAKRISHNAN IYER FALL 2009 ELEC : Computer Architecture and Design

Lecture: Interconnection Networks

Interconnection Network. Jinkyu Jeong Computer Systems Laboratory Sungkyunkwan University

The Nios II Family of Configurable Soft-core Processors

Scalability and Classifications

Hardware-Based Speculation

Parallel Architecture. Sathish Vadhiyar

Structure of Computer Systems

Embedded Systems. 7. System Components

PowerPC 740 and 750

S = 32 2 d kb (1) L = 32 2 D B (2) A = 2 2 m mod 4 (3) W = 16 2 y mod 4 b (4)

CS575 Parallel Processing

Intel released new technology call P6P

Motivation for Parallelism. Motivation for Parallelism. ILP Example: Loop Unrolling. Types of Parallelism

Computer Organization and Microprocessors SYLLABUS CHAPTER - 1 : BASIC STRUCTURE OF COMPUTERS CHAPTER - 3 : THE MEMORY SYSTEM

Lecture 12: Interconnection Networks. Topics: communication latency, centralized and decentralized switches, routing, deadlocks (Appendix E)

CS 654 Computer Architecture Summary. Peter Kemper

CS Parallel Algorithms in Scientific Computing

Computer and Hardware Architecture I. Benny Thörnberg Associate Professor in Electronics

CS6303-COMPUTER ARCHITECTURE UNIT I OVERVIEW AND INSTRUCTIONS PART A

Dr e v prasad Dt

Interconnecting Components

UNIT I BASIC STRUCTURE OF COMPUTERS Part A( 2Marks) 1. What is meant by the stored program concept? 2. What are the basic functional units of a

Interconnection Network

A MULTIPROCESSOR SYSTEM. Mariam A. Salih

TDT Coarse-Grained Multithreading. Review on ILP. Multi-threaded execution. Contents. Fine-Grained Multithreading

ECE 341 Final Exam Solution

HY225 Lecture 12: DRAM and Virtual Memory

SMD149 - Operating Systems - Multiprocessing

Overview. SMD149 - Operating Systems - Multiprocessing. Multiprocessing architecture. Introduction SISD. Flynn s taxonomy

CS6303 Computer Architecture Regulation 2013 BE-Computer Science and Engineering III semester 2 MARKS

PART A (22 Marks) 2. a) Briefly write about r's complement and (r-1)'s complement. [8] b) Explain any two ways of adding decimal numbers.

Introduction to Multiprocessors (Part I) Prof. Cristina Silvano Politecnico di Milano

Normal computer 1 CPU & 1 memory The problem of Von Neumann Bottleneck: Slow processing because the CPU faster than memory

SHARED MEMORY VS DISTRIBUTED MEMORY

Transcription:

Time: 3 Hrs. Model Paper I Examination-2016 BCA III Advanced Computer Architecture MM:50 I) The Question paper contains 40 multiple choice questions with four choices and student will have to pick the correct one (each carrying ½ mark). 1....is a technique of decomposing a sequential process into sub operations. (a) Pipelining (b) Parallel Processing (c) Vector Processing ( ) 2. Personal computer were appeared in: (a) Ist generation (c) 4th generation (b) 2nd generation (d) 5th generation 3. A...contains the address of the next instructions to be executed. (a) Data Register (b) Accumulator (c) Instruction Register (d) Program Counter 4. A...is an interconnected set of processing elements which cooperate by communicating with one another to solve large problem (a) Parallel Computer (b) Personal Computer (c) Laptop Computer 5. MIPS stands for: (a) Memory Instruction Per Second (c) Main Information Per Second (b) Major Instruction Per Second (d) Million Instruction Per Second 6. A...can be be visualized as a collection of processing segments through which binary information flows: (a) Memory (b) I/O devices (c) Processor (d) Pipeline 7. A typical system bus consists of approximately...signals lines (a) 100 (b) 2 (c) 3 8. M.J. Flynn's parallel processing classification is based on:

(a) Multiple Instructions (b) Multiple data 9. The channel width of a...network increases as we ascend from leaves to the root. (a) Binary fat tree (b) Star (c) Ring (d) Binary tree 10. TLB is used in: (a) Paging 11. VLIW stands for: (a) Vector Large Instruction Word (c) Very Large Integrated Word (b) Segmentation (b) Very Long Instruction Word (d) Very Low Integrated Word 12. The major disadvantage of pipeline is: (a) High cost individual dedicated (b) Initial setup time (c) If branch instruction is encountered the pipe has to be flushed 13. Which of the example of blocking network? (a) Baseline (c) Omega 14. Data routing functions include: (a) Shifting and rotation (c) Shuffle and Exchange (b) Delta (b) Permutation 15. Throughput is measure of: (a) Number of instruction set executed per unit of time (b) Time for the completion of the task (c) Work done by the CPU (d) Memory Speed 16. In a UMA multiprocessor model all processor have...access time to all memory words: (a) Asynchronous (b) Equal (c) Different 17. Cache memory is: (a) Temporary and costly (c) High speed memory 18. What does RISC stand for? (a) Register Instruction Set Counter (c) Reduced Instruction Set Counter (b) Primary (b) Reduced Instruction Set Computer (d) Register Instruction Set Computer 19. A computer system consists of a CPU, a memory and one or more specialized I/O processor called: (a) Bandwidth (b) Data Channels (c) Interrupt

20. Which of not an address mapping scheme: (a) Associate Mapping (c) Direct Associate Mapping 21. Example of zero address instruction is: (a) ADD B (c) ADD R1, B 22. The speed of microcomputer measure in: (a) MIPS (c) Megahertz 23. Memory interleaving is: (a) Modular memory (c) Shared memory 24. Virtual memory is: (a) A part of main memory (c) Part of cache memory (b) Direct Mapping (d) Set Associate Mapping (b) ADD (d) ADD R1, A, B (b) Picoseconds (d) Milihertz (b) Virtual memory (d) Cache memory (b) Shared memory (d) A mechanism to process fast 25. Which mode transits data in both directions, but not at the same time: (a) Simplex mode (b) Half duplex mode (c) Full duplex (d) None 26. Two or more CPU's present in a computer system which share some or all of the memory called: (a) Paralleled (b) Multiprogramming (c) Multi tasking (d) Random File processing 27. Which is not valid architecture of a vector super computer? (a) Register to register (b) Memory to memory (c) Both a and b are invalid 28. The total number of messages the network can handle is: (a) Network efficiency (b) Network throughput (c) Network output 29. Instruction issue latency is: (a) Clock period of instruction pipeline (b) Time required between issuing of two adjacent instruction (c) No. of instructions issued per cycle (d) No. of cycles required by an instruction 30. For pattern recognition, which processor is used (a) Vector (b) VLIW (b) Symbolic (d) Superscalar 31. The relationship between access frequencies among different level of memory is: (a) f1>>f2>>f3.>>fn (b) f1<<f2<<f3.<<fn (c) f1=f2=f3..=fn

32. Which network suffers from bottleneck problem: (a) Mesh (b) Binary tree (c) Systolic Array (d) Hypercube 33. Which computation corresponds to Lazy evaluation: (a) Control Flow (b) Data Flow (c) Demand Driven 34. In which model, each demander gets a separate copy of the expression for its evaluation: (a) String-Reduction Model (b)graph Reduction Model 35. Multiprocessor is one with: (a) One CPU executing several processor (c) One CPU and several channels (b) Several CPU 36....Networking is controlled by a global clock. (a) Asynchronous (b) Synchronous 37. To find out cache performance we can use: (a) Program trace driven simulation (c) Greedy cycles (b) Hit ration (d) Cycle Count 38. An/a...is a request from I/O or other devices to a processor for services or attention: (a) Transaction (b) Arbitration (c) Interrupt 39. Router is a : (a) Data Transfer protocol (c) Modem 40. LRU stands for: (a) Last recently used (c) Last Rarely Used (b) Networking device (b) Least Recently used (d) Least Rarely Used II) Attempt any four questions out of the six. All questions carry 7½ marks each. Q1. What do you understand by shared memory multiprocessor and distributed memory multi computers? Explain different models of shared memory multiprocessor. Q2. Differentiate between static and dynamic networks. Explain any five types of static connection network. Q3. What do you understand with virtual memory? Describe the page replacement techniques in virtual memory. Q4. Explain instruction set architecture in RISC and CISC processor. Q5. Explain the following terms associated with program partitioning and scheduling: a) Grain sizes and latency b) Grain packing and scheduling

Q6. What do you mean by vector processing? Explain different types of vector instructions with example.