nf]s ;]jf cfof]u

:yfgLo tx cGtu{tsf k|fljlws tkm{ ljljw ;]jf, 5}7f}+ tx, sDKo'6/ Ol~hlgo/ kbsf] k|ltof]lutfTds
k/LIffsf] nflu kf7\oqmd
kf7\oqmdsf] ?k/]vfnfO{ lgDg cg';f/ ljefhg ul/Psf] 5 M

efu !
lnlvt k/LIff (Written Examination) M— k|yd r/0f k"0ff{Í M— !))
låtLo r/0f k"0ff{Í M— %)
efu @
clGtd r/0f (Final Examination) M— -s_ k|of]ufTds k/LIff k"0ff{Í M— %)
-v_ ;fd"lxs k/LIf0f k"0ff{Í M— !)
-u_ cGtjf{tf{ k"0ff{Í M— #)

k/LIff of]hgf (Examination Scheme)

!= lnlvt k/LIff M– k|yd r/0f (First Phase)

kq ljifo k"0ff{Í ptL0ff{Í k/LIff k|0ffnL k|Zg;+Vof x cÍ ;do

sDKo'6/ j:t'ut: ! 306f
Ol~hlgol/Ë ;DaGwL 100 40
k|yd ax'j}slNks k|Zg !)) k|Zg x !cÍ
(MCQs)
!%ldg]6

@= lnlvt k/LIff M– låtLo r/0f (Second Phase)

kq ljifo k"0ff{Í ptL0ff{Í k/LIff k|0ffnL k|Zg;+Vof x cÍ ;do

sDKo'6/ ljifout @ k|Zg x %cÍ ! 306f
låtLo 50 20
Ol~hlgol/Ë ;DaGwL (Subjective) $ k|Zg x !)cÍ #)ldg]6

clGtd r/0fM – k|of]ufTds k/LIff, ;fd"lxs k/LIf0f / cGtjf{tf{

ljifo k"0ff{Í ptL0ff{Í k/LIff k|0ffnL ;do

k|of]ufTds (Practical) ! 306f
k|of]ufTds k/LIff 50 25
-%k|Zg x !)cÍ_ #)ldg]6
;fd"lxs k/LIf0f ;d"xdf JolQmut k|:t'lt
10 #)ldg]6
(Group Test) (Individual Presentation in Group)
cGtjf{tf{ (Interview) 30 df}lvs (Oral)

b|i6Jo M
!= of] kf7\oqmd of]hgfnfO{ lnlvt k/LIff -k|yd r/0f / låtLo r/0f_ tyf clGtd r/0f -k|of]ufTds
k/LIff, ;fd"lxs k/LIf0f / cGtjf{tf{_ u/L b'O{ efudf ljefhg ul/Psf] 5 .
@= k|Zgkq c+u|]hL efiffdf x'g]5 .
#= lnlvt k/LIffsf] dfWod efiff g]kfnL jf c+u|]hL cyjf g]kfnL / c+u|]hL b'j} x'g]5 .
$= j:t'ut ax'j}slNks (Multiple Choice) k|Zgx?sf] unt pQ/ lbPdf k|To]s unt pQ/ afkt @)
k|ltzt cÍ s§f ul/g]5 . t/ pQ/ glbPdf To; afkt cÍ lbOg] 5}g / cÍ s§f klg ul/g] 5}g .
%= k/LIffdf s'g} k|sf/sf] SofNs'n]6/ (Calculator) k|of]u ug{ kfOg] 5}g .

Page 1
 nf]s ;]jf cfof]u
