BLUE PRIENT SUBJECT:- Computer Science

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

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

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

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

VIDYA BHARATI SCHOOL

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

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


KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION COMPUTER SCIENCE (083)

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

COMPUTER SCIENCE 2002 (Delhi Board)

COMMON PRE-BOARD EXAMINATION COMPUTER SCIENCE

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

Short Notes of CS201

CS201 - Introduction to Programming Glossary By

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

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

COMPUTER SCIENCE(083) SAMPLE QUESTION PAPER CLASS XII

CHAPTER 4 FUNCTIONS. 4.1 Introduction

2 SEMESTER EXAM CLASS : 12 DECEMBER 2016 TIME : 3 Hrs MAX MARKS : 70

KENDRIYA VIDYALAYA SANGATHAN, VARANASI REGION


Autumn Break 2017 Exam Oriented Assignment Class-XII B, Computer Science

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

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

KE DRIYA VIDYALAYA SA GATHA CHE AI REGIO COMMO PREBOARD EXAMI ATIO COMPUTER SCIE CE

DELHI PUBLIC SCHOOL BOKARO STEEL CITY ASSIGNMENT FOR THE SESSION

Sample Paper, 2015 Subject: Computer Science Class 12 th

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

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

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

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


Computer Science 2006 (Delhi)

3.Constructors and Destructors. Develop cpp program to implement constructor and destructor.

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

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

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

C++_ MARKS 40 MIN

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

COMPUTER SCIENCE (Theory) - Class XII Marking Scheme

KENDRIYA VIDYALAYA SANGATHAN ERNAKULAM REGION FIRST COMMON PRE BOARD EXAMINATION

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

Sample Paper 2015 Class XII Subject COMPUTER SCIENCE. Some Important Questions Networking

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

DELHI PUBLIC SCHOOL BOKARO STEEL CITY

COMPUTER SCIENCE 1998 (Delhi Board)

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

COMMON PRE-BOARD EXAMINATION COMPUTER SCIENCE

PART I. Answer all questions in this Part. While answering questions in this Part, indicate briefly your working and reasoning, wherever required.

Largest Online Community of VU Students

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

COMPUTER APPLICATION

BOOLEAN ALGEBRA. 1. State & Verify Laws by using :

Downloaded from


CSE202-Lec#4. CSE202 C++ Programming

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

SCIENCE ENTRANCE ACADEMY III PREPARATORY EXAMINATION SCHEME OF VALUATION

Come and join us at WebLyceum

Computer Science 2006 (Outside Delhi)

Introduction to C++ Introduction to C++ 1

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

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

3/12/2018. Structures. Programming in C++ Sequential Branching Repeating. Loops (Repetition)

KENDRIYA VIDYALAYA SANGATHAN TINSUKIA REGION PRE BOARD EXAMINATION SUBJECT COMPUTER SCIENCE

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

COMPUTER SCIENCE SAM PLE PAPER 2-HALF YEARLY EXAMINATION

Page. No. 1/15 CS201 Introduction to Programmming Solved Subjective Questions From spring 2010 Final Term Papers By vuzs Team

(Structured Query Language)

CLASS XII GUESS PAPER COMPUTER SCENCE (083)

Kapil Sehgal PGT Computer. Science Ankleshwar Gujarat

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

LSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology

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

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

SPLIT-UP SYLLABUS ----CHENNAI REGION COMPUTER SCIENCE (Code: 083) Class-XII Academic Session

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.

Date Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 04. Boolean Expression Simplification and Implementation

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

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

A506 / C201 Computer Programming II Placement Exam Sample Questions. For each of the following, choose the most appropriate answer (2pts each).

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

COMPUTER SCIENCE PAPER 1

Content: Learning Objectives

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

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

COMPUTER SCIENCE Paper 1

Sample Paper Class XII SUBJECT : COMPUTER SCIENCE

Introduction to C++ Systems Programming

Darshan Institute of Engineering & Technology for Diploma Studies

Functions. Introduction :

Downloaded from

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

Quiz Start Time: 09:34 PM Time Left 82 sec(s)

CS201 Latest Solved MCQs

COMPUTER SCIENCE Time allowed : 3hours] [Maximum Marks :70

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

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

UNIT- 3 Introduction to C++

Transcription:

Marking Scheme Ques. 1 BLUE PRIENT SUBJECT:- Computer Science UNIT/TOPIC 1Mks 2Mks 3Mks 4Mks TOTAL 1) Programming in C++ 1(4) 2(6) 3(2) 4(2) 30 2) Data Structure ----- 2(2) 3(2) 4(1) 14 3) Database and SQL ----- 2(2) ---- 4(1) 08 4) Boolean Algebra 1(1) 2(2) 3(1) ---- 08 5) Communication 1(4) 2(1) ----- 4(1) 10 &Networking Total 9 13 5 5 70 a) Free store is a pool of unallocated heap memory given to a program that is used by the program for dynamic allocation during execution. b) #define is a preprocessor. const is a keyword to declare constant variables. (1 mark for each correct definition) c) Header files- iostream.h and iomanip.h ( 1/2 mark for writing each header file) d) #include <iostream.h> class MEMBER int Mno; float Fees; public: void Register ( ) cin>>mno>>fees; void Display( ) cout<<mno<<" : "<<Fees<<endl; ; void main( ) MEMBER d; d.register( ); d.display( ); ( 1/2 mark for each correction) e) BAJJAB#-1 (3 marks for correct output) f) C AA L L L I I I I F F F F F OOOOOO RRRRRRR NNNNNNNN I I I I I I I I I AAAAAAAAAA (2 marks for correct output) g) Ans : Option (iii)######99-@@999 ( 1 mark for correct answer and 1 mark for writing the reason)

