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

Size: px
Start display at page:

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

Transcription

1 Answer key SUBJECT : COMPUTER SCIENCE Time : 3 hour 15 min Max. marks : 70 I. Answer ALL the questions 10 x 1= What is DHTML? Dynamic HTML is a term used to describe the combination of HTML, style sheets and scripts that allows documents to be animated. 2. Define e-ecommerce. It refers to the trade of goods and services with the help of telecommunication and internet. 3. Define Local Area Networking. LAN is a network covering a small geographic area, like a home, office, or building. 4. Define the term topology of computer networks. Topology is the actual appearance or layout of networking. 5. Define data mining. The practice of examining large pre-existing databases in order to generate new information is called data mining. 6. How do you initialize a pointer variable? int *ptr, a; ptr = &a; 7. What is the significance of scope resolution operation in C++? When we declare the member function inside the class and define it outside the class, we must refer the class it belongs to. This is done using the scope resolution operator. 8. Name any one non-linear data structure. tree 9. Write the standard symbol for XOR gate. 10. Expand ISA. Industry Standard Architecture.

2 II. Answer any TEN questions 10 x 2 = Prove algebraically that (X + Y) (X + Z) = X + YZ LHS = (X + Y) (X + Z) = XX + XZ + YX + YZ = X + XZ + XY + YZ [XX=X] = X(1+Z+Y)+YZ [1+X=1] = X.1+YZ [X.1=X] = X+YZ = RHS 12. Give the general syntax for defining classes and objects. Syntax for defining class: class class_name { private: Member data Member functions protected: Member data Member functions public: Member data Member functions }; Syntax for defining objects: Class_name object_name; 13. What are minterms and maxterms? Minterm is a product of all the literals (with or without the bar) within the logic system. A maxterm is a sum of all the literals (with or without the bar) within the logic system. 14. Mention any two antivirus software. Kaspersky, McAFee 15. Write the syntax for delete and insert command in SQL. DELETE FROM table_name WHERE condition; INSERT INTO table_name VALUES (value1,value2,value3,...);

3 16. Write any two rules for constructors. The name of a constructor is same as that of class in which it is declared. Constructors do not have any return type, not even void. 17. Write any two member functions belonging to ofstream class. put(), write() 18. What are the advantages and disadvantages of ISAM? Advantages 1. It combines the best features of sequential access and direct access. 2. Permits quick access of records even when the number of records is very large. Disadvantages 1. It requires special software and is expensive. 2. Extra processing time is required to process the indexes. III. Answer any FIVE questions 5 x 3 = What is web hosting? Mention various web hosting services. Web hosting is a means of hosting web-server application on a computer system through which electronic content on the internet is readily available to any webbrowser client. Different types of web hosting services are free hosting, Virtual or shared hosting, Dedicated hosting, Collocation Hosting 20. What is meant by shareware? Write its limitations. Software for which license fee is payable after some time limit is called shareware. Disadvantage: Shareware cannot be modified, and it may be either a cut down or temporary version. Within the limit if the license fee is paid it cannot be used. 21. Explain relational data model with an example. In relational data model, data is organized in two-dimensional tables called relations.

4 The relational data model was developed by E.F Codd in DB2, MS-SQL Server is few of the popular relational DBMSs. Oracle, Sybase, 22. Give the functions of the following : a. get() - It reads a single character from the associated stream. b. getline() - It is used to read a whole line of text c. read() - It reads binary data from a file 23. Explain the use of new and delete operators in pointers. e is the key ord used to allo ate e ory dy a i ally at the ti e of program execution. E.g.: int *ptr = new int; delete key ord is used to u allo ated e ory allo ated dy a i ally. E.g.: int *ptr = new int; delete ptr; 24. What is stack? Write an algorithm for POP operation. Stack is an ordered collection of items where addition and deletion take place at the same end. Algorithm for POP Operation Step 1: If TOP = -1 then P INT ta k is e pty Exit End of If Step 2: ITEM = STACK[TOP] Step 3: TOP = TOP 1 Step 4: Return 25. Draw the logic diagram and truth table for 2 input XOR gate.

5 26. Expand UPS. Explain the types of UPS. Uninterruptible Power Supply There are two types of UPS. Online UPS and Standby UPS. Online UPS: An online UPS avoids those momentary power lapses by continuously providing power from its own inverter, even when the power line is functioning well. Standby UPS: A standby UPS (or Off-line UPS) monitor the power line and switches to battery power as soon as it detects a problem. The switch over process may take several milliseconds during which system is not receiving any power. IV. Answer any SEVEN questions 7 x 5 = Write an algorithm to insert an element into a queue. Algorithm to insert element in queue Step 1: Step 2: Step 3: Step 4: If REAR = N-1 Then P INT O erflo Exit End of IF If FRONT = NULL Then FRONT = 0 REAR = 0 Else REAR = REAR + 1 QUEUE[REAR] = ITEM Return

