KENDRIYA VIDYALAYA SANGATHAN (KOLKATA REGION) Second Pre Board Examination ( ) COMPUTER SCIENCE (Theory) Class-XII Marking Scheme

Similar documents
BLUE PRIENT SUBJECT:- Computer Science

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

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

KENDRIYA VIDYALAYA SANGATHAN BHUBANESWAR REGION SECOND PREBOARD EXAMINATION FOR CLASS XII SUBJECT: COMPUTER SCIENCE

VIDYA BHARATI SCHOOL

KENDRIYA VIDYALAYA SANGATHAN DEHRADUN REGION 1 st Pre-Board Examination, Class XII Computer Science(083) Time: 3 Hours Max.

DELHI PUBLIC SCHOOL BOKARO STEEL CITY ASSIGNMENT FOR THE SESSION

Kendriya Vidyalaya Sangathan Model Question Paper-1 Class XII Subject - Computer Science (083) Max. Marks: 70. Blue Print

COMMON PRE-BOARD EXAMINATION COMPUTER SCIENCE

KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION. REVISION Examination 2013 COMPUTER SCIENCE (083) CLASS XII

KENDRIYA VIDYALAYA SANGATHAN MODEL QUESTION PAPER-5 BLUE PRINT CLASSS XII COMPUTER SCIENCE (083) TIME: 03:00 Hrs. MAX. MARKS: 70 S.No.

Subject - Computer Science (Code-083)

void display(){ cout << trainno.<< :>>Description<<endl; }; void main() {TRAIN T; Entry.(); Display.(); d) 410 e) i) south:east:south f) temttoe

KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION COMPUTER SCIENCE (083)

CLASS XII SECOND TERM EXAMINATION SUBJECT : COMPUTER SCIENCE SET A2 (SOLUTIONS)

KENDRIYA VIDYALAYA SANGATHAN TINSUKIA REGION PRE BOARD EXAMINATION SUBJECT COMPUTER SCIENCE

CLASS XII SECOND TERM EXAMINATION SUBJECT : COMPUTER SCIENCE SET A1(SOLUTIONS)

KE DRIYA VIDYALAYA SA GATHA, CHE AI REGIO. COMMO PRE-BOARD EXAMI ATIO COMPUTER SCIE CE (CLASS-XII) MARKI G SCHEME

KENDRIYA VIDYALAYA SANGATHAN ERNAKULAM REGION FIRST COMMON PRE BOARD EXAMINATION MARKING SCHEME. Code No. 083

Computer programs are associated to work with files as it helps in storing data & information permanently. File - itself a bunch of bytes stored on

UNIT- 3 Introduction to C++

COMPUTER SCIENCE(083) SAMPLE QUESTION PAPER CLASS XII

THE EMIRATES NATIONAL SCHOOL SHARJAH THIRD MODEL EXAMINATION COMPUTER SCIENCE ( Code : 083) ANSWER KEY

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

Downloaded from

DELHI PUBLIC SCHOOL BOKARO STEEL CITY

