Maharashtra State Eligibility Test (SET) 2010
Syllabus: (Computer Science & Applications: Paper II and III)
1. Discrete Structures
Sets, Relations, Functions, Pigeonhole Principle,
Inclusion-Exclusion Principle, Equivalence and Partial Orderings, Elementary
Counting Techniques. Probability, Measure(s) for information and Mutual
Computability : Models of computation-Finite Automata,
Pushdown Automata. Non-determinism and NFA, DPDA and PDAs and Languages accepted
by these structures. Grammars, Languages, Non- omputability and Examples of
Graph : Definition, walks, paths, trails, connected
graphs, regular and bipartite graphs, cycles and circuits. Tree and rooted tree.
Spanning trees. Eccentricity of a vertex radius and diameter of a graph. Central
Graphs. Centre(s) of a tree. Hamiltonian and Eulerian graphs, Planar graphs.
Groups : Finite fields and Error correcting/detecting
2. Computer Arithmetic
Propositional (Boolean) Logic, Predicate Logic,
Well-formed-formulae (WFF), Satisfiability and Tautology.
Logic Families : TTL, ECL and C-MOS gates. Boolean algebra
and Minimization of Boolean functions, Flip-flops-types, race condition and
comparison, Design of combinational and sequential circuits.
Representation of Integers : Octal, Hex, Decimal and
Binary. 2’s complement and 1’s complement arithmetic, Floating point
3. Programming in C and C++
Programming in C : Elements of C-Tokens, identitiers,
data types in C. Control structures in C. Sequence, selection and iteration(s),
Structured data types in C arrays, struct, union, string and pointers.
O-O Programming Concepts : Class, object, instantiation,
Inheritance, polymorphism and overloading.
C++ Programming : Elements of C++-Tokens, identifiers,
Variables and constants, Data types, Operators, Control statements, Functions
parameter passing, Class and objects, Constructors and destructors, Overloading,
Inheritance, Templates, Exception handling.
4. Relational Database Design and SQL
E R diagrams and their transformation to relational design,
normalization-1NF, 2NF, 3NF, BCNF and 4NF. Limitations of 4NF and BCNF.
SQL : Data Definition language (DDL), Data Manipulation
Language (DML), Data Control language (DCL) commands. Database objects
like-Views, indexes, sequences, synonyms, data dictionary.
5. Data and File structures
Data, Information, Definition of data structure, Arrays, stacks,
queues, linked lists, trees, graphs, priority queues and heaps.
File Structures : Fields, records and files, Sequential,
direct, index-sequential and relative files, Hashing, inverted lists and
multi-lists B trees and B+ trees.
6. Computer Networks
Network fundamentals : Local Area Networks (LAN),
Metropolitan Area Networks (MAN), Wide Area Networks (WAN), Wireless Networks,
Reference Models : The OSI model, TCP/IP model.
Data Communication : Channel capacity, Transmission
Media-twisted pair, coaxial cables, fibre-optic cables, wireless
transmission-radio, microwave infrared and millimeter waves. Lightwave
transmission, Thelephones-local loop, trunks, multiplexing, switching,
ISDN, broadband ISDN, ATM, High speed LANS, Cellular Radio. Communication
satellitesgeosynchronous and low-orbit.
Internetworking : Switch/Hub, Bridge, Router, Gateways,
Concatenated virtual circuits, Tunnelling, Fragmentation, Firewalls.
Routing : Virtual circuits and datagrams, Routing
algorithms, Conjestion control.
Network Security : Cryptography-public key, secret key,
Domain Name System (DNS)-Electronic Mail and Worldwide Web (WWW), The DNS,
Resource Records, Name servers, E-mail architecture and Serves.
7. System Software and Compilers
Assembly language fundamentals (8085 based assembly language
programming). Assemblers-2 pass and single-pass. Macros and macroprocessors.
Loading, linking, relocation, program relocatability, Linkage editing. Text
editors, Programming Environments, Debuggers and program generators. Compilation
and Interpretation. Bootstrap compilers. Phases of compilation process. Lexical
analysis. Lex package on Unix system.
Context free grammars, Parsing and parse trees, Representation
of parse (derivation) trees as rightmost and left most derivations. Bottom up
parsers-shift-reduce, operator precedence, and LR, YACC package on Unix system.
Topdown parsers-left recursion and its removal, Recursive
descent parser. Predictive parser, Intermediate codes-Quadruples, Triples,
Intermediate code generation, Code generation, Code optimization.
8. Operating Systems (with Case Study of Unix)
Main functions of operating systems. Multiprogramming,
multiprocessing, and multitasking.
Memory Management : Virtual memory, paging, fragmentation.
Concurrent Processing : Mutual exclusion, Critical regions,
lock and unlock.
Scheduling : CPU scheduling, I/O scheduling, Resource
scheduling, Deadlock and scheduling algorithms. Banker’s algorithm for deadlock
The Unix System : File system, process management, bourne shell
shell variables, command line programming.
Filters and Commands : Pr, head, tail, cut, paste, sort,
uniq, tr, join, etc., grep, egrep, fgrep, etc., sed, awk, etc.
System Calls (like) : Creat, open, close, read, write,
iseek, link, unlink, stat, fstat, umask, chmod, exec, fork, wait, system.
9. Software Engineering
System Development Life Cycle (SDLC) : Steps, Water fall
model, Prototypes, Spiral model.
Software Metrics : Software Project Management.
Software Design : System design, detailed design, function
oriented design, object oriented design, user interface design. Design level
Coding and testing : Testing level metrics, Software quality
and reliability, Clean room approach, software reengineering.
10. Current Trends and Technologies
The topics of current interest in Computer Science and Computer
Applications shall be covered.
The experts shall use their judgement from time to time to
include the topics of popular interest, which are expected to be known for an
application development software professional, currently, they include :
Parallel Computing Parallel virtual machine (pvm) and
message passing interface (mpi) libraries and calls. Advanced architectures.
Today’s fastest computers.
Mobile connectivity-Cells, Framework, wireless delivery technology and
switching methods, mobile information access devices, mobile data
internetworking standards, cellular data communication protocols, mobile
computing applications, Mobile databases-protocols, scope, tools and technology,
Electronic Commerce : Framework, Media Convergence of Applications, Consumer
Applications, Organisation Applications.
Electronic Payment Systems : Digital Token, Smart Cards, Credit
Cards, Risks in Electronic Payment System, Designing Electronic Payment Systems.
Electronic Data Interchange (EDI) : Concepts, Applications, (Legal, Security and
Privacy) issues, EDI and Electronic Commerce, Standardization and EDI, EDI
Software Implementation, EDI Envelope for Message Transport, Internet-Based EDI.
Digital Libraries and Data Warehousing : Concepts, Types of
Digital documents, Issues behind document Infrastructure, Corporate data
Software Agents : Characteristics and Properties of Agents,
Technology behind Software Agents (Applets, Browsers and Software Agents).
Broadband Telecommunications : Concepts, Frame Relay, Cell Relay, Switched
Multimegabit data Service, Asynchronous Transfer Mode. Main concepts in
Geographical Information System (GIS), E-cash, E-Business, ERP packages.
Data Warehousing : Data Warehouse environment, architecture of a
data warehouse methodology, analysis, design, construction and administration.
Data Mining : Extracting models and patterns from large
databases, data mining techniques, classification, regression, clustering,
summarization, dependency modelling, link analysis, sequencing analysis, mining
scientific and business data.
Introduction to Windows programming-Win32, Microsoft Foundation Classes (MFC),
Documents and views, Resources, Message handling in windows.
Simple Applications (in windows)
Scrolling, splitting views, docking toolbars, status bars,
Advanced Windows Programming
Multiple Document Interface (MDI), Multithreading, Object linking and
Embedding (OLE), Active X controls, Active Template Library (ATL), Network
(CORE GROUP) Unit-I
Combinational Circuit Design, Sequential Circuit Design,
Hardwired and Microprogrammed processor design, Instruction formats, Addressing
modes, Memory types and organisation, Interfacing peripheral devices,
Interrupts. Microprocessor architecture, Instruction set and Programming (8085,
P-III/P-IV), Microprocessor applications.
Database Concepts, ER diagrams, Data Models, Design of
Relational Database, Normalisation, SQL and QBE, Query Processing and
Optimisation, Centralised and Distributed Database, Security, Concurrency and
Recovery in Centralised and Distributed Database Systems, Object Oriented
Database, Management Systems (Concepts, Composite objects, Integration with
RDBMS applications), ORACLE.
Display systems, Input devices, 2D Geometry, Graphic operations,
3D Graphics, Animation, Graphic standard, Applications. Concepts, Storage
Devices, Input Tools, Authoring Tools, Application, Files.
Programming language concepts, paradigms and models. Data, Data
types, Operators, Expressions, Assignment, Flow of Control-Control structures,
I/ O statements, User-defined and built-in functions, Parameter passing.
Principles, classes, inheritance, class hierarchies, polymorphism, dynamic
binding, reference semantics and their implementation. Principles, functions,
lists, types and polymorphisms, higher order functions, lazy evaluation,
equations and pattern matching. Principles, horn clauses and their execution,
logical variables, relations, data structures, controlling the search order,
program development in prolog, implementation of prolog, example programs in
Principles of parallelism, coroutines, communication and
execution, Parallel Virtual Machine (PVM) and Message Passing Interface (MPI)
routines and calls. Parallel programs in PVM paradigm as well as MPI paradigm
for simple problems like matrix multplication. Preconditions, post-conditions,
axiomatic approach for semantics, correctness, denotational semantics. Compiler
structure, compiler construction tools, compilation phases.
Finite Automata, Pushdown Automata, Non-determinism and NFA,
DPDA, and PDAs and languages accepted by these structures. Grammars,
Languages-types of grammars-type 0, type 1, type 2 and type 3. The relationship
between types of grammars, and finite machines. Pushdown automata and Context
Free Grammars. Lexical Analysis-regular expressions and regular languages, LEX
package on Unix. Conversion of NFA to DFA. Minimizing the number of states in a
DFA. Compilation and Interpretation. Bootstrap compilers.
Context free grammars, Parsing and parse trees. Representation
of parse (derivation) trees as rightmost and leftmost derivations. Bottom up
parsers-shift-reduce, operator precedence, and LR, YACC package on Unix system.
Topdown parsers-left recursion and its removal. Recursive descent parser.
Predictive parser, Intermediate codes-Quadruples, triples, Intermediate code
generation, code generation, Code optimization.
Analog and Digital transmission, Asynchronous and Synchronous
transmission, Transmission media, Multiplexing and Concentration, Switching
techniques, Polling. Topologies, Networking Devices, OSI Reference Model,
Protocols for-(i) Data link layer, (ii) Network layer, and (iii) Transport
layer, TCP/IP protocols, Networks security, Network administration.
Definition, Simple and Composite structures, Arrays, Lists,
Stacks queues, Priority queues, Binary trees, B-trees, Graphs. Sorting and
Searching Algorithms, Analysis of Algorithms, Interpolation and Binary Search,
Asymptotic notations-big ohm, omega and theta. Average case analysis of simple
programs like finding of a maximum of n elements, Recursion and its systematic
removal. Quicksort- Non-recursive implementation with minimal stack storage.
Design of Algorithms (Divide and Conquer, Greedy method, Dynamic programming,
Back tracking, Branch and Bound). Lower bound theory, Non-deterministic
algorithm-Non-deterministic programming constructs. Simple non-deterministic
programs. NP-hard and NP-complete problems.
Object, messages, classes, encapsulation, inheritance,
polymorphism aggregation, abstract classes generalization as extension and
restriction, Object oriented design. Multiple inheritance, metadata. HTML, DHTML,
XML, Scripting, Java, Servelets, Applets.
Software development models, Requirement analysis and
specifications. Software design, Programming techniques and tools, Software
validation and quality assurance techniques, Software maintenance and advanced
concepts, Software management.
Introduction, Memory management, Support for concurrent process,
Scheduling, System deadlock, Multiprogramming system, I/O management,
Distributed operating systems, Study of Unix and Windows NT.
Definitions, AI approach for solving problems. Automated
Reasoning with propositional logic and predicate logic-fundamental proof
procedure, refutation, resolution, refinements to resolution
(ordering/pruning/restriction strategies). State space representation of
problems, bounding functions, breadth first, depth first, A, A*, AO*, etc.
Performance comparison of various search techniques. Frames, scripts, semantic
nets, production systems, procedural representations, Prolog programming.
Components of an expert system, Knowledge representation and Acquisition
techniques, Building expert system and Shell. RTNs, ATNs, Parsing of Ambiguous
CFGs. Tree Adjoining Grammars (TAGs). Systems approach to planning, Designing,
Development, Implementation and Evaluation of MIS.
Decision-making processes, evaluation of DSS, Group decision
support system and case studies, Adaptive design approach to DSS development,
Cognitive style in DSS, Integrating expert and Decision support systems.
Theory of Computation : Formal language, Need for formal
computational models, Noncomputational problems, diagonal argument and Russel’s
paradox. Deterministic Finite Automaton (DFA), Non- eterministic Finite
Automaton (NFA), Regular languages and regular sets. Equivalence of DFA and NFA.
Minimizing the number of states of a DFA. Non-regular languages and Pumping
lemma. Pushdown Automaton (PDA), Deterministic Pushdown Automaton (DPDA), Non-equilvalence
of PDA and DPDA.
Context free Grammars : Greibach Normal Form (GNF) and
Chomsky Normal Form (CNF), Ambiguity, Parse Tree Representation of Derivations,
Equivalence of PDA’s and CFG’s. Parsing techniques for parsing of general
CFG’s-Early’s, Cook-Kassami-Younger (CKY) and Tomita’s parsing.
Linear Bounded Automata (LBA) : Power of LBA. Closure
properties. Turing Machine (TM) : One tape, multitape. The notions of
time and space complexity in terms of TM, Construction of TM for simple
problems. Computational complexity. Chomsky Hierarchy of languages : Recursive
and recursively-enumerable languages.
Models for Information Channel : Discrete Memoryless
Channel, Binary Symmetric Channel (BSC), Burst Channel, Bit-error rates.
Probability, Entropy and Shannon’s measure of information, Mutual information,
Channel capacity theorem, Rate and optimality of Information transmission.
Variable Length Codes : Prefix Codes, Huffmann Codes,
Lempel-Ziev (LZ) Codes, Optimality of these codes, Information content of these
Error Correcting and Detecting Codes : Finite fields,
Hamming distance, Bounds of codes, Linear (Parity Check) codes, Parity check
matrix, Generator matrix. Decoding of linear codes, Hamming codes.
Image Processing : Image Registration, Spatial Fourier
transforms, Discrete Spatial (2-dimensional) Fourier Transforms, Restoration,
Lossy Compression of images (pictures).
Data Compression Techniques : Representation and
compression of text, sound, picture, and video files (based on the JPEG and MPEG
Linear Programming : Problem (LPP) in the standard form, LPP
in canonical form, Conversion of LPP in standard form to LPP in Canonical form
Simplex-Prevention of cyclic computations in Simplex and Tableau, Big Method,
dual simplex and revised simplex.
Complexity of simplex algorithm(s) Exponential behaviour of
simplex. Ellipsoid method and karmakar’s method for solving LPPs, Solving simple
LPPs through these methods. Comparison of complexity of these methods.
Assignment and Transportation Problems : Simple algorithms like Hungarian
Shortest Path Problems : Dijkstra’s and Moore’s method,
Network Flow Problem : Formulation, Max-Flow Min-Cut
theorem, Ford and Fulkerson’s algorithm. Exponential behaviour of Ford and
Fulkerson’s algorithm, Malhotra-Pramodkumar- Maheshwari (MPM) Polynomial
algorithm for solving Network flow problem. Bipartite Graphs and matchings;
Solving matching problems using Network flow problems.
Matroids : Definition, Graphic and Cographic matroids, Matroid
Non-Linear programming : Kuhn-Tucker conditions, Convex
functions and Convex regions, Convex programming problems, Algorithms for
solving convex programming problems-Rate of convergence of iterative methods for
solving these problems.
Neural Networks : Perceptron model, Linear separability
and XOR problem. Two and three layered neural nets, Backpropagation-Convergence,
Hopfield nets, Neural net learning, Applications.
Fuzzy Systems : Definition of a Fuzzy set, Fuzzy
relations, Fuzzy functions, Fuzzy measures, Fuzzy reasoning, Applications of
Unix : Operating System, Structure of Unix Operating System.
Unix Commands, Interfacing with Unix, Editors and Compilers for Unix. LEX and
YACC, File system, System calls, Filters, Shell programming.
Windows : Windows environment, Unicode, Documents and
Views, Drawing in a window, Message handling, Scrolling and Spliting views,
Docking toolbars and Status bars, Common dialogs and Controls, MDI,
Multithreading, OLE, Active X controls, ATL, Database access, Network
1. Which among the following is not a structured data type in
2. A B-tree of order m is an m-way scarch tree with
(A) all leaves of the tree on the same level
(B) each node, except for root and leaves, having less than m/2 subtrees
(C) the root of the tree having more than m subtrees
(D) all its leaves connected to form a linked list
3. A brower is a software tool that helps
(A) linking of application program modules
(B) viewing of application information
(C) developing application programs
(D) debugging of application software