6 28. Write an algorithm for insertion sort method. Algorithm for insertion sort: Step 1 : for (i = 1 to N-1) Step 2 : j= i Step 3 : while(j>=1) If (A[j] < A[j-1] Temp = A[j] A[j] = A[j-1] A[j-1] = Temp [End if] j=j-1 [End of while loop] [End of for loop] Step 4 : Exit 29. Using K-map, simplify the following expression in four variables: F(A, B, C, D) = m1+m2+m4+m5+m9+ m11+m12+m13 Quad 1: Reduced term B Quad 2: Reduced term C Pair 1 : Reduced term A D Which couldn t be paired : C Final reduced term B + C + A D + C 30. Write the rules to be followed in writing constructor function in C++. a. The name of a constructor is same as that of class in which it is declared.

7 b. Constructors do not have any return type, not even void. c. Constructors are always defined in the public section of the class. d. Like other C++ functions, constructors can also have default arguments. e. It is not possible to refer to the address of a constructor. 31. Describe briefly the use of friend function in C++ with syntax and example. A friend function is a non-member function of a class which gets access to private, protected and public data of a class. It is declared within a class with the prefix friend. If there is a situation where an outside function must get access to members of one or more class we can implement it by declaring that function as friend in side those functions Syntax: class class_name { Member declarations; friend return_type function_name(parameter list); }; Example: class Husband { private: int salary; public: void read() { cin >> salary; } friend int total(husband, Wife); }; 32. Explain defining objects of a class with syntax and a programming example. Memory is allocated only when the object is created. All operations related to class are done using object. Following is the syntax for declaration of object. class_name object_name1, object_name2,...; Example: class number { private: int num;

8 public: void read() { cin>>num; } }; void main() { number N1, N2, N3; //objects of the class number }; 33. Define object oriented programming. Write the limitations of object oriented programming. Object Oriented Programming (OOP) can be defined as a programming paradigm that represe ts o epts as o je ts that ha e data fields a d asso iated procedures known as methods. Limitations: a) No set standards: Object oriented programming software is not having set standards. b) Less reality: To convert a real world problem into an object oriented model is difficult. c) Classed are overly generalized: With Object oriented programming, classed are overly generalized. d) Program design difficult and tricky: Adaptability of flow diagrams and Object oriented programming is a complex process. This makes program design difficult and tricky. e) Needs to think in terms of objects: Programmer needs skill to think in terms of objects. 34. Explain network securities in detail. Network security is to make sure that only legal or authorized user and programs gain access to resources in the network. Some of the problem that may occur are: 1) Physical Security holes-when individuals gain unauthorized physical access to a computer. 2) Software Security holes-when badly written programs are doing things that they should not be doing.

9 3) Inconsistent usage holes-when the system administrator assembles a combination of hardware and software but it is seriously imperfect from a security point of view. 35. Describe any five logical operators available in SQL. IN "Equivalent to any member of" test. Equivalent to "= ANY". SELECT * FROM EMP WHERE ENAME IN ('SMITH', 'WARD'); ANY NOT IN ALL [NOT] BETWEEN x and y Compares a value to each value in a list or returned by a query. Must be preceded by =,!=, >, <, <=, or >=. Evaluates to FALSE if the query returns no rows. Equivalent to "!= ANY". Evaluates to FALSE if any member of the set is NULL. Compares a value with every value in a list or returned by a query. Must be preceded by =,!=, >, <, <=, or >=. Evaluates to TRUE if the query returns no rows. [Not] greater than or equal to x and less than or equal to y. SELECT * FROM DEPT WHERE LOC = ANY ('NEW YORK','DALLAS'); SELECT * FROM DEPT WHERE LOC NOT IN ('NEW YORK', 'DALLAS'); SELECT * FROM emp WHERE sal >= ALL (1400, 3000); SELECT ENAME, JOB FROM EMP WHERE SAL BETWEEN 3000 AND 5000; 36. Write the difference between Manual and Electronic Data Processing. Manual data processing Electronic data processing 1. For a given time, the data that can Large volume of data can be be processed is less in volume processed within a short period. 2. Manual data processing requires large quantity of paper. 3. The speed and accuracy at which the job is executed is limited 4. Since a lot of manual processing is involved the cost of labour is high. 5. Storage medium is paper. It makes the data processing work more Computers eliminate the usage of papers. Reasonably very less amount of paper will be used. The job executed is faster and accurate. Labour cost is economical as the number of staff required is less. Storage medium is secondary storage devices that can hold huge

10 tedious and tiresome amount of data. 37. Explain briefly the types of inheritance. 1) Single inheritance: If a class is derived from a single base class, it is calls as single inheritance. 2) Multilevel inheritance The classes can also be derived from the classes that are already derived. This type of inheritance is called multilevel inheritance. 3) Multiple inheritance If s class is derived from more than one base class, it is known as multiple inheritance. 4) Hierarchical inheritance If more than one classes are inherited from a base class, it is called as hierarchical inheritance. 5) Hybrid inheritance Combination of more than one form of inheritance is known as hybrid inheritance.

11 xxx

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

Answer key SUBJECT : COMPUTER SCIENCE Time : 3 hour 15 min Max. marks : 70 Answer key SUBJECT : COMPUTER SCIENCE Time : 3 hour 5 min Max. marks : 7 I. Answer ALL the questions x =. Expand the term DDRRAM. Double Data Rate Random Access Memory 2. Write the standard symbol for

More information

SCIENCE ENTRANCE ACADEMY III PREPARATORY EXAMINATION SCHEME OF VALUATION

SCIENCE ENTRANCE ACADEMY III PREPARATORY EXAMINATION SCHEME OF VALUATION Computer Science (4) Q.NO Expand SCSI Small computer system interface PART-A Name the gate which produces output 0, if there are even numbers of s in the input XOR What is complete tree? Tree in which

More information

COMPUTER APPLICATION

COMPUTER APPLICATION Total No. of Printed Pages 16 HS/XII/A.Sc.Com/CAP/14 2 0 1 4 COMPUTER APPLICATION ( Science / Arts / Commerce ) ( Theory ) Full Marks : 70 Time : 3 hours The figures in the margin indicate full marks for

More information

Government of Karnataka SYLLABUS FOR SECOND PUC - COMPUTER SCIENCE (41) SUB-UNITS