:yfgLo tx cGtu{tsf k|fljlws tkm{ ljljw ;]jf, 5}7f}+ tx, sDKo'6/ Ol~hlgo/ kbsf] k|ltof]lutfTds
k/LIffsf] nflu kf7\oqmd
^= ljifout k|Zgsf nflu tf]lsPsf cÍsf xsdf Pp6f nfdf] k|Zg jf Pp6} k|Zgsf b'O{ jf b'O{ eGbf
a9L efu -Two or more parts of a single question_ jf Pp6f k|Zg cGtu{t b'O{ jf a9L
l6Kk0fLx? -Short notes_ ;f]Wg ;lsg] 5 .
&= ljifout k|Zg x'g] kqsf xsdf k|To]s v08sf nflu 5'§f5'§} pQ/k'l:tsfx? x'g]5g\ . k/LIffyL{n]
k|To]s v08sf k|Zgx?sf] pQ/ ;f]xL v08sf] pQ/k'l:tsfdf n]Vg'kg]{5 .
*= cfof]uaf6 ;+rfng x'g] k/LIffdf k/LIffyL{n] df]afOn jf o:t} k|sf/sf ljB'tLo pks/0f k/LIff
xndf n}hfg kfOg] 5}g .
(= lnlvt k/LIffdf k|yd kq / låtLo kqsf kf7\oqmdsf ljifoj:t' Pp6} x'g]5 .
!)= lnlvt k/LIffdf ;f]lwg] k|Zg ;+Vof k|yd kqsf] nflu oyf;Dej b]xfo adf]lhd x'g]5 .
k|yd kqsf PsfO{ 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
k|Zg ;+Vof 8 8 4 6 8 6 10 6 6 6 6 4 8 6 8
!!= k|yd r/0f (First Phase) sf] lnlvt k/LIffaf6 5gf}6 ePsf pDd]bjf/x?nfO{ dfq låtLo r/0f
(Second Phase) sf] lnlvt k/LIffdf ;lDdlnt u/fOg]5 .
!@ lnlvt k/LIffdf ;f]lwg] k|Zg ;+Vof låtLo kqsf] nflu oyf;Dej b]xfo adf]lhd x'g]5 .
låtLokqsf A B
v08
låtLo kqsf 1 5 6 13 14 2 4 7 8 9 3 10 11 12 15 Technical Case
PsfO{ Writing Study
k|ltzt 40 30 10 20
k|Zg ;+Vof 4 1 1
!#= lnlvt k/LIffsf] k|yd r/0f (First Phase) df k|fKt u/]sf] k|fKtfÍsf] zt\ k|ltzt cÍ tyf låtLo
r/0f (Second Phase) sf] k|fKtfÍx? hf]l8 s"n cÍsf] cfwf/df lnlvt k/LIffsf] glthf k|sflzt
ul/g]5 .
!$= lnlvt k/LIffdf 5gf}6 ePsf pDd]bjf/x?nfO{ dfq clGtd r/0fsf] k|of]ufTds k/LIff, ;fd"lxs
k/LIf0f / cGtjf{tf{df ;lDdlnt u/fOg]5 .
!% k|of]ufTds k/LIffsf k|Zg;+Vof lgDgfg';f/ x'g]5g .
k|of]ufTds k/LIffsf] PsfO{ 1 6 9 10
k|Zg ;+Vof 1 1 2 1
!^= lnlvt k/LIff / clGtd clGtd r/0fsf] k|of]ufTds k/LIff, ;fd"lxs k/LIf0f / cGtjf{tf{sf] s'n
cÍ of]usf cfwf/df k|of]ufTds k/LIffdf pQL0f{ x'g] k/LIffyL{x?nfO{ dfq of]Uotfqmd ;"rLdf
;dfj]z u/L clGtd k/LIffkmn k|sflzt ul/g]5 .
!& o; kf7\oqmd of]hgf cGtu{tsf kq÷ljifosf ljifoj:t''df h];'s} n]lvPsf] eP tfklg kf7\oqmddf
k/]sf sfg"g, P]g, lgod tyf gLltx? k/LIffsf] ldlt eGbf # dlxgf cufl8 -;+zf]wg ePsf jf
;+zf]wg eO{ x6fO{Psf jf yk u/L ;+zf]wg eO{_ sfod /x]sfnfO{ o; kf7\qmddf k/]sf] ;Demg''
kb{5 .
!* kf7\oqmd nfu" ldlt M @)&^÷)@÷!@

Page 2
 nf]s ;]jf cfof]u
