1. #1
    thanneru
    Join Date
    Feb 2012
    Posts
    1

    What is the syllabus for NET(Computer Science),2012?

    Hi,
    can any body give the syllabus for net in 2012 for computer science.




  2. #2
    athiksha
    Join Date
    Jan 2012
    Location
    hyderabad
    Posts
    272

    Re: What is the syllabus for NET(Computer Science),2012?

    Quote Originally Posted by thanneru View Post
    Hi,
    can any body give the syllabus for net in 2012 for computer science.
    Hi
    I have attaced one pdf file which contain syllabus of NET exam.
    Please check that.
    I hope you will definetly clear that exam.
    My best wishes with you.
    Good luck
    Attached Files




  3. #3
    venkataprakash
    Join Date
    Apr 2011
    Location
    chennai.
    Posts
    1,275

    Re: What is the syllabus for NET(Computer Science),2012?

    Syllabus of NET (Computer Science ) :-
    ------------------------------------------------
    • Discrete Structures
    • Computer Arithmetic
    • Programming in C and C++
    • Relational Database Design and Sql
    • Data and File Structure
    • Computer Networks
    • System Software and Compilers
    • Operating Systems
    • Software Engineering
    • Current Trends and Technologies .

    I am uploaded the syllabus of this examination and i hope it is very useful for your exam preparation .


    Qualification Required for NET exam :-
    ----------------------------------------------

    NET Stands for National Eligibility Test and this examination is conducted by University Grants Commission two times in a year . Mostly the examination will held in the month of June and December . June notification will be publish in the month of May or April in the official website of UGC ( University Grants Commission ) .

    To Crack this examination , the candidate should have a passed Master degree with any desire subject from a recognized University or equivalent qualification and the candidate must secure at least 55% aggregate marks in their examination . 50% aggregate marks for reserved categories .

    Those who are pursing in the final year of degree course may also eligible to apply for NET examination . There is no backlogs at the time of appearing for this examination.

    There is no upper age limits for applying for lectureship in examination .

    Exam pattern of this examination :- Click here !!!

    Previous year question papers :- Click here !!!
    Attached Files

  4. #4
    arvind_singh
    Join Date
    May 2011
    Location
    pune
    Posts
    1,049

    Re: What is the syllabus for NET(Computer Science),2012?

    Paper I

    Teaching and Research Aptitude(General Paper).

    Paper II

    Discrete Structures.
    Computer Arithmetic.
    Programming in C and C++.
    Relational Database Design and SQL.
    Data and File Structures.
    Computer Networks.
    System Software and Compilers.
    Operating Systems with Case Study of Unix.
    Software Engineering.
    Current Trends and Technologies.

    Paper III - Core Group

    Digital Systems and Microprocessors.
    Data Base Management Systems.
    Computer Graphics.
    Programming Concepts.
    Data Communication and Networks.
    Data Structures and Algoritms.
    OOP and Web Technologies.
    Advanced Software Engineering.
    Operating Systems.
    Artificial Intelligence.

    Paper III - Elective/Optional
    Finite Automata and Formal Languages.
    Information Theory and Coding.
    Operation Research.
    Neural Networks and Fuzzy Systems.
    Unix and Windows.

    I have attached the syllabus for the examination hope it will help you to prepare for the exam.
    Attached Files

  5. #5
    shiva636
    Join Date
    Jun 2011
    Posts
    1,407

    Re: What is the syllabus for NET(Computer Science),2012?

    Hello Friend,

    NET-National Eligibility Test.

    Eligibility Criteria:

    >>You must t at least 55% marks in Masterís Degree OR equivalent examination from universities recognised by UGC in Humanities and Social Sciences, Computer Science & Applications, Electronic Science

    >>Final year students are also eligible to apply for the exam.

    Age Limit:

    >>You should not be more than 28 years as on 01/6/2011.

    >>Relaxation upto 5 years is provided to the candidates belonging to SC/ST/OBC/PH/VH categories and to women applicants.

    >>There is no upper age limit for lectureship.

    Examination Pattern:

    It consist of three papers.

    Paper-I :

    >>It is of general nature for assessing the teaching/research aptitude.

    Paper-II :

    >>Its consist of objective questions based on the subject selected by you only.


    Paper-III :


    >>It will consist of only descriptive questions from the subject selected by you only.



    Important Books For You:









    I am attaching you Computer science syllabus of UGC NET below



    All The Best...

    Attached Files

  6. #6
    BISWARUP
    Join Date
    May 2011
    Location
    PURULIA
    Posts
    3,998

    Re: What is the syllabus for NET(Computer Science),2012?

    NET stands for National Eligibility Test which is conducted by UGC.This exam will be happened twice time in a year.

    Those candidate have completed masters degree from recognized university are eligible for NET exam.

    For general and OBC candidate must be scored 55% above in masters degree. For SC/ST candidate scored 50% above in masters degree.

    I have attached the Syllabus for NET computer Science Exam so please check it out.
    Attached Files

  7. #7
    Rahul kuntala
    Join Date
    Aug 2011
    Location
    India
    Posts
    1,394

    Re: What is the syllabus for NET(Computer Science),2012?

    NET stands for National Eligiblity Test is conducted by UGC. I am attaching you the syllabus at the end of this post

    NET is conducted twice in a year.
    -June
    -December

    You will have the subjects like;
    Operating Systems
    Software Engineering
    Computer Networks
    System Software and Compilers

    Eligibility for NET::

    >>You must have completed Mater degree(PG) in any steam from recognized university
    >>You must pass your PG with minimum of 55% marks
    >>50% for ST/SC/PH/Females
    >>Final year students are also eligible

    Important Dates for NET 2012:

    Application forms for NET-2012 will be starting available from:
    22nd February 2012

    ->>NET exam closing date:
    8th mArch 2012

    ->>Last date of recieving of applications:
    12th April 2012

    ->>The dispatch of admit cards for the NET 2012 will be starting from:
    21st May 2012

    ->>The NET 2012 is on 8th June 2012



    Syllabus Available in Official website : http://www.ugc.ac.in/inside/syllabus.html

    For More details,
    Please Visit the official website : http://www.ugcnetonline.in
    Attached Files

  8. #8
    Rahul k
    Join Date
    May 2011
    Location
    Uttranchal,Rishikesh
    Posts
    1,943

    Re: What is the syllabus for NET(Computer Science),2012?

    NET stands for National Eligibility test and this examination is Conducted by UGC, Twice in a year and the examination is held on June and December every year and If you have completed your Post graduate degree course in Computer science, then you can choose Computer science subject in NET Examination, The Notification of June NET Examination was already Published and the Online Registration process was already started.

    To apply for NET, you have to complete your Post graduate degree course with minimum 55% marks, Final year appearing candidates are also eligible for NET and you must have attained the age of 19 years.

    There is no Upper age restriction to apply for Lectureship Post, But for Junior Research Fellowship Post, your age should not be more than 28 years, Upper age relaxation is applicable for SC/ST/OBC Candidates. Eligible candidates may fill the NET Application form Online Only, the examination fees of NET is Rs 450 and you have to pay the fees through challan form in SBI Bank. the challan form is availiable in the official website after declaring the Notification.

    From this year Onward's all 3 NET Examination papers will be Objective, No Descriptive papers will be there in NET Examination and No Negative marking in the examination.

    Important Dates of NET :

    ~~ Application Submission End Date : Monday; Apr. 30, 2012
    ~~ Last date for receiving the documents at the test center : Monday; May 07, 2012
    ~~ Examination Date : Sunday; June 24, 2012

    If you have completed your Post graduation with minimum 55% Marks then please fill the NET Application form soon before the last date.

    Before filling the online application form please pay the fees of Rs 450 in SBI through challan form, You can download the challan form directly form the UGC Website.

    If you need the syllabus of Computer Science Syllabus of NET then please do not worry because here i am Uploading syllabus of NET Examination, Please download the syllabus from the given attachment and if you need more details then check official website :







    http://ugcnetonline.in
    Attached Files

  9. #9
    para
    Join Date
    Aug 2011
    Posts
    537

    Re: What is the syllabus for NET(Computer Science),2012?

    NET is NATIONAL ELIGIBILITY TEST and The Examination pattern in given in the image below.



    The Full Syllabus for the NET exam is:

    Paper I:Teaching and Research Aptitude(General Paper).

    Paper II: For Subject Knowledge(Computers)
    • Discrete Structures.
    • Computer Arithmetic.
    • Programming in C and C++.
    • Relational Database Design and SQL.
    • Data and File Structures.
    • Computer Networks.
    • System Software and Compilers.
    • Operating Systems with Case Study of Unix.
    • Software Engineering.
    • Current Trends and Technologies.

    Paper III - Core Group
    • Digital Systems and Microprocessors.
    • Data Base Management Systems.
    • Computer Graphics.
    • Programming Concepts.
    • Data Communication and Networks.
    • Data Structures and Algoritms.
    • OOP and Web Technologies.
    • Advanced Software Engineering.
    • Operating Systems.
    • Artificial Intelligence.

    Paper III - Elective/Optional
    • Finite Automata and Formal Languages.
    • Information Theory and Coding.
    • Operation Research.
    • Neural Networks and Fuzzy Systems.
    • Unix and Windows.

  10. #10
    minni
    Join Date
    Mar 2012
    Posts
    411

    Re: What is the syllabus for NET(Computer Science),2012?

    Quote Originally Posted by thanneru View Post
    Hi,
    can any body give the syllabus for net in 2012 for computer science.
    hello........
    UGC-NET Syllabus 2012 for Computer Science and Applications:-

    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 noncomputable 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 Satisfiability and Tautology.
    Logic Families: TTL, ECL and C-MOS gates. Boolean algebra and Minimization of Boolean functions, Flipflops-
    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, identifiers, data types in C. Control structures in C. Sequence,
    selection and iteration(s). Structured data types m 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 - INF, 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. Communications. satellites - geosynchronous and low-orbit.
    Internetworking: Switch/Hub, Bridge, Router, Gateways, Concatenated virtual circuits, Tunnelling,
    Fragmentation, Firewalls.
    2
    Routing: Virtual circuits and datagrams. Routing algorithms. Congestion 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 microprocessors.
    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 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.


    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) : Great, 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 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 protocol s , mobile computing applications . Mobile databases - protocols, scope,
    tools and technology. M-business.
    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 Telecomrnunications: Concepts, Frame Relay, Cell Relay, Switched Multimegabit Data
    Service, Asynchronous Transfer Mode.
    Main concepts in Geographical Information System (GIS), E-cash, EBusiness, 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, and 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 (Subjective Type)

    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, PIII/ 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, co routines, 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 multiplication. 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, Language- 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, Btrees,
    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. Quick sort - 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 inheritances, 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 GFGs. 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.


    PAPER-III (B)


    (ELECITVE/OPTIONAL)

    Elective - I

    Theory of Computation: Formal language, Need for formal computational models, Non-computational
    problems, diagonal argument and Russellí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-equivalence of PDA and
    DPDA.
    Contexts 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-M 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 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-linear4:58 PM 1/5/2012 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 Splitting views, Docking toolbars and Status bars, Common dialogs and Controls,
    MDI, Multithreading, OLE, Active X controls, ATL, Database access, Network programming.


    prepare well
    all the best

  11. #11
    oh my friend
    Join Date
    Dec 2011
    Posts
    1,580

    Re: What is the syllabus for NET(Computer Science),2012?

    Quote Originally Posted by thanneru View Post
    Hi,
    can any body give the syllabus for net in 2012 for computer science.
    Hello friend...



    *NET-National Eligibility Test.

    *NET examination is conducted by University Grants Commission two times in a year

    * Mostly the examination will held in the month of June and December .

    * June notification will be publish in the month of May or April in the official website of UGC
    (University Grants Commission )

    Eligibility Criteria:

    -->You must t at least 55% marks in Masterís Degree OR equivalent examination from universities recognised by UGC in

    -Humanities and Social Sciences

    -Computer Science & Applications

    -Electronic Science

    -->You should not be more than 28 years as on 01/6/2011.

    -->There is no upper age limit for lectureship.


    syllabus for NET(Computer Science)

    Teaching and Research Aptitude(General Paper).

    Discrete Structures.

    Computer Arithmetic.

    Programming in C and C++.

    Relational Database Design and SQL.

    Data and File Structures.

    Computer Networks.

    System Software and Compilers.

    Operating Systems with Case Study of Unix.

    Software Engineering.

    Current Trends and Technologies.

    Digital Systems and Microprocessors.

    Data Base Management Systems.

    Computer Graphics.

    Programming Concepts.

    Data Communication and Networks.

    Data Structures and Algoritms.

    OOP and Web Technologies.

    Advanced Software Engineering.

    Operating Systems.

    Artificial Intelligence.

    Elective/Optional

    Finite Automata and Formal Languages.

    Information Theory and Coding.

    Operation Research.

    Neural Networks and Fuzzy Systems.

    Unix and Windows.



    all the best

  12. #12
    parveen22
    Join Date
    May 2011
    Posts
    807

    Re: What is the syllabus for NET(Computer Science),2012?

    Dear friend,

    The National Educational Testing Bureau of University Grants Commission (UGC) conducts National Eligibility Test (NET) to determine eligibility for lectureship and for award of Junior Research Fellowship (JRF).


    The Test is conducted in Humanities (including languages), Social Sciences, Forensic Science, Environmental Sciences, Computer Science and Applications and Electronic Science.

    UGC conducts NET twice a year, i.e., in the months of June and December.


    Documents needed at the time of filling forms:

    1.High School/Higher Secondary/Matriculation Certificate depicting date of birth.

    2.Master's degree/Provisional Certificate.

    3.Consolidated mark-sheet of Master's degree course. (Wherever grades are assigned, conversion table in terms of consolidated percentage may be produced from the issuing authority).

    4.Caste certificate (only in case of SC/ST/OBC candidates)

    5.Certificate of Physical disability (only in case of Physically Handicapped and Visually Handicapped candidates).


    Eligibility for NET:
    1. Yo should have done masters degree.

    2. You should have minimum 60% marks in masters degree.

    Important Dates 2012


    UGC NET 2012 Application Submission Start Date : 29-3-2012
    UGC NET 2012 Application Submission End Date : 25-4-2012
    UGC NET 2012 Last date for receiving the documents at the test center: 2-5-2012
    UGC NET 2012 Examination Date : 26-6-2012

    Following is the syllabusof NET(Computer Scinece):

    1. Discrete Structures
    2. Data structure
    3. Programming in C and C++
    4. Relational Database Design and SQL
    5. System programming
    6. Computer Networks
    7. System Software and Compilers
    8. Operating Systems
    9. Software Engineering
    10. Current Trends and Technologies

    best of lk....

  13. #13
    BISWARUP
    Join Date
    May 2011
    Location
    PURULIA
    Posts
    3,998

    Re: What is the syllabus for NET(Computer Science),2012?



    NET stands for National Eligibility Test which is conduct twice time in year by UGC.This test conduct for lectureship , PHD and JRF .

    Those candidate have completed masters degree from recognized university are eligible for NET exam but their is also some marks criteria.

    For general and OBC candidate must be hold 55% above marks in masters degree. For SC/ST candidate must be hold 50% above in masters degree.

    For Junior research fellowship course your age must be in between 19 to 28 years.

    For lectureship ,There is no upper age limit but the Minimum age is 19 years.There is no restriction for attempts NET exam.

    NET Exam date for June session Already announced by UGC.So i have provide the proper exam notification .You can check it out.

    From this year NET Pattern will be changed .I have listed the details about that.

    I have attached the Syllabus for NET exam for computer science department so please check it out.
    Attached Files

  14. #14
    balarmkec
    Join Date
    Apr 2012
    Posts
    42

    Re: What is the syllabus for NET(Computer Science),2012?

    Quote Originally Posted by thanneru View Post
    Hi,
    can any body give the syllabus for net in 2012 for computer science.
    Hi,

    To clear NET, you need to write three papers. Examination will be based on the core questions of computer.

    All The Best

+ Reply to Thread

Quick Reply Any Question?