UGC NET Computer Science And Application Paper-III (Core Group) , Ph 078-380-243-65

Global Teachers Academy Formally Name UGC NET D Provides Coaching For UGC NET Computer Science and Application in Delhi. We Provides Best Study Material For Computer Science and Applications, Management, Commerce, Education, Economics, English, Finance, Psychology, Mass Communication and Journalism, Hindi, Human Resources, History in Delhi.
If You are looking For A Best Institute for UGC NET Computer Science Exam in Delhi then Can Contact us at:- 09953762308

Paper-III (Core Group)

• Unit-I
Combinational circuit design, Sequential Circuit design, Hardware ad Micro programmed processor design, Instruction formats, Addressing models Memory types and organization, Interfacing peripheral devices, Interrupts
Microprocessor architecture, Instruction set and Programming (8085. P-III/P-IV), Microprocessor applications


• unit-II
Database concepts, ER diagrams, Data model, Design of Relational Database, Normalization, SQL and QBE, Query Processing and Optimization, Centralized and Distributed Database, Security, Concurrency an recovery in centralized and Distributed Database System, Object oriented Database Management System (Concept, composite object , Integration with RDBMS application), ORACLE


• Unit-III
Display system , input devise, 2D, geometry, Graphics operation, 3D Graphics, Animation Graphic Standard, Application
concepts, Storage Devices, Input Tools, Authoring Tools, Application files


• Unit-IV
Programming language , concepts, Paradigm and models
Data , Data types, Operators, Expressions, Assignments , Flow of control-Control Structure, I/O Statement, User Defined and Built in Function parameter passing
Principles , Classes, Inheritance, Class hierarchies, Polymorphism, Dynamic binding, reference semantics and their implementation
Principles, functions, lists, types and polymorphism, higher order functions lazy evaluation equations and pattern matching
Principles , horn clauses and their execution, logical variables relations, data structure, Controlling the search order, programme development in prolog implementation of prolog, example programme in prolog
Principle of parallelism co routines, Communication and execution, Parallel virtual Machine (PVM) and message passing interface (MPI), routine an calls , Parallel programmes in PVM paradigm a swell as MPI, paradigm for simple problems like matrix multiplication
Preconditions , post conditions, axiomatic approaches for semantic, correction's denotation semantics
Complier structure, Compiler construction tools, coalition phases
Finite Automata, Pushdown Automata, Non-Determinations, and NFA, DPDA and PDAs and language accepted by these structure, Grammars, language-Types of grammar-type,0, type 1, tope 2, type 3, The relationship between types of grammars, and finite machine, Pushdown automata and context free Framers, Lexical Analysis-regular express and regular languages.LEX pacemaker on UNIX, Conversion of NFA to DFA minimizing the number of states in a DFA, Compilation an interpretation Bootstrap Compilers
Context free grammars, Parsing and parse trees, representation of parse trees as rightmost ma leftmost derivation. Bottom up parsers-shift reduce, operator precedence an LR, YACC package on UNIX, system, Top down parsers-Left recursion and its removal , recursive descent Parsers, Predictive parser Intermediate codes-Quadruples, triples, Intermediate code generation, Code generation , Code optimization



• Unit-V
Analogue and Digital Transmission, Asynchronous and Synchronous transitions Transmission media, Multiplexing and Concentration Switch if techniques Polling
Topologies m Networking devices, OSI, Reference Model Protocol for -(i) Data link layer, (ii) Network layer and (iii) Transpire layer , TCP/IP Protocol Network security, Network Administration