Ques. 2 a) The functions should be inlined only when they are small.inline functions execute faster but memory penalty is there.we can make a function inline if it a small function and it does not return a value and not having a loop or a switch or a goto statement and it does not contain static variables,and is not a recursive function. (2 marks for definition) b) i) a) To call Statement 1 - Inter Obj(100); b)function 3 is a destructor, it will invoke automatically when an object expire from memory. (1/2 Mark for each correct answer) ii) Definition for Function 2- Copy constructor Inter ( Inter & t ) m=t.m; c) class Competiton int Event_no; char Description[30]; int Score; char Qualified; char Award(int cutofscore) if (Score>cutOfScore) return Y ; else return N ; public: competition ( ) Event_No=101; strcpy(description, State Level ); Score=50; Qualified= N ; void Input( ) cin>>event_no; gets(description); cin>> Score; int cutscore; cout<< Enter cut of Score\n ; cin>>cutscore; Qualified= Award(cutScore); void Show( ) cout<< \nevent_no << Event_No<< \n Description << Description<< \n Score << Score<< \n Qualified << Qualified; ; (2 Marks for declaring the class correctly, 1 mark for function definition,1 mark for invoking the function Award(int) from input( ) ) d) i) Multiple Inheritance ii) void Register( ), void Input( ),void Output( ), void Sitein( ),void Siteout( ) iii) void Register( ),void Show ( ),void Input( ),void Output( ) iv) Not possible.there is no relation between class FacetoFace and class Online. (1 Mark for each correct answer)

Ques. 3 a) void SORTSCORE(Examinee E[ ],int size) int i,j; Examinee temp; cout<< \arranging in Descending order\n ; for(i=0;i<size;i++) for(j=0;j<size;j++) if(e[j].score<e[j+1].score) temp=e[j]; E[j]= E[j+1]; E[j+1]=temp; b) Total No of rows R=35 No of columns C= 20 I r = 0 I c =0 W=4 A[i][j]=B+w(c(I-Ir)+(j-Ic)) T[2][2]=B+4(15(2-0)+(2-0) 3000=B+128 B=2872 A[20][5]=2872+4(15(20-0)+(5-0)) =2872+1220 =4092 Base address =2872 Element address= 4092 (1 1/2 mark for each correct answer) c) void FindPlayer(Cricket *Front, Cricket *Rear,int PlayerID) int f=0; if (Front==NULL) // Or (Rear == NULL) cout<< Queue is Empty ; exit(1); while(front!=null) If(Front->Pid ==PlayerID) cout<< \n Player ID <<Front-> Pid<< \n Player Name <<Front-> Pname << \n Type <<Front->Type; f=1; Front=Front->next; if (f==0) cout<< Sorry No such Player Found!!!!!\n

