Set1

he 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

ans
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

set3
1. Which data structure allows deleting data elements from front and inserting at rear? a. Stacks b. Queues

c. Deques d. Binary search tree 2. Identify the data structure which allows deletions at both ends of the list but insertion at only one end. a. Input-restricted deque b. Output-restricted deque c. Priority queues d. None of above 3. Which of the following data structure is non-linear type? a. Strings b. Lists c. Stacks d. None of above 4. Which of the following data structure is linear type? a. Strings b. Lists c. Queues d. All of above 5. To represent hierarchical relationship between elements, which data structure is suitable? a. Deque b. Priority c. Tree d. All of above 6. A binary tree whose every node has either zero or two children is called a. Complete binary tree b. Binary search tree c. Extended binary tree d. None of above 7. The depth of a complete binary tree is given by a. Dn = n log2n b. Dn = n log2n+1 c. Dn = log2n d. Dn = log2n+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 b. the operations in E will appear as external nodes and variables in internal nodes c. the variables and operations in E will appear only in internal nodes d. the variables and operations in E will appear only in external nodes

9. A binary tree can easily be converted into q 2-tree a. by replacing each empty sub tree by a new internal node b. by inserting an internal nodes for non-empty node c. by inserting an external nodes for non-empty node 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 b. external nodes on extended tree c. vanished on extended tree d. None of above 11. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal a. ABFCDE b. ADBFEC c. ABDECF d. ABDCEF 12. Which of the following sorting algorithm is of divide-and-conquer type? a. Bubble sort b. Insertion sort c. Quick sort d. All of above 13. An algorithm that calls itself directly or indirectly is known as a. Sub algorithm b. Recursion c. Polish notation d. Traversal algorithm 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 a. Leaf b. branch c. path d. thread 15. The in order traversal of tree will yield a sorted listing of elements of tree in a. Binary trees b. Binary search trees c. Heaps d. None of above 16. In a Heap tree a. Values in a node is greater than every value in left sub tree and smaller than right sub tree

b. Values in a node is greater than every value in children of it c. Both of above conditions applies d. None of above conditions applies 17. In a graph if e=[u, v], Then u and v are called a. endpoints of e b. adjacent nodes c. neighbors d. all of above 18. A connected graph T without any cycles is called a. a tree graph b. free tree c. a tree d. All of above 19. In a graph if e=(u, v) means a. u is adjacent to v but v is not adjacent to u b. e begins at u and ends at v c. u is processor and v is successor 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 a. isolated b. complete c. finite d. strongly connected

ans
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. Dn = log2n + 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

set1
. 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

ans
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

Microsoft Word Practice Quiz Set 01

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

Answers 1-B, 2-D, 3-A, 4-D, 5-A, 6-C, 7-D, 8-B, 9-A, 10-A, 11-B, 12-D, 13-C, 14-D, 15-C, 16-B, 17-C, 18-A, 19-C, 20-D,

Microsoft Word Practice Quiz Set 02

1. Pressing F8 key for three times selects A) A word B) A sentence C) A paragraph D) Entire document

2. What happens if you press Ctrl + Shift + F8?

A) It activates extended selection B) It activates the rectangular selection C) It selects the paragraph on which the insertion line is. D) None of above

3. How can you disable extended selection mode? A) Press F8 again to disable B) Press Del to disable C) Press Esc to disable D) Press Enter to disable

4. What does EXT indicator on status bar of MS Word indicate? A) It indicates whether the external text is pasted on document or not B) It indicates whether extended add-ons are installed on MS Word or not C) It indicates whether Extended Selection mode is turned on or off D) None of above

5. What is the maximum number of lines you can set for a drop cap? A) 3 B) 10 C) 15 D) 20

6. What is the default number of lines to drop for drop cap? A) 3 B) 10 C) 15 D) 20

7. What is the shortcut key you can press to create a copyright symbol? A) Alt+Ctrl+C B) Alt + C C) Ctrl + C D) Ctrl + Shift + C

8. How many columns can you insert in a word document in maximum? A) 35 B) 45 C) 55 D) 65

9. What is the smallest and largest font size available in Font Size tool on formatting toolbar? A) 8 and 72 B) 8 and 64 C) 12 and 72 D) None of above

10. What is the maximum font size you can apply for any character? A) 163 B) 1638 C) 16038 D) None of above

11. Which of the following is graphics solution for Word Processors? A) Clipart B) WordArt C) Drop Cap D) All of above

12. The keystrokes Ctrl + I is used to A) Increase font size B) Inserts a line break C) Indicate the text should be bold D) Applies italic format to selected text

13. A character that is raised and smaller above the baseline is known as A) Outlined B) Raised C) Superscript

D) Subscript