:yfgLo tx cGtu{tsf k|fljlws tkm{ ljljw ;]jf, 5}7f}+ tx, sDKo'6/ Ol~hlgo/ kbsf] k|ltof]lutfTds
k/LIffsf] nflu kf7\oqmd
k|yd / låtLo kq M— sDKo'6/ Ol~hlgol/Ë ;DjGwL ljifo
Section (A)
1. Computer Networks
1.1 Protocol stack, switching
1.2 Link Layer: services, error detection and correction, multiple access protocols, LAN
addressing and ARP (Address Resolution Protocol), Ethernet, CSMA/CD multiple
access protocol, Hubs, Bridges, and Switches, Wireless LANs, PPP (Point to Point
Protocol), Wide area protocols
1.3 Network Layer :services, datagram and virtual circuits, routing principles and
algorithms, Internet Protocol (IP), IP addressing, IP transport, fragmentation and
assembly, ICMP (Internet Control Message Protocol), routing on the internet, RIP
(Routing Information Protocol), OSPF (Open Shortest Path First), router internals,
IPv6)
1.4 Transport Layer: principles, multiplexing and demultiplexing, UDP, TCP, flow
control, principles of congestion control, TCP congestion control
1.5 Application Layer : Web and Web caching, FTP (File Transfer Protocol), Electronic
mail, DNS (Domain Name Service), socket programming)
1.6 Distributed system, Clusters
2. Computer Architecture & organization and micro-processors
2.1 Basic Structures : sequential circuits, design procedure, state table and state
diagram, von Neumann / Harvard architecture, RISC/CISC architecture
2.2 Addressing Methods and Programs, representation of data, arithmetic operations,
basic operational concepts, bus structures, instruction, cycle and excitation cycle.
2.3 Processing Unit: instruction formats, arithmetic and logical instruction.
2.4 addressing modes
2.5 Input Output Organization : I/O programming , memory mapped I/O, basic interrupt
system, DMA
2.6 Arithmetic
2.7 Memory Systems
2.8 808X and Intel microprocessors: programming and interfacing
3. Digital Design
3.1 Digital and Analog Systems. Number Systems
3.2 Logic Elements
3.3 Combinational Logic Circuits
3.4 Sequential Logic
3.5 Arithmetic Circuits
3.6 MSI Logic circuits
3.7 Counters and Registers
3.8 IC logic families
3.9 Interfacing with Analog Devices
3.10 Memory Devices
4. Basic Electrical & Electronics
4.1 Electrical
4.1.1 Basic Circuit Theory
4.1.2 AC circuit Fundamentals
4.1.3 Magnetic circuits and Transformers
4.1.4 Transient Analysis, Filters
4.2 Electronics
4.2.1 Semiconductors, Diodes and Diode Circuits, Transistors,

Page 3
 nf]s ;]jf cfof]u
:yfgLo tx cGtu{tsf k|fljlws tkm{ ljljw ;]jf, 5}7f}+ tx, sDKo'6/ Ol~hlgo/ kbsf] k|ltof]lutfTds
k/LIffsf] nflu kf7\oqmd
4.2.2 Transistor modeling
4.2.3 Biasing and Amplification
4.2.4 Small Signal amplifiers and frequency response
4.2.5 Large signal amplifiers, feedback amplifiers and Oscillators
4.2.6 Operational amplifiers
5. Principles of Electronic Communications
5.1 Block Diagram of analog/ digital communication system
5.2 Analog and Digital modulation techniques
5.3 Fundamentals of Error Detection and Correction
5.4 Performance evaluation of analog and digital communication systems: SNR and
BER
6. Structured and object oriented programming
6.1 Data types, ADT
6.2 Operators, variables and assignments, control structures
6.3 Procedure/function
6.4 Class definitions, encapsulation, inheritance, object composition, Polymorphism
6.5 Pattern and framework
7. Data structures
7.1 General concepts : Abstract data Type, Time and space analysis of algorithms, Big
oh and theta notations, Average, best and worst case analysis
7.2 Linear data structures
7.3 Trees: General and binary trees, Representations and traversals, Binary search
trees, balancing trees, AVL trees, 2-3 trees, red-black trees, self-adjusting trees,
Splay Trees
7.4 Algorithm design techniques: Greedy methods, Priority queue search, Exhaustive
search, Divide and conquer, Dynamic programming, Recursion
7.5 Hashing
7.6 Graphs and digraphs
7.7 Sorting
8. Software Engineering
8.1 Software process: software lifecycle models, risk-driven approaches
8.2 Software Project management: Relationship to lifecycle, project planning, project
control, project organization, risk management, cost models, configuration
management, version control, quality assurance, metrics
8.3 Software requirements: Requirements analysis, requirements solicitation, analysis
tools, requirements definition, requirements specification, static and dynamic
specifications, requirements review.
8.4 Software design: Design for reuse, design for change, design notations, design
evaluation and validation
8.5 Implementation: Programming standards and procedures, modularity, data
abstraction, static analysis, unit testing, integration testing, regression testing, tools
for testing, fault tolerance
8.6 Maintenance: maintenance problem, nature of and planning for maintenance
8.7 SE issues: Formal methods, tools and environments for software engineering, role of
programming paradigm, process maturity and Improvement, ISO standards, SEI-
CMM, CASE tools
9. Database Management System
9.1 Introduction : The relational model, ER model , SQL, Functional dependency and
relational database design, File structure

