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

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

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

KENDRIYA VIDYALAYA SANGATHAN

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

KENDRIYA VIDYALAYA SANGATHAN

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

KENDRIYA VIDYALAYA SANGATHAN BHUBANESWAR REGION SPLITUP SYLLABUS FOR COMPUTER SCIENCE CLASS XII

COMPUTER SCIENCE (THEORY) Class XII (Theory) - Python

UNIT 1: OBJECT ORIENTED PROGRAMMING IN C++

COMPUTER SCIENCE (THEORY) Class XII ( Theory) - Python. Unit No. Unit Name MARKS UNIT 1: PROGRAMMING WITH PYTHON

UNIVERSITY POLYTECHNIC B.I.T., MESRA, RANCHI. COURSE STRUCTURE (W.E.F Batch Students) (Total Unit 7.5) Sessional Unit Code. Theory Unit Course

IMPORTANT QUESTIONS WITH ANSWERS FOR II PU FINAL EXAMINATION


SCIENCE ENTRANCE ACADEMY III PREPARATORY EXAMINATION SCHEME OF VALUATION

LIST OF EXPERIMENTS. (1) (Office Automation)

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

B.Sc II Year Computer Science (Optional)

VALLIAMMAI ENGINEERING COLLEGE

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

Object Oriented Programming

Syllabi & Scheme of Examination BCA-2 nd Year. Website:-

Preface to the Second Edition Preface to the First Edition Brief Contents Introduction to C++ p. 1 A Review of Structures p.

CLASS XII ( ) (Theory)

Fundamental of I.T. (c) Application of computer *************

ONE MARKS QUESTION AND ANSWERS

Get Unique study materials from

B.Sc. Computer Science (Ancillary)

Computer Science (330)

CGS 2405 Advanced Programming with C++ Course Justification

Syllabus for Computer Science General Part I

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

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

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

Chapter 2. Boolean Expressions:

END TERM EXAMINATION

An Introduction to JavaScript & Bootstrap Basic concept used in responsive website development Form Validation Creating templates

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

HIGER SECONDARY FIRST YEAR COMPUTER SCIENCE

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

CHOICE BASED CREDIT SYSTEM (With effect from )

COMPUTER SCIENCE (Code No. 083) (For the session only)

Seth Jai Parkash Polytechnic, Damla

ACADEMIC YEAR PLANNING - F.Y.J.C. ( ) F.Y.J.C. COMPUTER SCIENCE (Theory)

C++ (Non for C Programmer) (BT307) 40 Hours

SUBJECT COMPUTER SCIENCE PAGE 1

S Y B Voc Software Development Syllabus

Strictly Based on the Latest Syllabus issued by CBSE Board for 2015 Examination QUESTION BANK. Chapter-Wise Solutions.

COMPUTER SCIENCE 2002 (Delhi Board)

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

M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75

Jh fouk;d egkfo ky;] xkmjokjk RANI DURGAVATI VISHWAVIDYALAYA, JABALPUR BACHLOR OF COMPUTER APPLICATION BCA SYLLABUS THIRD SEMESTER

PROGRAMMING IN C AND C++:

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

Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS

Unit-IV Boolean Algebra

KENDRIYA VIDYALAYA SANGATHAN ERNAKULAM REGION Split up syllabus Computer Science (083)

Rani Durgavati Vishwavidyalaya Jabalpur (M.P.) (UICSA) Master of Computer Application (MCA) Practical List of. MCA III SEM Session -2010

SECOND SEMESTER JAVA PROGRAMMING

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)

Sr. No. Subject. 1 Paper I- Theory Computer Component Unit-I- Computer Organization & Architecture Unit-II- Software Engg Unit-III-O.S.

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

COURSE OUTCOMES OF M.Sc(IT)

CS 6456 OBJCET ORIENTED PROGRAMMING IV SEMESTER/EEE

MaanavaN.Com CS1203 OBJECT ORIENTED PROGRAMMING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.

WYSE Academic Challenge Computer Science Test (Regional) 2015 Solution Set

IBPS SO Examination 2013 IT Officer Professional Knowledge Question Paper

Object Oriented Programming. Assistant Lecture Omar Al Khayat 2 nd Year


Week. Lecture Topic day (including assignment/test) 1 st 1 st Introduction to Module 1 st. Practical

MAHARAJA KRISHNAKUMARSINHJI BHAVNAGAR UNIVERSITY NAAC Accreditation Grade B (With effect from Academic Year: )

Dot Net Online Training

CLASS XII. There will be two papers in the subject: Paper I: Theory- 3 hours 100 marks Paper II: Practical- 3 hours 100 marks

Note: Select one full question from each unit

10CS36: Object Oriented Programming with C++

ADMINISTRATIVE MANAGEMENT COLLEGE

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

Course Title III Allied Practical** IV Environmental Studies #

Code No: R Set No. 1

