Open Competition TU Lecturer 2081 Subject ICT

Open Competition TU Lecturer 2081 Subject ICT

त्रिभुवन विश्वविद्यालय

सेवा आयोग

उपप्राध्यापक पदको खुला प्रतियोगितात्मक लिखित परीक्षा

२०८१/०८/०९

पत्र प्रथम (खण्ड दोश्रो)

समय ५० मिनेट

५०*०१=५० अङ्क

विषय: विषयगत ज्ञान परिक्षण

KEY [A]

पूर्णाङ्ग: ५०

उत्तरपुस्तिकामा प्रश्नपत्रको KEY अनिवार्य रूपले उल्लेख गर्नुपर्नेछ । उल्लेख नगरेमा उत्तरपुस्तिका रद्द हुनेछ । परीक्षामा calculator, mobile प्रयोग गर्न पाइनेछैन ।

Multiple Choice

Marks: 50x1

1. Codes consisting of light and dark marks which may be optically read is known as

A) Barcode

B) Mnemonics

C) Decoder

D) Encoder

2. Which feature of OOP indicates code reusability?

A) Abstraction

B) Polymorphism

C) Encapsulation.

D) Inheritance

3. Fetch operations are not required in....

A) direct addressing

B) indirect addressing

C) immediate addressing

D) register addressing

4. The operating system keeps a small table containing information about all open called......

A) file table

B) directory table

C) open-file table

D) system table

5 . The circult used to store one bit of data is known as....

A) Encoder

B) Flip Flop

C) OR gate

D) Decoder

6. In an 18 bit Johnson Counter Sequence how many state orbit patterns are possible?

A) 240

B) 232

C) 228

D) 220

7. The overall description of a database is called ............

A) Data integrity

B) Data manipulation

C) Database schema

D) Data defination

8. In program, a mistake in an algorithm that causes incorrect results in definition is called a.......

A) logical error

B) syntax error

C) procedural error

D) compiler error

9. Which one of the following cannot be scheduled by the kernel?

A) Kernel level thread

B) User level thread

C) Process

D) None of the above

10. Which exception is thrown when java is out of memory?

A) Memory error

B) Out of memory error

C) Memory out of bounds exception

D) Memory full exception

11. Which one is used to store critical pieces of Data during subroutines and interrupts?

A) Queue

B) Accumulator

C) Stack

D) Data register

12 Earliest dead line first algorithm assigns priorities according to.........

A) Periods

B) Burst time

C) Scheduling

D) Deadlines

13. A problem encountered in multitasking when a process is perpetually denied necessary resources is called.....

A) deadlock

B) starvation

C) Inversion

D) aging

Next