14. What is the purpose of inserting header and footer in document? A) To enhance the overall appearance of the document B) To mark the starting and ending of page C) To make large document more readable D) To allow page headers and footers appear on document when printed

15. Which of the following function key activates the speller? A) F5 B) F7 C) F9 D) Shift + F7

16. The minimum number of rows and columns in MS Word document is A) 1 and 1 B) 2 and 1 C) 2 and 2 D) None of above

17. Thesaurus tool in MS Word is used for A) Spelling suggestions B) Grammar options C) Synonyms and Antonyms words D) All of above

18. Why Drop Caps are used in document? A) To drop all the capital letters B) To automatically begin each paragraph with capital letter C) To begin a paragraph with a large dropped initial capital letter D) None of above

19. A bookmark is an item or location in document that you identify as a name for future reference. Which of the following task is accomplished by using bookmarks?

A) To add anchors in web page B) To mark the ending of a paragraph of document C) To quickly jump to specific location in document D) To add hyperlinks in webpage

20. A word processor would most likely be used to do A) Keep an account of money spent B) Do a computer search in media center C) Maintain an inventory D) Type a biography

Answers 1-B, 2-B, 3-C, 4-C, 5-B, 6-A, 7-A, 8-B, 9-A, 10-B, 11-A, 12-D, 13-C, 14-D, 15-B, 16-A, 17-C, 18-C, 19-C, 20-D,

OS
1) Round robin scheduling is essentially the preemptive version of ________. 1 FIFO 2 Shortest job first 3 Shortes remaining 4 Longest time first Right Ans ) 1 2) A page fault occurs 1 when the page is not in the memory 2 when the page is in the memory 3 when the process enters the blocked state 4 when the process is in the ready state Right Ans ) 1 3) Which of the following will determine your choice of systems software for your computer ? 1 Is the applications software you want to use compatible with it ? 2 Is it expensive ?

3 Is it compatible with your hardware ? 4 Both 1 and 3 Right Ans ) 4 4) Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S); respectively. The above situation depicts a _________ . 1 Semaphore 2 Deadlock 3 Signal 4 Interrupt Right Ans ) 2 5) What is a shell ? 1 It is a hardware component 2 It is a command interpreter 3 It is a part in compiler 4 It is a tool in CPU scheduling Right Ans ) 2 6) Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of loading is called _________ 1 Static loading 2 Dynamic loading 3 Dynamic linking 4 Overlays Right Ans ) 3 7) In the blocked state 1 the processes waiting for I/O are found 2 the process which is running is found 3 the processes waiting for the processor are found 4 none of the above Right Ans ) 1 8) What is the memory from 1K - 640K called ? 1 Extended Memory 2 Normal Memory 3 Low Memory 4 Conventional Memory Right Ans ) 4

9) Virtual memory is __________. 1 An extremely large main memory 2 An extremely large secondary memory 3 An illusion of extremely large main memory 4 A type of memory used in super computers. Right Ans ) 3 10) The process related to process control, file management, device management, information about system and communication that is requested by any higher level language can be performed by __________. 1 Editors 2 Compilers 3 System Call 4 Caching Right Ans ) 3 11) If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98,37,14,124,65,67. 1 310 2 324 3 315 4 321 Right Ans ) 4 12) Multiprogramming systems ________. 1 Are easier to develop than single programming systems 2 Execute each job faster 3 Execute more jobs in the same time 4 Are used only on large main frame computers Right Ans ) 3 13) Which is not the state of the process ? 1 Blocked 2 Running 3 Ready 4 Privileged Right Ans ) 4 14) The solution to Critical Section Problem is : Mutual Exclusion, Progress and Bounded Waiting. 1 The statement is false

2 The statement is true. 3 The statement is contradictory. 4 None of the above Right Ans ) 2 15) The problem of thrashing is effected scientifically by ________. 1 Program structure 2 Program size 3 Primary storage size 4 None of the above Right Ans ) 1 16) The state of a process after it encounters an I/O instruction is __________. 1 Ready 2 Blocked/Waiting 3 Idle 4 Running Right Ans ) 2 17) The number of processes completed per unit time is known as __________. 1 Output 2 Throughput 3 Efficiency 4 Capacity Right Ans ) 2 18) _________ is the situation in which a process is waiting on another process,which is also waiting on another process ... which is waiting on the first process. None of the processes involved in this circular wait are making progress. 1 Deadlock 2 Starvation 3 Dormant 4 None of the above Right Ans ) 1 19) Which of the following file name extension suggests that the file is Backup copy of another file ? 1 TXT 2 COM 3 BAS 4 BAK Right Ans ) 4

20) Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy? 1 Time-sharing 2 SPOOLing 3 Preemptive scheduling 4 Multiprogramming Right Ans ) 4 21) A critical region 1 is a piece of code which only one process executes at a time 2 is a region prone to deadlock 3 is a piece of code which only a finite number of processes execute 4 is found only in Windows NT operation system Right Ans ) 1 22) The mechanism that bring a page into memory only when it is needed is called _____________ 1 Segmentation 2 Fragmentation 3 Demand Paging 4 Page Replacement Right Ans ) 3 23) PCB = 1 Program Control Block 2 Process Control Block 3 Process Communication Block 4 None of the above Right Ans ) 2 24) FIFO scheduling is ________. 1 Preemptive Scheduling 2 Non Preemptive Scheduling 3 Deadline Scheduling 4 Fair share scheduling Right Ans ) 2 25) Switching the CPU to another Process requires to save state of the old process and loading new process state is called as __________. 1 Process Blocking 2 Context Switch

3 Time Sharing 4 None of the above Right Ans ) 2 26) Which directory implementation is used in most Operating System? 1 Single level directory structure 2 Two level directory structure 3 Tree directory structure 4 Acyclic directory structure Right Ans ) 3 27) The Bankers algorithm is used 1 to prevent deadlock in operating systems 2 to detect deadlock in operating systems 3 to rectify a deadlocked state 4 none of the above Right Ans ) 1 28) A thread 1 is a lightweight process where the context switching is low 2 is a lightweight process where the context swithching is high 3 is used to speed up paging 4 none of the above Right Ans ) 1 29) ______ is a high level abstraction over Semaphore. 1 Shared memory 2 Message passing 3 Monitor 4 Mutual exclusion Right Ans ) 3 30) A tree sturctured file directory system 1 allows easy storage and retrieval of file names 2 is a much debated unecessary feature 3 is not essential when we have millions of files 4 none of the above Right Ans ) 1

Dbms

Database Management System and Design MCQ Set 4

Questions Questions 1:
The relational database environment has all of the following components except a. users b. separate files c. database d. query languages e. database

Question 2:
Database management systems are intended to a. eliminate data redundancy b. establish relationship among records in different files c. manage file access d. maintain data integrity e. all of the above

Question 3:
One approach to standardization storing of data? a. MIS b. structured programming c. CODASYL specification d. none of the above

Question 4:
The language used application programs to request data from the DBMS is referred to as the a. DML b. DDL

c. query language d. any of the above e. none of the above

Question 5:
The highest level in the hierarchy of data organization is called a. data bank b. data base c. data file d. data record

Question 6:
Choose the RDBMS which supports full fledged client server application development a. dBase V b. Oracle 7.1 c. FoxPro 2.1 d. Ingress

Question 7:
Report generators are used to a. store data input by a user b. retrieve information from files c. answer queries d. both b and c

Question 8:
A form defined a. where data is placed on the screen b. the width of each field c. both a and b d. none of the above

Question 9:
A top-to-bottom relationship among the items in a database is established by a a. hierarchical schema b. network schema c. relational schema d. all of the above

Question 10:
The management information system (MIS) structure with one main computer system is called a a. hierarchical MIS structure b. distributed MIS structure c. centralized MIS structure d. decentralized MIS structure

Answers:
1.b 2.e 3.c 4.a 5.b 6. b 7.d 8.a 9.a 10.c

Database Management System and Design MCQ Set 3

Questions Questions 1:
Which of the following is not true of the traditional approach to information processing a. there is common sharing of data among the various applications b. it is file oriented c. programs are dependent on the file d. it is inflexible e. all of the above are true

Question 2:
Which of the following hardware component is the most important to the operation of database management system? a. high resolution video display b. printer

c. high speed, large capacity disk d. plotter e. mouse

Question 3:
Generalized database management system do not retrieve data to meet routine request a. true b. false

Question 4:
Batch processing is appropriate if a. large computer system is available b. only a small computer system is avilbale c. only a few transactions are involved d. all of the above e. none of the above

Question 5:
Large collection of files are called a. fields b. records c. database d. sectors

Question 6:
Which of the following is not a relational database? a. dBase IV b. 4th Dimension c. FoxPro d. Reflex

Question 7:
In order to use a record management system

a. you need to understand the low level details of how information is stored b. you need to understand the model the record management system uses c. bother a and b d. none of the above

Question 8:
Sort/Report generators a. are faster than index/report generators b. require more disk space than indexed/report generators c. do not need to sort before generating report d. both a and b

Question 9:
If a piece of data is stored in two places in the database, then a. storage space is wasted b. changing the data in one spot will cause data inconsistency c. in can be more easily accessed d. both and b

Question 10:
An audit trail a. is used to make backup copies b. is the recorded history of operations performed on a file c. can be used to restore lost information d. none of the aobve

