Purpose of the TOEFL Test
The purpose of the TOEFL test is to evaluate the English proficiency of people who are non-native English speakers. In addition, international companies, government agencies, scholarship programs, and recruitment agencies use TOEFL scores to evaluate English proficiency.
CBT: The TOEFL test on computer combines many of the same question types as the traditional paper-based test with new question types that can be offered only in the computer format. This is an easy-to-use testing system for even the most basic computer users.
The Computer-Based TOEFL Test has 4 sections
Section 1: Listening
Section 2: Structure (Grammar)
Section 3: Reading
Section 4: Writing
1. Listening Comprehension:
Measures the ESL student's ability to understand North American English.
2. Structure & Written Expression
Measures the ESL student's ability to recognize language appropriate for standard written English.
3. Vocabulary & Reading Comprehension
Measures the ESL student's ability to understand non-technical reading material.
4. Essay Writing
Measures the ESL student's ability to express ideas in standard written English.
Scoring:
The score range on the CBT TOEFL Test is: 0-300. In other words, the highest possible total score is 300 points.
This breaks down in each section as a scaled score:
Listening: 0-30
Structure/Writing: 0-30
Reading Comprehension: 0-30
TOTAL SCALED SCORE: 0-300
The score from the essay in the Writing Section is included in the Structure score. The essay is graded on a scaled score of 0 to 6. 6 is the highest possible total score on the Writing Section. Note: The essay score is one sixth of the total test score.
Number of Questions in the test and the time to complete each section:
Tutorials: 7 untimed tutorials explaining in detail the exam procedure
Listening: 30 to 49 questions with 15-25 minutes to answer the questions. 40-60 minutes to complete entire section. The clock runs while you are answering questions, but not while you are listening to conversations and talks.
Structure: 20-25 questions with 15-20 minutes to complete the questions.
Reading: 44-55 questions with 70-90 minutes to complete the section (includes time spent reading passages and answering questions).
Writing: One assigned essay topic, with 30 minutes to write the essay.
How often can I take the CBT TOEFL test?
If I cancel my scores, can I take the test again?
You may take the CBT TOEFL test only once in any calendar month, even if you took the test and cancelled your scores. For example, if you test in May, you must wait until June to take it again. IMPORTANT: If you take the test more than once in a calendar month, your new scores will not be reported and your test fee will not be refunded. Violation of this policy may also result in additional action being taken.
Wednesday, September 23, 2009
CCRAS Research Officer, CCRAS Central Council for Research in Ayurveda & Siddha
The CCRAS is an autonomous organization under theMinistry of Health & Family Welfare. It is a technical Institute for formulation, co-ordination, development and promotion of Research in the fields of Ayurveda and Siddha.The research areas also include literary and fundamental research, drug research, clinical research etc.
Job profile: The researchofficers will be responsible for carrying R & D work in the field of Ayurveda and Siddha and its allied disciplines. They will also be responsible for carrying research work in the field of clinical pathology and pharmacology. They will be working on various projects and working for the promotion of Ayurveda.
Eligibility: A candidate must not exceed the age of 40 years. However, relaxation can be claimed as per the rules.
Educational Qualifications: For a research officer in Ayurveda – A candidate must have a degree/diploma in ayurveda from a recognized university OR a post graduate degree in ayurveda with a minimum experience of 8 years. For a research officer in Pharmacology – A candidate must have a doctorate degree in Pharmacology from a recognized university OR an M.Sc/M.V.Sc degree in pharmacology with a minimum experience of 3 years. For a research officer inClinical Pathology – A candidate must be an MBBS or a candidate must have a degree/diploma in clinical pathology with a minimum of 2 years experience OR a candidate must have a post graduate degree/diploma from a recognized university.
No. of posts: There are 4 posts (ST-3 & SC-1) in ayurveda, 1 post (OBC) in pharmacology and 1 post (UR) in clinical pathology.
Pay scale: The research officers will be given a pay scale of Rs15600-39100 plus a grade Pay of Rs5400.
Selection process: The candidates will have to appear for an interview.
How to apply: The candidates are required to apply as per the format given on the website. The candidates are required to pay a fee of Rs100 (Rs20 in case of SC/ST) in the form of a DD drawn in the favor of Director General CCRAS payable at New Delhi. All the applications must be sent to Deputy Director (Admn.), Central Council for Research in Ayurveda and Siddha, No.61-65 Institutional Area opposite D Block Janak Puri, New Delhi – 110058
The last date for the receipt of applications is 28th September 2009.
For more details visit www.ccras.nic.in
NET Exam cliteria examinatoin pattern
Council of Scientific &Industrial Research (CSIR) is undoubtedly one of the best Resource Development institutions in India. Council of Scientific & Industrial Research is a premier organization which was set up in 1942 and since then it has contributed highly in the field of Resource Development. CSIR conducts National Eligibility Test twice a year inJune and December for admission to Junior Research Fellowship and eligibility for lectureship in Indian Universities and Colleges.
Candidates can give CSIR NET from one of the following five subjects:Chemical Sciences; Earth, Atmosphere, Ocean and Planetary Sciences; Life Sciences; Mathematical Sciences and Physical Sciences. Candidates have to choose the subject in which they did their master’s and want to pursue research or lecturership.
Eligibility criteria:
A candidate should have atleast 55% marks in MSc. or an equovalent examination. Those in the final year can also apply but will have to submit provisional certificate at the time of counselling.
Those who are applying for Junior Research Fellowship should be between the age of 19-28 years(19-33 years for SC/ST). For Lecturership there is no age limit.
Availability of Application forms for CSIR NET:
The forms for CSIR NET will be available in the selected braches of various banks. The form can also be obtained by post by sending a Demand Draft along with the request for form to Indian Bank, West Patel Nagar, New Delhi. Candidates will aslo be able to apply online at the website csirhrdg.res.in.
Important Dates(Tentative):
Availability of application forms: August 2nd week- September 1st week, 2009
Last Date for submission of application forms: September 2nd week, 2009
Date of examination: December 3rd week, 2009
Please note that the dates are only tentative and are not final. The post will be updated as soon as the dates are officially released.
Examination Pattern: The test will be divided in two parts of two and a half hours each. Detailed syllabus for CSIR NET is given in the following link:
Paper-1 will be of 200 marks and divided in two parts. Part 1 will contain 40 objective type questions from theof which the candidate will have to answer only 25 and the questions will be common to all the candidates. Part 2 will contain 100 questions of which a candidate has to answer 75 from the specific subject the candidate has opted for. There will be negative marking for wrong answers.
Paper-2 will also be of 300 marks and the questions will be subjective type from the subject which the candidate has chosen.
Monday, July 27, 2009
Set Exam syllabus and sample paper
[37] : COMPUTER SCIENCE & APPLICATIONS
SYLLABUS AND SAMPLE QUESTIONS
NOTE : STRUCTURE OF PAPER II AND REVISED STRUCTURE OF PAPER III PLEASE
SEE PAGE NUMBER ONE.
PAPER—II
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 information.
Computability : Models of computation-Finite Automata, Pushdown Automata. Non-determinism
and NFA, DPDA and PDAs and Languages accepted by these structures. Grammars, Languages,
Non-computability and Examples of non-computable problems.
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 codes.
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 representation.
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.
SET (Computer Science & Applications) / 4
computer sci & applicat_SET syllabus (03-09)
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, Inter 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, narrowband
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.
SET (Computer Science & Applications) / 5
computer sci & applicat_SET syllabus (03-09)
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 handling.
UNIX
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 metrics.
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 Computing
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, M-business.
SET (Computer Science & Applications) / 6
computer sci & applicat_SET syllabus (03-09)
E-Technologies
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 Warehouses.
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.
Windows Programming
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, common dialogs.
Advanced Windows Programming
Multiple Document Interface (MDI), Multithreading, Object linking and Embedding (OLE),
Active X controls, Active Template Library (ATL), Network programming.
PAPER—III (A)
(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.
Unit—II
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.
SET (Computer Science & Applications) / 7
computer sci & applicat_SET syllabus (03-09)
Unit—III
Display systems, Input devices, 2D Geometry, Graphic operations, 3D Graphics, Animation,
Graphic standard, Applications.
Concepts, Storage Devices, Input Tools, Authoring Tools, Application, Files.
Unit—IV
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 prolog.
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.
Unit—V
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.
SET (Computer Science & Applications) / 8
computer sci & applicat_SET syllabus (03-09)
Unit—VI
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.
Unit—VII
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.
Unit—VIII
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.
Unit—IX
Introduction, Memory management, Support for concurrent process, Scheduling, System
deadlock, Multiprogramming system, I/O management, Distributed operating systems, Study
of Unix and Windows NT.
Unit—X
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.
SET (Computer Science & Applications) / 9
computer sci & applicat_SET syllabus (03-09)
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.
PAPER—III (B)
(ELECTIVE/OPTIONAL)
Elective—I
Theory of Computation : Formal language, Need for formal computational models, Noncomputational
problems, diagonal argument and Russel’s paradox.
Deterministic Finite Automaton (DFA), Non-deterministic 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.
Elective—II
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 codes.
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 standards).
Elective—III
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.
SET (Computer Science & Applications) / 10
computer sci & applicat_SET syllabus (03-09)
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 method, etc.
Shortest Path Problems : Dijkstra’s and Moore’s method, Complexity.
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 intersection problem.
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.
Elective—IV
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 Fuzzy systems.
Elective—V
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 programming.
SAMPLE QUESTIONS
PAPER—II
1. Which among the following is not a structured data type in C ?
(A) Union
(B) Pointer
(C) String
(D) Boolean
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
SYLLABUS AND SAMPLE QUESTIONS
NOTE : STRUCTURE OF PAPER II AND REVISED STRUCTURE OF PAPER III PLEASE
SEE PAGE NUMBER ONE.
PAPER—II
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 information.
Computability : Models of computation-Finite Automata, Pushdown Automata. Non-determinism
and NFA, DPDA and PDAs and Languages accepted by these structures. Grammars, Languages,
Non-computability and Examples of non-computable problems.
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 codes.
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 representation.
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.
SET (Computer Science & Applications) / 4
computer sci & applicat_SET syllabus (03-09)
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, Inter 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, narrowband
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.
SET (Computer Science & Applications) / 5
computer sci & applicat_SET syllabus (03-09)
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 handling.
UNIX
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 metrics.
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 Computing
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, M-business.
SET (Computer Science & Applications) / 6
computer sci & applicat_SET syllabus (03-09)
E-Technologies
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 Warehouses.
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.
Windows Programming
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, common dialogs.
Advanced Windows Programming
Multiple Document Interface (MDI), Multithreading, Object linking and Embedding (OLE),
Active X controls, Active Template Library (ATL), Network programming.
PAPER—III (A)
(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.
Unit—II
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.
SET (Computer Science & Applications) / 7
computer sci & applicat_SET syllabus (03-09)
Unit—III
Display systems, Input devices, 2D Geometry, Graphic operations, 3D Graphics, Animation,
Graphic standard, Applications.
Concepts, Storage Devices, Input Tools, Authoring Tools, Application, Files.
Unit—IV
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 prolog.
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.
Unit—V
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.
SET (Computer Science & Applications) / 8
computer sci & applicat_SET syllabus (03-09)
Unit—VI
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.
Unit—VII
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.
Unit—VIII
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.
Unit—IX
Introduction, Memory management, Support for concurrent process, Scheduling, System
deadlock, Multiprogramming system, I/O management, Distributed operating systems, Study
of Unix and Windows NT.
Unit—X
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.
SET (Computer Science & Applications) / 9
computer sci & applicat_SET syllabus (03-09)
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.
PAPER—III (B)
(ELECTIVE/OPTIONAL)
Elective—I
Theory of Computation : Formal language, Need for formal computational models, Noncomputational
problems, diagonal argument and Russel’s paradox.
Deterministic Finite Automaton (DFA), Non-deterministic 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.
Elective—II
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 codes.
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 standards).
Elective—III
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.
SET (Computer Science & Applications) / 10
computer sci & applicat_SET syllabus (03-09)
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 method, etc.
Shortest Path Problems : Dijkstra’s and Moore’s method, Complexity.
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 intersection problem.
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.
Elective—IV
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 Fuzzy systems.
Elective—V
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 programming.
SAMPLE QUESTIONS
PAPER—II
1. Which among the following is not a structured data type in C ?
(A) Union
(B) Pointer
(C) String
(D) Boolean
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
Subscribe to:
Posts (Atom)
