Go Back   2021-2022 StudyChaCha > StudyChaCha Discussion Forum > General Topics

  #1  
Old June 6th, 2014, 06:07 PM
Unregistered
Guest
 
Default Maharashtra State Eligibility Test for Lectureship Computer Science syllabus

I want to give the exam of Maharashtra State Eligibility Test for Lectureship and for that I want to get the syllabus of Computer Science so can you provide me that?
Reply With Quote
Other Discussions related to this topic
Thread
Rajasthan State Eligibility Test For Lectureship
Maharashtra State Eligibility Test For Lectureship
Karnataka State Eligibility Test For Lectureship
Eligibility criteria of Maharashtra State Eligibility Test for Lectureship
Maharashtra State Eligibility Test for Lectureship exam syllabus of Commerce
Maharashtra State Eligibility Test for Lectureship results details
Maharashtra State Eligibility Test for Lectureship Computer Science question papers o
Maharashtra State Eligibility Test for Lectureship Physics exam question papers of pa
Maharashtra State Eligibility Test for Lectureship Hindi previous year question paper
Maharashtra State Eligibility Test for Lectureship syllabus of Computer Science free
Maharashtra State Eligibility Test for Lectureship Psychology study material free dow
Maharashtra State Eligibility Test for Lectureship (SET) question papers of Life Scie
Exam scheme of Maharashtra State Eligibility Test for Lectureship (SET)
Exam Pattern of Maharashtra State Eligibility Test for Lectureship
Maharashtra State Eligibility Test for Lectureship syllabus of Social Work
Maharashtra State Eligibility Test for Lectureship papers of Social Work
Maharashtra State Eligibility Test for Lectureship Education syllabus free download
Maharashtra State Eligibility Test for Lectureship Life Science material free downloa
Maharashtra State Eligibility Test for Lectureship coaching class in Pune
Maharashtra State Eligibility Test for Lectureship eligibility criteria






  #2  
Old June 9th, 2014, 11:10 AM
Super Moderator
 
Join Date: May 2011
Default Re: Maharashtra State Eligibility Test for Lectureship Computer Science syllabus

As you want to get the syllabus of Computer Science of exam of Maharashtra State Eligibility Test for Lectureship so here is the information of the same for you:

Some content of the file has been given here:

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.
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.

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.

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.

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.

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

For more detailed information I am uploading a PDF file which is free to download:


Contact Details:
University Of Pune
Ganeshkhind,
Pune,
Maharashtra 411007 ‎
020 2560 1099
India

Map Location:
__________________
Answered By StudyChaCha Member

Last edited by Educhamp; June 9th, 2014 at 11:30 AM.
Reply With Quote
  #3  
Old October 31st, 2015, 09:18 AM
Unregistered
Guest
 
Default Re: Maharashtra State Eligibility Test for Lectureship Computer Science syllabus

Hey buddy can you please provide me Computer Science Syllabus as I’m preparing for Maharashtra State Eligibility Test?
Reply With Quote
  #4  
Old October 31st, 2015, 09:23 AM
Super Moderator
 
Join Date: Dec 2011
Default Re: Maharashtra State Eligibility Test for Lectureship Computer Science syllabus

As you are preparing for Maharashtra State Eligibility Test for that I will help you here to get the Computer Science Syllabus so that you can easily cover the exam topics.




Here is the exam syllabus of Maharashtra State Eligibility Test computer science.
Computer Science Syllabus

Here I have some details about the syllabus please have a look on them if your are interested in.
General Paper on Teaching & Research Aptitude (Paper-I)
Marathi
Hindi
English
Sanskrit
History
Economics
Philosophy
Psychology
Sociology
Political Science
Defence and Strategic Studies
Home Science
Library & Information Science
Journalism and Mass Communication
Social Work
Public Administration
Mathematical Sciences
Environmental Sciences
Physics
Chemical Sciences
Life Sciences
Earth , Atmospheric, Ocean & Planetary Sciences
Geography
Computer Science and Applications
Electronic Science
Commerce



Attached Files Available for Download
File Type: pdf Maharashtra State Eligibility Test for Lectureship Computer Science syllabus.pdf (43.2 KB, 24 views)
__________________
Answered By StudyChaCha Member

Last edited by Aakashd; August 13th, 2018 at 09:33 AM.
Reply With Quote
Reply


Reply to this Question / Ask Another Question
Your Username: Click here to log in

Message:
Options



All times are GMT +6.5. The time now is 01:04 AM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, vBulletin Solutions, Inc.
Search Engine Friendly URLs by vBSEO 3.6.0 PL2

1 2 3 4 5 6 7 8