All Practice Exams

Free Practice Questions for NEB 12 Computer Science

Exam-style questions and explanations by OpenExamPrep.

✓ No registration✓ No credit card
100+ Questions
100% Free

Loading practice questions...

Exam Review

Key Facts: NEB 12 Computer Science Exam

50

Theory Marks

50

Practical Assessment Marks

2 hours

Theory Paper Duration

35%

Minimum Theory Score

NEB

Conducting Board

The NEB Class 12 Computer Science examination is conducted by the National Examinations Board (NEB) of Nepal. It consists of a 50-mark written theory paper (2 hours) plus 50 marks of practical assessment, and students need at least 35% in theory to avoid a Non-Graded (NG) result. OpenExamPrep offers free independent practice questions on DBMS and SQL, networking, web technology, C programming and OOP, and software engineering. OpenExamPrep's questions are an independent English-language multiple-choice study adaptation of the curriculum topics. They are not an official translation of the board paper or a simulation of its written format.

Sample NEB 12 Computer Science Practice Questions

Try these sample questions to review concepts for the NEB 12 Computer Science exam. Each question includes a detailed explanation. Start the interactive quiz above for the full 100+ question experience with AI tutoring.

1In a traditional file-processing system, the same customer data may be stored in multiple files across different departments, leading to inconsistencies if an update is not applied everywhere. Which fundamental advantage of a Database Management System (DBMS) addresses this issue?
A.Controlling data redundancy and maintaining consistency
B.Eliminating the need for secondary storage devices
C.Allowing unrestricted direct physical access to disk sectors
D.Removing the requirement for backup and recovery procedures
Explanation: A central advantage of a DBMS is centralized data management, which minimizes or eliminates unnecessary data duplication (redundancy). By ensuring that data appears in a single centralized or controlled structure, updates propagate consistently, preventing data anomalies and inconsistencies inherent in traditional flat-file processing.
2In relational database design, what are the two essential constraints that an attribute (or set of attributes) designated as the primary key must always satisfy?
A.It must accept duplicate values and permit NULL entries
B.It must be foreign to the relation and automatically generate sequential integers
C.It must reference an external table and allow at most one NULL value
D.It must contain strictly unique values and cannot contain NULL values
Explanation: Under the entity integrity rule of the relational model, a primary key must uniquely identify each tuple in a relation (uniqueness constraint) and must not contain NULL values (not-null constraint), ensuring that every record can be distinctly referenced.
3Consider two relational tables: Department(dept_id, dept_name) and Employee(emp_id, emp_name, dept_id). If dept_id in Employee references dept_id in Department, what integrity rule prevents adding an employee with a dept_id that does not exist in Department?
A.Domain integrity
B.Entity integrity
C.User-defined integrity
D.Referential integrity
Explanation: Referential integrity requires that any foreign key value in a referencing table must either match an existing primary key value in the referenced table or be NULL. This prevents orphan records and references to non-existent parent rows.
4In an Employee relation, both emp_id and citizenship_no are unique, non-null attributes capable of uniquely identifying every tuple. If the database designer chooses emp_id as the primary key, what is citizenship_no formally classified as?
A.Foreign key
B.Composite key
C.Alternate key
D.Surrogate key
Explanation: Candidate keys are all minimal superkeys capable of uniquely identifying tuples in a relation. When one candidate key is selected as the primary key, all remaining candidate keys are termed alternate keys (or secondary keys).
5Which database model organizes data into a tree-like structure where each child record has exactly one parent record, forming a strict 1:N parent-child relationship hierarchy?
A.Relational data model
B.Network data model
C.Hierarchical data model
D.Object-oriented data model
Explanation: The hierarchical data model organizes data into a tree structure with root records, parent records, and child records. In this model, every child record can have only one parent record, supporting 1:1 and 1:N relationships directly.
6A relational database table named Student has 6 attributes (columns) and currently contains 45 tuples (rows). What are the degree and cardinality of this relation?
A.Degree = 45, Cardinality = 6
B.Degree = 6, Cardinality = 45
C.Degree = 270, Cardinality = 6
D.Degree = 6, Cardinality = 270
Explanation: In relational database terminology, the degree of a relation is the total number of attributes (columns), which is 6. The cardinality of a relation is the total number of tuples (rows), which is 45.
7Which of the following SQL statements belongs strictly to the Data Definition Language (DDL) subset?
A.SELECT * FROM Students WHERE marks > 80;
B.INSERT INTO Students VALUES (101, 'Anil', 'Kathmandu');
C.ALTER TABLE Students ADD COLUMN email VARCHAR(100);
D.UPDATE Students SET marks = 90 WHERE id = 101;
Explanation: DDL commands define, modify, or destroy database structures (schema). Common DDL commands include CREATE, ALTER, DROP, and TRUNCATE. 'ALTER TABLE' modifies the table structure by adding a new attribute column.
8Which SQL command is used to modify the existing data values stored in one or more records within a table?
A.ALTER
B.MODIFY
C.UPDATE
D.CHANGE
Explanation: The UPDATE command is a core Data Manipulation Language (DML) statement used to change column values in existing rows matching an optional WHERE condition.
9A Customers table contains 50 rows. In the city column, the value 'Pokhara' appears 20 times, 'Kathmandu' appears 20 times, and 'Biratnagar' appears 10 times. How many rows will the query 'SELECT DISTINCT city FROM Customers;' return?
A.3 rows
B.10 rows
C.20 rows
D.50 rows
Explanation: The DISTINCT keyword eliminates duplicate rows from the query output. Since there are only three unique city values ('Pokhara', 'Kathmandu', and 'Biratnagar') across the 50 records, the query returns exactly 3 rows.
10Which SQL pattern in a 'WHERE name LIKE ...' clause matches any student name that starts with the letter 'S' and is at least 3 characters long?
A.'S%'
B.'S__'
C.'S__%'
D.'%S%'
Explanation: In SQL LIKE clauses, the underscore '_' matches exactly one character, and the percent '%' matches zero or more characters. The pattern 'S__%' requires 'S' at index 1, followed by at least two specific characters ('__'), followed by zero or more characters ('%'), ensuring a minimum length of 3 characters.