Government of Karnataka SYLLABUS FOR SECOND PUC - COMPUTER SCIENCE (41) SUB-UNITS SL No NAME OF THE UNIT/CHAPTER 1 Typical configuration of Computer system Organisation 5 Hrs/ 4 Marks BOOLEAN ALGEBRA 15 Hrs/ 13 Marks Government of Karnataka SYLLABUS FOR 014-015 SECOND PUC - COMPUTER

More information

ONE MARKS QUESTION AND ANSWERS

ONE MARKS QUESTION AND ANSWERS ONE MARKS QUESTION AND ANSWERS Question No 1 Typical Configuration of Computer System: 1. What is a motherboard? The motherboard is the most important circuit board of the computer; all the components

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

COMPUTER SCIENCE PAPER 1

COMPUTER SCIENCE PAPER 1 COMPUTER SCIENCE PAPER 1 (THEORY) (Maximum Marks: 70) (Time allowed: Three hours) (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time.)

More information

COMPUTER SCIENCE Paper 1

COMPUTER SCIENCE Paper 1 COMPUTER SCIENCE Paper 1 (THEORY) (Three hours) Maximum Marks: 70 (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time) -----------------------------------------------------------------------------------------------------------------------

More information

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 DATA STRUCTURE

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 DATA STRUCTURE TED (10)-3071 Reg. No.. (REVISION-2010) Signature. FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours (Maximum marks: 100)

More information

Databases - 4. Other relational operations and DDL. How to write RA expressions for dummies

Databases - 4. Other relational operations and DDL. How to write RA expressions for dummies Databases - 4 Other relational operations and DDL How to write RA expressions for dummies Step 1: Identify the relations required and CP them together Step 2: Add required selections to make the CP Step

More information

OBJECT ORIENTED PROGRAMMING USING C++ CSCI Object Oriented Analysis and Design By Manali Torpe

OBJECT ORIENTED PROGRAMMING USING C++ CSCI Object Oriented Analysis and Design By Manali Torpe OBJECT ORIENTED PROGRAMMING USING C++ CSCI 5448- Object Oriented Analysis and Design By Manali Torpe Fundamentals of OOP Class Object Encapsulation Abstraction Inheritance Polymorphism Reusability C++

More information

Time : 3 hours. Full Marks : 75. Own words as far as practicable. The questions are of equal value. Answer any five questions.

Time : 3 hours. Full Marks : 75. Own words as far as practicable. The questions are of equal value. Answer any five questions. XEV (H-3) BCA (6) 2 0 1 0 Time : 3 hours Full Marks : 75 Candidates are required to give their answers in their Own words as far as practicable. The questions are of equal value. Answer any five questions.

More information

CS/IT DIGITAL LOGIC DESIGN

CS/IT DIGITAL LOGIC DESIGN CS/IT 214 (CR) Total No. of Questions :09] [Total No. of Pages : 02 II/IV B.Tech. DEGREE EXAMINATIONS, DECEMBER- 2016 First Semester CS/IT DIGITAL LOGIC DESIGN Time: Three Hours 1. a) Flip-Flop Answer

More information

MODEL PAPER -1 PART-A. 3.Define an array? An array is a linear data structure contain homogeneous data elements with a common name.

MODEL PAPER -1 PART-A. 3.Define an array? An array is a linear data structure contain homogeneous data elements with a common name. 1.Expand PCI? Pheripheral component interconnect MODEL PAPER -1 PART-A 2.What do you understand by the truth function? A truth function is a function formed using set of truth values. 3.Define an array?

More information

I BCS-031 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination. June, 2015 BCS-031 : PROGRAMMING IN C ++

I BCS-031 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination. June, 2015 BCS-031 : PROGRAMMING IN C ++ No. of Printed Pages : 3 I BCS-031 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination 05723. June, 2015 BCS-031 : PROGRAMMING IN C ++ Time : 3 hours Maximum Marks : 100 (Weightage 75%)

More information

M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following.

M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following. Paper I INFORMATION TECHNOLOGY Answer any THREE of the following. 1. Explain Architecture of computer in detail. 2. Explain in detail about Input and Output technologies. 3. What is MODEM? What factors

More information

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

Page. No. 1/15 CS201 Introduction to Programmming Solved Subjective Questions From spring 2010 Final Term Papers By vuzs Team Page. No. 1/15 CS201 Introduction to Programmming Solved Subjective Questions From spring 2010 Final Term Papers By vuzs Team Question No: 1 ( Marks: 2 ) Write a declaration statement for an array of 10

More information

Standard Forms of Expression. Minterms and Maxterms

Standard Forms of Expression. Minterms and Maxterms Standard Forms of Expression Minterms and Maxterms Standard forms of expressions We can write expressions in many ways, but some ways are more useful than others A sum of products (SOP) expression contains:

More information

PROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (8)

PROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (8) B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2009 EC 2202 DATA STRUCTURES AND OBJECT ORIENTED Time: Three hours PROGRAMMING IN C++ Answer ALL questions Maximum: 100 Marks 1. When do we declare a

More information

Short Notes of CS201

Short Notes of CS201 #includes: Short Notes of CS201 The #include directive instructs the preprocessor to read and include a file into a source code file. The file name is typically enclosed with < and > if the file is a system

More information

CS201 - Introduction to Programming Glossary By

CS201 - Introduction to Programming Glossary By CS201 - Introduction to Programming Glossary By #include : The #include directive instructs the preprocessor to read and include a file into a source code file. The file name is typically enclosed with

More information

CERTIFICATE IN WEB PROGRAMMING

CERTIFICATE IN WEB PROGRAMMING COURSE DURATION: 6 MONTHS CONTENTS : CERTIFICATE IN WEB PROGRAMMING 1. PROGRAMMING IN C and C++ Language 2. HTML/CSS and JavaScript 3. PHP and MySQL 4. Project on Development of Web Application 1. PROGRAMMING