Page 4
 nf]s ;]jf cfof]u
:yfgLo tx cGtu{tsf k|fljlws tkm{ ljljw ;]jf, 5}7f}+ tx, sDKo'6/ Ol~hlgo/ kbsf] k|ltof]lutfTds
k/LIffsf] nflu kf7\oqmd
9.2 Transaction Management and Concurrency Control: Concurrent execution of the
user programs, transactions, Concurrency control techniques
9.3 Crash Recovery : types of failure, Recovery techniques
9.4 Query Processing and Optimization
9.5 Indexing : Hash based indexing, Tree based indexing
9.6 Distributed Database Systems and Object oriented database system
9.7 Data Mining and Data Warehousing
9.8 Security Management System
10. Operating System
10.1 Processes and Threads: Symmetric Multiprocessing, Micro-kernels, Concurrency,
Mutual Exclusion and Synchronization, Deadlock.
10.2 Scheduling
10.3 Memory Management
10.4 Input Output and Files: I/O devices and its organization, Principles of I/O software
and hardware, Disks, Files and directories organization, File System
Implementation.
10.5 Distributed Systems: Distributed Message passing, RPC, Client/Server Computing,
Clusters.
10.6 Security : Authentication and Access Authorization, System Flaws and Attacks,
Trusted system
11. Artificial Intelligence
11.1 Search
11.2 Natural Language Processing
11.3 Game Playing
11.4 Learning
11.5 Automated reasoning
11.6 Planning
11.7 Vision and Robotics
12. Theory of Computation
12.1 BNF, Languages, grammars
12.2 DFA and NDFA, regular expressions, regular grammars
12.3 Closure, homomorphism
12.4 Pigeonhole principle, pumping lemma
12.5 CFGs, Parsing and ambiguity, Pushdown automata, NPDAs & CFGs
12.6 Pumping lemma
12.7 Turing machines
12.8 Recursively enumerable languages, Unrestricted grammars
12.9 Chomsky hierarchy, Undecidable problems, Church's Thesis
12.10 Complexity Theory, P and NP
13. Compiler Design
13.1 Structure of a Compiler
13.2 Lexical Analyzer
13.3 Top down Parsing/ Bottom up Parsing
13.4 Syntax Directed Translation
13.5 Types and Type Checking
13.6 Run-Time Storage Administration
13.7 Intermediate Code generation
13.8 Data-Flow Analysis and Code Optimizations
13.9 Architecture and recent development on compilers

Page 5
 nf]s ;]jf cfof]u
:yfgLo tx cGtu{tsf k|fljlws tkm{ ljljw ;]jf, 5}7f}+ tx, sDKo'6/ Ol~hlgo/ kbsf] k|ltof]lutfTds
k/LIffsf] nflu kf7\oqmd
14. Computer Graphics
14.1 Graphics concepts
14.2 Input devices and techniques
14.3 Basic raster graphics algorithms and primitives
14.4 Scan conversion
14.5 Graphics hardware
14.6 2D geometrical transformations and viewing
14.7 3D geometry and viewing
14.8 Hierarchical modeling
14.9 Projections
14.10 Hidden surface removal
14.11 Shading and rendering
15. Emerging Technology and Electives
15.1 Modeling and simulation
15.2 Parallel and distributed computing
15.3 High speed networks
15.4 Artificial Neural Network and Computer Vision
15.5 Adaptive web technology
15.6 Software Architecture
15.7 Distributed Object technology ( ORB, DCOM)
15.8 Speech signal processing
15.9 Cryptography and network security
15.10 E-commerce
15.11 Software project management
15.12 Embedded systems
15.13 Image processing
15.14 Multimedia
15.15 Expert system
15.16 GIS/ Remote sensing/ GPS
16. Legislations and IT in Nepal
16.1 The Constitution of Nepal (From Part 1 to 5, 13, 14, 15, 16, 17, 18, 19 & 20; and
Schedules)
16.2 History of IT in Nepal,
16.3 ICT Policy of Nepal
16.4 Electronic Transaction Act, 2063 B.S.
16.5 Copyright Act, 2059 B.S.
16.6 Local Government Operation Act, 2074 (Provisions related to ICT)

