p. 1

gujarat board computer science syllabus gujarat board computer science syllabus unit 1 programming in c review c covered in class -xi -object oriented programming -concept of object oriented programming ­ data hiding data encapsulation class and object abstract class and concrete class polymorphism implementation of polymorphism using function overloading as an example in c inheritance advantages of object oriented programming over earlier programming methodologies implementation of object oriented programming concepts in c -definition of a class members of a class data members and member functions methods using private and public visibility modes default visibility mode private member function definition inside class definition and outside class definition using scope resolution operator declaration of objects as instances of a class accessing members from objects array of type class objects as function arguments pass by value and pass by reference know more about icse board chemistry text books boards.edurite.com page 1/5

[close]

p. 2

-constructor and destructor constructor special characteristics declaration and definition of a constructor default constructor overloaded constructors copy constructor constructor with default arguments -destructor special characteristics declaration and definition of destructor inheritance extending classes -concept of inheritance base class derived class defining derived classes protected visibility mode single level inheritance multilevel inheritance and multiple inheritance privately derived publicly derived and protectedly derived class accessibility of members from objects and within derived classes -data file handling need for a data file types of data files ­ text file and binary file text file basic file operations on text file creating/writing text into file reading and manipulation of text from an already existing text file accessing sequentially -binary file creation of file writing data into file searching for required data from file appending data to a file insertion of data in sorted file deletion of data from file modification of data in a file implementation of above mentioned data file handling in c -components of c to be used with file handling header file fstream.h ifstream ofstream fstream classes opening a text file in in out and app modes -using cascading operators for writing text to the file and reading text from the file open get put getline and close functions detecting end-of-file with or without using eof function opening a binary file using in out and app modes open read write and close functions detecting end-of-file with or without using eof function tellg tellp seekg seekp functions read more about icse board business studies text books boards.edurite.com page 2/5

[close]

p. 3

-pointers declaration and initialization of pointers dynamic memory allocation/deallocation operators new delete pointers and arrays array of pointers pointer to an array 1 dimensional array function returning a pointer reference variables and use of alias function call by reference pointer to structures deference operator self referencial structures unit 2 data structures -arrays one and two dimensional arrays sequential allocation and address calculation one dimensional array traversal searching linear binary search insertion of an element in an array deletion of an element from an array sorting insertion selection bubble sort concatenation of two linear arrays merging of two sorted arrays -two-dimensional arrays traversal finding sum/difference of two nxm arrays containing numeric values interchanging row and column elements in a two dimensional array -stack array and linked implementation of stack operations on stack push and pop and its implementation in c converting expressions from infix to postfix notation and evaluation of postfix expression -queue circular array and linked implementation operations on queue insert and delete and its implementation in c unit 3 databases and sql -database concepts relational data model concept of domain tuple relation key primary key alternate key candidate key relational algebra selection projection union and cartesian product boards.edurite.com page 3/4

[close]

p. 4

-structured query language general concepts advantages of using sql data definition language and data manipulation language data types number character date -sql commands create table drop table alter table update set insert delete select distinct from where in between group by having order by sql functions sum avg count max and min obtaining results select query from 2 tables using equi-join cartesian product and union note implementation of the above mentioned commands could be done on any sql supported software on one or two tables unit 4 boolean logic -binary-valued quantities boolean variable boolean constant and boolean operators and or not truth tables closure property commutative law associative law identity law inverse law principle of duality idem potent law distributive law absorption law involution law demorgan s -law and their applications obtaining sum of product sop and product of sum pos form from the truth table reducing boolean expression sop and pos to its minimal form use of karnaugh map for obtaining minimal form of boolean expressions up to 4 variables -applications of boolean logic l digital electronic circuit design using basic logic gates not and or nand nor l use of boolean operators and,or in sql select statements l use of boolean operators and or in search engine queries unit 5 communication and open source concepts -evolution of networking arpanet internet interspace different ways of sending data across the network with reference to switching techniques data communication terminologies concept of channel baud bandwidth hz khz mhz ghz and data transfer rate bps kbps mbps gbps tbps boards.edurite.com page 4/5

[close]

p. 5

thank you boards.edurite.com

[close]