More information

IMPORTANT QUESTIONS WITH ANSWERS FOR II PU FINAL EXAMINATION

IMPORTANT QUESTIONS WITH ANSWERS FOR II PU FINAL EXAMINATION IMPORTANT QUESTIONS WITH ANSWERS FOR II PU FINAL EXAMINATION Chapter 1: Configuring a computer system ONE mark questions 1. What is a motherboard? Ans.: A Printed Circuit Board (PCB) used to connect all

More information

RAJIV GANDHI COLLEGE OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY OBJECT ORIENTED PROGRAMMING QUESTION BANK UNIT I 2 MARKS

RAJIV GANDHI COLLEGE OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY OBJECT ORIENTED PROGRAMMING QUESTION BANK UNIT I 2 MARKS RAJIV GANDHI COLLEGE OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY OBJECT ORIENTED PROGRAMMING YEAR/SEM:II & III UNIT I 1) Give the evolution diagram of OOPS concept. 2) Give some

More information

CS201 Latest Solved MCQs

CS201 Latest Solved MCQs Quiz Start Time: 09:34 PM Time Left 82 sec(s) Question # 1 of 10 ( Start time: 09:34:54 PM ) Total Marks: 1 While developing a program; should we think about the user interface? //handouts main reusability

More information

5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register

5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register General Concepts 1. (a) What are combinational circuits? (b) Perform the following: (i) Convert (0.5625) 10 = ( ) 2 (ii) (010010) 2 (100011) 2 = ( ) 2 2. (a) Using truth table prove that A B= A+ B (b)

More information

double d0, d1, d2, d3; double * dp = new double[4]; double da[4];

double d0, d1, d2, d3; double * dp = new double[4]; double da[4]; All multiple choice questions are equally weighted. You can generally assume that code shown in the questions is intended to be syntactically correct, unless something in the question or one of the answers

More information

ISC 2008 COMPUTER SCIENCE PAPER 1 THEORY PART I Answer all questions in this part Question 1. a) State the two complement properties of Boolean Algebra. Verify any one of them using the truth table. b)

More information

UNIT-4 BOOLEAN LOGIC. NOT Operator Operates on single variable. It gives the complement value of variable.

