Tuesday 31 December 2013

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

No comments:

Post a Comment