COMPUTER SCIENCE Time allowed : 3hours] [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

KENDRIYA VIDYALAYA SANGATHAN ERNAKULAM REGION FIRST COMMON PRE BOARD EXAMINATION CLASS:XII - (COMPUTER SCIENCE )

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

Session Chapter 4: Classess & Object

KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION. REVISION Examination 2013 COMPUTER SCIENCE (083) CLASS XII. Time Allowed: 3 Hours Maximum Marks: 70

Page 1

After going through this lesson, you would be able to: store data in a file. access data record by record from the file. move pointer within the file

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

KENDRIYA VIDYALAYA SANGATHAN, VARANASI REGION

Week 3: File I/O and Formatting 3.7 Formatting Output

COMPUTER SCIENCE (Theory) - Class XII Marking Scheme

JB Academy, Faizabad Half Yearly Examination Subject: Computer Science (083) Class XII

CLASS XII GUESS PAPER COMPUTER SCENCE (083)

KENDRIYA VIDYALAYA SANGATHAN ERNAKULAM REGION SECOND PRE BOARD EXAMINATION CLASS XII

KENDRIYA VIDYALAYA SANGATHAN ERNAKULAM REGION FIRST COMMON PRE BOARD EXAMINATION

Computer Science 2006 (Delhi)

KENDRIYA VIDYALAYA SANGATHAN. Regional Office Delhi Split-up Syllabus Session Subject:-Computer Science Subject Code:-083

Guru Harkrishan Public School, Karol Bagh Pre Mock Class XII Sub: COMPUTER SCIENCE Allowed :3 hrs

C++_ MARKS 40 MIN

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

I BSc(IT) [ Batch] Semester II Core: Object Oriented Programming With C plus plus - 212A Multiple Choice Questions.

KENDRIYA VIDYALAYA SANGATHAN,MUMBAI REGION 1 ST PRE-BOARD EXAMINATION TIME- 3 HRS. CLASS-XII SUBJECT-COMPUTER SCIENCE MARKS-70 MARKING SCHEME


DATA FILE HANDLING FILES. characters (ASCII Code) sequence of bytes, i.e. 0 s & 1 s

2. Distinguish between a unary, a binary and a ternary operator. Give examples of C++ operators for each one of them.

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

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

void main() { int global=7 ; func( ::global,global) ; cout<<global<<, <<::global<< \n ; func(global,::global) ; cout<<global<<, <<::global<< \n ; }

Come and join us at WebLyceum

KUWAIT SAHODAYA EXAMINATION FIRST TERM SUBJECT : COMPUTER SCIENCE (083) : CLASS - XII SET - 3 Time : 3 Hours

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

Object Oriented Programming Using C++ UNIT-3 I/O Streams

KENDRIYA VIDYALAYA SANGATHAN MODEL QUESTION PAPER 8 CLASS XII COMPUTER SCIENCE (083)

CPE Summer 2015 Exam I (150 pts) June 18, 2015

Computer Science 2006 (Outside Delhi)

KENDRIYA VIDYALAYA SANGATHAN GUWAHATI REGION क य व लय स गठन, ग व ह ट स भ ग I-PRE BOARD EXAMINATION ( -ब ड पर )

KENDRIYA VIDYALAYA SANGATHAN (CHANDIGARH REGION) MARKING SCHEME (Ist Pre Board )

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

Largest Online Community of VU Students

COMPUTER SCIENCE 2002 (Delhi Board)

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

Answer key SUBJECT : COMPUTER SCIENCE Time : 3 hour 15 min Max. marks : 70

File I/O Christian Schumacher, Info1 D-MAVT 2013

DISK FILE PROGRAM. ios. ofstream

[Time allowed : 3hours] [Maximum Marks: 70] Instructions (i) All questions are compulsory (ii) Programming Language: C++

BHARATIYA VIDYA BHAVAN S V.M.PUBLIC SCHOOL, VADODARA. Class : XII SAMPLE PAPER Max Marks : 70

Name :. Roll No. :... Invigilator s Signature : INTRODUCTION TO PROGRAMMING. Time Allotted : 3 Hours Full Marks : 70

THE EMIRATES NATIONAL SCHOOL SHARJAH THIRD MODEL EXAMINATION 2015 COMPUTER SCIENCE ( Code : 083) CLASS : XII MAX MARKS: 70

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

THE NAME OF THE CONSTRUCTOR AND DESTRUCTOR(HAVING (~) BEFORE ITS NAME) FUNCTION MUST BE SAME AS THE NAME OF THE CLASS IN WHICH THEY ARE DECLARED.

KE DRIYA VIDYALAYA SA GATHA CHE AI REGIO COMMO PREBOARD EXAMI ATIO COMPUTER SCIE CE- CLASS- XII. Marking scheme

COMMON PRE-BOARD EXAMINATION COMPUTER SCIENCE

C++ 8. Constructors and Destructors

Java Identifiers, Data Types & Variables

CS101 Computer Programming and Utilization

KENDRIYA VIDYALAYA SANGATHAN

1- Write a single C++ statement that: A. Calculates the sum of the two integrates 11 and 12 and outputs the sum to the consol.

Chapter-12 DATA FILE HANDLING

KENDRIYA VIDYALAYA SANGATHAN

COMPUTER SCIENCE 1998 (Delhi Board)

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

KENDRIYA VIDYALYA CLRI CHENNAI AUTUMN BREAK HOLIDAY HW MARKS QUESTIONS : DATA STRUCTURE

+2 Volume II OBJECT TECHNOLOGY OBJECTIVE QUESTIONS R.Sreenivasan SanThome HSS, Chennai-4. Chapter -1

CHAPTER 4 FUNCTIONS. 4.1 Introduction

ASSIGNMENT CLASS : XII ( ) COMPUTER SCIENCE

Consider the following example where a base class has been derived by other two classes:

Short Notes of CS201

STUDY NOTES UNIT 1 - INTRODUCTION TO OBJECT ORIENTED PROGRAMMING

CAMBRIDGE SCHOOL, NOIDA ASSIGNMENT 1, TOPIC: C++ PROGRAMMING CLASS VIII, COMPUTER SCIENCE

CS201 Latest Solved MCQs

KENDRIYA VIDYALAYA SANGATHAN, KOLKATA REGION SPLIT-UP SYLLABUS ( ) CLASS XII : COMPUTER SCIENCE (THEORY)

SHORT REVIEW OF CS TOPICS RANDOM NUMBERS (2 MARKS) which generates a random number in the range of 0 to n-1. For example;

CS201 - Introduction to Programming Glossary By

Transcription:

KENDRIYA VIDYALAYA SANGATHAN (KOLKATA REGION) Second Pre Board Examination (2014-15) COMPUTER SCIENCE (Theory) Class-XII Marking Scheme Ques. 1 a) [1] Automatic Type Conversion Type casting It is also called implicit type It is also called explicit type conversion. conversion In this type, conversion is performed It is user-defined that forces an by compiler. expression to be of specific type. Automatic conversion takes place Here conversion takes place when it automatically when data types are appears as (type) expression intermixed in an expression. Conversion takes place always upto Conversion takes place to the specific the type of the largest operand. data type that appears in type. Suitable example [1] b) i) iostream.h [2 x ½ =1] ii) string.h c) #include<iostream.h> [½ x4=2] class MEMBER int Mno; float Fees; public: void Register ( ) cin>>mno>>fees; void Display( ) cout<<mno<<" : "<<Fees<<endl; 1