UNIT-4 BOOLEAN LOGIC. NOT Operator Operates on single variable. It gives the complement value of variable. UNIT-4 BOOLEAN LOGIC Boolean algebra is an algebra that deals with Boolean values((true and FALSE). Everyday we have to make logic decisions: Should I carry the book or not?, Should I watch TV or not?

More information

NULLs & Outer Joins. Objectives of the Lecture :

NULLs & Outer Joins. Objectives of the Lecture : Slide 1 NULLs & Outer Joins Objectives of the Lecture : To consider the use of NULLs in SQL. To consider Outer Join Operations, and their implementation in SQL. Slide 2 Missing Values : Possible Strategies

More information

IMPORTANT QUESTIONS IN C FOR THE INTERVIEW

IMPORTANT QUESTIONS IN C FOR THE INTERVIEW IMPORTANT QUESTIONS IN C FOR THE INTERVIEW 1. What is a header file? Header file is a simple text file which contains prototypes of all in-built functions, predefined variables and symbolic constants.

More information

4. BOOLEAN ALGEBRA 8 5. NETWORKING AND OPEN SOURCE SOFTWARE 10

4. BOOLEAN ALGEBRA 8 5. NETWORKING AND OPEN SOURCE SOFTWARE 10 SPLIT UP SYLLABUS SUBJECT : COMPUTER SCIENCE (083) SESSION:2014-15 Class XII (Theory) - C++ Duration: 3 hours Total Marks: 70 Unit No. Unit Name MARKS 1 OBJECT ORIENTED PROGRAMMING IN C++. 2. DATA STRUCTURE

More information

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

SPLIT-UP SYLLABUS ----CHENNAI REGION COMPUTER SCIENCE (Code: 083) Class-XII Academic Session SPLIT-UP SYLLABUS ----CHENNAI REGION COMPUTER SCIENCE (Code: 083) Class-XII Academic Session 2008-09 Sr.No. Duration Number of Working Days From To Topic to be Covered Nos. of Periods required CAL/TAL

More information

Classes. Logical method to organise data and functions in a same structure. Also known as abstract data type (ADT).

Classes. Logical method to organise data and functions in a same structure. Also known as abstract data type (ADT). UNITII Classes Logical method to organise data and functions in a same structure. Also known as abstract data type (ADT). It s a User Defined Data-type. The Data declared in a Class are called Data- Members

More information

Introduction to Computers and C++ Programming p. 1 Computer Systems p. 2 Hardware p. 2 Software p. 7 High-Level Languages p. 8 Compilers p.

Introduction to Computers and C++ Programming p. 1 Computer Systems p. 2 Hardware p. 2 Software p. 7 High-Level Languages p. 8 Compilers p. Introduction to Computers and C++ Programming p. 1 Computer Systems p. 2 Hardware p. 2 Software p. 7 High-Level Languages p. 8 Compilers p. 9 Self-Test Exercises p. 11 History Note p. 12 Programming and

More information

Jayaram college of Engineering and Technology, Pagalavadi. CS2203 Object Oriented Programming Question Bank Prepared By: S.Gopalakrishnan, Lecturer/IT

Jayaram college of Engineering and Technology, Pagalavadi. CS2203 Object Oriented Programming Question Bank Prepared By: S.Gopalakrishnan, Lecturer/IT CS2203 Object Oriented Programming Question Bank Prepared By: S.Gopalakrishnan, Lecturer/IT Two Mark Questions UNIT - I 1. DEFINE ENCAPSULATION. Encapsulation is the process of combining data and functions

More information

PART - I 75 x 1 = The building blocks of C++ program are (a) functions (b) classes (c) statements (d) operations

PART - I 75 x 1 = The building blocks of C++ program are (a) functions (b) classes (c) statements (d) operations OCTOBER 2007 COMPUTER SCIENCE Choose the best answer: PART - I 75 x 1 = 75 1. Which of the following functions will be executed first automatically, when a C++ Program is (a) void (b) Main (c) Recursive

More information

Software Engineering 2DA4. Slides 2: Introduction to Logic Circuits

Software Engineering 2DA4. Slides 2: Introduction to Logic Circuits Software Engineering 2DA4 Slides 2: Introduction to Logic Circuits Dr. Ryan Leduc Department of Computing and Software McMaster University Material based on S. Brown and Z. Vranesic, Fundamentals of Digital

More information

University of Baghdad College of Science Department of Computer Science األسم الكامل: High Diploma Qualification Exam Date: 13 Aug Time: 3 hrs.

University of Baghdad College of Science Department of Computer Science األسم الكامل: High Diploma Qualification Exam Date: 13 Aug Time: 3 hrs. University of Baghdad College of Science Department of Computer Science األسم الكامل: High Diploma Qualification Exam Date: 13 Aug. 2015 Time: 3 hrs. Notes: Answer All Questions. Answer in English. It

More information

Programming the Database

Programming the Database Programming the Database Today s Lecture 1. Stored Procedures 2. Functions BBM471 Database Management Systems Dr. Fuat Akal akal@hacettepe.edu.tr 3. Cursors 4. Triggers 5. Dynamic SQL 2 Stored Procedures

More information

Problem Solving with C++

Problem Solving with C++ GLOBAL EDITION Problem Solving with C++ NINTH EDITION Walter Savitch Kendrick Mock Ninth Edition PROBLEM SOLVING with C++ Problem Solving with C++, Global Edition Cover Title Copyright Contents Chapter

More information

JAYARAM COLLEGE OF ENGINEERING AND TECHNOLOGY Pagalavadi, Tiruchirappalli (An approved by AICTE and Affiliated to Anna University)

JAYARAM COLLEGE OF ENGINEERING AND TECHNOLOGY Pagalavadi, Tiruchirappalli (An approved by AICTE and Affiliated to Anna University) Estd: 1994 JAYARAM COLLEGE OF ENGINEERING AND TECHNOLOGY Pagalavadi, Tiruchirappalli - 621014 (An approved by AICTE and Affiliated to Anna University) ISO 9001:2000 Certified Subject Code & Name : CS 1202

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

Absolute C++ Walter Savitch

Absolute C++ Walter Savitch Absolute C++ sixth edition Walter Savitch Global edition This page intentionally left blank Absolute C++, Global Edition Cover Title Page Copyright Page Preface Acknowledgments Brief Contents Contents

More information

Menu. Algebraic Simplification - Boolean Algebra EEL3701 EEL3701. MSOP, MPOS, Simplification

Menu. Algebraic Simplification - Boolean Algebra EEL3701 EEL3701. MSOP, MPOS, Simplification Menu Minterms & Maxterms SOP & POS MSOP & MPOS Simplification using the theorems/laws/axioms Look into my... 1 Definitions (Review) Algebraic Simplification - Boolean Algebra Minterms (written as m i ):

More information

WYSE Academic Challenge Regional Computer Science 2008 Solution Set

WYSE Academic Challenge Regional Computer Science 2008 Solution Set 1. Correct answer: C. WYSE Academic Challenge Regional 2008 Solution Set 8 bits are sent at each clock cycle and there are 1,000,000 cycles per second, so 8,000,000 bits per second or 1,000,000 bytes per

More information

22316 Course Title : Object Oriented Programming using C++ Max. Marks : 70 Time: 3 Hrs.

22316 Course Title : Object Oriented Programming using C++ Max. Marks : 70 Time: 3 Hrs. Scheme I Sample Question Paper Program Name : Computer Engineering Program Group Program Code : CO/CM/IF/CW Semester : Third 22316 Course Title : Object Oriented Programming using C++ Max. Marks : 70 Time:

More information

XII CS(EM) Minimum Question List N.KANNAN M.Sc., B.Ed COMPUTER SCIENCE IMPORTANT QUESTION (TWO MARKS) CHAPTER 1 TO 5 ( STAR OFFICE WRITER)

XII CS(EM) Minimum Question List N.KANNAN M.Sc., B.Ed COMPUTER SCIENCE IMPORTANT QUESTION (TWO MARKS) CHAPTER 1 TO 5 ( STAR OFFICE WRITER) COMPUTER SCIENCE IMPORTANT QUESTION (TWO MARKS) CHAPTER 1 TO 5 ( STAR OFFICE WRITER) 1. Selecting text with keyboard 2. Differ copying and moving 3. Text Editing 4. Creating a bulleted list 5. Creating

More information

Come and join us at WebLyceum

Come and join us at WebLyceum Come and join us at WebLyceum For Past Papers, Quiz, Assignments, GDBs, Video Lectures etc Go to http://www.weblyceum.com and click Register In Case of any Problem Contact Administrators Rana Muhammad

More information

M1-R4: Programing and Problem Solving using C (JAN 2019)

M1-R4: Programing and Problem Solving using C (JAN 2019) M1-R4: Programing and Problem Solving using C (JAN 2019) Max Marks: 100 M1-R4-07-18 DURATION: 03 Hrs 1. Each question below gives a multiple choice of answers. Choose the most appropriate one and enter

More information

ISC 2007 COMPUTER SCIENCE PAPER 1 THEORY PART I Answer all questions in this part

ISC 2007 COMPUTER SCIENCE PAPER 1 THEORY PART I Answer all questions in this part ISC 2007 COMPUTER SCIENCE PAPER 1 THEORY PART I Answer all questions in this part Question 1. a) Simplify the following Boolean expression using laws of Boolean Algebra. At each step state clearly the

