BCS written syllabus

SYLLABUS FOR BCS (WRITTEN) EXAMINATION     
       
45/235 
 
INFORMATION AND COMMUNICATION TECHNOLOGY 
PART-II 
Marks: 100 
Programming Language  
Structured programming language: data types, operators, expressions, control structures; Functions and 
program structure: parameter passing conventions, scope rules and storage classes, recursion; Header files; 
Preprocessor; Pointers and arrays; Strings; M ultidimensional array; User defined data types: structures, 
unions, enumerations; Input and Output: standard input and output, formatted input and output, file access; 
Variable length argument list; Command line parameters; Error Handling; Graphics; Linkin g; Library 
functions.  
 
Object Oriented Programing language: Philosophy of Object Oriented Programming (OOP); Advantages of 
OOP over structured programming; Encapsulation, classes and objects, access specifiers, static and non -
static members; Constructors,  destructors and copy constructors; Array of objects, object pointers, and 
object references; Inheritance: single and multiple inheritance; Polymorphism: overloading, abstract classes, 
virtual functions and overriding; Exceptions; Object Oriented I/O; Temp late functions and classes; Multi -
threaded Programming.  
 
Theory: Discrete Mathematics, Theory of Computation and Basic Graph Theory  
Set theory; Relations; Functions; Graph theory; Propositional calculus and predicate calculus; Mathematical 
reasoning: induction, contradiction and recursion; counting; Principles of inclusion and exclusion; 
Recurrence relations; Algebraic structures: rings and groups.  
 
Graphs: simple graphs, digraphs, subgraphs, vertex -degrees, walks, paths and cycles; Trees, spanning trees 
in graphs, distance in graphs; Complementary graphs, cut -vertices, bridges and blocks, k -connected graphs; 
Theory of Computation: Lan guage theory; Finite automata: deterministic finite automata, nondeterministic 
finite automata, equivalence and conversion of deterministic and nondeterministic finite automata, 
pushdown automata; Context free languages; Context free grammars; Turing Machi nes: basic machines, 
configuration, computing with Turing machines  
 
Data Structures and Algorithms  
Internal data representation; Abstract data types; Elementary data structures: arrays, lists, stacks, queues, 
trees, graphs; Advanced data Structures: heap s, Fibonacci heaps, B -trees; Recursion, sorting, searching, 
hashing, storage management.  
 
Techniques for analysis of algorithms; Methods for the design of efficient algorithms: divide and conquer, 
greedy method, dynamic programming, back tracking, branch and bound; Basic search and traversal 
techniques; Topological sorting; Connected components, spanning trees, shortest paths; Flow algorithms; 
Approximation algorithms; Parallel algorithms; Algebraic simplification and transformations; Lower bound 
theory; NP-completeness, NP-hard and NP-complete problems.  
 
Database Systems  
Concepts of database systems; Data Models: Entity -Relationship model, Relational model; Query 
Languages: Relational algebra, SQL; Constraints and triggers; Functional dependencies and no rmalization; 
File organization and data storage; Indexing: primary and secondary indexes, B+ trees, hash tables; Query 
optimization; Transaction management; Recovery; Concurrency control; Access control and security; Semi -
structured database: XML, XPath, XQuery; Object oriented and object relational databases.  
 
 
 
Software Engineering and Information System Design