; void main() MEMBER d; d.register(); d.display(); d) JjIANS! [2] e) [3] 20, 25, 30, 20, 25, 30, 35, Number=34 f) iii) ######99-@@999 iv) ####99-@@@999 [1] Justification [1] Ques. 2 a) [2] We will make the function inline only when it is small as if we make large function inline, there would be heavy memory penalty. When the function becomes inline, the compiler does not have to jump to function and then jump back to called function, thus saves time. Function call is replaced by function definition by the compiler. b) (i) Function1 is called automatically, when the scope of an object gets over. It is known as Destructor. [ ½ + ½ ] ii) Function4 will be called on execution of statement written as Statement 2. It is Copy Constructor. [ ½ + ½] c) class Stock int ICode; char Item[10]; 2

; float price; int Qty; float Discount ; void FindDisc( ) if (Qty<=50) Discount=0 ; else if(qty>=51 && Qty<=100) Discount=5 ; else if(qty>100) Discount=10; public: Stock() ICode=0; Price=0.0; Qty=0; strcpy(item, NULL ); void Buy( ) cout << Enter item code : ; cin >> ICode; cout << Enter item name : ; gets(item); cout << Enter price : ; cin >>price; cout << Enter quantity : cin >> Qty; FindDisc( ); void ShowAll( ) cout<< Item Code : <<ICode; cout<< Item Name : ;puts(item); cout<< Price : <<price; cout<< Quantity: <<Qty; cout<< Discount: << Discount; d) (i) Multiple inheritance [1] (ii) Register(), Input(), Output(), Sitein(), Siteout() [1] (iii) Data members: None [1] 3

(iv) Member Function: Register(), Show() Function Output( ) is not accessible inside the function SiteOut( ). Online and FacetoFace classes are independent classes. [1] But after inheriting Output () is accessible inside function SiteOut() as both are member functions of the same class. Ques. 3 a) void SumUnit2(int A[ ],int size) [3] int S=0,i; for(i=0;i<size;i++) if((a[i]%10)%2==0) S+=A[i]; cout<<s; [3] b) Formula for column major: Address of T[i][j]=B+W*((i-i r )+(j-j r )*R) As per question: 9800=b+4*(25+50*10) or, b=9800-4*525 or, b=9800-2100=7700 Therefore base address is 7700. Therefore, address of T[30[15]=7700+4*(30+15*50) = 7700+4*(30+750) = 7700+4*780=7700+3120=10820 c) void remove(book *front) [4] BOOK *Temp; If(front==NULL) cout<< Queue underflow. ; else Temp=front; 4

cout<<element removed : << Temp->bprice; if(front->link==null) front=null; else front=front->link; \\Output; for(temp=front; temp->link!=null; temp=temp->link) cout<< temp->bprice; cout<< temp->bprice; d) int sum(int B[ ][3], int r, int c) int count=0,i,j,s=0; for(i=0;i<r;i++) for(j=0;j<c;j++) if(count%2==0) s+=b[i][j]; count++; return count; e) [2] Scanned element Operation Stack Intermediate Result True Push True False Push True, False NOT Pop one ele and True, True NOT(False)=True push result OR Pop two ele and push result True True OR True= True False Push True, False 5