About the NEB 12 Computer Science Exam

The Nepal NEB Class 12 Computer Science Board Examination is the national standardized secondary leaving examination administered by the National Examinations Board (NEB) of Nepal. Governed by the Curriculum Development Centre (CDC) curriculum, it tests students on database management systems, data communication and networking, web technology, advanced C programming and OOP concepts, and software engineering with contemporary computing trends.

Exam sponsor: National Examinations Board (NEB), Nepal. The requirements and fees below concern the certification or admission exam, separate from our free practice resources.

Assessment

Written board examination: a 50-mark written theory paper (2 hours) plus 50 marks of practical assessment. The theory paper has 9 multiple-choice questions, 5 short-answer questions and 2 long-answer questions

Time Limit

2 hours (theory paper)

Passing Score

At least 35% in the theory paper (below that: Non-Graded, NG)

Exam / Certification Fees

Set annually by NEB; paid through the school

Exam sponsor website

Reported exam pass rate: Not published by subject. Under NEB's letter-grading rules, a theory score below 35% is recorded as Non-Graded (NG) for that subject. Exam sponsor website

Fees, eligibility, and exam policies can change. Confirm them with the exam sponsor before applying or paying.

Our practice resources: topics covered

We aim to reflect publicly available exam outlines and topic information in our study resources. Coverage, format, and difficulty may differ from the actual exam, and we cannot guarantee that every detail is accurate or current. Confirm exam requirements, fees, and policies with the official exam sponsor.

25% of practice bank

Database Management System (DBMS & SQL)

Database concepts, normalisation, and SQL commands.

25% of practice bank

Data Communication and Networking

Transmission media, network models and protocols, and IP addressing.

20% of practice bank

Web Technology

HTML, CSS, JavaScript, and server-side scripting with databases.

20% of practice bank

Programming in C & Object-Oriented Concepts

Functions, pointers, structures and files in C, and OOP concepts.

10% of practice bank

Software Engineering & Contemporary Technologies

Software development life cycle and emerging technologies.

Preparing for the NEB 12 Computer Science Exam

What You Need to Know

  • Passing score: At least 35% in the theory paper (below that: Non-Graded, NG)
  • Assessment: Written board examination: a 50-mark written theory paper (2 hours) plus 50 marks of practical assessment. The theory paper has 9 multiple-choice questions, 5 short-answer questions and 2 long-answer questions
  • Time limit: 2 hours (theory paper)
  • Exam / certification fees: Set annually by NEB; paid through the school Official sources

Using Our Practice Resources

  • Work through all 100 available questions
  • Review every answer and explanation
  • Track weak areas and revisit them
  • Use our AI tutor for tough concepts

NEB 12 Computer Science: Suggested Study Strategy

1Focus on SQL syntax and normalization problems (converting unnormalized tables into 1NF, 2NF, and 3NF) as these frequently appear in board papers.
2Practice tracing C pointer arithmetic, structure memory usage, and file pointers (fseek, ftell) with exact dry runs.
3Master the 7 layers of the OSI model, their respective protocols, and practical IPv4 subnetting calculations.
4Write out clean PHP syntax for form handling ($_POST) and MySQL database query execution to ensure full marks on web technology questions.

Frequently Asked Questions

What is the format of the NEB Class 12 Computer Science examination?

The official assessment is a 50-mark written theory paper (2 hours) plus 50 marks of practical assessment. The theory paper has 9 multiple-choice questions, 5 short-answer questions and 2 long-answer questions. It is a written board examination, not a multiple-choice test.

What score is needed to pass NEB Class 12 Computer Science?

Under NEB's letter-grading rules, students need at least 35% of the theory marks. A lower theory score is recorded as Non-Graded (NG) for the subject.

What happens if a student is Non-Graded (NG) in Computer Science?

Students who are NG in up to two subjects can sit the grade-increment (supplementary) examination announced by NEB after the results; others take the subject again in a later regular examination.

Are these practice questions official NEB papers?

No. OpenExamPrep's questions are an independent English-language multiple-choice study adaptation of the curriculum topics. They are not an official translation of the board paper or a simulation of its written format. OpenExamPrep is independent and is not affiliated with or endorsed by NEB or the Curriculum Development Centre (CDC).