More information

Department of Computer science and Engineering Sub. Name: Object oriented programming and data structures Sub. Code: EC6301 Sem/Class: III/II-ECE Staff name: M.Kavipriya Two Mark Questions UNIT-1 1. List

More information

Duration: 2 hours Max. Marks: 60

Duration: 2 hours Max. Marks: 60 I. (a) Determine the number of positive integers n where 1 and n is not divisible by 2 or 3 or. (b) How many integers between 1 and 2000 are divisible by 2, 3, or 7? (c) Let S = {1, 2, 3, 4,, 6, 7, 8,

More information

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

PART I. Answer all questions in this Part. While answering questions in this Part, indicate briefly your working and reasoning, wherever required. COMPUTER SCIENCE 2008 Paper-1 (THEORY) Three hours (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time) Answer all question in Part I

More information

OBJECT ORIENTED PROGRAMMING. Ms. Ajeta Nandal C.R.Polytechnic,Rohtak

OBJECT ORIENTED PROGRAMMING. Ms. Ajeta Nandal C.R.Polytechnic,Rohtak OBJECT ORIENTED PROGRAMMING Ms. Ajeta Nandal C.R.Polytechnic,Rohtak OBJECT ORIENTED PARADIGM Object 2 Object 1 Data Data Function Function Object 3 Data Function 2 WHAT IS A MODEL? A model is an abstraction

More information

QUESTION BANK FOR TEST

QUESTION BANK FOR TEST CSCI 2121 Computer Organization and Assembly Language PRACTICE QUESTION BANK FOR TEST 1 Note: This represents a sample set. Please study all the topics from the lecture notes. Question 1. Multiple Choice

More information

Chapter 2 Boolean algebra and Logic Gates

Chapter 2 Boolean algebra and Logic Gates Chapter 2 Boolean algebra and Logic Gates 2. Introduction In working with logic relations in digital form, we need a set of rules for symbolic manipulation which will enable us to simplify complex expressions

More information

BCA (Part II) EXAMINATION, 2009 C++ PROGRAMMING Time allowed: Three Hours Maximum Marks: 50 Attempt any five questions

BCA (Part II) EXAMINATION, 2009 C++ PROGRAMMING Time allowed: Three Hours Maximum Marks: 50 Attempt any five questions C++ PROGRAMMING Attempt any five questions 1. (a) What is encapsulation? Why is data considered safe if encapsulated? How are the terms abstraction and encapsulation related. 4 (b) What do you understand

More information

Seat No. Total No. of Questions : 6] [Total No. of Printed Pages : 2 [4189]-101. P. G. D. C. M. (Semester - I) Examination

Seat No. Total No. of Questions : 6] [Total No. of Printed Pages : 2 [4189]-101. P. G. D. C. M. (Semester - I) Examination Seat No. Total No. of Questions : 6] [Total No. of Printed Pages : 2 [4189]-101 P. G. D. C. M. (Semester - I) Examination - 2012 ELEMENTS OF INFORMATION TECHNOLOGY AND OFFICE AUTOMATION (2008 Pattern)

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

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

Quiz Start Time: 09:34 PM Time Left 82 sec(s) Quiz Start Time: 09:34 PM Time Left 82 sec(s) Question # 1 of 10 ( Start time: 09:34:54 PM ) Total Marks: 1 While developing a program; should we think about the user interface? //handouts main reusability

More information

If the function modify( ) is supposed to change the mark of a student having student_no y in the file student.dat, write the missing statements to modify the student record. 10. Observe the program segment

More information

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

3.Constructors and Destructors. Develop cpp program to implement constructor and destructor. 3.Constructors and Destructors Develop cpp program to implement constructor and destructor. Constructors A constructor is a special member function whose task is to initialize the objects of its class.

More information

Review: Standard forms of expressions

Review: Standard forms of expressions Karnaugh maps Last time we saw applications of Boolean logic to circuit design. The basic Boolean operations are AND, OR and NOT. These operations can be combined to form complex expressions, which can

More information

Note: Select one full question from each unit

Note: Select one full question from each unit P.E.S COLLEGE OF ENGINEERING, MANDYA-571401 (An Autonomous Institution Under VTU Belgaum) Department of Master of Computer Applications Model Question Paper Data Structures Using C (P18MCA21) Credits :

More information

UNIVERSITY OF SWAZILAND

UNIVERSITY OF SWAZILAND UNIVERSITY OF SWAZILAND DEPARTMENT OF COMPUTER SCIENCE CSC242 - OBJECT ORIENTED PROGRAMMING FINAL EXAMINATION MAY 2017 Instructions 1. The time allowed is THREE (3) H0URS. 2. Read all the questions in

More information

B.Tech II Year I Semester (R13) Regular Examinations December 2014 DIGITAL LOGIC DESIGN

B.Tech II Year I Semester (R13) Regular Examinations December 2014 DIGITAL LOGIC DESIGN B.Tech II Year I Semester () Regular Examinations December 2014 (Common to IT and CSE) (a) If 1010 2 + 10 2 = X 10, then X is ----- Write the first 9 decimal digits in base 3. (c) What is meant by don

More information

Experiment 3: Logic Simplification

Experiment 3: Logic Simplification Module: Logic Design Name:... University no:.. Group no:. Lab Partner Name: Mr. Mohamed El-Saied Experiment : Logic Simplification Objective: How to implement and verify the operation of the logical functions

More information

Boolean algebra. June 17, Howard Huang 1

Boolean algebra. June 17, Howard Huang 1 Boolean algebra Yesterday we talked about how analog voltages can represent the logical values true and false. We introduced the basic Boolean operations AND, OR and NOT, which can be implemented in hardware

More information

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

KENDRIYA VIDYALAYA SANGATHAN, KOLKATA REGION SPLIT-UP SYLLABUS ( ) CLASS XII : COMPUTER SCIENCE (THEORY) KENDRIYA VIDYALAYA SANGATHAN, KOLKATA REGION SPLIT-UP SYLLABUS (2017-) CLASS XII : COMPUTER SCIENCE (THEORY) MONTH PORTION TO BE COVERED THEORY PRACTICAL APRIL- MAY Unit 1 Object Oriented Programming in

More information

P.G.D.C.M. (Semester I) Examination, : ELEMENTS OF INFORMATION TECHNOLOGY AND OFFICE AUTOMATION (2008 Pattern)

P.G.D.C.M. (Semester I) Examination, : ELEMENTS OF INFORMATION TECHNOLOGY AND OFFICE AUTOMATION (2008 Pattern) *4089101* [4089] 101 P.G.D.C.M. (Semester I) Examination, 2011 101 : ELEMENTS OF INFORMATION TECHNOLOGY AND OFFICE AUTOMATION (2008 Pattern) Time : 3 Hours Max. Marks : 70 Note : 1) Q. 1 is compulsory.

