Scribd
Upload
0 views

Quiz 01 PDC Solution

This document outlines the details for Quiz#01 for the course 'Parallel and Distributed Computing' at COMSATS University Islamabad, Lahore Campus. It includes questions on basic concepts, taxonomy levels, computational granularity, design goals, speculative parallelism, code dependencies, and code optimization techniques. The quiz is designed for BCS students and has a total of 15 marks with a time allowance of 30 minutes.

Uploaded by

abma959595
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0 views

Quiz 01 PDC Solution

This document outlines the details for Quiz#01 for the course 'Parallel and Distributed Computing' at COMSATS University Islamabad, Lahore Campus. It includes questions on basic concepts, taxonomy levels, computational granularity, design goals, speculative parallelism, code dependencies, and code optimization techniques. The quiz is designed for BCS students and has a total of 15 marks with a time allowance of 30 minutes.

Uploaded by

abma959595
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

COMSATS UNIVERSITY ISLAMABAD

Lahore Campus
Department of Computer Science

■ Quiz#01
Credit
Course Title: Parallel and Distributed Computing Course Code: CSC334 3(2,1)
Hours:
Course Instructor: Muntha Amjad Program Name: BCS
Semester: Batch: Section: Repeaters Date: 4-3-2025
Time Allowed: 30 minutes Maximum Marks: 15
Student’s Name: Reg. No.

Question#01: CLO: <1> Explain the basic concepts of parallel and


distributed computing.; Bloom Taxonomy Level: <Understanding>

(A) Under which taxonomy level do the following examples fall? (2 marks)

MISD SIMD

(B) What do you know about computational granularity? (2 marks)


(C) Give any three design goals of Parallel and Distributed Computing?
(3 marks)

(D) How speculative parallelism works? (2 marks)

(E) Illustrate the given code dependencies in a visual format. (3 marks)

For counter = 1 to n
S1  str = arr1[counter] + 1
S2  arr2 = str + 2
(F) Optimize the following code using Index set splitting technique: (3 marks)

You might also like