MS office quiz for competitive exam

Thursday, 11 April 2013

MS office quiz for competitive / entrance exam

1. Which of the following is not valid version of MS Office?

 A) Office XP

 B) Office Vista

 C) Office 2007

 D) None of above

2. You cannot close MS Word application by

 A) Choosing File menu then Exit submenu

 B) Press Alt+F4

 C) Click X button on title bar

 D) From File menu choose Close submenu

3. The key F12 opens a

 A) Save As dialog box

 B) Open dialog box

 C) Save dialog box

 D) Close dialog box

4. What is the short cut key to open the Open dialog box?

 A) F12

 B) Shift F12

 C) Alt + F12

 D) Ctrl + F12

5. A feature of MS Word that saves the document automatically after certain interval is available on

 A) Save tab on Options dialog box

 B) Save As dialog box

 C) Both of above

 D) None of above

6. Where can you find the horizontal split bar on MS Word screen?

 A) On the left of horizontal scroll bar

 B) On the right of horizontal scroll bar

 C) On the top of vertical scroll bar

 D) On the bottom of vertical scroll bar

7. Which of the following is not available on the Ruler of MS Word screen?

 A) Tab stop box

 B) Left Indent

 C) Right Indent

 D) Center Indent

 E) All of them are available on ruler

8. What is place to the left of horizontal scroll bar?

 A) Tab stop buttons

 B) View buttons

 C) Split buttons

 D) Indicators

 E) None of above

9. Which file starts MS Word?

 A) Winword.exe

 B) Word.exe

 C) Msword.exe

 D) Word2003.exe

10. How many ways you can save a document?

 A) 3

 B) 4

 C) 5

 D) 6

11. If you want to keep track of different editions of a document which features will you use?

 A) Editions

 B) Versions

 C) Track Change

 D) All of above

12. Background color or effects applied on a document is not visible in

 A) Web layout view

 B) Print Layout view

 C) Reading View

 D) Print Preview

13. What is a portion of a document in which you set certain page formatting options?

 A) Page

 B) Document

 C) Section

 D) Page Setup

14. Borders can be applied to

 A) Cells

 B) Paragraph

 C) Text

 D) All of above

15. Which of the following is not a type of page margin?

 A) Left

 B) Right

 C) Center

 D) Top

16. What is the default left margin in Word 2003 document?

 A) 1"

 B) 1.25"

 C) 1.5"

 D) 2"

17. What is gutter margin?

 A) Margin that is added to the left margin when printing

 B) Margin that is added to right margin when printing

 C) Margin that is added to the binding side of page when printing

 D) Margin that is added to the outside of the page when printing

18. Portrait and Landscape are

 A) Page Orientation

 B) Paper Size

 C) Page Layout

 D) All of above

19. If you need to change the typeface of a document, which menu will you choose?

 A) Edit

 B) View

 C) Format

 D) Tools

20. Which of the following is not a font style?

 A) Bold

 B) Italics

 C) Regular

 D) Superscript

Continue Reading | comments

Data Structure quiz for entrance exam

Data Structure quiz for entrance exam

1.    Which data structure allows deleting data elements from front and inserting at rear?

b. Queues

---

2.    Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

a. Input-restricted deque

---

3.    Which of the following data structure is non-linear type?

d. None of above

---

4.    Which of the following data structure is linear type?

d. All of above

---

5.    To represent hierarchical relationship between elements, which data structure is suitable?

c.   Tree

---

6.    A binary tree whose every node has either zero or two children is called

c. Extended binary tree

---

7.    The depth of a complete binary tree is given by

d. D_n =  log₂n + 1

---

8.    When representing any algebraic expression E which uses only binary operations in a 2-tree,

a. the variable in E will appear as external nodes and operations in internal nodes

---

9.    A binary tree can easily be converted into q 2-tree

d. by replacing each empty sub tree by a new external node

---

10.  When converting binary tree into extended binary tree, all the original nodes in binary tree are

a. internal nodes on extended tree

---

11. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal

c.   ABDECF

---

12.  Which of the following sorting algorithm is of divide-and-conquer type?

c.   Quick sort

---

13.  An algorithm that calls itself directly or indirectly is known as

b. Recursion

---

14.  In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called

d. thread

---

15.  The in order traversal of tree will yield a sorted listing of elements of tree in

b. Binary search trees

---

16.  In a Heap tree

b. Values in a node is greater than every value in children of it

---

17.  In a graph if e=[u, v], Then u and v are called

d. all of above

---

18.  A connected graph T without any cycles is called

d. All of above

---

19.  In a graph if e=(u, v) means

d. both b and c

---

20. If every node u in G is adjacent to every other node v in G, A graph is said to be

b. complete

Continue Reading | comments

General Knowledge quiz for entrance exam

General Knowledge quiz for entrance exam

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(n²)

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

Continue Reading | comments

Computer Knowledge quiz for competitive exam

Computer Knowledge quiz for competitive exam

1. The difference between linear array and a record is

d. All of above
 

---

2. Which of the following statement is false?

c. pointers store the next data element of a list
 

---

3. Binary search algorithm can not be applied to

a. sorted linked list
 

---

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

b. overflow
 

---

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

a. underflow
 

---

6. Which of the following is two way list?

d. none of above
 

---

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

a. FIFO lists
 

---

8. The term "push" and "pop" is related to the

c. stacks
 

---

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

d. Deque
 

---

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

b. FAEKCDHGB

Continue Reading | comments