More information

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR 603203 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS QUESTION BANK (2017-2018) Course / Branch : M.Sc CST Semester / Year : EVEN / II Subject Name

More information

FORM 2 (Please put your name and form # on the scantron!!!!)

FORM 2 (Please put your name and form # on the scantron!!!!) CS 161 Exam 2: FORM 2 (Please put your name and form # on the scantron!!!!) True (A)/False(B) (2 pts each): 1. Recursive algorithms tend to be less efficient than iterative algorithms. 2. A recursive function

More information

Databases - 5. Problems with the relational model Functions and sub-queries

Databases - 5. Problems with the relational model Functions and sub-queries Databases - 5 Problems with the relational model Functions and sub-queries Problems (1) To store information about real life entities, we often have to cut them up into separate tables Problems (1) To

More information

Introduction to Programming Using Java (98-388)

Introduction to Programming Using Java (98-388) Introduction to Programming Using Java (98-388) Understand Java fundamentals Describe the use of main in a Java application Signature of main, why it is static; how to consume an instance of your own class;

More information

Interview Questions of C++

Interview Questions of C++ Interview Questions of C++ Q-1 What is the full form of OOPS? Ans: Object Oriented Programming System. Q-2 What is a class? Ans: Class is a blue print which reflects the entities attributes and actions.

More information

Syllabus for Computer Science General Part I

Syllabus for Computer Science General Part I Distribution of Questions: Part I Q1. (Compulsory: 20 marks). Any ten questions to be answered out of fifteen questions, each carrying two marks (Group A 3 questions, Group B, Group C and Group D 4 questions

More information

CHRIST THE KING BOYS MATRIC HR. SEC. SCHOOL, KUMBAKONAM CHAPTER 9 C++

CHRIST THE KING BOYS MATRIC HR. SEC. SCHOOL, KUMBAKONAM CHAPTER 9 C++ CHAPTER 9 C++ 1. WRITE ABOUT THE BINARY OPERATORS USED IN C++? ARITHMETIC OPERATORS: Arithmetic operators perform simple arithmetic operations like addition, subtraction, multiplication, division etc.,

More information

Part III. Data Modelling. Marc H. Scholl (DBIS, Uni KN) Information Management Winter 2007/08 1

Part III. Data Modelling. Marc H. Scholl (DBIS, Uni KN) Information Management Winter 2007/08 1 Part III Data Modelling Marc H. Scholl (DBIS, Uni KN) Information Management Winter 2007/08 1 Outline of this part (I) 1 Introduction to the Relational Model and SQL Relational Tables Simple Constraints

More information

Algorithms & Data Structures

Algorithms & Data Structures GATE- 2016-17 Postal Correspondence 1 Algorithms & Data Structures Computer Science & Information Technology (CS) 20 Rank under AIR 100 Postal Correspondence Examination Oriented Theory, Practice Set Key

More information

C Language Part 2 Digital Computer Concept and Practice Copyright 2012 by Jaejin Lee

C Language Part 2 Digital Computer Concept and Practice Copyright 2012 by Jaejin Lee C Language Part 2 (Minor modifications by the instructor) 1 Scope Rules A variable declared inside a function is a local variable Each local variable in a function comes into existence when the function

More information

Recharge (int, int, int); //constructor declared void disply();

Recharge (int, int, int); //constructor declared void disply(); Constructor and destructors in C++ Constructor Constructor is a special member function of the class which is invoked automatically when new object is created. The purpose of constructor is to initialize

More information

Gate-Level Minimization. BME208 Logic Circuits Yalçın İŞLER

Gate-Level Minimization. BME208 Logic Circuits Yalçın İŞLER Gate-Level Minimization BME28 Logic Circuits Yalçın İŞLER islerya@yahoo.com http://me.islerya.com Complexity of Digital Circuits Directly related to the complexity of the algebraic expression we use to

More information

Venkateshwar International School Sector-18, Dwarka, New Delhi-78 SAT- PRELIMINARY ROUND Class XII

Venkateshwar International School Sector-18, Dwarka, New Delhi-78 SAT- PRELIMINARY ROUND Class XII Venkateshwar International School Sector-18, Dwarka, New Delhi-78 SAT- PRELIMINARY ROUND Class XII Computer Science MMWT Total (40) Name of the student School Code M.M : 20 COMPUTER SCIENCE 1. A is a special

More information

Sri Vidya College of Engineering & Technology

Sri Vidya College of Engineering & Technology UNIT I INTRODUCTION TO OOP AND FUNDAMENTALS OF JAVA 1. Define OOP. Part A Object-Oriented Programming (OOP) is a methodology or paradigm to design a program using classes and objects. It simplifies the

More information

ASSIGNMENT-1 M.Sc. DEGREE EXAMINATION, MAY 2018 (First Year) INFORMATION TECHNOLOGY Basics of Information Technology

ASSIGNMENT-1 M.Sc. DEGREE EXAMINATION, MAY 2018 (First Year) INFORMATION TECHNOLOGY Basics of Information Technology ASSIGNMENT-1 () Basics of Information Technology (DMSIT01) Q1) Discuss in detail about IT support at different organizational levels. Q2) Explain about hierarchy of computers. Q3) Discuss different categories

