UGC NET Computer Science Coaching In Chandigarh
Well known for their superior quality UGC NET computer science coaching in Chandigarh, Statesman Academy has prepared thousands of candidates to grab an excellent score. Our experienced faculty offer quality teaching which help students crack this exam. What makes us the most outstanding ugc net coaching institute is our result oriented approach, expert guidance, latest study material and competitive ambience. Every teachers of Statesman Academy set efforts to cover all the segments of ugc net computer science.
With over a time span of 7 years, our brand has been producing unbeatable results in the UGC NET computer science exam. The venture of producing more and more successful candidates will be maintained via our comprehensive coaching for the UGC NET computer science in Chandigarh. At statesman academy, the doors are always open for the aspirants who want to achieve above the level.
Now Onwards National Testing Agency (NTA) will conduct NET.
UGC-NET exam is All India level exam conducted by the CBSE for the recruitment of Assistant professions and junior fellowship at the leading institutions of India. UGC hold this exam for different subjects, which demands quality level guidance and that’s what Statesman Academy is famous for. We also provide personalized attention to every single aspect of the ugc net coaching and scholarships to economically poor candidates. Come and experience the best possible learning with us and we ensure that we’ll surely take you to the top.
Once again Unparalled Success in Recent CBSE UGC NET RESULTS
UGC NET Computer Science Previous Years Questions Trend :
UGC NET Computer Science minimum Cut-Off Percentage for JRF/NET Qualification:
- 5 DAYS classes in a week (3-4 hrs Daily)
- 60 classes (paper 1) + more than 120 classes (paper 2, 3 and study material) + test series + Regular doubt sessions
- It will take approx. 4 months to complete UGC-NET Computer Science coaching with more than 120 classes.
Fee Structure for UGC-NET June 2020 Exam
- Total Fee = Rs. 32000/- (For limited Period)
- Special Concession (20%) for M.Sc 1st Year Students and 10% for M.Sc Final Year students. (For Limited Period Only.
- Registration Fee : (Included in Total Fee): Rs. 2000/-
- There are two options available for payment that are:
Option 1 – Total fee payable at the commencement of the program
Option 2 – Installments (optional)
- Payable at the commencement of the program – Installment 1st – Rs. 20000/-
- After 30 days of the Registration – Remaining amount as 2nd Installment.
New UGC-NET Pattern and Schedule:
i) Mode of Examination: The Examination shall only be conducted as Computer Based Test (CBT).
PROCEDURE & CRITERIA FOR DECLARATION OF UGC-NET RESULT:
- Following steps will be followed for Result declaration :
Step I: The number of candidates to be qualified (total slots or Eligibility for Assistant Professor) shall be equal to 6% of the candidates appeared in both the papers of NET.
Step II: The total slots shall be allocated to different categories as per the reservation policy of Government of India.
Step III: In order to be considered for ‘both JRF and Eligibility for Assistant Professor’ and for ‘Assistant Professor Only’, the candidate must have appeared in both the papers and secured atleast 40% aggregate marks in both the papers taken together for General (Unreserved) category candidates and at least 35% aggregate marks in both the papers taken together for all candidates belonging to the reserved categories (viz., SC, ST, OBC (belonging to Non-Creamy Layer, PwD and Transgender).
Step IV: The number of candidates to be declared qualified in any subject for a particular category is derived as per the prescribed methodology.
Step V: All candidates who had applied for ‘Eligibility for JRF & Eligibility for Assistant Professor Both’ out of the total number of qualified candidates derived as per Step IV, shall constitute the
consideration zone for JRF.
Step VI: The total number slots available for awarding JRF is allocated among different categories as per the reservation policy of Government of India.
UGC NET Computer Science Coaching methodology
- Our teaching methodology strictly focus on the difficulties faced by aspirants in the preparation of this exam such as lack of proper study material, ignorance of crucial aspects, inadequate Test practices and lengthy syllabus. Our unique testing scheme designed according to the latest developments in respective subjects. Moreover we put a prime emphasis on time management skills, as many subjects have vast syllabus and students are left with limited time for the preparation of the exam.
- Once the syllabus of specific subject is complete, revision of that topic is done to make it sure that the student is fully confident for the exam and during the exam so that he can perform efficiently.
- Difficult topics are covered multiple times before taking the NTA UGC NET exam so that student do not loose marks in these areas. Difficult topics are the difference making part of the exam between an average student and well prepared student.
- For NTA UGC NET subjects, daily 3 hour class is conducted. One hour for Paper-1, which is common for all students, and two hour class for specific subject. After the completion of the topic, practice worksheet are solved. Regular weekly tests help to evaluate and improve the preparation for the exam.
Schedule of NET
- The UGC-NET is conducted in the months of June and December i.e. twice in a year Notification about the schedule of the test is published in March/September in Employment News.
- 1. Candidates with 55% marks in Master’s Degree from universities/institutions recognised by UGC. The Other Backward Classes(OBC) belonging to non-creamy layer/Scheduled Caste(SC)/Scheduled Tribe(ST)/ persons with disability(PWD) category candidates who have secured at least 50% marks in Master’s degree are eligible for this Test.
- 2. Candidates whose result is still awaited may also apply, but, such candidates shall be considered eligible for award of Junior Research Fellowship/eligibility for Assistant professor only after passing their Master’s Degree examination. So, these candidates must complete their Master degree examination within two years of the UGC NET result declaration.
- 3. The Ph.D. degree holders having done their Master’s examination by 19th September 1991shall be eligible for a relaxation of 5% in total marks for appearing in NTA UGC NET.
- Candidates should appear in the subject of their post graduation only.
Age Limit and Relaxation
- Junior Research Fellowship: Maximum: 30 years. A relaxation up to 5 years is given to women applicants and OBC SC/ST/PWD categories candidates. Three years relaxation is given to the candidates with L.L.M. Degree. Total age relaxation on any ground(s) shall not exceed five years under any circumstances.
EXEMPTION (ELIGIBILITY FOR ASSISTANT PROFESSOR)
- NET/SLET/SET qualified candidates.
- Candidates, who are or have been awarded a Ph. D. Degree in accordance with the University Grants Commission (Minimum Standards and Procedure for Award of the Ph. D. Degree) Regulations, 2009, shall be exempted from the requirement of the minimum eligibility condition of NET/SELT/SET for recruitment and appointment of Assistant Professor or equivalent positions in Universities.
JUNIOR RESEARCH FELLOWSHIP: Candidates qualifying for the award of Junior Research fellowship will be eligible to receive fellowship of UGC under various schemes with a validity of two years from the date of issuance of JRF Award letter.
We offer specialized CBSE UGC NET coaching in following subjects:-
- Computer Sciences
- Life Sciences
- Chemical Sciences
- Physical Sciences
Why join our Institute;
- Powered by eligible and experienced faculty
- Special doubt sessions for difficult topics
- Innovative approach to solve problem quickly and correctly
- Comprehensive coverage of complete syllabus
- Extensive, updated and quality study material
- Highest success rate in the region
- Library facility
- Special guest lectures by eminent Academicians
- Weekend classes for working professionals
- Fully air conditioned and Wi-Fi premises
- Comfortable batch timing
- Complete coverage and revision of syllabus
- Result oriented teaching with small batch sizes
Views of Some of Our Successful Students:
UGC-NET Computer Science
UGC JRF – Computer Sci.
Guru Jambeshwar University, HISAR
My sincere THANKS to STATESMAN ACADEMY for making my future.”
UGC-JRF Computer Science
UGC NET-Computer Science
Baddi University, HP.
UGC NET Computer Science
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 non computable problems.
Graph : Definition , walks , paths , trails , connected graphs, regular and bipartite graphs, cycle 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.
Propositional (Boolean) Logic, predicate Logic, Well – formed – formulae ( WFF), 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 1’s complement arithmetic. Floating point representation.
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.
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 handlings.
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.
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.
Computer Networks :
Networks 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. Communication satellites, Tunnelling Fragmentation , firewalls.
Routing : Virtual circuits and datagrams. Routing algorithms. Routing algorithms. Conjestion 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.
System Software and Compilers
Assembly language fundamentals (8085 based assembly language programming). Assemblers – 2 pass and single – pass. Macros and macroprocessors.
Loading , linking , relocation , program relocatability , Linkage editing.
Text editors. Programming Environments. Debuggers and program generators.
Compilations and Interpretation. Bootstrap compilers, Phases of compilation process. Lexical analysis. Lex package on Unix system.
Context free grammars, parsing and parse trees. Representation of parser (derivation) trees as rightmost and leftmost derivations. Bottom up parsers- shift- reduce, operator precedence and LR. YACC package on Unix system.
Top down parsers – left recursion and its removal. Recursive descent parser. Predictive parser, Intermediate codes – Quadruples , Triples, intermediate code generation, Code generation , Code optimization.
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.
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) : Creat, open, close , read, iseek, link , unlink , state, fstat, unmask, chmod , exec, fork, wait, system.
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.
Current Trends and Technologies
The topics of current interest in Computer Science and Computer Application 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 an application development software professional, currently, they include:
Parallel virtual machine (pvm) and message passing interface (mpi) libraries
and calls. Advanced architectures. Today’s fastest computers.
Mobile Connectivity – cells , Framework, technology and switching methods,
mobile information access devices, mobile data internetworking standards,
cellular data communication protocols , mobile computing application. Mobile
databases – protocols, scope, tools and technology. M – business.
E – Technologies
Electronic Commerce : Framework , Media Convergence of Application ,
Consumer Application , 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, Application, (Legal, Security and
Privacy) issues EDI and Electronic Commerce, Standardization and EDI, EDI
Software . Implementation, EDI Envelope for Message Transport, Internet –
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 Telecommunications: Concepts, Frame Relay, Cell Relay, Switched
Multimegabit Data Service, Asynchronous Transfer Mode.
Main concepts in Geographical Information System (GIS), E – cash, E- Business,
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
modeling , link analysis, sequencing analysis, mining scientific and business data.
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).
Unit – I
Combinational circuit Design, Sequential Circuit Design , Hardwired and Microprogrammed processor, Instruction formats , Addressing modes, Memory types and organisation, Interfacing peripheral devices, Interrupts.
Microprocessor architecture, Instruction set and Programming (8085, P- III/ 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, Concurreny and Recovery in Centralised and Distributed Database System, Object Oriented Database Management System (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 type, operators expressions, Assignment. Flow of control – control structures, I/0 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, type and polymorphisms, higher order functions, lazy evaluation , equations and pattern matching.
Principle, horn clauses and their execution, logical variables, relations , data structures, controlling the search order, program development in prolog, implementation of prolog, example in prolog.
Principles of parallelism, coroutines, 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 constructions tools, compilation phases.
Finite Automata, Pushdown Automata. Non – determinism and NFA, DPDA, and PDAs and languages accepted by these structures. Grammars Languages – 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 expression and regular languages. LFX 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.
Definition , Simple and Composite structure, Arrays, Lists, Stacks queues, Priority queues, Binary trees , B- trees, Graphs.
Sorting and Searching Algorithm, 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. Quicksort- 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 inheritance, 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.
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 functional , breadth first depth first, A, A*, AO*, etc, performance comparison of various search techniques.
Frames , scripts, semantic nets, production systems, procedural representation, Prolog programming .
Components of an expert system, Knowledge representation and Acquisition techniques , Building expert system and Shell.
RTNs, ATNs, Parsing of Ambiguous CFGs. 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.
[ELECTIVE / OPTIONAL]
Elective – I
Theory of Computation: Formal language, Need for formal computational models, Non Computational problems, diagonal argument and Russel’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.
Context 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 general CFG’S – Early’s, Cook -Kassami- Younger (CKY), and Tomita’s parsing.
Linear Bounded Automata (LBA): Power of LBA Closure properties.
Turing Machine : One tape, multitape. The notions of time ad 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 Transform , 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 from. 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 revised simplex.
Complexity of simplex algorithm (s). Exponential behaviour of simplex.
Ellipsoid method Karmakar’s method for solving LPP’S 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. Malhotra – Pramodkumar – Mheshwari (MPM) Polynomial algorithm for solving Network flow problem. Bipartite Graphs and Matchings; Solving matching problems using Network flow Problems.
Matroids : Definition , Graphic and Co graphic matroids. Matroid intersection problems.
Non- linear Programming : Kuhn – Tucker conditions. Convex functions and Convex regions. Convex programming problems. Algorithm for solving convex programming problems- Rate of convergence of iterative methods for solving these problems.
Neural Networks: Perceptron model, Linear Separability and XOR problem. Two and three layered neural nets, Back propagation – Convergence , Hopfield nets, Neural net learning, Applications.
Fuzzy Systems: Definition of a Fuzzy set, Fuzzy relations, 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 Compilers for Unix , LEX and YAXX, File systems , Systems calls, Filters, Shell programming.
Window : 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 , Networking programming.
How to crack
PREPARE CONSISTENTLY: You can easily clear the exam if you prepare well for atleast 2-3 months regularly. Because the secret of success is consistency of purpose. Start learning new concepts each day and practice them by writing and that is the symbol for victory.
SOLVE PREVIOUS YEAR PAPERS: Solving previous year papers will give you an edge to do the exam well.
START YOUR PREPARATION NOW: Don’t wait till the exam notification comes. Start your preparation instantly because tomorrow may be too late. If you start your preparation early, then you will have ample time to revise what you have learnt and practiced and face the exam more confidently. Be proactive. Begin your preparation with subjects in which you have keen interest. Prepare them well. Then concentrate upon other subjects too to gain mastery over them.
ATTEMPT MAXIMUM QUESTIONS: Try to attempt as many questions as you can because candidates generally do not go through the questions properly and immediately make the decision that questions are tough. It is not a good practice. The truth is that the questions are asked in an indirect way. So try to read each question atleast twice so that you will be able to get an idea about how to solve those questions.
MAKE BEST USE OF TIME AND OPPORTUNITY: Another common problem is that candidates generally do not utilize 2 ½ hours given for paper 3 properly. To make the best use of those 2 ½ hours, you have to learn and practice a lot to see your dream come true. Nothing is Impossible in life. Just like little drops of water makes a huge ocean, Little amount of hard work everyday for some months will yield amazing career progressing results.
We are very comfortable when it comes to timing of the classes; however we always request you to fix up a slot well in advance to avoid inconvenience. The usual duration for a class is 2-3 hours.
Duration: The total minimum duration to cover the all syllabus is 3 month.
Some Salient Features
- Highest result across in Chandigarh, Punjab and Haryana.
- Maximum 15 students per batch
- Practice Tests in routine
- Weekly Mock Tests
- All tests on OMR Sheets for better practice
- Best Faculties in the region
- UGC NET / Ph. D. qualified Faculties
- Study Material included
- 100% syllabus coverage
- Paper-3 on Objective Pattern
- Comfortable batch timing
- Amicable environment
- Full access to faculties (Open Door Policy)
The classroom teaching will be in group of maximum 15 students per batch. Our faculty members are Subject Matter Experts / UGC NET Qualified / Ph. D. and have several years of teaching experience into UGC NET & other related domains.
Statesman Academy, SCO 54-55, 2nd Floor,
Sector 34A, Chandigarh (UT), Punjab