Section (B)
1. Technical Writing (5 Marks)
2. Case Study (10 Marks)

--------------------

Page 6
 nf]s ;]jf cfof]u
:yfgLo tx cGtu{tsf k|fljlws tkm{ ljljw ;]jf, 5}7f}+ tx, sDKo'6/ Ol~hlgo/ kbsf] k|ltof]lutfTds
k/LIffsf] nflu kf7\oqmd
j:t'ut gd"gf k|Zgx? (Sample Questions)
1. The Constructive Cost Model (COCOMO) helps in identifying
A. Function point count
B. Effort
C. Lines of Codes
D. Design timeframe
Correct answer: (B)
2. Which one of the following process scheduling technique is most appropriate for
batch jobs for which run time are known in advance?
A. Round robin scheduling
B. Priority based scheduling
C. Multiple queues scheduling
D. Shortest job first scheduling

Correct answer: (D)

3. The pumping lemma for context free languages can be used to
A. prove that a given language is regular
B. prove that a given language is not context free.
C. prove that all CFL have a corresponding PDA
D. prove that a given CFL is inherently ambiguous
Correct answer: (B)

4. Which of the followings does NOT belong to “Extreme Programming”?

A. pair programming
B. heavy documentation
C. unit-test
D. user-story
Correct answer: (B)

Page 7
 nf]s ;]jf cfof]u
:yfgLo tx cGtu{tsf k|fljlws tkm{ ljljw ;]jf, 5}7f}+ tx, sDKo'6/ Ol~hlgo/ kbsf] k|ltof]lutfTds
k/LIffsf] nflu kf7\oqmd
Guidelines & Sample questions
The Subjective paper consists of two parts. "Part I" consists of questions pertinent to core
subjects provided in the course of studies (units 1-15). Similarly "Part II" consists of
technical writing skill test as well as case study.
Sections (A) - (70 %)
Attempt all questions. (3 X 10 marks = 30 Marks, 1 X 5 marks = 5 Marks)
1.
a. Explain the principles of public Key infrastructure (PKI).
b. Illustrate two methods to reduce the aliasing effect in context to Computer
Graphics.
c. Prove that if a heuristic is consistent, it must be admissible. [4 +3+3]
Section (B) (30 %)
This section consists of 2 (two) sub-sections i.e. Technical Writing and Case study.
a. Technical Writing (1 question Carrying 5 marks)
This section may ask the examinee to write technical proposal on given specification,
essay, views/critics etc. The topic must be related to computer technology or the matter
related therewith and examinee should be encouraged to put his/her own views and
reasoning rather than facts/information.
b. Case Study (1 question Carrying 10 marks)
This section is dedicated to the analysis and design of a software system. Examinee
should be given a scenario of existing system and asked to analyze and design it following
one particular paradigm. This section should include the various domain of knowledge in
one platform (for e.g. A case study may incorporate questions from Software Engineering
and Database management and Operating system domains).

Technical Writing (1 Question carrying 5 marks)

1. The recently promulgated Electronic Transaction Act has provided legal provisions for
authentication and regulating for the recognition, true ship, integrity and reliability of
creation, production, processing, storage, and communication and dissemination system of
electronic records by making reliable and secured transactions carried out by means of
electronic data interchange and other means of electronic communications.
Write an Essay on how this ordinance affects the existing software development scenario
in Nepal.
Case Study (1 Question carrying 20 marks)
2. A Kathmandu based transport company wants to establish a computerized ticketing
counter at Gongabu bus terminal. Company owns both air conditioned as well as non-AC
buses. Besides that, Company also provides service of goods transport. There are various
possible users of the proposed software: Owners can monitor and manipulate the accounts
and reservation whereas clients can view the status of their ticket and goods. Employees
can have limited access according to their role.
2.1 Calculate the cost/effort for the proposed system using Function points and any
effort model of your choice (for e.g. Constructive Cost Model). (3 marks)
2.2 Draw a context diagram and Level-1 Data-flow diagram OR USE-CASE diagram for
the possible automated system. (3 Marks)
2.3 Design the efficient database schema for the proposed system (with appropriate
normalization methods). (4 Marks)

