Menu
Test Providers Syllabus Books Exams   My Account

UGC NET - Computer Science

Free Online Mock Test for UGC NET Computer Science exam

Prepare for UGC Computer Science examination with our free mock test.

What do you get?
  • Real Time NET Computer Science Preparation experience
  • 20 Free Practice Questions & Solutions
  • Performance Score Card Analytics
  • Tips & Resources To Improve Your Ranking

What is UGC NET Computer Science exam?
CBSE conducts National Eligibility Test Computer Science (CS) examination on behalf of UGC. Qualified candidates are considered eligible to apply for Computer Science faculty jobs in Indian educational institutions.
Do I have to pay for this mock test?
No, this UGC NET Computer Science (CS) mock test is absolutely free.
How to register for UGC (CS) exam?
Click here to register online for NET Computer Science examination.

UGC NET Computer Science Examination Pattern

This UGC NET exam is divided into two parts (i.e) Part I and Part II. You need to qualify in both papers to pass the UGC NET Computer Science exam.

  1. Paper I : It consists of 50 questions from UGC NET teaching & research aptitude exam (general paper), which you have to attempt in 1 hour.
  2. Paper II : The UGC Computer Science exam (paper 2) will have 100 questions and the total duration will be two hours. Each question carries 2 marks, so the exam will be worth 200 marks. Read below to know the pattern of NET Computer Science examination (part II).
Exam HighlightsDetails
Test Duration120 minutes
Total Questions100
Marks per question2
Total Marks200
Negative MarkingN/A

UGC NET Computer Science Exam Syllabus

UnitDetails
Software engineering Development, testing and maintenance of software; Enhancing software life cycle process.
Programming (C/C++/JAVA/HTML) Relations to different languages; early improvements and programming highlights.
Study of computer graphics Two-dimensional and three-dimensional images; computer animation.
Computer Networks Know how PC systems bolster a huge number of applications; kinds of network connections; star topology, bus topology, ring topology; understanding how computing devices exchange data with each other utilizing between hubs; remote technologies.
Computer architecture and organization Functionality, association, and execution of computer systems; portraying the abilities and programming model of a PC; deciding the necessities of the user of a structure and after that outlining to address those issues as adequately as conceivable within mechanical requirements.
Operating system Types of operating systems; Unix and Unix-like operating systems, components of OS; mainframes, microcomputers, understanding how distributed operating system manages a group of distinct computers and makes them appear to be a single computer; understanding how an OS utilizes specialized scheduling algorithms so that a deterministic nature of behavior is accomplished and how event-driven system switches between tasks in light of their needs.
Database management system (DBMS) Classify DBMSs according to the database models that they bolster; advantages of using a DBMS; data definition, update, retrieval, administration, Creation, modification and removal of definitions that define the organization of the data; enforcing data security, monitoring performance, maintaining data integrity; security, and availability; external, conceptual, and inner perspectives; understanding the difference between general-purpose and special-purpose DBMSs; design and modeling.
Overview of data structures and algorithm Understanding various sorts of information structures, generally built upon simpler primitive data types; manage large amounts of data proficiently for uses; activities that can be performed on a data structure; concrete implementation by an ADT; organize the storage and retrieval of information; fetching and storing data at any place in a computer's memory; mechanism that allows data structure implementations to be reused by different programs.
Data structures and algorithms Using an algorithm; creation of models of all kinds in the domain of computer science; formal language theory; deal basically with the question of the degree to which a problem is solvable on a computer.