Time allowed : 3 hours Maximum Marks: 70

Size: px
Start display at page:

Download "Time allowed : 3 hours Maximum Marks: 70"

Transcription

1 SAMPLE PAPER-2015 CLASS-XII COMPUTER SCIENCE(C++) Time allowed : 3 hous Maximum Maks: 70 Geneal Instuction 1. Please check that this question pape contains 7 questions. 2. Please wite down seial numbe of the question befoe answeing it. 3. All questions ae compulsoy. 4. Pogamming language : C++ Q1.(a) What is the diffeence between Class and Object? Give an example in c++ to illustate both. (2 (b) Name the heade files, to which the following built-in functions belong to: (1 (i) getc ( ) (ii) exit() (c) Identify and coect the eo(s) in the following pogam: (2 #include <iosteam.h> #include <conio.h> void main() float class = 10.7; float y; y = class % 5.45; cout<<class <<", "<<y; getch(); (d) Give the output of the following Pogam: (2 #include<iosteam.h CONST int CONST int a = 3; void func (int &x, int y, int *z) cout<< CONST << endl; void main( ) a + = x; y * = a; *z = a + y; cout<<a<<, <<x<<, <<y<<, <<z<<endl; int a = 2, b=5; func(::a,a,&b); cout<<::a<<, <<a<<, <<b;

2 (e) Give the output of the following Pogam: (3 #include<iosteam.h> void withdef ( int HisNum = 30) fo ( int I = 20 ; I<= HisNum; I+= 5) cout<<i<<, ; cout<<endl; void Contol( int &MyNum ) MyNum + = 10; withdef(mynum); void main( ) int YouNum = 20; Contol(YouNum ); withdef( ); cout<< Numbe= <<YouNum<<endl; (f) Study the following pogam and select the possible output fom it : (2 #inlude<iosteam.h> #include<conio.h> #include<stdlib.h> const int LIMIT = 5; void main( ) andomize( ); int Points; Points = andom(limit); fo ( int p = Points; p>=100; p--) cout<<p<< # ; cout<<endl; (i) 104#103#102#101#100# (ii) 104#103#102#101#100 (iii) 101#102#103#104#105#

3 (iv) 014#103#102#101#100# Q.2 (a) What do you undestand by Copy Constucto? Explain it with a suitable example. (2 (b) Answe the questions (i) and (ii) afte going though the following class: (2 class Dance int days; Dance ( ) // Function 1 days = 50; cout << Dance stats now << endl; void danceschedule( ) // Function 2 cout << The schedule of the dance stats hee << endl; Dance (int Duation) // Function 3 days = Duation; cout << Dance jouney stats now << endl; ~ Dance ( ) // Function 4 cout << Dance, life cycle ends hee << endl; ; (i) In Object Oiented Pogamming, what is Function 4 efeed as and when does it get invoked/ called? (ii) In Object Oiented Pogamming, which concept is illustated by Function 1 and Function 3 togethe? Wite an example illustating the calls fo these functions. (c) Define a class Mobile in C++ with the following desciptions : (4 Pivate membes : mcode of type sting mtype of type sting mosname of type sting msceensize of type intege mppvalue of type float mdiscount of type float mactsalepice of type float

4 A function AdjustPice ( ) which calculates and assigns the value of mactsalepice as follows : mosname mactsalepice Andoid mppvalue-10% on mpvalue ios mppvalue-9 % on mpvalue Othes mppvalue-15 % on mpvalue Public membes: A constucto to assign initial values of mcode with MCODE01, mtype with Tablet, mosname with Andoid, mssceensiz, mppvalue, mdiscount and mactsalepice with 0. A function GetData( ) to input the values of the data all membes vaiables. and invoke the AdjustPice( ) function. A destucto to pint object is being destoyed. A function to Display( ) which displays the content of all the data membes fo a Mobile. (d) Answe the questions (i) to (iv) based on the following code: (4 class Ca cha Model[10]; cha Date_of_puchase[10]; cha Company[20]; public( ); Ca( ); void entecadetail( ); void showcadetail( ); ; class Accessoies : public Ca potected: cha steeo_tape[30]; cha sheet_cove[20];

5 float Pice; Accessoies( ); void enteaccessoiesdetails( ); void showaccessoiesdetails( ); ; class Deale : public ca int No_of_deales; cha deales_name[20]; int No_of_poducts; Deale( ); void entedetails( ); void showdetails( ); ; (i) (a) How many bytes will be equied by an object of class Ca and an object of class Deale? (b) Which type of inheitance is illustated in the above c++ code? (ii) (iii) (iv) Wite names of all the data membes which ae accessible fom the objects of class Deale. Wite names of all the membes accessible fom membe functions of class Accessoies. Wite names of all the membe functions which ae accessible fom objects of class Deale. Q.3 (a) Wite the function AddAay() in C++ to club the values( ascending ode) of two aays. (3 (b) Wite enumeation in C++ to stoe the names of days. (3 (c) Define functions pushnode( ) to inset nodes and popnode( ) to delete nodes, fo a Linked List implemented Stack having the following stuctue fo each node: (4 stuct node cha student[20];

6 int age; node *node; ; (d) What ae the diffeence between Linked List And Dense List? (2 (e) Wite a use defined function Uppe_half() which takes a two dimensional aay A, with size N ows and N columns as aguments and point the uppe half(diagonally) of the aay. eg. ( If A is The Output Will be Q4. a) Obseve the pogam segment given below caefully and answe the question that follows: 1 class Student long ollnumbe; cha student[20]; float maks; void GetData( ); void ShowData( ); void PointChange( ); long getrollnumbe( ) etun ollnumbe; ; void ReplaceUpdateMaks(long Id) fsteam file; file.open ( Team.Dat,ios::binay ios::in ios::out); Student T; int Recod=0, found=0; while(!found && file.ead((cha*)&t, sizeof(t))) if (Id==T.getRollNumbe( ))

7 cout<< Ente New Maks ; T.PointChange (); //Statement 1 // Statement 2 Found=1; Recod++; if(found==1) cout<< Recod Updated ; file.close( ); Wite the statement 1 to position the File Pointe at the beginning of the Recod fo which the Student's Roll Numbe matches with the agument passed, and Statement 2 to wite the updated ecod at the Position. (b) Wite a function in C++ to pint the count of the wod Technology and India (ignoing the case) as an independent wod in a text file education.txt. If the file education.txt content is as follows: Technology bings innovation in education. Misuse of technology destoys the system. Indian education is becoming tech-savvy. (c) Wite a function in C++ to seach and display details, whose destination is Chandigagh fom a binay file Flight.Data. Assuming the binay file is containing the objects of the following class: class FLIGHT int Fno; // Flight Numbe ; cha Fom[20]; // Flight Stating Point cha To[20]; // Flight Destination cha * GetFom ( ); etun fom; cha * GetTo( ); etun To; void input() cin>>fno>>; gets(fom); get(to); void show( ) cout<<fno<< : <<Fom << : <<To<<endl; Q 5. (a) Diffeentiate between Pimay key and Foeign Key in context of RDBMS. Give suitable example. (2 (2 (3

8 (b) Wite SQL commands fo the statements (a) to (i) and give outputs of the SQL Queies (i) to (vi) on the basis of CUSTOMER_DETAILS (1*6=6 Table: CUSTOMER_DETAILS CUST_ID CUT_NAME ACCT_TYPE ACCULT_AMT DOJ GENDER CNR_101 Manoj Saving M CNR_102 Rahul Cuent M CNR_103 John Saving M CNR_104 Steve Salay Saving M CNR_105 Manpeet Cuent F CNR_106 Catheine Saving F CNR_107 Ramesh Saving M i. To select all the custome of Saving and Cuent account type. ii. To list the names of custome with thei date of joining in descending ode. iii. To list the customes who have joined afte 1998 May 31. iv. To display female customes with accumulated amount geate than v. To list the custome having 15 lettes name. vi. To list the all account types. Q6. (a) State and veify Distibutive Law and Demogan s Law using tuth table and algebaically. (2 (b) Wite the equivalent Boolean Expession fo the following Logic Cicuit (1 (c) Wite the equivalent POS expession of following SOP fom : (1 F (x,y,z)= (0,2,4,6) (d) Reduce the following Boolean Expession using K-Map: (3 F(U,V,W,Z)= (0,1,4,5,6,7,11,12,13,14,15) (e) Give the dual of (A+BC+AB) (1 Q.7 (a) What is the diffeence between Hub and message Route? (1 (b) Diffeentiate the following : (1 (i) (ii) GSM and CDMA FOSS and OSS. (c) What is Vius? Give two examples. (1 (d) Define and explain Cybe Law. (1

9 (e) The Sony has set up its Banch at Sinaga fo its office and web based activities. It has 4 Zone of buildings as shown in the diagam: Zone Z Zone Y Zone X Zone U Banch to banch distances ae : Zone X to Zone Z 40 Mt Zone Z to Zone Y 60 Mt Zone Y to Zone X 135 Mt Zone Y to Zone U 70 Mt Zone X to Zone U 165 Mt Zone Z to Zone U 80 Mt Numbe of Computes: Zone X 50 Zone Z 130 Zone Y 40 Zone U 15 (e1) (e2) Suggest a most suitable cable layout o Netwoking Toplogy of connections between the Zones. (1 Suggest the most suitable place (i.e., Zone) to house the ERP and BI Seve of this oganization with a suitable eason, with justification. (1 (e3) Suggest the placement of the following devices with justifications: (1 (1) Repeate (2) Hub / Switch (e4) Which is the most economic type of cable fo the selected topology? (1 (f) Diffeentiate the following pais: (2 1. Intenet and ARPANET. 2. Coaxial Wie and Optical Fibe. Ceated by Amit Chheti fo CBSE-CPP XII 2013; Copyight(C): Amit Chheti,2013

SAMPLE PAPER-2015 CLASS-XII COMPUTER SCIENCE. Sample paper-i. Time allowed: 3 hours Maximum Marks: 70 Name : Roll No.:

SAMPLE PAPER-2015 CLASS-XII COMPUTER SCIENCE. Sample paper-i. Time allowed: 3 hours Maximum Marks: 70 Name : Roll No.: SAMPLE PAPER-2015 CLASS-XII COMPUTER SCIENCE Sample paper-i Time allowed: 3 hours Maximum Marks: 70 Name : Roll No.: General Instruction 1. Please check that this question paper contains 7 questions. 2.

More information

Sample Paper, Subject: Computer Science Class 12 th Time Allowed : 3 Hr. M.M.: 70

Sample Paper, Subject: Computer Science Class 12 th Time Allowed : 3 Hr. M.M.: 70 Sample Paper, 2012-13 Subject: Computer Science Class 12 th Time Allowed : 3 Hr. M.M.: 70 General Instruction 1. Please check this question paper contains 10 printed pages. 2. Code number given on the

More information

Sample Paper 2012 Class XII Subject Computer Science

Sample Paper 2012 Class XII Subject Computer Science Sample Paper 2012 Class XII Subject Computer Science General Instruction CODE (083) 1. Please check this question paper contains 7 printed pages. 2. Code number given on the right side of question paper

More information

Any modern computer system will incorporate (at least) two levels of storage:

Any modern computer system will incorporate (at least) two levels of storage: 1 Any moden compute system will incopoate (at least) two levels of stoage: pimay stoage: andom access memoy (RAM) typical capacity 32MB to 1GB cost pe MB $3. typical access time 5ns to 6ns bust tansfe

More information

How many times is the loop executed? middle = (left+right)/2; if (value == arr[middle]) return true;

How many times is the loop executed? middle = (left+right)/2; if (value == arr[middle]) return true; This lectue Complexity o binay seach Answes to inomal execise Abstact data types Stacks ueues ADTs, Stacks, ueues 1 binayseach(int[] a, int value) { while (ight >= let) { { i (value < a[middle]) ight =

More information

Code No. 083 Time allowed: 3 hours Maximum Marks: 70 Instructions: (i) All questions are compulsory. (ii) Programming language: C++

Code No. 083 Time allowed: 3 hours Maximum Marks: 70 Instructions: (i) All questions are compulsory. (ii) Programming language: C++ Sample Paper Class XII Subject Computer Science Please check that this question paper contains 7 printed pages. Code number given on the right hand side of the question paper should be written on the title

More information

Reader & ReaderT Monad (11A) Young Won Lim 8/20/18

Reader & ReaderT Monad (11A) Young Won Lim 8/20/18 Copyight (c) 2016-2018 Young W. Lim. Pemission is ganted to copy, distibute and/o modify this document unde the tems of the GNU Fee Documentation License, Vesion 1.2 o any late vesion published by the

More information

(d) Rewrite the following program after removing all the syntax error(s), if any. [2] include <iostream.h> void main ( )

(d) Rewrite the following program after removing all the syntax error(s), if any. [2] include <iostream.h> void main ( ) Sample Paper 2012 Class XII Subject Computer Science Time: 3 Hrs. M.M. 70 General instructions: 1) All questions are compulsory. 2) Read all the questions carefully. 3) Programming language C++. Q.1(a)

More information

Sample Paper 2013 SUB: COMPUTER SCIENCE GRADE XII TIME: 3 Hrs Marks: 70

Sample Paper 2013 SUB: COMPUTER SCIENCE GRADE XII TIME: 3 Hrs Marks: 70 Sample Paper 2013 SUB: COMPUTER SCIENCE GRADE XII TIME: 3 Hrs Marks: 70 INSTRUCTIONS: All the questions are compulsory. i. Presentation of answers should be neat and to the point. iii. Write down the serial

More information

Lecture #22 Pipelining II, Cache I

Lecture #22 Pipelining II, Cache I inst.eecs.bekeley.edu/~cs61c CS61C : Machine Stuctues Lectue #22 Pipelining II, Cache I Wiewold cicuits 2008-7-29 http://www.maa.og/editoial/mathgames/mathgames_05_24_04.html http://www.quinapalus.com/wi-index.html

More information

Query Language #1/3: Relational Algebra Pure, Procedural, and Set-oriented

Query Language #1/3: Relational Algebra Pure, Procedural, and Set-oriented Quey Language #1/3: Relational Algeba Pue, Pocedual, and Set-oiented To expess a quey, we use a set of opeations. Each opeation takes one o moe elations as input paamete (set-oiented). Since each opeation

More information

dc - Linux Command Dc may be invoked with the following command-line options: -V --version Print out the version of dc

dc - Linux Command Dc may be invoked with the following command-line options: -V --version Print out the version of dc - CentOS 5.2 - Linux Uses Guide - Linux Command SYNOPSIS [-V] [--vesion] [-h] [--help] [-e sciptexpession] [--expession=sciptexpession] [-f sciptfile] [--file=sciptfile] [file...] DESCRIPTION is a evese-polish

More information

SAMPLE PAPER. Class: XII SUBJECT COMPUTER SCIENCE. Time: 3 Hours MM: 70

SAMPLE PAPER. Class: XII SUBJECT COMPUTER SCIENCE. Time: 3 Hours MM: 70 SAMPLE PAPER Class - XII SUBJECT COMPUTER SCIENCE Subject: Computer Sc. Class: XII Time: 3 Hours MM: 70 1. (a) Differentiate between a global variable and a local variable. (b) Name the Header file(s)

More information

Downloaded from

Downloaded from QUARTERLY EXAMINATION, 2013 14 SUBJECT: COMPUTER SCIENCE TIME : 3 hrs CLASS : XII M.M.-70 Instructions: (1) All the questions are compulsory. (2) Programming Language C++ 1 (a) Illustrate the concept of

More information

The Java Virtual Machine. Compiler construction The structure of a frame. JVM stacks. Lecture 2

The Java Virtual Machine. Compiler construction The structure of a frame. JVM stacks. Lecture 2 Compile constuction 2009 Lectue 2 Code geneation 1: Geneating code The Java Vitual Machine Data types Pimitive types, including intege and floating-point types of vaious sizes and the boolean type. The

More information

UCB CS61C : Machine Structures

UCB CS61C : Machine Structures inst.eecs.bekeley.edu/~cs61c UCB CS61C : Machine Stuctues Lectue SOE Dan Gacia Lectue 28 CPU Design : Pipelining to Impove Pefomance 2010-04-05 Stanfod Reseaches have invented a monitoing technique called

More information

MapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma

MapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma apreduce Optimizations and Algoithms 2015 Pofesso Sasu Takoma www.cs.helsinki.fi Optimizations Reduce tasks cannot stat befoe the whole map phase is complete Thus single slow machine can slow down the

More information

Monitors. Lecture 6. A Typical Monitor State. wait(c) Signal and Continue. Signal and What Happens Next?

Monitors. Lecture 6. A Typical Monitor State. wait(c) Signal and Continue. Signal and What Happens Next? Monitos Lectue 6 Monitos Summay: Last time A combination of data abstaction and mutual exclusion Automatic mutex Pogammed conditional synchonisation Widely used in concuent pogamming languages and libaies

More information

This lecture. Abstract Data Types (ADTs) The Stack ADT ( 4.2) Stacks. Stack Interface in Java. Exceptions. Abstract data types Stacks Queues

This lecture. Abstract Data Types (ADTs) The Stack ADT ( 4.2) Stacks. Stack Interface in Java. Exceptions. Abstract data types Stacks Queues This lectue Abstact data types Stacks ueues Abstact Data Types (ADTs) An abstact data type (ADT) is an abstaction o a data stuctue An ADT speciies: Data stoed Opeations on the data Eo conditions associated

More information

void Add() { cin >> trainnumber; gets(trainname); } void display() { cout<<trainnumber <<":"<<TrainName<<end;

void Add() { cin >> trainnumber; gets(trainname); } void display() { cout<<trainnumber <<:<<TrainName<<end; . T SHREE MAHAPRABHU PUBLIC SCHOOL & COLLEGE QUESTION BANK FOR BOARD EXAMINATION 016-17 SUBJECT COMPUTER SCIENCE (Code: 083) Q1. Answer the following questions: a) Name the header file(s) that shall be

More information

PRINCE PUBLIC SCHOOL PRE-BOARD EXAMINATION ( ) SAMPLE PAPER-1 COMPUTER SCIENCE XII TIME ALLOWED: 3 HOURS

PRINCE PUBLIC SCHOOL PRE-BOARD EXAMINATION ( ) SAMPLE PAPER-1 COMPUTER SCIENCE XII TIME ALLOWED: 3 HOURS PRINCE PUBLIC SCHOOL PRE-BOARD EXAMINATION (2018-19) SAMPLE PAPER-1 COMPUTER SCIENCE XII TIME ALLOWED: 3 HOURS MAXIMUM MARKS: 70 General Instructions 1. This question paper contains 7 questions. 2. SECTION

More information

4.2. Co-terminal and Related Angles. Investigate

4.2. Co-terminal and Related Angles. Investigate .2 Co-teminal and Related Angles Tigonometic atios can be used to model quantities such as

More information

Compiler-based Implementation of. Katia Gladitz. Lehrstuhl fur Informatik II, RWTH Aachen. Ahornstrae 55, W{5100 Aachen, Germany

Compiler-based Implementation of. Katia Gladitz. Lehrstuhl fur Informatik II, RWTH Aachen. Ahornstrae 55, W{5100 Aachen, Germany Compile-based Implementation of Syntax-Diected Functional Pogamming Katia Gladitz ehstuhl fu Infomatik II, RWTH Aachen Ahonstae 55, W{5100 Aachen, Gemany Heinz Fabende and Heiko Vogle Abt. Theoetische

More information

Sample Paper 2012 Class XII Subject COMPUTER SCIENCE (Theory)

Sample Paper 2012 Class XII Subject COMPUTER SCIENCE (Theory) Sample Paper 2012 Class XII Subject COMPUTER SCIENCE (Theory) Time Allowed: 3hours Maximum Marks: 70 Note. (i) All questions are compulsory. (ii) Programming Language: C+ + Ques 1. (a)what is the difference

More information

Mock Test Paper-3. Computer Science. Duration : 3hrs Max Marks : 70

Mock Test Paper-3. Computer Science. Duration : 3hrs Max Marks : 70 Mock Test Paper-3 Computer Science Mock Test Paper-3 11 Duration : 3hrs Max Marks : 70 1. (a) How does a class inforce data hiding? 2 (b) Name the header files to which the following belong- 1 (c) Rewrite

More information

The Processor: Improving Performance Data Hazards

The Processor: Improving Performance Data Hazards The Pocesso: Impoving Pefomance Data Hazads Monday 12 Octobe 15 Many slides adapted fom: and Design, Patteson & Hennessy 5th Edition, 2014, MK and fom Pof. May Jane Iwin, PSU Summay Pevious Class Pipeline

More information

CS 2461: Computer Architecture 1 Program performance and High Performance Processors

CS 2461: Computer Architecture 1 Program performance and High Performance Processors Couse Objectives: Whee ae we. CS 2461: Pogam pefomance and High Pefomance Pocessos Instucto: Pof. Bhagi Naahai Bits&bytes: Logic devices HW building blocks Pocesso: ISA, datapath Using building blocks

More information

KENDRIYA VIDYALAYA SANGATHAN, COMPUTER SCIENCE (THEORY) I PRE-BOARD TIME 3 HRS CLASS XII M. Marks 70

KENDRIYA VIDYALAYA SANGATHAN, COMPUTER SCIENCE (THEORY) I PRE-BOARD TIME 3 HRS CLASS XII M. Marks 70 KENDRIYA VIDYALAYA SANGATHAN, COMPUTER SCIENCE (THEORY) I PRE-BOARD TIME 3 HRS CLASS XII M. Marks 70 GENERAL INSTRUCTIONS : 1. ALL QUESTIONS ARE COMPULSORY. 2. PROGRAMMING LANGUAGE : C++ Q1. (a) Out of

More information

Configuring RSVP-ATM QoS Interworking

Configuring RSVP-ATM QoS Interworking Configuing RSVP-ATM QoS Intewoking Last Updated: Januay 15, 2013 This chapte descibes the tasks fo configuing the RSVP-ATM QoS Intewoking featue, which povides suppot fo Contolled Load Sevice using RSVP

More information

COSC 6385 Computer Architecture. - Pipelining

COSC 6385 Computer Architecture. - Pipelining COSC 6385 Compute Achitectue - Pipelining Sping 2012 Some of the slides ae based on a lectue by David Culle, Pipelining Pipelining is an implementation technique wheeby multiple instuctions ae ovelapped

More information

Topic 7 Random Variables and Distribution Functions

Topic 7 Random Variables and Distribution Functions Definition of a Random Vaiable Distibution Functions Popeties of Distibution Functions Topic 7 Random Vaiables and Distibution Functions Distibution Functions 1 / 11 Definition of a Random Vaiable Distibution

More information

SAMPLE PAPER 2015 SUB - COMPUTER SCIENCE - (Theory) CLASS XII Time allowed: 3 hours Maximum marks: 70

SAMPLE PAPER 2015 SUB - COMPUTER SCIENCE - (Theory) CLASS XII Time allowed: 3 hours Maximum marks: 70 SAMPLE PAPER 215 SUB - COMPUTER SCIENCE - (Theory) CLASS XII Time allowed: 3 hours Maximum marks: 7 Instructions : i) All the questions are compulsory. ii) Programming Language (for Q. 1-4): C++ iii) Write

More information

GCC-AVR Inline Assembler Cookbook Version 1.2

GCC-AVR Inline Assembler Cookbook Version 1.2 GCC-AVR Inline Assemble Cookbook Vesion 1.2 About this Document The GNU C compile fo Atmel AVR isk pocessos offes, to embed assembly language code into C pogams. This cool featue may be used fo manually

More information

User Visible Registers. CPU Structure and Function Ch 11. General CPU Organization (4) Control and Status Registers (5) Register Organisation (4)

User Visible Registers. CPU Structure and Function Ch 11. General CPU Organization (4) Control and Status Registers (5) Register Organisation (4) PU Stuctue and Function h Geneal Oganisation Registes Instuction ycle Pipelining anch Pediction Inteupts Use Visible Registes Vaies fom one achitectue to anothe Geneal pupose egiste (GPR) ata, addess,

More information

The Screen Control Language (SCl) in Version 6 SAS/Ar: and SAS/FSp Software Chris Bailey, Yao Chen SAS Institute Inc., Cary, NC

The Screen Control Language (SCl) in Version 6 SAS/Ar: and SAS/FSp Software Chris Bailey, Yao Chen SAS Institute Inc., Cary, NC The Sceen Contol Language (SCl) in Vesion 6 SAS/A: and SAS/FSp Softwae Chis Bailey, Yao Chen SAS Institute Inc., Cay, NC Abstact Explanations and examples povide the basis of this tutoial that explains

More information

Communication module System Manual Part 9

Communication module System Manual Part 9 Communication module 70.4040 System Manual Pat 9 Contents 1 Intoduction 3 1.1 Peface... 3 1.2 Type designation... 4 2 Indications and contols 5 3 Integated functions 7 3.1 Oveview... 7 3.2 Outputs...

More information

Sample Paper, 2015 Subject: Computer Science Class 12 th

Sample Paper, 2015 Subject: Computer Science Class 12 th Sample Paper, 2015 Subject: Computer Science Class 12 th Time: 3 Hours Max. Marks: 70 Instructions: i) All questions are compulsory and so attempt all. ii) Programming language: C++. iii) Please check

More information

a Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives

a Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives SPARK: Soot Reseach Kit Ondřej Lhoták Objectives Spak is a modula toolkit fo flow-insensitive may points-to analyses fo Java, which enables expeimentation with: vaious paametes of pointe analyses which

More information

Model Sample Paper 2015

Model Sample Paper 2015 Time: 3 Hours MM: 70 Model Sample Paper 2015 Class XII Computer Science (083) Instructions: (i) (ii) All questions are compulsory. Programming Language C++. 1. (a) What is the difference between Actual

More information

CLASS XII COMPUTER SCIENCE(083) TimeAllowed : 3 HrsMax Marks : 70

CLASS XII COMPUTER SCIENCE(083) TimeAllowed : 3 HrsMax Marks : 70 1 CLASS XII COMPUTER SCIENCE(083) TimeAllowed : 3 HrsMax Marks : 70 General Instructions- (i) All questions are compulsory (ii) Programming Language: C++ 1. (a) Differentiate between call-by-value and

More information

KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION COMPUTER SCIENCE (083)

KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION COMPUTER SCIENCE (083) KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION CLASS XII COMMON PREBOARD EXAMINATION 05-06 COMPUTER SCIENCE (08) Time: hours Max. Marks: 70 Instructions: (i) All questions are compulsory. (ii) Programming

More information

KE DRIYA VIDYALAYA SA GATHA,CHE AI REGIO. COMMO PRE-BOARD EXAMI ATIO COMPUTER SCIE CE CLASS- XII Time allowed : 3 hours Maximum Marks : 70

KE DRIYA VIDYALAYA SA GATHA,CHE AI REGIO. COMMO PRE-BOARD EXAMI ATIO COMPUTER SCIE CE CLASS- XII Time allowed : 3 hours Maximum Marks : 70 KE DRIYA VIDYALAYA SA GATHA,CHE AI REGIO. COMMO PRE-BOARD EXAMI ATIO 2008-09. COMPUTER SCIE CE CLASS- XII Time allowed : 3 hours Maximum Marks : 70 1. (a) Explain the difference between an actual parameter

More information

IP Multicast Simulation in OPNET

IP Multicast Simulation in OPNET IP Multicast Simulation in OPNET Xin Wang, Chien-Ming Yu, Henning Schulzinne Paul A. Stipe Columbia Univesity Reutes Depatment of Compute Science 88 Pakway Dive South New Yok, New Yok Hauppuage, New Yok

More information

Sample Paper COMPUTER SCIENCE (Theory) Class-XII Time Allowed: 3hours Maximum Marks: 70

Sample Paper COMPUTER SCIENCE (Theory) Class-XII Time Allowed: 3hours Maximum Marks: 70 Sample Paper- 2015 COMPUTER SCIENCE (Theory) Class-XII Time Allowed: 3hours Maximum Marks: 70 Note. (i) All questions are compulsory. (ii) Programming Language: C+ + Ques. 1 a) What is the use of inline

More information

Gravitational Shift for Beginners

Gravitational Shift for Beginners Gavitational Shift fo Beginnes This pape, which I wote in 26, fomulates the equations fo gavitational shifts fom the elativistic famewok of special elativity. Fist I deive the fomulas fo the gavitational

More information

9.5 Volume of Pyramids

9.5 Volume of Pyramids 9.5 Volume of Pyamids and Cones Goal Find the volumes of pyamids and cones. Key Wods pyamid p. 49 cone p. 49 volume p. 500 In the puzzle below, you can see that the squae pism can be made using thee conguent

More information

91/1 COMPUTER SCIENCE. Series SHC/1. dksm ua- jksy ua- Code No. Roll No. Candidates must write the Code on the title page of the answer-book.

91/1 COMPUTER SCIENCE. Series SHC/1. dksm ua- jksy ua- Code No. Roll No. Candidates must write the Code on the title page of the answer-book. Series SHC/1 Roll No. jksy ua- Code No. dksm ua- Candidates must write the Code on the title page of the answer-book. Please check that this question paper contains 12 printed pages. Code number given

More information

DELHI PUBLIC SCHOOL BOKARO STEEL CITY ASSIGNMENT FOR THE SESSION

DELHI PUBLIC SCHOOL BOKARO STEEL CITY ASSIGNMENT FOR THE SESSION DELHI PUBLIC SCHOOL BOKARO STEEL CITY ASSIGNMENT FOR THE SESSION 2017 2018 Class: XII Subject : Computer Science Assignment No. 3 1. a) What is this pointer? Explain with example. b) Name the header file

More information

Undecidability of Static Analysis. William Landi. Siemens Corporate Research Inc. 755 College Rd East.

Undecidability of Static Analysis. William Landi. Siemens Corporate Research Inc. 755 College Rd East. Undecidability of Static Analysis William Landi Siemens Copoate Reseach Inc 755 College Rd East Pinceton, NJ 08540 wlandi@sc.siemens.com Abstact Static Analysis of pogams is indispensable to any softwae

More information

Lecture 27: Voronoi Diagrams

Lecture 27: Voronoi Diagrams We say that two points u, v Y ae in the same connected component of Y if thee is a path in R N fom u to v such that all the points along the path ae in the set Y. (Thee ae two connected components in the

More information

Pipes, connections, channels and multiplexors

Pipes, connections, channels and multiplexors Pipes, connections, channels and multiplexos Fancisco J. Ballesteos ABSTRACT Channels in the style of CSP ae a poeful abstaction. The ae close to pipes and connections used to inteconnect system and netok

More information

ITL Public School Pre-Board( ) Computer Science (083) Time:3 hrs M. M: 70

ITL Public School Pre-Board( ) Computer Science (083) Time:3 hrs M. M: 70 ITL Public School Pre-Board(04-5) Date:..04 Class:XII Computer Science (08) Time: hrs M. M: 70 General Instructions:. Programming Language C++. Try to give Examples a) What is the difference between Actual

More information

COMPUTER SCIENCE SAM PLE PAPER 2-HALF YEARLY EXAMINATION

COMPUTER SCIENCE SAM PLE PAPER 2-HALF YEARLY EXAMINATION COMPUTER SCIENCE SAM PLE PAPER 2-HALF YEARLY EXAMINATION Q.1. (i) Name the header file to which the following belong: (a) gets( ) (b) open( ) (ii) (iv) (v) What is copy constructor? What do you understand

More information

CLASS XII GUESS PAPER COMPUTER SCENCE (083)

CLASS XII GUESS PAPER COMPUTER SCENCE (083) CLASS XII GUESS PAPER COMPUTER SCENCE (083) TIME: 3 hours MARKS: 70 Q1. Please check that this question paper contains 11 printed pages. Code-snippets in questions may be printed wrong rectify the errors

More information

In order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions.

In order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions. In ode to lean which questions have been answeed coectly: 1. Pint these pages. 2. Answe the questions. 3. Send this assessment with the answes via: a. FAX to (212) 967-3498. O b. Mail the answes to the

More information

Lecture Topics ECE 341. Lecture # 12. Control Signals. Control Signals for Datapath. Basic Processing Unit. Pipelining

Lecture Topics ECE 341. Lecture # 12. Control Signals. Control Signals for Datapath. Basic Processing Unit. Pipelining EE 341 Lectue # 12 Instucto: Zeshan hishti zeshan@ece.pdx.edu Novembe 10, 2014 Potland State Univesity asic Pocessing Unit ontol Signals Hadwied ontol Datapath contol signals Dealing with memoy delay Pipelining

More information

Sample Paper Class XII SUBJECT : COMPUTER SCIENCE

Sample Paper Class XII SUBJECT : COMPUTER SCIENCE Sample Paper - 2013 Class XII SUBJECT : COMPUTER SCIENCE FIRST SEMESTER EXAMINATION Instructions: (i) All questions are compulsory. (ii) (ii) Programming Language : C++ 1. (a) Name the header files that

More information

DELHI PUBLIC SCHOOL BOKARO STEEL CITY

DELHI PUBLIC SCHOOL BOKARO STEEL CITY DELHI PUBLIC SCHOOL BOKARO STEEL CITY ASSIGNMENT FOR THE SESSION 2015-2016 Class: XII Subject : Computer Science Assignment No. 3 Question 1: (a) What is the difference between Call by Value and Call by

More information

(a) Differentiate between a call by value and call by reference method.

(a) Differentiate between a call by value and call by reference method. ATOMIC ENERGY CENTRAL SCHOOL NO- RAWATBHATA Half Yearly Examination 05 Model Paper Class XII Subject Computer Science Time Allowed: hours Maximum Marks: 70 Note. (i) All questions are compulsory. (ii)

More information

Cache Memory and Performance

Cache Memory and Performance Cache Memo and Pefomance Code and Caches 1 Man of the following slides ae taken with pemission fom Complete Powepoint Lectue Notes fo Compute Sstems: A Pogamme's Pespective (CS:APP) Randal E. Bant and

More information

Computer Science 141 Computing Hardware

Computer Science 141 Computing Hardware Compute Science 141 Computing Hadwae Fall 2006 Havad Univesity Instucto: Pof. David Books dbooks@eecs.havad.edu [MIPS Pipeline Slides adapted fom Dave Patteson s UCB CS152 slides and May Jane Iwin s CSE331/431

More information

Efficient Execution Path Exploration for Detecting Races in Concurrent Programs

Efficient Execution Path Exploration for Detecting Races in Concurrent Programs IAENG Intenational Jounal of Compute Science, 403, IJCS_40_3_02 Efficient Execution Path Exploation fo Detecting Races in Concuent Pogams Theodous E. Setiadi, Akihiko Ohsuga, and Mamou Maekaa Abstact Concuent

More information

IS-IS Protocol Hardware Implementation for VPN Solutions

IS-IS Protocol Hardware Implementation for VPN Solutions IS-IS Potocol Hadwae Implementation fo VPN Solutions MOHAMED ABOU-GABAL, RAYMOND PETERKIN, DAN IONESCU School of Infomation Technology and Engineeing (SITE) Univesity of Ottawa 161 Louis Pasteu, P.O. Box

More information

COMPUTER SCIENCE 1998 (Delhi Board)

COMPUTER SCIENCE 1998 (Delhi Board) COMPUTER SCIENCE 1998 (Delhi Board) Time allowed: 3 hours Max. Marks: 70 Instructions: (i) All the questions are compulsory. (ii) Programming Language: C++ QUESTION l. (a) Define the following terms: (i)

More information

User Specified non-bonded potentials in gromacs

User Specified non-bonded potentials in gromacs Use Specified non-bonded potentials in gomacs Apil 8, 2010 1 Intoduction On fist appeaances gomacs, unlike MD codes like LAMMPS o DL POLY, appeas to have vey little flexibility with egads to the fom of

More information

Class 21. N -body Techniques, Part 4

Class 21. N -body Techniques, Part 4 Class. N -body Techniques, Pat Tee Codes Efficiency can be inceased by gouping paticles togethe: Neaest paticles exet geatest foces diect summation. Distant paticles exet smallest foces teat in goups.

More information

ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS

ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS Daniel A Menascé Mohamed N Bennani Dept of Compute Science Oacle, Inc Geoge Mason Univesity 1211 SW Fifth

More information

(i) case (ii) _delete (iii) WHILE (iv) 21stName

(i) case (ii) _delete (iii) WHILE (iv) 21stName KENDRIYA VIDAYALAYA SANGATHAN ERNAKULAM REGION PREBOARD EXAMINATION 208-9 CLASS :XII MAX. MARKS : 70 SUBJECT : COMPUTER SCIENCE Instructions: TIME :3 HRS (i) Please check that this question paper contains

More information

NODAL AND LOOP ANALYSIS TECHNIQUES

NODAL AND LOOP ANALYSIS TECHNIQUES NODAL AND LOOP ANALYSIS TECHNIQUES LEANING GOALS NODAL ANALYSIS LOOP ANALYSIS Deelop systematic techniques to determine all the oltages and currents in a circuit NODE ANALYSIS One of the systematic ways

More information

= dv 3V (r + a 1) 3 r 3 f(r) = 1. = ( (r + r 2

= dv 3V (r + a 1) 3 r 3 f(r) = 1. = ( (r + r 2 Random Waypoint Model in n-dimensional Space Esa Hyytiä and Joma Vitamo Netwoking Laboatoy, Helsinki Univesity of Technology, Finland Abstact The andom waypoint model (RWP) is one of the most widely used

More information

Concomitants of Upper Record Statistics for Bivariate Pseudo Weibull Distribution

Concomitants of Upper Record Statistics for Bivariate Pseudo Weibull Distribution Available at http://pvamuedu/aam Appl Appl Math ISSN: 93-9466 Vol 5, Issue (Decembe ), pp 8 9 (Peviously, Vol 5, Issue, pp 379 388) Applications and Applied Mathematics: An Intenational Jounal (AAM) Concomitants

More information

Question Bank Class XII Subject : Computer Science

Question Bank Class XII Subject : Computer Science Question Bank Class XII Subject : Computer Science Q1. What is the difference between call by reference & call by value method in a user defined function in C++? Explain it with suitable example. Q.2.Write

More information

COMPUTER SCIENCE(083) SAMPLE QUESTION PAPER CLASS XII

COMPUTER SCIENCE(083) SAMPLE QUESTION PAPER CLASS XII COMPUTER SCIENCE(083) SAMPLE QUESTION PAPER CLASS XII TIME: 3 HOURS MAX.MARK: 70 General Instructions- (i) All questions are compulsory (ii) Programming Language: C++ 1 (a) When a function is overloaded,

More information

You Are Here! Review: Hazards. Agenda. Agenda. Review: Load / Branch Delay Slots 7/28/2011

You Are Here! Review: Hazards. Agenda. Agenda. Review: Load / Branch Delay Slots 7/28/2011 CS 61C: Geat Ideas in Compute Achitectue (Machine Stuctues) Instuction Level Paallelism: Multiple Instuction Issue Guest Lectue: Justin Hsia Softwae Paallel Requests Assigned to compute e.g., Seach Katz

More information

Pledge: Signature:

Pledge: Signature: S/PM 0 Final Exam 7 May 005 Name: KEY E-mail ID: @viginia.edu Pledge: Signatue: Thee ae 80 minutes 3 hous fo this exam and 80 oints on the test; don t send too long on any one uestion! Thee is an exam

More information

Introduction To Pipelining. Chapter Pipelining1 1

Introduction To Pipelining. Chapter Pipelining1 1 Intoduction To Pipelining Chapte 6.1 - Pipelining1 1 Mooe s Law Mooe s Law says that the numbe of pocessos on a chip doubles about evey 18 months. Given the data on the following two slides, is this tue?

More information

GARBAGE COLLECTION METHODS. Hanan Samet

GARBAGE COLLECTION METHODS. Hanan Samet gc0 GARBAGE COLLECTION METHODS Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 07 e-mail: hjs@umiacs.umd.edu

More information

COMPUTER SCIENCE (CODE 083) CLASS XII Time allowed : 3Hours Maximum. Marks 70

COMPUTER SCIENCE (CODE 083) CLASS XII Time allowed : 3Hours Maximum. Marks 70 Ashok Garg - 9149405 Code No.08 Roll No. Candidate must write the Code on the title page of the answer-book Please check that this question paper contains 8 printed pages. Code number given on the right

More information

COMPUTER SCIENCE

COMPUTER SCIENCE Final 2012-13 COMPUTER SCIENCE - 083 (Theory) CLASS XII Time allowed : 3 hours Maximum marks: 70 Instructions : i) All the questions are compulsory. ii) Programming Language : C++. 1. a) What is the difference

More information

Data mining based automated reverse engineering and defect discovery

Data mining based automated reverse engineering and defect discovery Data mining based automated evese engineeing and defect discovey James F. Smith III, ThanhVu H. Nguyen Naval Reseach Laboatoy, Code 5741, Washington, D.C., 20375-5000 ABSTRACT A data mining based pocedue

More information

Chapter 4 (Part III) The Processor: Datapath and Control (Pipeline Hazards)

Chapter 4 (Part III) The Processor: Datapath and Control (Pipeline Hazards) Chapte 4 (Pat III) The Pocesso: Datapath and Contol (Pipeline Hazads) 陳瑞奇 (J.C. Chen) 亞洲大學資訊工程學系 Adapted fom class notes by Pof. M.J. Iwin, PSU and Pof. D. Patteson, UCB 1 吃感冒藥副作用怎麼辦? http://big5.sznews.com/health/images/attachement/jpg/site3/20120319/001558d90b3310d0c1683e.jpg

More information

IP Network Design by Modified Branch Exchange Method

IP Network Design by Modified Branch Exchange Method Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management

More information

Data File Handling FILL IN THE BLANKS EACH QUESTION CARRY 1 MARK

Data File Handling FILL IN THE BLANKS EACH QUESTION CARRY 1 MARK Data File Handling FILL IN THE BLANKS EACH QUESTION CARRY 1 MARK 1.. Observe the program segment given below carefully, and answer the question that follows: class Labrecord int Expno; char Expriment[20];

More information

Slotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System

Slotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System Slotted Random Access Potocol with Dynamic Tansmission Pobability Contol in CDMA System Intaek Lim 1 1 Depatment of Embedded Softwae, Busan Univesity of Foeign Studies, itlim@bufs.ac.k Abstact In packet

More information

GH4000 SMS CONFIGURATION PROTOCOL

GH4000 SMS CONFIGURATION PROTOCOL GH4000 SMS CONFIGURATION PROTOCOL Document vesion 1.09 Table of contents Witing ules... 3 1 Device Configuation... 4 1.1 Geneal Configuation... 4 1.2 Configuation of Peiodical Tacking... 4 1.3 Configuation

More information

CBSE GUESS PAPER. Roll No. Computer Sc. XII(083)/

CBSE GUESS PAPER. Roll No. Computer Sc. XII(083)/ Roll No. CBSE GUESS PAPER Computer Sc. XII(083)/2011-12 Time Allowed 3 Hours Maximum Marks- 70 General Instructions: (i) All questions are compulsory. (ii) The paper contains 7 questions. (iii) Programming

More information

KENDRIYA VIDYALAYA NO.02 AFS HINDAN G.BAD Holiday Homework Class XII Computer Science

KENDRIYA VIDYALAYA NO.02 AFS HINDAN G.BAD Holiday Homework Class XII Computer Science KENDRIYA VIDYALAYA NO.02 AFS HINDAN G.BAD Holiday Homework 2018-19 Class XII Computer Science Topics covered 1) Classes and objects 2) Constructors and destructors 3) Inheritance 4) Review of class XI

More information

CENG 3420 Computer Organization and Design. Lecture 07: MIPS Processor - II. Bei Yu

CENG 3420 Computer Organization and Design. Lecture 07: MIPS Processor - II. Bei Yu CENG 3420 Compute Oganization and Design Lectue 07: MIPS Pocesso - II Bei Yu CEG3420 L07.1 Sping 2016 Review: Instuction Citical Paths q Calculate cycle time assuming negligible delays (fo muxes, contol

More information

CMCS Mohamed Younis CMCS 611, Advanced Computer Architecture 1

CMCS Mohamed Younis CMCS 611, Advanced Computer Architecture 1 CMCS 611-101 Advanced Compute Achitectue Lectue 6 Intoduction to Pipelining Septembe 23, 2009 www.csee.umbc.edu/~younis/cmsc611/cmsc611.htm Mohamed Younis CMCS 611, Advanced Compute Achitectue 1 Pevious

More information

Towards Adaptive Information Merging Using Selected XML Fragments

Towards Adaptive Information Merging Using Selected XML Fragments Towads Adaptive Infomation Meging Using Selected XML Fagments Ho-Lam Lau and Wilfed Ng Depatment of Compute Science and Engineeing, The Hong Kong Univesity of Science and Technology, Hong Kong {lauhl,

More information

Mock Test Paper-2. CBSE XII : Computer Science. Duration : 3hrs Max Marks : 70

Mock Test Paper-2. CBSE XII : Computer Science. Duration : 3hrs Max Marks : 70 Mock Test Paper-2 CBSE XII : Computer Science Mock Test Paper-2 1 Duration : 3hrs Max Marks : 70 1. (a) What is the difference between Object Oriented Programming and Procedural programming? 2 (b) Write

More information

Lecture 8 Introduction to Pipelines Adapated from slides by David Patterson

Lecture 8 Introduction to Pipelines Adapated from slides by David Patterson Lectue 8 Intoduction to Pipelines Adapated fom slides by David Patteson http://www-inst.eecs.bekeley.edu/~cs61c/ * 1 Review (1/3) Datapath is the hadwae that pefoms opeations necessay to execute pogams.

More information

2016 COMPUTER SCIENCE

2016 COMPUTER SCIENCE Total number of printed pages: 5 Total marks : 70 2016 COMPUTER SCIENCE Time : 3 hours General instructions: i) Approximately 15 minutes is allotted to read the question paper and revise the answers. ii)

More information

ECE331: Hardware Organization and Design

ECE331: Hardware Organization and Design ECE331: Hadwae Oganization and Design Lectue 16: Pipelining Adapted fom Compute Oganization and Design, Patteson & Hennessy, UCB Last time: single cycle data path op System clock affects pimaily the Pogam

More information

Computer Science 2006 (Outside Delhi)

Computer Science 2006 (Outside Delhi) Computer Science 6 (Outside Delhi) General Instructions: Q... All questions are compulsory.. Programming Language: C++ a. Name the header file to which the following belong: () i. pow( ) ii. random( )

More information

Series SHC COMPUTER SCIENCE. Code No. 91. Roll No.

Series SHC COMPUTER SCIENCE. Code No. 91. Roll No. Roll No. Series SHC Code No. Please check that this question paper contains 11 printed pages. Code number given on the right hand side of the question paper should be written on the title page of the answer-book

More information

SIMOCODE pro. Motor Management and Control Devices. SIMOCODE pro for Modbus RTU. Answers for industry. Edition 04/2015

SIMOCODE pro. Motor Management and Control Devices. SIMOCODE pro for Modbus RTU. Answers for industry. Edition 04/2015 SIMOCODE po Moto Management and Contol Devices SIMOCODE po fo Modbus RTU Geätehandbuch Configuation Manual Edition 04/2015 Answes fo industy. Intoduction 1 System configuation and commissioning with RTU

More information

An Assessment of the Efficiency of Close-Range Photogrammetry for Developing a Photo-Based Scanning Systeminthe Shams Tabrizi Minaret in Khoy City

An Assessment of the Efficiency of Close-Range Photogrammetry for Developing a Photo-Based Scanning Systeminthe Shams Tabrizi Minaret in Khoy City Austalian Jounal of Basic and Applied Sciences, 5(1): 80-85, 011 ISSN 1991-8178 An Assessment of the Efficiency of Close-Range Photogammety fo Developing a Photo-Based Scanning Systeminthe Shams Tabizi

More information

COMPUTER SCIENCE 2002 (Delhi Board)

COMPUTER SCIENCE 2002 (Delhi Board) COMPUTER SCIENCE 2002 (Delhi Board) Time allowed: 3 hours Max. Marks: 70 Instructions: (i) All the questions are compulsory. (ii) Programming Language: C++ QUESTION l. (a) What the purpose of a header

More information

Reachable State Spaces of Distributed Deadlock Avoidance Protocols

Reachable State Spaces of Distributed Deadlock Avoidance Protocols Reachable State Spaces of Distibuted Deadlock Avoidance Potocols CÉSAR SÁNCHEZ and HENNY B. SIPMA Stanfod Univesity We pesent a family of efficient distibuted deadlock avoidance algoithms with applications

More information