More information

CSc 453 Intermediate Code Generation

CSc 453 Intermediate Code Generation CSc 453 Intermediate Code Generation Saumya Debray The University of Arizona Tucson Overview Intermediate representations span the gap between the source and target languages: closer to target language;

More information

M.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75

M.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75 M.C.A. DEGREE EXAMINATION, MAY - 2013 First Year Paper - I : INFORMATION TECHNOLOGY (DMCA 101) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer any Three of the following 1) What is the

More information

CS February 17

CS February 17 Discrete Mathematics CS 26 February 7 Equal Boolean Functions Two Boolean functions F and G of degree n are equal iff for all (x n,..x n ) B, F (x,..x n ) = G (x,..x n ) Example: F(x,y,z) = x(y+z), G(x,y,z)

More information

CHAPTER 1 Introduction to Computers and Programming CHAPTER 2 Introduction to C++ ( Hexadecimal 0xF4 and Octal literals 031) cout Object

CHAPTER 1 Introduction to Computers and Programming CHAPTER 2 Introduction to C++ ( Hexadecimal 0xF4 and Octal literals 031) cout Object CHAPTER 1 Introduction to Computers and Programming 1 1.1 Why Program? 1 1.2 Computer Systems: Hardware and Software 2 1.3 Programs and Programming Languages 8 1.4 What is a Program Made of? 14 1.5 Input,

More information

ADMINISTRATIVE MANAGEMENT COLLEGE

ADMINISTRATIVE MANAGEMENT COLLEGE First Semester ADMINISTRATIVE MANAGEMENT COLLEGE BACHELOR OF COMPUTER APPLICATION COURSE OUTCOME (CO) Problem solving techniques Using C CO 1: Understand the basic concepts of programming, software and

More information

Gate Level Minimization Map Method

Gate Level Minimization Map Method Gate Level Minimization Map Method Complexity of hardware implementation is directly related to the complexity of the algebraic expression Truth table representation of a function is unique Algebraically

More information

Object-Oriented Programming

Object-Oriented Programming Object-Oriented Programming 1. What is object-oriented programming (OOP)? OOP is a technique to develop logical modules, such as classes that contain properties, methods, fields, and events. An object

More information

KOM3191 Object Oriented Programming Dr Muharrem Mercimek OPERATOR OVERLOADING. KOM3191 Object-Oriented Programming

KOM3191 Object Oriented Programming Dr Muharrem Mercimek OPERATOR OVERLOADING. KOM3191 Object-Oriented Programming KOM3191 Object Oriented Programming Dr Muharrem Mercimek 1 OPERATOR OVERLOADING KOM3191 Object-Oriented Programming KOM3191 Object Oriented Programming Dr Muharrem Mercimek 2 Dynamic Memory Management

More information

S Y B Voc Software Development Syllabus

S Y B Voc Software Development Syllabus S Y B Voc Software Development Syllabus Course Level Job Roles Course Name: Pattern: Examination Pattern: Eligibility: Medium of Instruction: NSQF Level-VI 1. Jr. Software Developer 2. Trainer Software

More information

KENDRIYA VIDYALAYA SANGATHAN

KENDRIYA VIDYALAYA SANGATHAN KENDRIYA VIDYALAYA SANGATHAN JAMMU REGION Winter Stations CLASS: XII SESSION: 2016-17 SPLIT-UP SYLLABUS Computer Science MONTH PORTION TO BE COVERED THEORY PRACTICAL April May-June 2016 UNIT-1 REVIEW:

More information

COMPUTER SCIENCE (Theory) - Class XII Marking Scheme

COMPUTER SCIENCE (Theory) - Class XII Marking Scheme COMPUTER SCIENCE (Theory) - Class XII Marking Scheme 1 a) Call by value l It is a used to create a temporary copy of data coming from actual parameter.the changes done in the function in the formal parameter

More information

Multiple Choice (Questions 1 13) 26 Points Select all correct answers (multiple correct answers are possible)

Multiple Choice (Questions 1 13) 26 Points Select all correct answers (multiple correct answers are possible) Name Closed notes, book and neighbor. If you have any questions ask them. Notes: Segment of code necessary C++ statements to perform the action described not a complete program Program a complete C++ program

More information

VALLIAMMAI ENGINEERING COLLEGE

VALLIAMMAI ENGINEERING COLLEGE VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK B.E. - Electrical and Electronics Engineering IV SEMESTER CS6456 - OBJECT ORIENTED

More information

CS 112 Introduction to Computing II. Wayne Snyder Computer Science Department Boston University

CS 112 Introduction to Computing II. Wayne Snyder Computer Science Department Boston University 9/5/6 CS Introduction to Computing II Wayne Snyder Department Boston University Today: Arrays (D and D) Methods Program structure Fields vs local variables Next time: Program structure continued: Classes

More information