NEB 12 Computer Science study guide
NEB 12 Computer Science · Work through your exam, one topic at a time.
NEB Grade 12 Computer Science is the Computer Science subject examination of the Grade 12 (कक्षा १२) national examinations administered by the National Examinations Board (NEB), Sanothimi, Bhaktapur, through its Examination Control Office for Classes 11 and 12. It is taken by Grade 12 students in Nepal who have registered Computer Science as a subject, including regular candidates and old partial or grade-improvement candidates who sit the examination under the Board's published schedules. The Board publishes an Assessment Framework for Grade 12 and downloadable sample question papers (नमुना प्रश्नपत्रहरू), which are the most reliable starting points for understanding how the subject is assessed, and its notices for Class 12 routinely name Computer Science alongside Physics, Biology and Chemistry, for example in re-totaling (पुनर्योग) result announcements. Preparation should begin with the Assessment Framework and official sample papers, then move to the syllabus topics, practising writing answers to the marks and time available. Candidates should track the Board website for the annual work calendar, examination routine, application form deadlines, and re-totaling or supplementary (मौका) notices, and should confirm practical requirements with their school, since the Board publishes a Practical Practice Implementation Directive, 2083. This page is an independent study resource and is not affiliated with, endorsed by, or operated by the National Examinations Board. Topics on this exam: Computer Science. The NEB 12 Computer Science study guide has 1 section and about 379 words.
01Computer Science (NEB Grade 12)
This domain covers the full NEB Grade 12 Computer Science syllabus: number systems and Boolean logic, computer architecture, data communication and networking, database management, C and object-oriented programming, web technology, software process models, and recent trends. Questions mix short definitions, "difference between" tables, trace-the-output code, and numerical conversions, so exact terminology earns marks. Number systems: binary, octal, decimal and hexadecimal conversions; 1's and 2's complement; signed range for n bits is −2^(n−1) to 2^(n−1)−1. Boolean algebra: De Morgan's laws, canonical SOP/POS forms, Karnaugh-map groups in powers of two.
379 words, about 2 minMore study resources for NEB 12 Computer Science
- Practice questionsIn a singly linked list, which operation is performed in O(1) time when a pointer to the node immediately before the target position is available?
- FlashcardsTwo's complement range. In an n-bit two's complement system the representable range is −2^(n−1) through 2^(n−1)−1, so 8 bits cover −128 to 127 and there is only one representation of zero.
- Cheat sheetNumber systems: binary base 2, octal base 8, decimal base 10, hexadecimal base 16; each hex digit maps to exactly 4 bits, each octal digit to 3 bits.
- Key termsAlgorithm. A finite, ordered set of unambiguous steps that transforms given inputs into a desired output and terminates.
- Study planDefine and classify the core building blocks of a computer system (CPU, memory, storage, I/O) and explain how each contributes to program execution.
- Common mistakesCandidates memorize the body of a program (declarations, statements, return) but skip the preprocessor directives and the int return type because those lines feel like boilerplate that 'doesn't do anything'.
- Exam-day guidePrint or download the admit card or hall ticket issued for your exam.