INFORMATION TECHNOLOGY COURSE OBJECTIVE AND OUTCOME

B.C.A 2017 OBJECT ORIENTED PROGRAMMING USING C++ BCA303T MODULE SPECIFICATION SHEET

And Even More and More C++ Fundamentals of Computer Science

1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices.

OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS

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

Subject: OBJECT ORIENTED PROGRAMMING WITH C++ Paper (U.G): BCA -231 S. No. Course Outcomes

BACHELOR OF COMPUTER APPLICATIONS (BCA)

STATE COUNCIL OF EDUCATIONAL RESEARCH AND TRAINING TNCF DRAFT SYLLABUS.

M.C.A DEGREE EXAMINATION,NOVEMBER/DECEMBER 2010 Second Semester MC 9222-OBJECT ORIENTED PROGRAMMING (Regulation 2009)

Core PHP. PHP output mechanism. Introducing. Language basics. Installing & Configuring PHP. Introducing of PHP keywords. Operators & expressions

Computer Programming C++ (wg) CCOs

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

Absolute C++ Walter Savitch

Department of Computer Sci.

Sardar Patel University S Y BSc. Computer Science CS-201 Introduction to Programming Language Effective from July-2002

SUBJECT: INFORMATION TECHNOLOGY

PRACTICAL LIST FOR EVEN SEMESTERS (PGDCA/MCA/MSC (CS))

COURSE OUTLINE & WEEK WISE BREAKAGE


XII- COMPUTER SCIENCE VOL-II MODEL TEST I

Transcription:

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 SCIENCE (41) SUB-UNITS UNIT A BACKDROP OF COMPUTERS 35 Hrs NO. OF OURS Review of Block diagram of CPU 1 Mother board to Motherboard Types of Motherboards Components of Motherboard Processor and clock speed BIOS CMOS Memory and Expansion slots Disk Controllers I/O Ports and Interfaces BUS Power supply SMPS and UPS 1 Typical configuration of Computer system 1 Development of Boolean Algebra (History) Binary valued quantities Boolean constants Boolean variables Logical operators Logical functions or compound statements Logical operators Evaluation of Boolean expressions Using truth table Using rules of algebra Logic gates Basic gates OR Gate AND Gate NOT Gate Derived Gates NOR Gate NAND Gate XOR Gate XNOR Gate Design of gates NAND to NAND and NOR to NOR design 1 Design of basic gates ( NOT, OR & AND ) using NAND and NOR gates Basic postulates of Boolean Algebra (with proof )

3 Data structures 15 Hrs/ 14 Marks Properties of 0 and 1 Indempotence law Involution law Complementarity law Commutative law Associative law Distributive law-different forms Absorption law De Morgan s theorems De Morgan s I theorem De Morgan s II theorem Applications of De Morgan s theorems Derivation of Boolean expressions Min terms Max terms Canonical expressions Minimization of Boolean expressions Simplification using Karnaugh map ( upto 4- variables) Sum-of-product reduction using Karnaugh map Product-of-sum reduction using Karnaugh map to Data Structures to Data Structures Data representation Types of Data structures -Linear and non linear Definition for Traversal, Insertion, Deletion,Searching,sorting and merging Arrays Types of arrays one dimensional and two dimensional Memory representation of data Basic operations on One dimensional arrays Traversing Insertion of an element Deletion of an element searching(linear and Binary search) Sorting Stacks and Queues Data representation in stacks(using arrays) Operations on stacks(push and pop) Applications of Stacks-polish notationprefix,infix,postfix expression Queues Types of Queues Data representation Operations on Queues 3 3 6 5

Linked lists Single and double linked lists Operations on single linked lists UNIT B COMPUTING IN C++ 45Hrs 4 Object Oriented Review of C++ covered in First PUC Programming Programming paradigms in C++ Procedural programming 1 45 Hrs/ Object Oriented programming 39 Marks Basic concepts of OOPS to Classes and Objects Data Abstraction Data Encapsulation 4 Inheritance Polymorphism Advantages of OOPS over earlier programming methodologies Classes and objects Declaration & definition of class and objects 6 Access specifies (scope of class & its members) Private Public Protected Members of the class Data members Member functions Member functions inside class definition Member functions out side class definition Referencing class members Array within class using objects array of objects Functions returning objects Function over loading 3 Need for function overloading Declaration and definition of function overloading Function over loading Restrictions on functions over loading Calling over loaded functions Inline function Friend function Constructor & Destructor Constructor Declaration & definition of Constructor

