New Vacancy For Computer Officer 2068 – 08 [राजपत्रांकित तृतीय श्रेणी (प्रा.) (आ.प्र., समावेशी तथा खुला) प्रतियोगितात्मक लिखित परीक्षाको विज्ञापन]

परीक्षाको किसिमः – लिखित र अन्तर्वार्ता ।
परीक्षा केन्द्रः– विद्यालय निरीक्षक पदको लागि आयोगको पूर्वाञ्चल क्षेत्रीय निर्देशनालय, धनकुटा, मध्यमाञ्चल क्षेत्रीय निर्देशनालय,
काठमाडौं, पश्चिमाञ्चल क्षेत्रीय निर्देशनालय, पोखरा, मध्यपश्चिमाञ्चल क्षेत्रीय निर्देशनालय, सुर्खेत र सुदूरपश्चिमाञ्चल
क्षेत्रीय निर्देशनालय, दिपायलमा लिखित परीक्षा हुनेछ । साथै अन्य पदहरुको हकमा काठमाडौंमा परीक्षा हुनेछ ।
परीक्षा दस्तुरः ः– निजामती सेवाको रा.प. तृतीय श्रेणीको लागि रु. ७००।– (सातसय) बुझाउनु पर्ने र त्यसपछिका थप प्रत्येक अन्य
किसिम÷समूहका लागि रु. ३००।– (तीनसय) थप दस्तुर बुझाउनु पर्ने ।
दरखास्त दिने स्थानः थानः– काठमाडौंको हकमा काठमाडौं उपत्यका दरखास्त संकलन केन्द्र, अनामनगर र काठमाडौं उपत्यका बाहिरको हकमा
आयोगका क्षेत्रीय निर्देशनालयहरु र अञ्चल कार्यालयहरु ।
दरखास्त दिने अन्तिम मितिः मितिः– २०६८।८।२० गतेसम्म र दोब्बर दस्तुर २०६८।८।२७ गतेसम्म ।
अन्तर्वार्ता हुने मितिः मितिः– लिखित परीक्षाको नतिजा प्रकाशित हुंदा सूचना गरिने छ ।
पदमा रही गर्नुपर्ने कामको विवरणः णः– सेवा, समूह सम्बन्धी ।
तलबः तलबः– प्रचलित स्केल बमोजिम ।
सेवा सम्बन्धी मन्त्रालयः मन्त्रालयः– सामान्य प्रशासन मन्त्रालय ।

lok sewa notice for computer ofice and engineers

 

New Application Form
Notice 2068-08-05

Data structures & Algorithms – Multiple Choice Questions (MCQs) – Objective Set 1

Following are the multiple choice questions (MCQs) or objective questions from Data Structures and Algorithms. The questions are set from the topics such as arrays, records, pointers, linked lists, stacks, queues, recursion, trees, sorting and searching.

Set – 1


1. Two main measures for the efficiency of an algorithm are

a. Processor and memory

b. Complexity and capacity

c. Time and space

d. Data and space


2. The time factor when determining the efficiency of algorithm is measured by

a. Counting microseconds

b. Counting the number of key operations

c. Counting the number of statements

d. Counting the kilobytes of algorithm


3. The space factor when determining the efficiency of algorithm is measured by

a. Counting the maximum memory needed by the algorithm

b. Counting the minimum memory needed by the algorithm

c. Counting the average memory needed by the algorithm

d. Counting the maximum disk space needed by the algorithm


4. Which of the following case does not exist in complexity theory

a. Best case

b. Worst case

c. Average case

d. Null case


5. The Worst case occur in linear search algorithm when

a. Item is somewhere in the middle of the array

b. Item is not in the array at all

c. Item is the last element in the array

d. Item is the last element in the array or is not there at all


6. The Average case occur in linear search algorithm

a. When Item is somewhere in the middle of the array

b. When Item is not in the array at all

c. When Item is the last element in the array

d. When Item is the last element in the array or is not there at all


7. The complexity of the average case of an algorithm is

a. Much more complicated to analyze than that of worst case

b. Much more simpler to analyze than that of worst case

c. Sometimes more complicated and some other times simpler than that of worst case

d. None or above


8. The complexity of linear search algorithm is

a. O(n)

b. O(log n)

c. O(n2)

d. O(n log n)


9. The complexity of Binary search algorithm is

a. O(n)

b. O(log )

c. O(n2)

d. O(n log n)


10. The complexity of Bubble sort algorithm is