(1 mark for writing the function definition & passing the required arguments correctly, 1/2 mark for checking empty condition, 1/2 mark for checking Not found condition, 2 marks for displaying the Player details after searching.) d) void SumOfAlternate(int B[ ][5],int R,int C) int sum=0; for(int i=0;i<r;i++) for(int j=0;j<c;j++) if((i+j)%2==0) sum+=b[i][j]; cout<< \nsum of Alternate Elements = <<sum; ( 1/2 Mark for writing the correct function definition and 1/2 mark for declaring & initializing a variable for storing sum and 1 mark for taking alternate location elements,calculating sum &displaying or returning the result.) e) (1 mark for showing stack contents in each stage and 1 mark for correct output) Ques. 4. Given Expression is (A+B)*(C^(D-E)+F)-G Sl.No Symbol Stack Status Output Scanned 1 ( 2 ( (( 3 A (( A 4 + ((+ A 5 B ((+ AB 6 ) ( AB+ 7 * (* AB+ 8 ( (*( AB+ 9 C (*( AB+C 10 ^ (*(^ AB+C 11 ( (*(^( AB+C 12 D (*(^( AB+CD 13 - (*(^(- AB+CD 14 E (*(^(- AB+CDE 15 ) (*(^ AB+CDE- 16 + (*(+ AB+CDE-^ 17 F (*(+ AB+CDE-^F 18 ) (* AB+CDE-^F+ 19 - (- AB+CDE-^F+* 20 G (- AB+CDE-^F+*G 21 ) AB+CDE-^F+*G- Postfix expression is AB+CDE-^F+*G- a) i) Statement 1 File.seekp(Record*sizeof(PracFile)); ii) Statement 2 File.write((char*)&P,sizeof(PracFile)); ( 1/2 Mark each)

b) #include<iostream.h> #include<process.h> //for exit( ) #include<ctype.h> //for isupper( ) void CountWord( ) ifstream File; char word[50]; int wcount=0,docount=0; File.open( coordinate.txt, ios::in); if(!file) cout<< Sorry Can t open the file!!!! ; exit(1); while (File) File>>word; if(isupper(word[0]) wcount++; if(strcmp(word, Do )==0) Docount++; cout<< Total words with capital vowel << wcount<< Count of Do in file << Docount; File.close( ); ( 1/2 Mark for opening the file correctly. 1/2 mark for declaring & initializing variables to store count,1 mark for reading word by word from file and counting and displaying the counts.) c) void PrintDistance( ) ifstream File; int f=0; File.open( BUS.DAT,ios::binary ios::in); bus B; while (File.read(( char*) &B, sizeof(b))) if(b.retdist( ) > 100) f=1; B. display( ); if(f= =0) cout<< \n No such record. ; File.close( ); Ques. 5 (1 Mark for opening the file correctly. 1/2 mark for declaring Object of class Bus,1 mark for reading records from file and ½ mark for checking and displaying the record.) a) DDL Data Definition Language This is a category of SQL commands which are used to creating or defining relations,deleting relations and modifying relations.eg : Create,Drop,Alter DML- Data Manipulation Language -This is a category of SQL commands which are used to manipulate or access data from a table.eg: Insert,Update,Delete ( 1/2 mark for definition & 1/2 mark for writing any one Eg for each) b) i) Select * from consumer where Address = Delhi ; ii) Select * from Stationary where price between 8 and 15.

iii) Select ConsumerName, Address, Company,Price from Consumer, Stationary where Consumer. S_ID = Stationary. S_ID ; iv)update Stationary set Price =Price + 2; v) Count 3 vi) Company Max(Price) MIN(Price) COUNT(*) ABC 15 10 2 vii) XYZ 7 6 2 CAM 5 5 1 viii) ConsumerName StationaryName Price Good Learner Pencil 5 Write Well Gel Pen 15 Topper Dot Pen 10 Write & Draw Pencil 6 Motivation Pencil 5 Ques.6 StationaryName Price*3 Dot Pen 30 Pencil 18 Eraser 21 Pencil 15 Gel Pen 45 (1 mark each for questions from (i) to (iv) and ½ mark each for questions from (v) to (viii) a) (A +B ).(A+B)=A.B+A.B L.H.S = (A +B ).(A+B) =A A+A B+B A+B B = 1+A B+AB +1 (Applying Complementarity Law AA =1 &BB =1) = A B+AB = R.H.S (Applying Properties of 1 ) (2 marks for the correct derivation with explanation) b) A.(B+C ) A B C C B+C A.(B+C ) (1 marks for drawing the circuit diagram and 1 mark for showing the output in each stage) c) F(X,Y,Z)= (1,3,6,7) SOP = F(X,Y,Z) = (0,2,4,5) Canonical SOP Expression is X Y Z +X YZ +XY Z +XY Z (1 Mark for writing the SOP expression)

d) F (X, Y, Z, W) = ) Ques.7 Z W Z W ZW ZW X Y 1 1 1 0 X Y 1 1 1 0 XY 0 1 1 0 XY 0 1 1 1 F= W+X Z +XY Z (1 mark for mapping the given function into K-map, 1 mark for Grouping, 1 mark for the answer) a) ARPANET is Advanced Research Agency Network, developed by U.S department of Defence. It is the seed of today s internet developed in 1969 and used for connecting different Universities and U.S researchers. It expanded rapidly and formed new high capacity network like NFSnet. (2 marks for correct answer) b) In electronic communication bandwidth is the width of the range of frequencies that an electronic signal uses on a given transmission medium. Bps(Bytes per second) ( 1/2 mark for definition & 1/2 mark for Eg) c) i) FTP - File Transfer Protocol (ii) NTP Network Time Protocol (1/2 Mark for each correct answer) d) i)cable Layout Main Resource Training Accounts ii)training. According to the 80:20 rule, building having more number of computers should be selected for installing server. iii) i) Repeater should be placed between Training building and Accounts and Training building and Resourse building since the distance is more than 100m. ii) Hub/Switch should be placed in all the building to connect the computers each other. iv) Optical Fibre (1 mark for each correct answer) e) Cookies are messages that a web server transmit to a website to a web browser so that web server can keep track of the user s activity on a specific website.(1 mark for definition) f) FLOSS is Free Libre and Open Source Software.It refers to a software which is both free software as well as open source software.(1 mark for definition) ----------------------------------------------------------------------------- Prepared By: Ruby Viswam PGT (CompSc) KV Ernakulam