2023 2024 Student Forum > Management Forum > Main Forum

 
  #1  
22nd August 2014, 02:38 PM
Unregistered
Guest
 
Maharashtra State Eligibility Test for Lectureship syllabus of Computer Science

Will you please share with me the Maharashtra State Eligibility Test for Lectureship syllabus of Computer Science?
Similar Threads
Thread
Dates of exam of Maharashtra State Eligibility Test for Lectureship
Karnataka State Eligibility Test for Lectureship (SET)
Online application process of Maharashtra State Eligibility Test for Lectureship
Syllabus of exam of History of Maharashtra State Eligibility Test for Lectureship
Deadlines to apply for the exam of Maharashtra State Eligibility Test for Lectureship
Maharashtra State Eligibility Test for Lectureship dates
Maharashtra State Eligibility Test for Lectureship Commerce previous year question pa
Maharashtra State Eligibility Test for Lectureship last year question papers of Hindi
Dates of Maharashtra State Eligibility Test for Lectureship
Maharashtra State Eligibility Test for Lectureship exam eligibility criteria
Maharashtra State Eligibility Test for Lectureship Electrical reference books
Maharashtra State Eligibility Test for Lectureship exam pattern
Syllabus of exam of Hindi of Maharashtra State Eligibility Test for Lectureship
Syllabus and the exam pattern of Maharashtra State Eligibility Test for Lectureship
Syllabus of Maharashtra State Eligibility Test for Lectureship
Maharashtra State Eligibility Test for Lectureship papers of Library & Information Sc
Maharashtra State Eligibility Test for Lectureship Commerce last year papers
Maharashtra State Eligibility Test for Lectureship syllabus
Maharashtra State Eligibility Test for Lectureship results December
Maharashtra State Eligibility Test for Lectureship Commerce last year question papers
  #2  
22nd August 2014, 03:36 PM
Super Moderator
 
Join Date: Apr 2013
Re: Maharashtra State Eligibility Test for Lectureship syllabus of Computer Science

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

Some content of the file has been given here:

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


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.




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:
[MAP]https://www.google.co.in/maps?q=University+of+Pune&hl=en&ll=18.553366,73.82 4692&spn=0.010273,0.013046&sll=23.013843,72.570276 &sspn=0.009974,0.013046&t=m&z=16&iwloc=A[/MAP]


Quick Reply
Your Username: Click here to log in

Message:
Options

Thread Tools Search this Thread



All times are GMT +5. The time now is 10:39 PM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2024, vBulletin Solutions Inc.
SEO by vBSEO 3.6.0 PL2

1 2 3 4