a. O(n)

b. O(log n)

c. O(n2)

d. O(n log n)


11. The complexity of merge sort algorithm is

a. O(n)

b. O(log n)

c. O(n2)

d. O(n log n)


12. The indirect change of the values of a variable in one module by another module is called

a. internal change

b. inter-module change

c. side effect

d. side-module update


13. Which of the following data structure is not linear data structure?

a. Arrays

b. Linked lists

c. Both of above

d. None of above


14. Which of the following data structure is linear data structure?

a. Trees

b. Graphs

c. Arrays

d. None of above


15. The operation of processing each element in the list is known as

a. Sorting

b. Merging

c. Inserting

d. Traversal


16. Finding the location of the element with a given value is:

a. Traversal

b. Search

c. Sort

d. None of above


17. Arrays are best data structures

a. for relatively permanent collections of data

b. for the size of the structure and the data in the structure are constantly changing

c. for both of above situation

d. for none of above situation


18. Linked lists are best suited

a. for relatively permanent collections of data

b. for the size of the structure and the data in the structure are constantly changing

c. for both of above situation

d. for none of above situation


19. Each array declaration need not give, implicitly or explicitly, the information about

a. the name of array

b. the data type of array

c. the first data from the set to be stored

d. the index set of the array


20. The elements of an array are stored successively in memory cells because

a. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

b. the architecture of computer memory does not allow arrays to store other than serially

c. both of above

d. none of above
 



Answers



1. Two main measures for the efficiency of an algorithm are
c. Time and space
2. The time factor when determining the efficiency of algorithm is measured by
b. Counting the number of key operations
3. The space factor when determining the efficiency of algorithm is measured by
a. Counting the maximum memory needed by the algorithm
4. Which of the following case does not exist in complexity theory
d. Null case
5. The Worst case occur in linear search algorithm when
d. Item is the last element in the array or is not there at all
6. The Average case occur in linear search algorithm
a. When Item is somewhere in the middle of the array
7. The complexity of the average case of an algorithm is
a. Much more complicated to analyze than that of worst case
8. The complexity of linear search algorithm is
a. O(n)
9. The complexity of Binary search algorithm is
b. O(log n)
10. The complexity of Bubble sort algorithm is
c. O(n2)
11. The complexity of merge sort algorithm is
d. O(n log n)
12. The indirect change of the values of a variable in one module by another module is called
c. side effect
13. Which of the following data structure is not linear data structure?
d. None of above
14. Which of the following data structure is linear data structure?
c. Arrays
15. The operation of processing each element in the list is known as
d. Traversal
16. Finding the location of the element with a given value is:
b. Search
17. Arrays are best data structures
a. for relatively permanent collections of data
18. Linked lists are best suited
b. for the size of the structure and the data in the structure are constantly changing
19. Each array declaration need not give, implicitly or explicitly, the information about
c. the first data from the set to be stored

20. The elements of an array are stored successively in memory cells because

a. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

Data structures & Algorithms – Multiple Choice Questions (MCQs) – Objective Set 2

Following are the multiple choice questions (MCQs) or objective questions from Data Structures and Algorithms. The questions are set from the topics such as arrays, records, pointers, linked lists, stacks, queues, recursion, trees, sorting and searching.

Set – 2


1. The memory address of the first element of an array is called

a. floor address

b. foundation address

c. first address

d. base address


2. The memory address of fifth element of an array can be calculated by the formula

a. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array

b. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array

c. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array

d. None of above


3. Which of the following data structures are indexed structures?

a. linear arrays

b. linked lists

c. both of above

d. none of above


4. Which of the following is not the required condition for binary search algorithm?

a. The list must be sorted

b. there should be the direct access to the middle element in any sublist

c. There must be mechanism to delete and/or insert elements in list

d. none of above


5. Which of the following is not a limitation of binary search algorithm?

a. must use a sorted array

b. requirement of sorted array is expensive when a lot of insertion and deletions are needed

c. there must be a mechanism to access middle element directly

d. binary search algorithm is not efficient when the data elements are more than 1000.


6. Two dimensional arrays are also called

a. tables arrays

b. matrix arrays

c. both of above

d. none of above


7. A variable P is called pointer if

a. P contains the address of an element in DATA.

b. P points to the address of first element in DATA

c. P can store only memory addresses

d. P contain the DATA and the address of DATA


8. Which of the following data structure can’t store the non-homogeneous data elements?