Page 8
 nf]s ;]jf cfof]u
:yfgLo tx cGtu{tsf k|fljlws tkm{ ljljw ;]jf, 5}7f}+ tx, sDKo'6/ Ol~hlgo/ kbsf] k|ltof]lutfTds
k/LIffsf] nflu kf7\oqmd
;fd"lxs k/LIf0f (Group Test)
;fd'lxs k/LIf0f JolQmTj k/LIf0f (Personality Test) sf] Ps c+z xf] . lghfdtL ;]jfsf]
If]qlj:tf/ tyf sfo{ k4lt kl/jt{g ;d]t e}/x]]sf] ;Gbe{df g]kfn ;/sf/sf gLlt, of]hgf, sfo{qmd cflb
dfly ljrf/–ljdz{, 5nkmn u/L ltgsf] cem} a9L k|efjsf/L tyf sfof{Gjog of]Uo ;dfwfg klxNofpg]
;DaGwdf pDd]bjf/x?sf] Ifdtf klxrfg ug'{ o; k/LIf0fsf] d"n dd{ xf] . . o;sf] nflu 5nkmn, ljrf/–
ljdz{ u/L kl/l:ylt a'‰g ;Sg], lg0f{o lbg], hgtfnfO{ lqmofzLn agfpg], lrQ a'emfpg], lgwf{l/t nIo
cg';f/ sfd ug]{÷u/fpg], h:tf sfdsf nflu n]vg Ifdtfsf ;fy;fy} ;d:ofnfO{ oyfy{k/s 9+un]
klxrfg ug{ ;Sg], jfsk6'tf, lzi6tf, ts{zlQmsf] klg cfjZostf kb{5 .
To;}n] o; k/LIf0fdf pDd]bjf/x?sf] jf}l4s Ifdtf, ;+rf/ ;Lk, ;d"x ultlzntf, Jojxf/,
JolQmTj, dgf]j[lt, lqmofzLntf, lg0f{ozlQm, ;d:of ;dfwfg Ifdtf, g]t[Tj Ifdtf, ;do Joj:yfkg tyf
JolQmTjdf ePsf cGo u'0fx?sf] cf+sng cyf{t k/LIf0f / d"NofÍg ug{sf] nflu pDd]bjf/x?nfO{ s'g}
;d;fdlos ljifo÷;jfn÷;d:ofdf ;fd"lxs 5nkmn u/L k|efjsf/L / sfof{Gjog of]Uo ;dfwfg lgsfNg
lbOG5 .

;fd"lxs 5nkmn (Group Discussion)

o; k|of]hgsf] nflu ul/g] k/LIf0f !) k"0ff{Í / #) ldg]6 cjlwsf] x'g]5 h'g g]tfljlxg ;fd"lxs
5nkmn (Leaderless Group Discussion) sf] ?kdf cjnDjg ul/g] 5 . lbOPsf] k|Zg jf Topic sf
ljifodf kfn}kfnf];Fu lglb{i6 ;doleq ;d"xjLr 5nkmn ub}{ k|To]s pDd]bjf/n] JolQmut k|:t'lt
(Individual Presentation) ug'{ kg]{5 . o; k/LIf0fdf d"NofÍgsf] nflu b]xfo cg';f/sf] # hgf eGbf
a9Lsf] ;ldlt /xg]5 .
cfof]usf ;b:o – cWoIf
cfof]usf ;b:o – ;b:o
dgf]lj1 – ;b:o
bIf÷lj1 -! hgf_ – ;b:o

;fd"lxs 5nkmndf lbOg] gd'gf k|Zg jf Topic

pbfx/0fsf] nflu – phf{ ;+s6, u/LaL lgjf/0f, :jf:Yo aLdf, vfB ;'/Iff, k|ltef knfog h:tf Topics
dWo] s'g} Ps Topic dfq lbOg]5 .

Page 9