UGC NET Computer Science and Applications (Paper 2) covers almost the whole B.Tech or MCA syllabus, so breadth matters. This mixed practice set takes questions from digital logic, DBMS, networks, operating systems, software engineering, compilers, data structures and AI, in the style of the exam.
How to practise: read each question and tap the option you think is correct. You will see right away whether you got it, along with a short explanation, and your score is tracked at the bottom of the screen. This set has 15 questions.
Topics covered in this set
- Number systems and Boolean algebra
- Normalisation and SQL
- OSI model, TCP/UDP and IP addressing
- Software engineering models and design principles
- Compiler phases and data structures
- Search in artificial intelligence
UGC NET Computer Science MCQs with answers and explanations
Q1. How many address lines are needed to address 512 memory locations?
a) 8
b) 512
c) 10
d) 9
Q2. The Boolean expression A + A'B simplifies to:
a) AB
b) A
c) A + B
d) B
Q3. What is the 4-bit two's complement representation of −5?
a) 1101
b) 0101
c) 1010
d) 1011
Q4. Which normal form is stricter than 3NF?
a) None
b) 2NF
c) BCNF
d) 1NF
Q5. Which SQL command removes a table's data and its structure from the database?
a) DROP
b) DELETE
c) REMOVE
d) TRUNCATE
Q6. Routing of packets between networks is the job of which OSI layer?
a) Session layer
b) Network layer
c) Data link layer
d) Transport layer
Q7. Which statement about TCP and UDP is correct?
a) TCP is connection-oriented and reliable; UDP is connectionless and has no delivery guarantee
b) Both use a three-way handshake
c) TCP is faster than UDP in all cases
d) UDP guarantees in-order delivery
Q8. What is the default subnet mask of a Class C IPv4 address?
a) 255.255.0.0
b) 255.255.255.0
c) 255.0.0.0
d) 255.255.255.255
Q9. A well-designed software module should have:
a) Low cohesion and low coupling
b) High cohesion and high coupling
c) Low cohesion and high coupling
d) High cohesion and low coupling
Q10. Which SDLC model explicitly includes risk analysis in every iteration?
a) V-model
b) Waterfall
c) Big bang
d) Spiral model
Q11. Which compiler phase converts the source program into a stream of tokens?
a) Semantic analysis
b) Syntax analysis
c) Lexical analysis
d) Code generation
Q12. Which data structure is used to manage function calls and recursion?
a) Stack
b) Heap
c) Hash table
d) Queue
Q13. What is the worst-case time complexity of binary search on a sorted array of n elements?
a) O(1)
b) O(n)
c) O(log n)
d) O(n log n)
Q14. A* search is guaranteed to find an optimal path (in tree search) when its heuristic h(n) is:
a) Always zero
b) Random
c) Larger than the true cost
d) Admissible, meaning it never overestimates the true cost to the goal
Q15. How many edges does a tree with n vertices have?
a) n − 1
b) n
c) n(n − 1)/2
d) n + 1
Quick revision notes
- n address lines address 2ⁿ locations.
- Two's complement: invert bits and add 1.
- BCNF ⊂ 3NF ⊂ 2NF ⊂ 1NF (each stricter than the next).
- Network layer routes; transport layer gives end-to-end delivery.
- High cohesion, low coupling; spiral model includes risk analysis.
Frequently asked questions
Are these previous UGC NET questions?
No. They are original practice questions aligned with the UGC NET Computer Science and Applications syllabus.
How many questions are in UGC NET Paper 2?
Paper 2 has 100 compulsory questions for 200 marks. Check the latest NTA notification for any pattern changes.
Which CS subjects carry most weight?
The syllabus has ten units. DBMS, networks, data structures and algorithms, operating systems and discrete structures are reliable areas to strengthen first.
Comments
Post a Comment