a. Arrays

b. Records

c. Pointers

d. None


9. Which of the following data structure store the homogeneous data elements?

a. Arrays

b. Records

c. Pointers

d. None


10. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called

a. elementary items

b. atoms

c. scalars

d. all of above


11. The difference between linear array and a record is

a. An array is suitable for homogeneous data but hte data items in a record may have different data type

b. In a record, there may not be a natural ordering in opposed to linear array.

c. A record form a hierarchical structure but a lienear array does not

d. All of above


12. Which of the following statement is false?

a. Arrays are dense lists and static data structure

b. data elements in linked list need not be stored in adjecent space in memory

c. pointers store the next data element of a list

d. linked lists are collection of the nodes that contain information part and next pointer


13. Binary search algorithm can not be applied to

a. sorted linked list

b. sorted binary trees

c. sorted linear array

d. pointer array


14. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called

a. underflow

b. overflow

c. housefull

d. saturated


15. The situation when in a linked list START=NULL is

a. underflow

b. overflow

c. housefull

d. saturated


16. Which of the following is two way list?

a. grounded header list

b. circular header list

c. linked list with header and trailer nodes

d. none of above


17. Which of the following name does not relate to stacks?

a. FIFO lists

b. LIFO list

c. Piles

d. Push-down lists


18. The term “push” and “pop” is related to the

a. array

b. lists

c. stacks

d. all of above


19. A data structure where elements can be added or removed at either end but not in the middle

a. Linked lists

b. Stacks

c. Queues

d. Deque


20. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return

a. FAEKCDBHG

b. FAEKCDHGB

c. EAFKHDCBG

d. FEAKDCHBG



Answers



1. The memory address of the first element of an array is called
d. base address

2. The memory address of fifth element of an array can be calculated by the formula
a. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array

3. Which of the following data structures are indexed structures?
a. linear arrays

4. Which of the following is not the required condition for binary search algorithm?
c. There must be mechanism to delete and/or insert elements in list

5. Which of the following is not a limitation of binary search algorithm?
d. binary search algorithm is not efficient when the data elements are more than 1000.

6. Two dimensional arrays are also called
c. both of above

7. A variable P is called pointer if
a. P contains the address of an element in DATA.

8. Which of the following data structure can’t store the non-homogeneous data elements?
a. Arrays

9. Which of the following data structure store the non-homogeneous data elements?
b. Records

10. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
d. all of above

11. The difference between linear array and a record is
d. All of above

12. Which of the following statement is false?
c. pointers store the next data element of a list

13. Binary search algorithm can not be applied to
a. sorted linked list

14. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
b. overflow

15. The situation when in a linked list START=NULL is
a. underflow

16. Which of the following is two way list?
d. none of above

17. Which of the following name does not relate to stacks?
a. FIFO lists

18. The term “push” and “pop” is related to the
c. stacks

19. A data structure where elements can be added or removed at either end but not in the middle
d. Deque

20. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
b. FAEKCDHGB

Annual calendar of Lok Sewa Aayog for Computer Jobs Positions

Recently (2066 Shrawan 27 B.S.) Public Service Commission has circulated their New Annual Calendar. I have presented the information related to Computer Jobs Positions as follows:

Computer Officer

Vacancy Announcement for Computer Officer:
Mangshir
Written Examination of Computer Officer:
Magh – Falgun
Result of Written Examination of Computer Officer:
Baishakh-Jestha
Practical Examination and Interview of Computer Officers:
Ashar – Shrawan
Result of Practical Examination and Interview :
Ashar – Shrawan
Posting:
Ashar Shrawan

Computer Operator

Vacancy Announcement for Computer Operator:
Magh
Written Examination of Computer Operator:
Baishakh – Jestha
Result of Written Examination of Computer Operator:
Bhadra – Ashad
Practical Examination and Interview of Computer Operator:
Kartik – Mangshir
Result of Practical Examination and Interview of Computer Operator:
Kartik – Mangshir
Posting:
Kartik – Mangshir

Assistant Computer Operator

Vacancy Announcement for Assistant Computer Operator:
Chaitra
Written Examination of Assistant Computer Operator:
Jestha – Ashadh
Result of Written Examination of Assistant Computer Operator:
Ashoj – Kartik
Practical Examination and Interview of Assistant Computer Operator:
Mangshir – Paush
Result of Practical Examination and Interview:
Mangshir – Paush
Posting:
Mangshir – Paush