LECTURER COMPUTER SCIENCE MCQS PAPER 2011

Q.1. Select the best option/answer and fill in the appropriate box on the Answer Sheet. (20)

(i) AX register is also known as:

(a) Accumulator
(b) Collector
(c) Distributor
(d) Counter
(e) None of these

(ii) In the Base + Offset addressing, Offset address is also known as:
(a) Physical Address
(b) Logical Address
(c) Actual Address
(d) Instruction Address
(e) None of these

(iii) The technique for allowing a unit to check the status of another independently function unit is known
as?
(a) Interrupt
(b) System call
(c) Polling
(d) Trape
(e) None of these

(iv) The method for storing data temporarily such that the input-output of the same job is overlapped with
its own processing, is known as:
(a) Spooling
(b) Contention
(c) I/O wait
(d) Buffering
(e) None of these

(v) The DMA that uses Busses when CPU is not using them is termed as:
(a) Shared DMA
(b) Cycle Stealing
(c) Channel
(d) Transparent DMA
(e) None of these

(vi) _________ Scheduler deals with the decision as to whether to admit another new job to the system.
(a) High Level
(b) Medium Level
(c) Low Level
(d) Short term
(e) None of these

(vii) When the process is in the states of Blocked Suspended or Ready Suspended, its relevant data is
stored in:
(a) Main Memory
(b) Hard Disk
(c) Magnetic Tape
(d) Buffer
(e) None of these

(viii) Priority, P = (Time Waiting + Run Time) / Run Time is used to calculate priority in __________
scheduling algorithm:
(a) Shortest Job First
(b) Priority Scheduling
(c) Longest Wait First
(d) Highest Response Ratio Next
(e) None of these

(ix) HDLC Protocol stands for:

(a) High-Level Data Link Control
(b) High Level Development Protocol
(c) Huge Level Data Link Control
(d) High Development Level Control
(e) None of these

(x) _________ is the generic name for a set of standards issued by the International
CommunicationsStandards Body CCITT, designed to support Message Handling Systems; i.e. Electronic
Mail.
(a) TCP/IP
(b) ISDN
(c) X.400
(d) X.25
(e) None of these

(xi) ________ layer is responsible for the transfer of a packet of data along one link in the network. It
organizes data into frames and detects errors in transmission.
(a) Physical Layer
(b) Data Link Layer
(c) Network Layer
(d) Transport Layer
(e) None of these

(xii) Encryption is the conversion of data in some intelligible format into an unintelligible format called
_________ to prevent the data from being understood if read by an unauthorized party.
(a) Clear Text
(b) Encrypted Text
(c) Cipher Text
(d) Coded Text
(e) None of these

(xiii) Binary search requires about ______ comparisons with an initial list of 1,000,000 elements.
(a) 10
(b) 20
(c) 35
(d) 100
(e) None of these

(xiv) A _________ header list is a header list where the last node contains the null pointer.
(a) Grounded
(b) Circular
(c) One way
(d) Rooted
(e) None of these
(xv) ________ are small applications that are accessed on an internet server, transported over the
internet, automatically installed and run as part of a web document.
(a) Applets
(b) Java Bean
(c) Sockets
(d) Java Component
(e) None of these

(xvi) AWT stands for:

(a) Abstract Window Technique
(b) Abstract Window Toolkit
(c) Actual Window Technique
(d) Added Window Toolkit
(e) None of these

(xvii) GIF images can have only upto _______ colors.

(a) 128
(b) 256
(c) 512
(d) 1024
(e) None of these

(xviii) ________ is stored on a client and contains state information of the website visited.
(a) Cookies
(b) Servelet
(c) History
(d) Resident Page
(e) None of these

(xix) In software Engineering KPA denotes.

(a) Key Process Audit
(b) Key Process Area
(c) Key Process Analysis
(d) Key Problem Area
(e) None of these

(xx) The ________ Process Model defines a series of events that will trigger transitions from state to state
for each of software engineering activities.
(a) Spiral
(b) Operational
(c) RAD
(d) Concurrent Development
(e) None of these

)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))

NETWORK MCQS ENTRY TEST PCS/CSS

OSI network architecture, the dialogue control and token management are responsibility of

a. session layer
b. network layer
c. transport layer
d. data link layer
e. none of above

Question 2:

In OSI network architecture, the routing is performed by

a. network layer
b. data link layer
c. transport layerd.
D session layere.
E none of above

Question 3:

Which of the following performs modulation and demodulation?

a. fiber optics
b. satellite
c. coaxial cable
d. modeme.
none of the above

Question 4:

The process of converting analog signals into digital signals so they can be processed by a receiving
computer is referred to as:
a. modulation
b. demodulation
c. synchronizing
d. digitizing

Question 5:

How many OSI layers are covered in the X.25 standard?

a. Two
b. Three
c. Seven
d. Sixe.
None of above

Question 6:

Layer one of the OSI model is

a. physical layer
b. link layer
c. transport layer
d. network layer
e. none of above

Question 7:

The x.25 standard specifies a

a. technique for start-stop data

b. technique for dial access
c. DTE/DCE interface
d. data bit ratee. none of above

Question 8:

Which of the following communication modes support two-way traffic but in only one direction at a time?
a. simplex
b. half duplex
c. three-quarters duplex
d. all of the abovee.
none of the above

Question 9:

Which of the following might be used by a company to satisfy its growing communications needs?
a. front end processor
b. multiplexer
c. controllerd. concentrator
e. all of the above

Question 10:

What is the number of separate protocol layers at the serial interface gateway specified by the X.25
standard?
a. 4
b. 2
c. 6
d. 33
. none of the above

)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))

Database Management System and Design MCQ Set 4

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

))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))

DATA STRUCTURE AND ALGORITHM MCQ'S FOR PCS

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
))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))