SSF Computer Level 7 PDF
SSF Computer Level 7 PDF
;]jf M ljljw, ;d'x M sDKo'6/ OlGhlgol/ª, tx M &, kb M ;xfos – lgb]{zssf] v'nf / cfGtl/s
k|ltof]lutfTds lnlvt k/LIffsf] kf7\oqmd
l4tLo r/0f
!=lnlvt k/LIffsf] dfWod efiff g]kfnL jf c+u|]hL cyjf g]kfnL / c+u]|hL b'j} x'g ;Sg]5 .
@= kf7\oqmdsf] k|yd / l4tLo kqsf] ljifoj:t' Pp6} x'g]5 .
#= k|yd / l4tLokqsf] lnlvt k/LIff 5'§f5'§} x'g]5 .
$= k|yd tyf l4tLo kqsf PsfO{x?sf] k|Zg ;+Vof lgDgfg';f/ x'g]5 M
c+sef/ 7 5 5 7 7 7 7 7 7 7 7 7 5 5+10
1
%= k|yd kqdf j:t'ut ax'pQ/ (Multiple Choice) k|Zgx?sf] pQ/ ;xL lbPdf k|To]s ;xL pQ/ afkt !
-Ps_ cÍ k|bfg ul/g]5 eg] untpQ/ lbPdf k|To]s untpQ/ afkt @) k|ltzt cyf{t\ )=@ cÍ s§f ul/g]5
. t/ pQ/ glbPdf To; afkt cÍ lbOg] 5}g / c+Í s§f klg ul/g] 5}g .
^= l4tLo kqsf] ljifout k|Zgsf nflu tf]lsPsf] ७ cÍsf k|Zgx?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 .
७= o; kf7|oqmddf h];'s} n]lvPsf] ePtfklg kf7\oqmddf k/]sf P]g, lgodx? k/LIffsf] ldlteGbf # -tLg_
dlxgf cufl8 -;+zf]wg ePsf jf ;+zf]wg eO{ x6fOPsf jf yk u/L ;+zf]wgeO{_ sfod /x]sfnfO{ o;
kf7\oqmddf /x]sf] ;Demg' kb{5 .
८=k|yd r/0fsf] lnlvt k/LIffaf6 5gf}6 ePsf pDd]bjf/x?nfO{ dfq l4tLor/0fsf] cGtjf{tf{df ;lDdlnt
u/fOg]5 .
2
2.4 Class definitions, encapsulation, inheritance, object
composition,Polymorphism
2.5 Pattern and framework
3. Artificial Intelligence
3.1 Search
3.2 Natural Language Processing
3.3 Game Playing
3.4 Learning
3.5 Automated reasoning
3.6 Planning
3.7 Vision and Robotics
4. Data structures
4.1 General concepts: Abstract data Type, Time and space analysis of algorithms,
Big oh andtheta notations, Average, best and worst-case analysis
4.2 Linear data structures
4.3 Trees: General and binary trees, Representations and traversals, Binarysearch
trees, balancing trees, AVL trees, 2-3 trees, red-black trees, self-adjusting trees,
Splay Trees
4.4 Algorithm design techniques: Greedy methods, Priority queue
search,Exhaustive search, Divide and conquer, Dynamic programming, Recursion
4.5 Hashing
4.6 Graphs and digraphs
4.7 Sorting
5.1 Basic Structures: sequential circuits, design procedure, state table and state
diagram, VonNeumann / Harvard architecture, RISC/CISC architecture
5.2 Addressing Methods and Programs, representation of data,
arithmeticoperations, basic operational concepts, bus structures, instruction, cycle
andexcitation cycle.
5.3 Processing Unit: instruction formats, arithmetic and logical instruction.
5.4 addressing modes
5.5 Input Output Organization: I/O programming, memory mapped I/O,
basicinterrupt system, DMA
5.6 Arithmetic
5.7 Memory Systems
5.8 808X and Intel microprocessors: programming and interfacing
3
6. Digital Design
7. Software Engineering
4
8.7 Data Mining and Data Warehousing
8.8 Security Management System
9. Operating System
5
12.1 Defining the System, System Owner, System User, System Designers and
system Builders, System Analysts, Variations on the System Analyst title, System
life Cycle,
12.2 The System Design Environment: Development Process, Management
Process, System Structure, Basic Component of Computer based Information
System, Personal/ Centralized/Distribution System.
12.3 Concept formations: Introduction, Finding the Problem, Evaluating the
Proposal, Technical Feasibility, Operational Feasibility, Economic Feasibility.
12.4 Requirements analysis: Representing System Analysis Model, Requirement
Model, Design Model,
12.5 Development Process: Design Method.
12.6 Entity Relationship Diagram (E-R Diagram): Notations, Entities: Strong
Entities, Weak Entities, Attributes: Simple and Composite, Single Valued and
Multiple Valued, Null and Derived Attribute.
12.7 Relationship Sets: Degree of Relationship and Cardinality Relationship,
Specialization, Generalization, Aggregation.
12.8 Data Flow Diagrams (DFDs): Introductions, Data flow Diagram, Symbol,
Files or data store, External entities, Data flows,
12.9 Describing System by Data Flow Diagram: Context diagram, Top level
DFD, Expansion Level DFD, Conversions of Data.
12.10 Object Modeling: Object -Oriented Concept, Object Structure, Object
Feature, Class and Object.
12.11 Representation: Association and Composition, Inheritance, Multiple
Inheritances.
12.12 Modeling: Use Case Diagram, State Diagram, Event Flow Diagram.
13. IT in Nepal
6
14.9 सामाजिक सरु ऺा योिना संचाऱन कायमविधध, २०७५
14.10 रोिगारदाता र श्रममकको सधु चकरण सम्बन्धी कायमविधध, २०७५
14.11 श्रम ऐन, २०७४
14.12 श्रम ननयमािऱी, २०७५
14.13 बोनस ऐन, २०३०
14.13 बोनस ननयमािऱी, २०३९
14.14 कोषको रकम (िाणणज्य बैंकहरुमा) ऱगानन गने कायमविधध, २०७५
---The end---