Wednesday 1 January 2014

UGC NET Computer Science And Application Paper-III (Core Group) Elective-I , 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

  • Elective-I
  • Theoory of computation: Formal language, need for formal computational model, Non-Computational model on computational problems, Diagonal argument and Russell's paradox
    Deterministic Finite Automata(DFA), Non deterministic finite Automaton (NFA),Digital languages ad regular sets Equivalence, of DFA, and NFA
    Minimizing the numbers of state of a DFA, non regulate language m, and pumping lemma
    Pushdown Automaton (PDA. Deterministic, Pushdoam Automaton (DPDA), No equivalence of PDA and DPDA
    Context free grammars: greenback Normal form (GNF) ad Chomsky Normal Form (CNF), Ambiguity , Parse Tree, representation of derivation, Equivalence of PDA's and CFG;s Parsing
    techniques for parsing of general CFG' -Early's Cook-Kassami-YUNGer (CKY) and Tomitta parsing
    Linear Bounded Automaton (LBA): Power of LBA , Closure Properties
    Turing Machine (TM) : One tape, Multiple, the notion 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 language

  • Elective-II
  • Model for information Channel: Discrete Memory less 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 optimally of information transform mission
    Variable Length codes: Prefix Codes, Human Codes, lempel -Ziew (LZ) Codes, Optimally of these cases Information content of these codes
    Error Correcting and detecting Codes: Finite fields, Hamming Distance, Bounds of Codes, Linear (Party check) Codes, Parity check matrix, generator Matrix, Decoding of linear codes, Hamming Codes
    Image Processing: Image Processing, Spatial Fourier, Transform Discrete Spatial Fourier Transform Restoration , Loss compression of image s(pictures)
    Data compression techniques :representation and compression of text, sound, picture, and video files based of MPEG and JPEG 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 computation in simplex and Tableau,. Big-M method, Dual Simplex and reviewed simplex
    Complexity of simple Algorithm(s), Exponential behaviors of simplex
    Ellipsoid method and Karmakar's Method for solving LPPs . Solving simple LLPs through theses methods, comparison of complexity of theses methods
    Assignment and Transportation Problems: Simple algorithm like Hungarian method etc
    Shortest Path Problems: Dijkstra'a and Moore's method Complexity
    Network Flow problem: Formulation, Max Flow min-Cut Theorem. Ford and Fulkerson;s algorithm,. Exponential behavior of f rod and fulkerson;s alorithim, Malhotra-Promod KUMar-Maheswari (MPM), Polynomial Method for solving network problem, Bipartite Graphs and Matching, Solving matching using network flow problems
    Matriods: Definition, Graphic and co graphic matriods, Matriods intersection problem
    Non-Linear programming: Kuhn-Tucker conditions, Convex function and Convex region, Convex programming problems, Algorithms for solving convex programming problems-Rate of convergence of iterative method for solving theses problems


  • Elective-IV
  • Neural network: Perception Model, Linear Severability and XOR problem, Two and three layered neural network, Backprpaogation-Convergence, Hopfield nets, Neural net Learning, Application
    Fuzzy System: Definition of a Fuzzy ste, fuzzy relation, fuzzy functions, Fuzzy measures, Fuzzy reasoning, Application of Fuzzy systems

  • Elective-V
  • UNIX: Operating system, Structure of UNIX, Operating system, UNIX Commands, Interfacing with UNIX, Editors and Compliers for UNIX, LEX and YACC , File System, System calls, Filters, Shell programming
    Windows: Windows environment,. Unicode, Documents and Views, Drawing in window, Message handing, Scrolling and Splitting views, Docking toolbar and status bar, Common dialogue and control, MDI, Multithreading , OLE, Active X Control, ATL, Database, access, Network programming

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