0 Bewertungen0% fanden dieses Dokument nützlich (0 Abstimmungen)
42 Ansichten4 Seiten
This document summarizes the CBSE Class XII Computer Science syllabus. It covers key topics like object-oriented programming in C++, inheritance, data structures like arrays and stacks, pointers, databases and SQL, Boolean algebra, communication technologies, and guidelines for class XI and XII projects. Practical work involves programming problems, SQL queries, and developing a group project using C++ and data files.
This document summarizes the CBSE Class XII Computer Science syllabus. It covers key topics like object-oriented programming in C++, inheritance, data structures like arrays and stacks, pointers, databases and SQL, Boolean algebra, communication technologies, and guidelines for class XI and XII projects. Practical work involves programming problems, SQL queries, and developing a group project using C++ and data files.
This document summarizes the CBSE Class XII Computer Science syllabus. It covers key topics like object-oriented programming in C++, inheritance, data structures like arrays and stacks, pointers, databases and SQL, Boolean algebra, communication technologies, and guidelines for class XI and XII projects. Practical work involves programming problems, SQL queries, and developing a group project using C++ and data files.
RE&IE': C%% co(ere) In Class -XI* Ob+ect Oriente) !ro,rammin,: Concept of Object Oriented Programming - Data hiding, Data encapsulation, Class and Object, Abstract class and Concrete class, Polymorphism (Implementation of polymorphism using Function oerloading as an e!ample in C""#$ Inheritance, Adantages of Object Oriented Programming oer earlier programming methodologies, Implementation o- Ob+ect Oriente) !ro,rammin, concepts in C%%: Definition of a class, %embers of a class - Data %embers and %ember Functions (methods#, &sing Priate and Public isibility modes, default isibility mode (priate#$ %ember function definition' inside class definition and outside class definition using scope resolution operator (''#$ Declaration of objects as instances of a class$ accessing members from object(s#, Objects as function arguments - pass by alue and pass by reference$ Constructor an) estructor: Constructor' (pecial Characteristics, Declaration and Definition of a constructor, Default Constructor, Oerloaded Constructors, Copy Constructor, Constructor )ith default arguments$ Destructor' (pecial Characteristics, Declaration and definition of destructor$ In.eritance /E0ten)in, Classes1: Concept of Inheritance, *ase Class, Deried Class, Defining deried classes, protected isibility mode$ (ingle leel inheritance, %ultileel inheritance and %ultiple inheritance, Priately deried, Publicly deried and Protectedly deried class, accessibility of members from objects and )ithin deried class(es#$ ata 2ile 3an)lin,: +eed for a data file, ,ypes of data files - ,e!t file and *inary file$ ,e!t File ' *asic file operations on te!t file' Creating-.riting te!t into file, /eading and %anipulation of te!t from an already e!isting te!t File (accessing se0uentially#$ *inary File' Creation of file, .riting data into file, (earching for re0uired data from file, Appending data to a file, Insertion of data in sorted file, Deletion of data from file, %odification of data in a file$ Implementation of aboe mentioned data file handling in C""$ Components o- C%% to be use) 4it. -ile .an)lin,: 3ea)er -ile: fstream1h$ ifstream, ofstream, fstream classes$ Opening a te!t file in in, out, and app modes$ &sing cascading operators (22 33#for )riting te!t to the file and reading te!t from the file$ open(#, get(#, put(#, getline(# and close(# functions$ Detecting end-of-file ()ith or )ithout using eof(# function#$ Opening a binary file using in, out, and app modes$ open(#, read(#, )rite(# and close(# functions$ Detecting end-of-file ()ith or )ithout using eof(# function#$ tellg(#, tellp(#, see4g(#, see4p(# functions1 !ointers: Introduction to Printer, Declaration and Initiali5ation of Pointers$ Dynamic memory allocation- deallocation operators' ne), delete$ Pointers and Arrays' Array of Pointers, Pointer to an array (6 dimensional array# Function returning a pointer, /eference ariables and use of alias$ Function call by reference1 Pointer to structures' Deference operator' 7, -2$ self referencial structures$ UNIT 5: #T# STRUCTURES Introduction to data structure, primitie and non-primitie data structure, linear and non-linear structure, static and dynamic data structure1 #rrays: One and t)o Dimensional arrays' (e0uential allocation and address calculation$ One dimensional array' ,raersal, (earching (8inear, *inary (earch#, Insertion of an element in an array, deletion of an element from an array, (orting (Insertion, (election, ,)o-dimensional arrays' ,raersal, Finding sum-difference of t)o +!% arrays containing numeric alues, Interchanging /o) and Column elements in a t)o dimensional array$ Stac6 /#rray an) 7in6e) implementation o- Stac61: Operations on (tac4 (P&(9 and POP# and its Implementation in C"", Conerting e!pressions from I+FI: to PO(,FI: notation and ealuation of Postfi! e!pression$ 8ueue: (Circular Array and 8in4ed Implementation#' Introduction to ;ueue (FIFO - First in First out operations# Operations on ;ueue (Insert and Delete# and its Implementation in C""1 UNIT 9: #T#B#SES #N S87 Database Concepts' Introduction to data base concepts and its need1 /elational data model' Concept of domain, tuple, relation, 4ey, primary 4ey, alternate 4ey, candidate 4ey$ /elational algebra' (election, Projection, &nion and Cartesian product$ Structure) 8uery 7an,ua,e: <eneral Concepts' Adantages of using (;8, Data Definition 8anguage and Data %anipulation 8anguage$ ata types: +&%*=/-D=CI%A8, C9A/AC,=/->A/C9A/->A/C9A/?, DA,=$ S87 comman)s: C/=A,= ,A*8=, D/OP ,A*8=, A8,=/ ,A*8=, &PDA,=111(=,111, I+(=/,, D=8=,=$ (=8=C,, DI(,I+C,, F/O%, .9=/=, I+, *=,.==+, </O&P *@, 9A>I+<, O/D=/ *@$ S87 -unctions: (&%, A><, CO&+,, %A: and %I+$ Obtaining results ((=8=C, 0uery# from ? tables using e0ui-join, Cartesian Product and &nion Note: Implementation of the aboe mentioned commands could be done on any (;8 supported soft)are on one or t)o tables1 UNIT :: BOO7E#N #7"EBR# /ole of 8ogical Operations in Computing1 *inary-alued ;uantities, 8ogical >ariable, 8ogical Constant and 8ogical Operators' A+D, O/, +O,$ ,ruth ,ables$ Closure Property, Commutatie 8a), Associatie 8a), Identity la), Inerse la), Principle of Duality, Idem potent 8a), Distributie 8a), Absorption 8a), Inolution la), De%organAs 8a) and their applications$ Obtaining (um of Product ((OP# and Product of (um (PO(# form from the ,ruth ,able, /educing *oolean =!pression ((OP and PO(# to its minimal form, &se of Barnaugh %ap for minimi5ation of *oolean e!pressions (up to C ariables#$ #pplication o- Computin, 7o,ic: *uilding up logic circuits using basic 8ogic <ates (+O,, A+D, O/, +A+D, +O,# &se of *oolean operators (+O,, A+D, O/# in (;8 (=8=C, statements &se of *oolean operators (A+D, O/# in search engine 0ueries1 UNIT ;: CO$$UNIC#TION #N O!EN SOURCE CONCE!TS CO$$UNIC#TION TEC3NO7O"IES =olution of +et)or4ing' A/PA+=,, Internet, Interspace Different )ays of sending data across the net)or4 )ith reference to s)itching techni0ues (Circuit, %essage and Pac4et s)itching# ata Communication terminolo,ies: Concept of Channel, *aud, *and)idth (95, B95, %95# and Data transfer rate (bps, 4bps, %bps, <bps, ,bps# Transmission me)ia: ,)isted pair cable, coa!ial cable, optical fiber, infrared, radio lin4, micro)ae lin4 and satellite lin4 Net4or6 )e(ices: %odem, /DCE connector, =thernet Card, 9ub, ()itch, <ate)ay Net4or6 Topolo,ies an) types: *us, (tar, ,ree$ PA+, 8A+, .A+, %A+ Net4or6 !rotocol: ,CP-IP, File ,ransfer Protocol (F,P#, PPP, /emote 8ogin (,elnet#, Internet .ireless-%obile Communication protocol such as <(%, CD%A, <P/(, .88, 6<, ?< and F< =lectronic mail protocols such as (%,P, POPF Protocols for Chat and >ideo Conferencing >oIP protocols such as .i-Fi and .i%a! Net4or6 Security Concepts: ,hreats and preention from >iruses, .orms, ,rojan horse, (pams &se of Coo4ies, Protection using Fire)all$ India I, Act, Cyber 8a), Cyber Crimes, IP/ issues, 9ac4ing1 .eb(erices' ..., 9yper ,e!t %ar4up 8anguage (9,%8#, e:tensible %ar4up 8anguage (:%8#$ 9yper ,e!t ,ransfer Protocol (9,,P#$ Domain +ames$ &/8$ Protocol Address$ .ebsite, .eb bro)ser, .eb (erers$ .eb 9osting, .eb (cripting - Client side (>* (cript, Daa (cript, P9P# and (erer side (A(P, D(P, P9P#, .eb ?1G (for social net)or4ing# Open (tandards Introduction to open standards and its adantage in deelopment of inter-operable enironment1 Open (ource Concepts Proprietory and Open (ource (oft)are, Free)are, (hare)are, F8O((-FO((, <+&,F(F, O(I, .FC !racticals: 1< !ro,rammin, in C%% 1= - One programming problem in C"" to be deeloped and tested in Computer during the e!amination1 %ar4s are allotted on the basis of follo)ing' 7o,ic : E %ar4s ocumentation>In)entation : ? %ar4s Output presentation : F %ar4s Notes: ,he types of problems to be gien )ill be of application type from the follo)ing topics1 Arrays (One dimensional and t)o dimensional# Array of structure (tac4 using arrays and lin4ed implementation ;ueue using arrays (circular# and lin4ed implementation *inary File operations (Creation, Displaying, (earching and modification# ,e!t File operations (Creation, Displaying and modification# 5< S87 Comman)s =; - Fie ;uery 0uestions based on a particular ,able-/eaction to be tested practically on Computer during the e!amination1 ,he command along )ith the result must be )ritten in the ans)er sheet1 9< !ro+ect 'or6 =; - ,he project has to be deeloped in C"" language )ith Object Oriented ,echnology and also should hae use of Data files1 (,he project is re0uired to be deeloped in a group of ?-C students# Presentation on the computer Project report (8isting, (ample, Outputs, Documentation >ia :< !ractical 2ile =; - %ust hae minimum ?G programs from the follo)ing topics Arrays (One dimensional and t)o dimensional, sorting, searching, merging, deletionAH insertion of elements# Arrays of structures, (tac4s using arrays and lin4ed implementation ;ueues using arrays (linear and circular# and lin4ed implementation File (*inary and ,e!t# operations (Creation, &pdation, ;uery# Any computational based problems 6E (;8 commands along )ith the output based on any table-relation' F %ar4s ;< &i(a &oce =; - &i(a 4ill be as6e) -rom syllabus co(ere) in class XII an) t.e pro+ect )e(elope) by stu)ent< "UIE7INES 2OR !ROJECTS /Class XI an) XII1 1< !reamble: 616 ,he academic course in Computer (cience includes one Project in each year1 ,he Purpose behind this is to consolidate the concepts and practices imparted during the course and to sere as a record of competence1 61? A group of ?-C students as team may be allo)ed to )or4 on one project1 5< !ro+ect content ?16 Project for class :I can be selected from the topics mentioned in the syllabus or domains on the similar lines ?1? Project for class :II should ensure the coerage of follo)ing areas of curriculum' a1 Problem (oling b1 Data (tructure c1 Object Oriented Programming in C"" d1 Data File 9andling T.eme o- t.e pro+ect can be Any subsystem of a (ystem (oft)are or ,ool Any (cientific or a fairly comple! algorithmic situation1 (chool %anagement, *an4ing, 8ibrary information system, 9otel or 9ospital management system, ,ransport 0uery system ;ui55es-<ames$ ,utor-Computer Aided 8earning (ystems ?1F ,he aim of the project is to highlight the abilities of algorithmic formulation, modular programming, optimi5ed code preparation, systematic documentation and other associated aspects of (oft)are Deelopment1 ?1C ,he assessment )ould be through the project demonstration and the Project /eport, )hich should portray Programming (tyle, (tructured Design, %inimum Coupling, 9igh Cohesion, <ood documentation of the code to ensure readability and ease of maintenance1 Su,,este) Re-erence Boo6s: Computer 2un)amentals an) Boolean #l,ebra 61 /ajaraman, F&+DA%=+,A8( OF CO%P&,=/( Cth =dition, Prentice 9all of India1 ?1 Peter +orton, I+,/OD&C,IO+ ,O CO%P&,=/ Cth =dition, ,ata %c<ra) 9ill F1 ,homas C1 *artee, DI<I,A8 CO%P&,=/ F&+DA%=+,A8(, %c<ra) 9ill International1 !roblem Sol(in, an) !ro,rammin, in C%% Note: Prior 4no)ledge of C is not re0uired in the learning of C"", eenthough reference about C are made in some of the boo4s1 61 /obert 8afore, O*D=C, O/I=+,=D P/O</A%%I+< I+ ,&/*O C"", <algotia Publications Pt1 8td1 ?1 Daid Parsons, O*D=C, O/I=+,=D P/O</A%%I+< .I,9 C"", *P* Publications1 F1 *jarne (troutrup, ,9= C"" P/O</A%%I+< 8A+<&<=, Adison .esley1 ata Structures 61 %1A1 .eiss, Data (tructures and Algorithm Analysis in C""1 the *enjamin-Cummings Pub1 Co1, Inc1 ?1 (artaj H (ahni, Fundamentals of Data (tructure, <algotia *oo4 (ource atabase $ana,ement System an) S87 61 C1D1 Date, DA,A*A(= P/I%=/, Adison .esley1 Computer Net4or6 61 A1(1 ,anenbaum, Computer +et)or4 Cth =dition, Prentice 9all of India P1 8td1 ?1 .illiams (talling, Data Communication and +et)or4s Eth =dition, Prentice 9all of India P1 8td1 F1 9ancoc4, +et)or4 Concept and Architectures, *P* Publications1