Guidelines For CSB Candidates PGT Comput
Guidelines For CSB Candidates PGT Comput
1. Aim. To test the level of knowledge of the candidate and assess his/her suitability for employment as
PGT Computer Science to teach with proficiency in class XI & XII in an English medium Private school system
following the syllabus prescribed by CBSE. The Proficiency is primarily required in C++/JAVA/PITHON.
2. Knowledge Level. Though PGT Computer Science has to teach class XI & XII, the knowledge level
will be beyond class XII so that the teacher can help and guide learners to think critically out of TEXTBOOK
questions. Also the teacher is to assist and help the Management/Principal in developing IT infrastructure in
the school.
3. Understanding. Candidate should have very well versed with the Computer Fundamentals,
programming concepts especially in C++, JAWA and PITHON. Also s/he should have good understanding of Net
Technologies, Database Management System, RDBMS, SQL etc. S/he should be able to analyse and
comprehend a question asked in the paper, be in a position to choose the correct/relevant answer from the
options given in English in the limited time available for the Ques Paper.
4. Awareness. Candidates are also required to be very well verse with the latest developments in the
field of teaching and learning besides Computer Sc, IT, ICT in Education etc.
5. Format of the Paper. The paper will consist of 90 questions based on the following format:-
BREAKDOWN OF QUESTIONS
(a) Computer Fundamentals : 8 Marks
(b) Programming in C++, Python : 20 Marks
Data Structure and Programming Methodology
(c) Databases Management System and : 10 Marks
SQL
(d) Boolean Algebra & Digital Electronics : 5 Marks
PROGRAMMING METHODOLOGY
General Concepts; Modular approach; Clarity and Simplicity of Expressions, Use of proper Names for
identifiers, Comments, Indentation; Documentation and Program Maintenance; Running and Debugging
programs, Syntax Errors, Run-Time Errors, Logical Errors Problem Solving Methodologies: Understanding
of the problem, Identifying minimum number of inputs required for output, Writing code to optimizing
execution time and memory storage, step by step solution for the problem, breaking down solution into
simple steps, Identification of arithmetic and logical operations required for solution, Control Structure:
Conditional control and looping (finite and infinite)
DATA STRUCTURES
Introduction to data structure, primitive and non-primitive data structure, linear and non-linear structure,
static and dynamic data structure.
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) 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): Introduction to stock (LIFO - Last in First Out
Operations) 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): Introduction to Queue (FIFO - First in First out
operations) Operations on Queue (Insert and Delete) and its Implementation in C++.
IT APPLICATIONS
e-Governance : Definition, Benefits to citizens, e-Governance websites and their salient features; Societal
impacts; e-Governance challenges. e-Business : Definition, Benefits to customers and business, e-Business
websites and their salient features; Societal impacts; e-Business challenges. e-Learning : Definition;
Benefits to students (Learners), teachers (Trainers) and school (Institution) Management; e-Learning
websites and their salient features Societal impacts; e-Business Challenges. In each of the above domains,
identify at least two real-life problems, list the input(s) required for the expected output(s), and describe
the problem solving approach. Front-end Interface - Introduction; content and features; identifying and
using appropriate component (Text Box, Radio Button, CheckBox, List etc. as learnt in Unit-2
(Programming) for data entry, validation and display; Back-end Database - Introduction and its purpose;
exploring the requirement of tables and their essential attributes; Front-End and Database Connectivity -
Introduction, requirement and benefits
Demonstration and development of appropriate Front-end interface and Back-end Database for e-
Governance, e-Business and e-Learning applications Impact of ICT on Society : Social and Economics
benefits and Infomania.
Text Files:
Open, Read and display content from a text file;
Working on Database:
Connecting with Databases: Creation of DSN, using OLE DB
Inserting, Retrieving, Modifying/Updation of records from Tables in Databases using server objects
(ADODB.Connection, ADODB.Recordset);
Programming in Python
Getting Started: Introduction to Python- an interpreted high level language, interactive mode
and script mode.
Variables, Expressions and Statements: Values, Variables and keywords; Operators and
Operands in Python: (Arithmetic, relational and logical operators), operator precedence,
Expressions and Statements (Assignment statement); Taking input (using raw_input() and
input()) and displaying output (print statement); Putting Comments.
Functions: Importing Modules (entire module or selected objects), invoking built in functions,
functions from math module (for example, ceil, floor, fabs, exp, log, log10, pow, sqrt, cos, sin,
tan, degrees, radians), using random() and randint() functions of random module to generate
random numbers, composition.
Defining functions, invoking functions, passing parameters (default parameter values, keyword
arguments), scope of variables, void functions and functions returning values, flow of execution
Conditional constructs and looping: if else statement While, for (range function), break,
continue, else, pass
Strings: Creating, initialising and accessing the elements; string operators: +, *, in, not in, range
slice [n:m]; comparing strings using relational operators;
String functions and methods: len, capitalize, find, isalnum, isalpha, isdigit, lower, islower, isupper,
upper, lstrip, rstrip.
Lists: Concept of mutable lists, creating, initializing and accessing the elements, traversing,
appending, updating and deleting elements; List operations (joining, list slices);
List functions and methods: len, insert, append, extend, sort, remove, reverse, pop.
Dictionaries: Concept of key-value pair, creating, initializing and accessing the elements in a
dictionary, traversing,
appending, updating and deleting elements.
Dictionary functions & Methods: cmp, len, clear(), get(), has_key(), items(), keys(), update(),
values()
Tuples: Immutable concept, creating, intialising and accessing the elements in a tuple; tuple
functions: cmp(), len(), max(), min(), tuple()
Stacks and Queues with lists
Data File: Opening and closing files, file object, access_modes, reading and writing a file read(),
readline(), readlines(), write(), file positions (seek(), tell()), renaming and deleting a file.
Classes (in Python):
Defining classes (attributes, methods), creating instance objects, accessing attributes and
methods, using built in class attributes (dict, doc, name, module, bases), using _ _init_ _() , _
_del_ _() method and _ _ str_ _( ) in a class, private attributes (limited support), importance of
"self" (acts as a pointer to current calling object)
Inheritance: Single and multiple inheritance- Overriding methods, using super() in derived class
to invoke _init_() or overriden methods of parent class
8. Study/Reference Material.
Text Books of Class XI & XII published by various publishers. Following books are recommended by CBSE
for class XI & XII.
SUGGESTED REFERENCE BOOKS / WEB RESOURCES (as suggested by CBSE)
TEXTBOOKS:
1. INFORMATICS PRACTICES (CLASS XI), CBSE
2. INFORMATICS PRACTICES (CLASS XII), CBSE
COMPUTER FUNDAMENTALS AND BOOLEAN ALGEBRA:
1. Rajaraman, FUNDAMENTALS OF COMPUTERS, Prentice Hall of India.
2. Peter Norton, INTRODUCTION TO COMPUTER, Tata McGraw Hill
3. Thomas C. Bartee, DIGITAL COMPUTER FUNDAMENTALS, McGraw Hill International.
WEB PAGE DEVELOPMENT:
1. Sybex, HTML Complete, BPB
2. Maccoy, MASTERING WEB DESIGNING, BPB
3. Russell, MASTERING ACTIVE SERVER PAGES, BPB
4. Sybex, ASP ADO AND XML COMPLETE, BPB
5. Simon, VBSCRIPT Interactive Course: Waite Group, BPB
COMMUNICATION AND OPEN SOURCE CONCEPTS:
1. A.S. Tanenbaum, COMPUTER NETWORK, Prentice Hall of India P. Ltd.
2. Williams Stalling, DATA COMMUNICATION AND NETWORKS, Prentice Hall of
India P. Ltd.
3. Hancock, NETWORK CONCEPT AND ARCHITECTURES, BPB Publications.
INTRODUCTION TO PROGRAMMING
1. Heiko Böck, The Definitive Guide to the NetBeans Platform 6.5, Apress
RELATIONAL DATABASE MANAGEMENT SYSTEM AND SQL
1. Lerry Ulman, MYSQL Database, Pearson Education, 2008
2. C.J. Date, DATABASE PRIMER, Adison Wesley.
PROBLEM SOLVING AND PROGRAMMING IN C++
1. Robert Lafore, OBJECT ORIENTED PROGRAMMING IN TURBO C++, Galgotia
Publications Pvt. Ltd.
2. David Parsons, OBJECT ORIENTED PROGRAMMING WITH C++, BPB Publications.
3. Bjarne Stroutrup, THE C++ PROGRAMMING LANGUGE, Adison Wesley.
DATA STRUCTURES
1. M.A. Weiss, Data Structures and Algorithm Analysis in C++. the Benjamin/Cummings Pub.
Co., Inc.
2. Sartaj & Sahni, Fundamentals of Data Structure, Galgotia Book Source