True Push True, False, True OR Pop two ele and push result True, True AND Pop two ele and True push result False OR True True AND True Ques. 4. a) [1] #include<fstream.h> class Employee int Eno; char Ename[30]; public: //Function to count the total number of records int Countrec( ); ; int Employee:: Countrec( ) fstream File; File.open( Emp.Dat,ios::binary ios::in); File.seekg(0,ios::end) // Statement 1 int Bytes = File.tellg() // Statement 2 int count = Bytes/sizeof(Employee); File.close( ); return count; 6

b) [2] void COUNT(void) ifstream fin; char wd[10]; int c=0; fin.open( coordinate.txt, ios::in); while(!fin.eof()) fin>>wd; if(isupper(wd[0])) c++; cout<< No. of words with first capital letter : <<c; fin.close(); c) [3] void TRANSFER( ) ifstream fin; ofstream fout; Phonlist P; fin.open( PHONE.DAT,ios::in); fout.open( PHONBACK.DAT,ios::out); while(!fin.eof()) fin.read((char *)&P,sizeof(P)); if(p.checkcode( DEL )==0) fout.write((char *)&P,sizeof(P)); fin.close(); fout.close(); 7

Ques. 5 a) [2] DDL (Data Definition Language) commands are commands used for defining the data structures specially database schemas. Example: CREATE, ALTER, DROP DML(Data Manipulation Language) commands are used for data manipulation. Example: SELECT, UPDATE, DELETE, INSERT b) [6] (i) SELECT * FROM CONSUMER WHERE ADDRESS = DELHI ; (ii) SELECT * FROM STATIONARY WHERE PRICE>=8 AND PRICE <=15; (iii) SELECT CONSUMERNAME, ADDRESS, COMPANY, PRICE FROM CONSUMER C, STATIONARY S WHERE S.S_ID=C.S_ID; (iv) UPDATE STATIONARY SET PRICE=PRICE+2; (v) DISCTINCT ADDRESS Delhi Mumbai Banglore (vi) Company MAX(Price) MIN(Price) COUNT(*) ABC 15 10 2 XYZ 7 6 2 CAM 5 5 1 8 (vii) (viii) Consumer.ConsumerName Stationary.StationaryName Stationary.Price Good Learner Pencil 5 Write Well Gel Pen 15 Topper Dot Pen 10 Write & Draw Pencil 6 Motivation Pencil 5 StationaryName Price*3 Dot Pen 30 Pencil 18 Eraser 21 Pencil 15 Gel Pen 45

Ques.6 a) LHS : [2] (A +B ).(A+B) = A.A + A.B +B.A+B.B = 0+ A.B+A.B +0 = A.B+A.B = RHS b) A.(B+C ) [2] c) [1] Canonical SOP form: (0,2,4,5) = F(X,Y,Z)=X Y Z +X YZ +XY Z +XY Z d) [3] Octet-1 (m 0 +m 1 +m 4 +m 5 +m 12 +m 13 +m 8 +m 9 ) = c Octet-2 (m 1 +m 3 +m 5 +m 7 +m 13 +m 15 +m 9 +m 11 ) = d Therefore, reduced expression using K-map is (c +d) Ques.7 a) [2] Message switching technique Packet switching technique 1.No limit on block size 1. Tight upper limit on block size 2. Data packets are stored on the disk 2.Packets are stored in main memory 3.Throughput is less improved in 3.Throughput is more improved in comparison to packet switching comparison to message switching b) ii) Mbps(Mega bits per second) [1] c) [1] 9

(i) (ii) FTP- File Transfer Protocol (ii) GSM- Global System for Mobile communication d) (i) ii) The most suitable building to house the server will be Training Building as it contains maximum number of computers and as per 80-20 rule that states that 80% of traffic must be local. iii) i. Repeater will be placed between Training Building & Accounts Building as the distance between them is more than 100m. ii. Hub/Switch in every building to connect computers in each building iv) The NGO is planning to connect its International office situated in Delhi. Optical Fibre will be better for very high speed connectivity. e) A Trojan horse is a computer program which carries out malicious operations without the user s knowledge. It is a piece of harmful code placed within a healthy program which destroys files. [1] f) [1] STAR Topology Requires more cable length than bus topology Difficult to expand BUS Topology Requires less cable length than star topology Easy to expand -----------------------XXXXX----------------------- 10