Answers:
1.a 2.c 3. b 4.e 5.c 6.d 7.b 8.b 9.d 10.b

Database Management System and Design MCQ Set 2

Questions Questions 1:
Which of the following fields in a student file can be used as a primary key? a. class b. Social Security Number c. GPA d. Major

Question 2:
Which of the following is not an advantage of the database approach a. Elimination of data redundancy b. Ability of associate deleted data c. increased security d. program/data independence e. all of the above

Question 3:
Which of the following contains a complete record of all activity that affected the contents of a database during a certain period of time? a. report writer b. query language c. data manipulation language d. transaction log e. none of the above

Question 4:
In the DBMS approach, application programs perform the a. storage function b. processing functions c. access control d. all of the above e. none of the above

Question 5:
A set of programs that handle a firm's database responsibilities is called a. database management system (DBMS) b. database processing system (DBPS) c. data management system (DMS) d. all of above

Question 6:
Which is the make given to the database management system which is able to handle full text data, image data, audio and video? a. full media b. graphics media c. multimedia d. hypertext

Question 7:
A record management system a. can handle many files of information at a time b. can be used to extract information stored in a computer file c. always uses a list as its model d. both a and b

Question 8:
A command that lets you change one or more fields in a record is a. insert b. modify c. lookup d. none of above

Question 9:
A transparent DBMS a. can not hide sensitive information from users b. keeps its logical structure hidden from users

c. keeps its physical structure hidden from users d. both b and c

Question 10:
A file produced by a spreadsheet a. is generally stored on disk in an ASCII text fromat b. can be used as is by the DBMS c. both a and b d. none of the above

Answers:
1.b 2.e 3.d 4.b 5.d 6.c 7.b 8.b 9.c 10.a

Database Management System and Design MCQ Set 1

Questions Questions 1:

The ascending order of a data hirerchy is: a. bit-byte-record-field-file-database b. byte-bit-field-record-file-database c. bit-byte-field-record-file-database d. bit-byte-file-record-field-database

Question 2:

Which of the following is true of a network structure? a. t is a physical representation of the data b. It allows a many-to-many relationship c. It is conceptually simple d. It will be dominant data base of the future

Question 3:

Which of the following is a problem of file management system? a. difficult to update b. lack of data independence c. data redundancy d. program dependence e. all of above

Question 4:

One data dictionery software package is called a. DB/DC dictionary b. TOTAL c. ACCESS d. Datapac e. Data Manager

Question 5:

The function of a database is ... a. to check all input data b. to check all spelling c. to collect and organize input data d. to output data

Question 6:

What is the language used by most of the DBMSs for helping their users to access data? a. High level language b. SQL c. Query Language d. 4GL

Question 7:

The model for a record management system might be a. handwritten list b. a Rolodex card file c. a business form d. all of above

Question 8:

Primitive operations common to all record management system include a. print b. sort c. look-up d. all of above

Question 9:

In a large DBMS a. each user can "see" only a small part of the entire database b. each subschema contains every field in the logical schema c. each user can access every subschema

Question 10:

Information can be transferred between the DBMS and a a. spreadsheet program b. word processor program c. graphics program d. all of the above
Answers:

1. c 2. b

3. e

4. a

5. c 6. c

7. d

8. c

9. a

10. d

Database Management System and Design MCQ Set 4

Questions Questions 1:
The relational database environment has all of the following components except a. users b. separate files c. database d. query languages e. database

Question 2:
Database management systems are intended to a. eliminate data redundancy b. establish relationship among records in different files c. manage file access d. maintain data integrity e. all of the above

Question 3:
One approach to standardization storing of data? a. MIS b. structured programming c. CODASYL specification d. none of the above

Question 4:
The language used application programs to request data from the DBMS is referred to as the a. DML b. DDL c. query language d. any of the above e. none of the above

Question 5:
The highest level in the hierarchy of data organization is called a. data bank b. data base c. data file d. data record

Question 6:
Choose the RDBMS which supports full fledged client server application development

a. dBase V b. Oracle 7.1 c. FoxPro 2.1 d. Ingress

Question 7:
Report generators are used to a. store data input by a user b. retrieve information from files c. answer queries d. both b and c

Question 8:
A form defined a. where data is placed on the screen b. the width of each field c. both a and b d. none of the above

Question 9:
A top-to-bottom relationship among the items in a database is established by a a. hierarchical schema b. network schema c. relational schema d. all of the above

Question 10:
The management information system (MIS) structure with one main computer system is called a a. hierarchical MIS structure b. distributed MIS structure c. centralized MIS structure d. decentralized MIS structure

Answers:
1.b 2.e 3.c 4.a 5.b 6. b 7.d 8.a 9.a 10.c