Trending ▼   ResFinder  

Class 12 CBSE Pre Board 2016 : Computer Science (The Navodaya Academy, Namakkal)

6 pages, 6 questions, 0 questions with responses, 0 total responses,    0    0
Bhuvi Eswari
Rathnavel Subramaniam College of Arts & Science (RSCAS)
+Fave Message
 Home > sbhuvi >   F Also featured on: sbhuvi School Page and 1 more

Formatting page ...

THE NAVODAYA ACADEMY SR SEC SCHOOL CBSE - NAMAKKAL CLASS : 12 COMPUTER SCIENCE TIME: 3 HRS MAX MARKS: 70 ANSWER ALL THE QUESTIONS COMPULSORY NOTE: - PROGRAMMING LANGUAGE : C++ A1. Explain the concept of candidate key with an example. A2.Consider the following table and answer the questions given below 2 2 i)Identify the Primary key/Keys in this table. ii) What will be the domain of the column LASTNAME? A3. What do you mean by Union & Cartesian Product operation in relational algebra? 2 A4. Define Cardinality & Degree upon the table given. 2 A5. Mention the advantages of relational database. 2 B1. Given the following truth table, derive a Sum of Product (SOP) and Product of Sum (POS) form of Boolean expression from it 2 X Y Z G(X,Y,Z) 0 0 0 0 0 0 1 1 0 1 0 1 0 1 1 0 1 0 0 0 1 0 1 1 1 1 0 0 1 1 1 1 B2. Prove that AB+BC+AC =B algebraically 2 B3. Design (A+B).(C+D) using NOR Gate 2 B4. Draw the logic circuit for the following expression 2 A.(B+C ) B5.Convert the following Boolean expression into its equivalen Canonical Product of Sum form (POS) 1 AB C+A BC+A BC B6. State and prove De Morgan Law using Truth table 2 B.a)Write the POS form of a Boolean Function F, which is represented in a truth table as follows: 2 U 0 0 0 0 1 1 1 1 V 0 0 1 1 0 0 1 1 W 0 1 0 1 0 1 0 1 F 1 0 1 0 1 0 1 1 B (b) Reduce the following Boolean Expression using K- Map: F(A, B,C, D)= (0 ,1,2,4,5,7,8, 9, 10,11,14) B (c)Write the equivalent Boolean Expression for the following Logic Circuit: 3 2 B (d) Obtain the minimal form of the following Boolean expression using K-map F(U,V,W,Z) = (0,1,2,3,6,7,8,9,10,13,15) 3 B (e) Write the Sum of Product form of the FunctionF(A,B,C) for the following truth table representation of F A B C F 0 0 0 0 0 0 1 0 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 0 1 1 0 0 1 1 1 1 C 1.Minimize A B +A +AB using Algebric method C2. Write the equivalent Boolean expression for the given logic circuit 1 2 2 C3. State and verify the Absorption Law 2 C4. Why NAND & NOR is universal gate? 2 D1. Assume that a text file named TEXT1.TXT already contains some text written into it, write a function named vowelwords(), that reads the file TEXT1.TXT and create a new file named TEXT2.TXT, which shall contain only those words from the file TEXT1.TXT which don t start with an uppercase vowel (i.e., with A , E , I , O , U ). For example if the file TEXT1.TXT contains Carry Umbrella and Overcoat When it Rains then the file TEXT2.TXT shall contain Carry When it Rains 3 D2.class PracFile { int Pracno; char Pracname[20]; int Timetaken; int Marks; Public: Void EnterPrac(); Void ShowPrac(); TimeTaken() { return TimeTaken; } void Assignmarks(int m) { Marks =m; } }; void PracFile:: EnterPrac( ) 1 { fstream File; File.open( MARKS.DAT ,ios::binary|ios::in|ios::out); PracFile P; int Record = 0; while (File.read(( char*) &P, sizeof(P))) { if(P.TimeTaken()>50) P.Assignmarks(0) else P.Assignmarks(20) ______________ //statement 1 ______________ //statement 2 Record + + ; } File.close(); } If the function EnterPrac () is supposed to Allocate Marks for the records in the file MARKS.DAT based on their value of the member TimeTaken. Write C++ statements for the statement 1 and statement 2, where, statement 1 is required to position the file write pointer to an appropriate place in the file and statement 2 is to perform the write operation with the modified record. D3. Write functions in C++ to count the no of the words present in a text file 2 D4.Given a binary file TRAIN.DAT , containing records of the following class bus type. 3 class Train { int train_no; char destination[40]; int distance; //in km D5. Write a function in C++ that would read the contents of file TRAIN.DAT and display the details of those buses which travels the distance more than 1000 Km. 3 D6.Write a function readfile() to read all the records present in an already existing binary file SHIP.DAT and display them on the screen, also count the number of records present in the file. 3 E (a) Name member functions of fstream Class. 1 d. Write a function in C++ to count the number of uppercase alphabets present in a text file BOOK.txt 2 b. Differentiate Text file and Binary file 2

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 

Additional Info : Class 12 CBSE Pre Board 2016 : Computer Science (The Navodaya Academy, Namakkal)  

© 2010 - 2025 ResPaper. Terms of ServiceContact Us Advertise with us

 

sbhuvi chat