Graduate Aptitude Test in Engineering and National Eligibility Test are national level entrance examinations. Though both are entrance examinations, they differ in exam pattern, purpose of exam etc. GATE exam is conducted for admission of candidates to Master of Technology (M.Tech.) programs. NET is conducted for assessing eligibility of students to take up lectureship jobs.
Candidates who have cleared NET exam are eligible for Lectureship, Junior Research Fellowship, Senior Research Fellowship, etc. NET is considered for recruitment to some government sector jobs.
Candidates having Bachelor’s degree in Engineering Technology/ Architecture and Master’s degree holders in any branch of Science/ Mathematics/ Statistics/ Computer Applications are eligible to apply for GATE. Those who are in the final year of such programmes are also eligible for this exam. Candidates who have passed through examinations conducted by professional bodies recognized by UGC/AICTE are eligible to apply for this exam. Pre-final year students are not eligible to write GATE.
Candidates who have secured at least 55 % marks in Master’s Degree OR equivalent examination from universities/ institutions recognised by UGC are eligible for this test. Final year candidates can also apply. Candidates are advised to appear in the subject in which they have done their post-graduation.
The GATE examination consists of a single paper of 3 hours duration. The question paper consists of only multiple choice objective type questions. There will be negative marking for wrong answers. Candidates can expect general questions, and questions from general aptitude and engineering mathematics.
The GATE score has a validity of two years. Those who have cleared GATE exam can opt for higher studies and even go for job with their under graduation background. Public sector firms such as BHEL and ONGC BARC, NPCIL, HAL etc. give importance to GATE scores for various job positions in their organizations.
The NET exam consists of three papers which are of multiple choice objective types. There will be 60 questions in Paper-I and the candidates have to attempt only 50 of them. Paper-II and Paper-III will be having 50 and 75 questions respectively. Candidates are required to attempt all these questions. The total marks for the three papers are 100, 100 and 150, respectively.
ATTEND -> EVALUATE -> JOIN
Know about our seminars, attend our demo class from highly qualified scientists and evaluate before joining us!!
Life Science – 6 Month (or) 1 Year Course.
Management – 6 Month (or) 1 Year Course.
Computer Science – 6 Month (or) 1 Year Course.
The Tata Institute of Fundamental Research
Website: http://www.ncbs.res.in/ /
http://www.tifr.res.in/~dbs/web/Home.html
IISc(Indian Institute of Science)
Website: http://www.iisc.ernet.in/
IIT-Bombay
Website: http://www.iitb.ac.in/
IIT-Roorkee
Website: http://www.iitr.ac.in/
NBRC( National Brain Research Centre)
Website: http://www.nbrc.ac.in/
All India Institute of Medical Sciences
Website: http://www.aiims.ac.in
IARI (Indian agriculture research institute )
Website: http://www.iari.res.in
ACBR(Ambedkar Centre For Biomedical Research)
Website: http://www.acbrdu.edu/admission.html
JNU- School of Biotechnology
Website: http://www.jnu.ac.in
JNU- School of Life Sciences
Website: http://www.jnu.ac.in
JNU- School of Environmental Sciences
Website: http://www.jnu.ac.in
MKU (Madurai Kamaraj University)
Website: http://www.mkuniversity.org
PGI, Chandigarh
Website: http://www.pgimer.nic.in
Delhi University South campus
Website: http://www.south.du.ac.in
University of Hyderabad, Hyderabad
Website: http://www.uohyd.ernet.in
National Institute of Virology
Website: http://www.niv.co.in/
Code No. : 87
Subject : Computer Science and Applications
Note : There will be two question papers, UGC NET CS Paper II and Paper III ( Multiple choice, Matching type, True / False, Assertion-Reasoning type).
1. Discrete Structures :
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, cycles and circuits. Tree and rooted tree. Spanning trees. Eccentricity of a vertex radius and diameter of a graph. Central Graphs. Centres 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 ( 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.
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.
O – O Programming Concepts : Class, object, instantiation. Inheritance, polymorphism and overloading.
C++ Programming : Elements of C++ – Tokens, identifiers. Variables and constants, Datatypes, Operators, Control statements. Functions parameter passing. Class and objects. Constructors and destructors. Overloading, Inheritance, Templates, Exception handling.
4. 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.
5. 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.
6. Computer Networks :
Network 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-geosynchronous and low-orbit.
Internetworking : Switch / Hub, Bridge, Router, Gateways, Concatenated virtual circuits, Tunnelling, Fragmentation, Firewalls.
Routing : Virtual circuits and datagrams. 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.
7. 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.
Compilation and Interpretation. Bootstrap compilers. Phases of compilation process. Lexical analysis. Lex package on Unix system.
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.
8. 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.
UNIX :
• 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, write, iseek, link, unlink, stat, fstat, umask, chmod, exec, fork, wait, system.
9. Software Engineering :
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.
10. Current Trends and Technologies :
The topics of current interest in Computer Science and Computer Applications 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 Computing : Parallel virtual machine ( pvm ) and message passing interface ( MPI ) libraries and calls. Advanced architectures. 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 applications. Mobile databases – protocols, scope, tools and technology. M-business.
E – Technologies :
• Electronic Commerce : Framework, Media Convergence of Applications, Consumer Applications, 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, Applications, ( 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 : 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, ERP packages.
• 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 modelling, 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 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 ). Network programming.
Unit – I:
Unit – II:
Unit – III:
Unit – IV:
Unit – V:
Unit – VI:
Unit – VII:
Unit – VIII:
Unit – IX:
Unit – X:
Knowledge about students will enable us to refine lectures, class discussions, comments, illustrations, and activities so that they are more effective learning experiences. References to student interests, backgrounds, knowledge, and even anxieties can make the class seem more personal and the material more accessible.
Not all students will have the same background in their field. By assessing students' comprehension levels of the subject, we can modify our own teaching to fit their needs. By customizing our course to students' needs, we can teach more efficiently and effectively.
Scientist first step will be to find out more about our students. On the first day of class, hand out a questionnaire. You should find out what previous classes students have had in their field and related subjects. Scientist can list basic terminology we expect students to understand, and ask students to mark the words they do not understand or feel uncomfortable with. Leave an area for students to write down any special accommodations they may need for learning disabilities, work or family obligations, etc.
Note: Images might take some time to load on slower connections. Once loaded, click image for more details.
Learn from Scientists