• Unit-VI
Definition , simple and composite structure, Arraue lists, stacks queues, Priority Queues, Binary trees , B-Trees Graphs
Sorting searching Algorithms, Analysis of algorithms, Interpolation and Binary search, Asymmetric notation, Bih ohm, Omega and Theta, Average case case analysis of simple programmes like finding of maximum of n elements, recursion and its systematic removal, Quicksort-Non-recurive implementation with minimal stake storage, Design of algorithm(divide and Conquer, greedy method, Dynamic programming Back tracking, Brach and Bound(), Lower bound theory, Non-deterministic algorithm Non-Deterministic algprogramming, construct, Simple non-deterministic programs, NP-hard and NP-complete problems


• Unit-VII
Object, message, classed, encapsulation, inheritance, polymorphism, aggregation, abstract, lasses, generalization and extension and restriction m Object oriented design, Multiple, inheritance metadata
HTML, DHTML, XML, Scripting, JAVA, Sevelets, Applets


• Unit-VIII
Software development models, Requirement analysis and specification 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, Multiplexing system , I/O Management distributes operating system Study of UNIX and Window NT


• Unit-X
definition, AI approach foe sloping problems
Automated Reasoning with propositional logic and predicate logic-Fundamental proof procedure, Refutation , resolution refinement to resolution (ordering/Pruning/Restriction strategies)
State solace representation of problems, Bounding functions, breadth first depth first, A, A*, AO* etc performance, comparison of various techniques
Frame, scripts, Semantic nets, production systems, Procedurural representation , Prolog programming
Components of an expert system, Knowledge representation and acquisition techniques, Building expert system and shell
RTNs. ATBNS. Parsing of Ambiguous, CFGs Tree Adjoining Grammars (TAGs)
Systems approach to planning , designing, Development, Implementation and evaluation of MIS
Decision making process, evaluation of DDS, Group decision support system And case studies, Adaptive design approach to DSS development, Cognitive style in DSS, Integrating experts and decision support systems

 

we provide coaching for----
“ugc net jrf 1st compulsory paper”
“ugc net jrf English”
“ugc net jrf commerce”
“ugc net jrf management”
“ugc net jrf economics”
ugcnetd ugcnetd ugcnetd ugcnetd ugcnetd
“Ugc net jrf mass communication”
“ugc net jrf education”
“ugc net jrf history”
“ugc net jrf psychology”
“ugc net jrf hindi”
“ugc net jrf political science”
“ugc net jrf human resource”
“ugc net jrf library & information science”
“ugc net jrf computer scienc”
Global Teachers Academy formally name as UGC NET D is an India’s Premier Institute in Delhi for UGC (JRF-NET-SLET) & Other University Entrance Examination. Established in 1978, was conceived with vision for quality education by eminent who are for long committed to excellence in education. 
GLOBAL TEACHERS ACADEMY
49-B, Arjun Nagar Safdarjung Enclave, New Delhi

Near Green Park Metro Station

contact no. ; Ph 078-380-243-65         Ph 078-380-239-56

www.ugcnetd.com
www.gtah.net
www.csirlifescience.com
https://www.facebook.com/ugcnetcoachingdelhiindia
https://www.facebook.com/gtadh?ref=hl
https://www.facebook.com/ugcnetcoaching.delhi
http://in.linkedin.com/in/ugcnetcoaching
http://ugcnetcoachingugc.wordpress.com

UGC NET Computer Science And Application , Ph 078-380-243-65

Global Teachers Academy Formally Name UGC NET D Provides Coaching For UGC NET Computer Science and Application in Delhi. We Provides Best Study Material For Computer Science and Applications, Management, Commerce, Education, Economics, English, Finance, Psychology, Mass Communication and Journalism, Hindi, Human Resources, History in Delhi.
If You are looking For A Best Institute for UGC NET Computer Science Exam in Delhi then Can Contact us at:- 078-380-239-56

There will be two question papers, Paper-II and paper-III(Part A & Part B) paper –II will be cover 50 objective type question(Multiple type, matching type ,true/false, Assertion Reasoning type) carrying 100 marks Paper-III will have two parts Part-A and Part-B
Paper-III will have 10 short essay type question (300 words) carrying 16 marks ach. In it there will be one question with internal choice from each unit (i.e 10 question form 10 units Total marks will be 160) Paper-IIIB will be compulsory and there will be one question form each of the elective. The candidate will attempt only one question (One elective only in 800 words) carrying 40 marks. Total marks of paper-III will be 200

Paper-II

• Discrete Structure
Sets, relation, Functions, Pigeonhole Principle, inclusion -Exclusion Principle, Equivalence and Partial orderings, elementary counting techniques Probability, Measures for Information and total information
Compatibility: Model of computation-Finite Automata, Pushdown Automata, Non-determinism and NFS, DPDA and PDAs and languages accepted by these structure, Grammars languages, non compatibility and example 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, centers of a tree, Hamiltonian and Eulerian graphs, planar graphs
Group: Finite field and error correcting / detecting codes


• Computer Arithmetic
Proportional (Boolean Logic), Predicate Logic, Well formed formula (WFF), Satisfactory and tautology
Logic Families: TTL, ECL and C-MOS sates, Boolean algebra and minimization of Boolean functions, Flip-Flop types race conditions and comparison, Design of combinational and sequential circuits
Representation of Integer: Octal, Hex, Decimal and Binary, 2;s Complement and 1's complement arithmetic, Floating point representation


• Programming in C and C++
Programming in C:
Element of C-Tokens, Identifiers, Data types in C, Control structure in C, Sequence selection and iteration, Structured data types in C-arrays, structure, union, string an pointers
O-O Programming concepts:
Classes , Object, installation, Inheritance, Polymorphism and overloading
C++ Programming:
Element of C++ Tokens,. identifiers, Variable and constants, Data types, Operator, Control Statement, Function parameter passing, Class and object, Constructor and destructor, overloading inheritance temples , exception handling


• Relational database design and SQL
E-R Diagram and their transformation to relation design, normalization -INF, 2NF 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


• Data and file Structure
Data information ,definition of data structure, arrays, stacks, queues, linked lists, trees,. graphs, priority queues, and heaps
File Structure:
Fields, records, and files sequential direct, index Sequential and elative files Hashing, inverted lists multi list, B trees and B+ trees


• Computer Network
Network Fundaments: Local area Network (LAN), metropolitan Area Network *(MKAN), Wide area Network (WAN)m, Wireless Network , Inter Network Reference Model: The OSI model , TCP/IP model
Data Communication: cannel capacity. Transmission media. Twisted pasi Coaxial cables, Fiber optic cables, Wireless transmission -radio, microwave infrared and millimeter waves Light wave transmission , telephones-local loop, trunks, multiplexing switching, narrowband ISDNm broadband ISDNm ATM, High speed LANS, Cellular radio Communication satellite-Geosynchronous and low orbit
Internetworking: Switch/Hub . Bridge, router, Gateways Concatahetsd virtual circuits, Tunneling, Fragmentation Firewalls
Routing: Virtual circuits and datagram's, Routing algorithms , congestion control
Network Security: Cryptography-Public key, Secret Key, domain Name System (DNS), electronics mail and worldwide web (WWW), the DNs Resource Records Name Services, E-Mail Architecture and Servers


• System Software
Assemble language fundamental (8085 based assembly language programming), Assemblr-2 pass and single pass, Macros and Microprocessor Loading , linking, program recordable, linkage editing
text editor programming environments debugger and program generator
Compilation and interpretation, Bootstrap compiler. Phase of Compilation process, Lexical analysis, Lex package on UNIX System
context free grammar, Parsing and parse trees, representation pf parse (derivation) trees as nightmare and leftmost derivation , Bottom up parsers=-Shift reduce, operator, precedence, and LR . YACC package an on UNIX system
Top down parses-Left recursion and its removal , recursive descend pares. Predictive parses, Intermediate codes, Quadruples, Triples, Intermediate code generation , Code generation, Code optimization


• Operating System(with Case study of UNIX)
IMain function of operating system, Multiprogramming multiprocessing and multitasking
Memory management: Virtual memory, Paging, fragmentation
Concurrent processing: mutual exclusion, critical regions, locks ad unlock
Scheduling: CPU Scheduling. I/o Scheduling, resource scheduling, 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. siort, uniq, tr, join, etc…Grep, egrep, fgrep etc, sed, awk, etc.
System calls (like): create, open, close, read, write, seem link, unlink, stat, fstat, unmask, chmos, exec, fork, wair, system


• Software engineering
System development cycle (SDCL) : 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 ad reliability, clean room approach, Software reengineering


• Current Trends and Technologies
The topic of current interest in Computer Science and Computer application hall be recovered. The expert shall use their judgment from time to time to include the topics of popular interest , which are expected to be known for an application development software professional they include
Parallel computing
Parallel virtual machine (PVM), and message passing interface (mpi), libraries and calls, advanced architecture, 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 application, Mobile database-Protocol, scope, tools, and technology, M-Business
E-Technology
Electronic Commerce:
Framework , Media convergence of Application, Consumer application , Organization application
Electronic payment System:
Digital SyToken, Smart Cards, Credit Cards, Risks in Electronics Payment system Designing electronic payment system
Electronic Data Interchange (EDI):
concept, Application (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:
Concept , Types of Digital Documents , Issues behind document infrastructure, Cooperate data warehouses
Software Agents:
Chaatetstics and Properties of Agents Technology behind software agents(Applets, Browser and Software Agents)
Broad band Telecommunication:
Concept, Frame relay, Cell relay, Switched Multimegabite Data Services, Asynchronous, Transfer Mode
Main Concepts in geographical Information System (GIS), E-Cash E-Business, ERP packages
Data Ware housing:

Data Ware housing environments, Architecture of a data warehouses methodology, Analysis design, Construction and administration
Data Mining:
Extraction models and pattern form large database , data miming techniques , classification regression, clustering summarization, dependency modeling, 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 n windows
Simple Application (in windows)
Scrolling. splitting views. docking toolbars status bar, common dialogue
Advanced Windows Programming
Multiple document Interface (MDI), Multiplex threading, Object linking and Embedding (OLE), Active X control Active template Library (ATL), Network programmi

Ugc net LIFE SCIENCES , Ph 078-380-239-56

The Joint CSIR-UGC JRF/LS (NET) Examination shall comprise 3 papers:
This paper shall be of 3 hours duration and shall have a maximum of 200 marks.
PART - A:
This part shall carry 20 questions pertaining to General Science, Quantitative Reasoning & Analysis and Research Aptitude. The candidates shall be required to answer any 15 questions. Each question shall be of two marks. The total marks allocated to this section shall be 30 out of 200.
PART - B:
This part shall contain 50 Multiple Choice Questions(MCQs) generally covering the topics given in the syllabus. A candidate shall be required to answer any 35 questions. Each question shall be of two marks. The total marks allocated to this section shall be 70 out of 200.
PART - C:
This part shall contain 75 questions that are designed to test a candidate's knowledge of scientific concepts and/or application of the scientific concepts. The questions shall be of analytical nature where a candidate is expected to apply the scientific knowledge to arrive at the solution to the given scientific problem. A candidate shall be required to answer any 25 questions. Each question shall be of four marks. The total marks allocated to this section shall be 100 out of 200. 

we provide coaching for----
“ugc net jrf 1st compulsory paper”
“ugc net jrf English”
“ugc net jrf commerce”
“ugc net jrf management”
“ugc net jrf economics”
ugcnetd ugcnetd ugcnetd ugcnetd ugcnetd
“Ugc net jrf mass communication”
“ugc net jrf education”
“ugc net jrf history”
“ugc net jrf psychology”
“ugc net jrf hindi”
“ugc net jrf political science”
“ugc net jrf human resource”
“ugc net jrf library & information science”
“ugc net jrf computer scienc”
Global Teachers Academy formally name as UGC NET D is an India’s Premier Institute in Delhi for UGC (JRF-NET-SLET) & Other University Entrance Examination. Established in 1978, was conceived with vision for quality education by eminent who are for long committed to excellence in education. 
GLOBAL TEACHERS ACADEMY
49-B, Arjun Nagar Safdarjung Enclave, New Delhi

Near Green Park Metro Station

contact no. ; Ph 078-380-243-65         Ph 078-380-239-56

www.ugcnetd.com
www.gtah.net
www.csirlifescience.com
https://www.facebook.com/ugcnetcoachingdelhiindia
https://www.facebook.com/gtadh?ref=hl
https://www.facebook.com/ugcnetcoaching.delhi
http://in.linkedin.com/in/ugcnetcoaching
http://ugcnetcoachingugc.wordpress.com