Ugc net syllabus Computer Science and Application

National Eligibility Test Syllabus UGC net Syllabus

Ugc net syllabus Computer Science and Application. After Pg degree, if u want the clear net exam then you know the right syllabus for your subject we provide all subject wise syllabus for National Eligibility Test ( Net).

What is UGC net or CBSE net?

The National Eligibility Test (NET), also known as UGC NET or CBSE NET, is a test to determine eligibility for college and university level lecturership and for the award of Junior Research Fellowship (JRF) for Indian nationals. It aims to ensure minimum standards for the entrants in teaching professions and research.

Ugc net syllabus Computer Science and Application

UNIVERSITY GRANTS COMMISSION
NET.BUREAU
Subject: COMPUTER SCIENCE AND APPLICATIONS

Note: There will be two question papers, Paper-II and Paper􀅠nI (Part-A & B}. Paper-ll will cover 50 Objective ‘Type Questions (Multiple choice, Matching type, True/False, Assertion-Reasoning type) carrying 100 marks. Paper In will have two Parts-A and B; Paper-III (A) will have 10 short essay type questions (300 words) carrying 16 marks each. In it, there will be one question with internal choice from each unit (i.e.10 questions from IO units; Total marks will be 160). Paper-III (B) will be compulsory and there will be one question from each of the Electives. The candidate will attempt only one question (one elective only in 800 words) carrying 40 marks. Total marks of Paper-Ill will be 200.

PAPER-II

1. Discrete Structures:-

Sets, Relations, Functions. Pigeonhole Principle, Inclusion-Exclusion Principle, Equivalence, and Partial. Orderings, · Elementary Counting· · Techniques, Probability. The measure (s) for information and Mutual information.
Compatibility: Models of computation-Finite Automata, Pushdown Automata, Non-determinism and NFA, DPDA and PDAs and Languages accepted by these structures.· Grammars, Languages. Non-comput􀃖bility and· Examples of non-computable problems.
Graph: Definitions 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 (WFFL 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 l’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 in, c-arrays, struct, union, string, and pointers.
0-0 Programming Concepts: Class,· objected, instantiation. Inheritance, polymorphism·, and overloading.
C++ Programming: Elements of C++ 7Tokens, identifiers􀇇 Variables, and constants, Pata • types, Operators, Control. statements. Functions. parameter passing. Class .and· objects. Constrictors · and · destructors. Overloading, Inheritance, Templates, Exception handling.

4. Relational Database Design and SQL

ER.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 the 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, InterNetworks.
Reference Models: The OSI model, TCP/IP model.

Data Communication: Channel capacity. Transmission media-twisted pair, coaxial cables, fiber-optic cables, wireless transmission-radio, microwave, · infrared and millimeter waves. Lightwave transmission. Telephones-local loop, trunks, multiplexing, switching, narrowband ISDN, broadband ISDN, ATM, High-speed LANs. Cellular 􀃟dio. Communication satellites-geosynchronous and low-orbit.
Internetworking: Switch/Hub, Bridge, Router, Gateways, Concatenated virtual circuits, Tunnelling; Fragmentation, Firewalls.
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, Nameservers. E-mail-architecture and Serves.

Download UGC net syllabus Computer Science and Application

The Author

Kavinder Kumar

My self Kavinder Kumar student of MSC CS. I am from Sadulpur (Rajasthan). Our website mission provides free Ebooks, Old Papers, Syllabus, Answer keys, and Latest Job notification. Thanks every visitor.

Leave a Reply

Your email address will not be published. Required fields are marked *

GroupExam © 2019