Default constructor Parameterized constructor Copy constructor Constructor overloading Special characteristics of constructor Constructor with default arguments Destructor Need for Destructor Declaration & definition of Destructor Special characteristics of Destructor Inheritance(Extending classes) Concepts of Inheritance Base class Derived class Defining derived classes Protected visibility modes Levels of inheritance Single Multilevel Multiple Hierarchical Relationship between classes Pointers Declaration & initialization of pointers Memory rlepresentation of pointers Address operator Pointer operator(indirection operator) Pointer arithmetic Memory allocation of pointers(static and dynamic) new and delete Pointer and arrays Arrays of pointers Pointers to an array( 1 dimensional) Pointers to strings Pointer and functions By passing the references By passing the pointers Pointer and structures Pointer and objects this pointer Data file handling Header files(fstream.h) Types of data files 7 6

Text file introduction Binary file introduction Opening & closing files Using constructor Using open() File modes In,out, app modes get(), getline(), put(),putline(),open(),close(),read(),write() Detecting end of file File pointers tellg(), tellp(), seekg(), seekp() functions Operation on files(sequential) Create, write, display UNIT C LARGE DATA, DATABASE AND QUERIES 0Hrs DATABASE CONCEPTS 0 Hrs/ 1 Marks Database Concepts :Facts,data,information,features database definitions : data types, field,records,table Logical database conceptsentities,attributes,relations(1:1,1-m,m-1,m-m) Physical data organisation - sequential,random,indexed sequential Need for Databases Data Abstraction :- view,schema,internal,conceptual,external Data Models Hierarchial,Network and Relational Models KEYS- Primary,Secondary,Candidate,Foreign,Alternate Relational Algebra Selection Projection Union Cartesian Product Data warehousing,data mining concepts., Structured Query Language and need of sql Data types(number,varchar,date) DDL DML SQL COMMANDS CREATE,DROP,ALTER,UPDATE INSERT,DELETE.SELECT,DISTINCT FROM,WHERE,GROUP BY, ORDER BY,JOIN SQL Functions 4

UNIT D 6 Networking Concepts 10 Hrs/ 09 Marks 7 Internet and Open source concepts 5Hrs/ 4 Marks Web Designing 5 Hrs/ 4 Marks SUM,AVG,COUNT,MAX,MIN ADVANCED CONCEPTS IN COMMUNICATION TECHNOLOGY 0Hrs Evolution of Networking and Protocols ARPANET,Layers,OSI VsTCP/IP,HTTP,ftp/Slip/PPP Internet, Interspace Different Terminologies used in Network Advantages of Networking Switching techniques Circuit,Message and Packet Switching Type of Networking LAN,MAN,WAN Transmission Media Twisted pair cable,co axial Cable, optical fibres,microwave,radiowave,satellite, Infrared, Laser Network Topologies Pointpoint,Bus,Star,Ring,Tree,Mesh,Graph,Fully connected Network Devices Modem,RJ- 45,Hub,Ethernet,Switch,repeater,bridge,router and gateway Wireless/Mobile Computing Definition Technologies of GSM,CDMA,GPRS,WLL,G,3G,4G,5G Applications SMS,Voice,Chat,Video conferencing protocol,wifi, Viruses Network Security Definition and Applictions Internetworking terms and concepts WWW,Telnet,URL,Domain,Web server, Web sites, web browser,web Address,Web Page IPR issues Open source E-commerce HTML, -text,layout,images,table,forms,settings XML DYNAMIC HTML Web HOSTING 10 5 5 10

List of programs to be conducted in practical sessions Section A C++ and Data structure 1. Write a program to find the frequency of presence an element in an array.. Write a program to insert an element into an array at a given position. 3. Write a program to delete an element from an array from a given position 4. Write a program to sort the elements of an array in ascending order using insertion sort. 5. Write a program to search for a given element in an array using Binary search method. 6. Write a program to create a class with data members principle, time and rate. Create member functions to accept data values to compute simple interest and to display the result. 7. Write a program to create a class with data members a, b, c and member functions to input data, compute the discriminant based on the following conditions and print the roots. Ø If determinant=0, print the roots that are equal Ø If the discriminant is>0, print the real roots Ø If the discriminant<0, print that the roots are imaginary. Program to find the area of a square/rectangle/triangle using function overloading. 9. Program to find the cube of a number using inline functions. 10. Write a program to find the sum of the series 1+ x + x + + x n using constructors. 11. Create a base class containing the data members roll number and name. Also create a member function to read and display the data using the concept of single level inheritance. Create a derived class that contains marks of two subjects and total marks as the data members. 1. Create a class containing the following data members register No., name and fees. Also create a member function to read and display the data using the concept of pointers to objects. 13. Write a program to perform push items into the stack. 14. Write a program to pop elements from the stack. 15. Write a program to perform enqueue and dequeue. 16. Write a program t o create a linked list and appending nodes. Section B SQL 17. Generate the Electricity Bill for one consumer 1. Create a student database and compute the result. 19 Generate the Employee details and compute the salary based on the department. 0. Create database for the bank transaction. Section C HTML 1. Write a HTML program to create a study time-table.. Create an HTML program with table and Form.