Académique Documents
Professionnel Documents
Culture Documents
In OSI network architecture, the dialogue control and token management are
responsibility of
a. session layer
b. network layer
c. transport layer
e. none of above
Question 2:
a. network layer
c. transport layer
d. session layer
e. none of above
Question 3:
a. fiber optics
b. satellite
c. coaxial cable
d. modem
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. digitising
Question 5:
a. Two
b. Three
c. Seven
d. Six
e. None of above
Question 6:
a. physical layer
b. link layer
c. transport layer
d. network layer
e. none of above
Question 7:
c. DTE/DCE interface
e. 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
Question 9:
b. multiplexer
c. controller
d. 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. 3
Correct Answers:
1. a
2. a
3. d
4. d
5. b
6. a
7. c
8. b
9. e
10. d
Question 1:
The interactive transmission of data within a time sharing system may be best suited to
a. simplex lines
b. half-duplex lines
d. biflex-lines
Question 2:
b. Half duplex line is a communication line in which data can move in two directions, but
not at the same time.
Question 3:
a. coaxial cable
c. microwave circuits
d. all of above
Question 4:
a. telephone lines
b. coaxial cables
c. modem
d. microwave systems
Question 5:
Which of the following does not allow multiple uses or devices to share one
communication line?
a. doubleplexer
b. multiplexer
c. concentrator
d. controller
Question 6:
a. VDR
b. RTS
c. CTS
d. DSR
Question 7:
a. Multiplexers are designed to accept data from several I/O devices and transmit a
unified stream of data on one communication line
Question 8:
d. all of above
Question 9:
a. communications software
b. protocol
c. communication hardware
Question 10:
a. Bipolar
b. NRZ
c. Manchester
d. Binary
Answers:Bottom of Form
1. b
2. d
3. d
4. c
5. a
6. a
7. d
8. d
9. d
10. a
Question 1:
Which data communication method is used to transmit the data over a serial
communication link?
a. simplex
b. half-duplex
c. full-duplex
d. b and c
e. None of above
Question 2:
What is the minimum number of wires needed to send data over a serial communication
link layer?
a. 1
b. 2
c. 4
d. 6
e. none of above
Question 3:
Question 4:
a. simplex lines
b. wideband channel
c. narrowband channel
d. dialed service
Question 5:
A communications device that combines transmissions from several I/O devices into one
line is a
a. concentrator
b. modifier
c. multiplexer
d. full-duplex line
Question 6:
How much power (roughly) a light emitting diode can couple into an optical fiber?
a. 100 microwatts
b. 440 microwatts
c. 100 picowatts
d. 10 miliwatts
Question 7:
The synchronous modems are more costly than the asynchronous modems because
e. none of above
Question 8:
Question 9:
a. equilizer
b. modulator
c. demodulator
d. terminal
e. none of aobve
Question 10:
b. simplex lines
Answers
1. c
2. b
3. c
4. c
5. c
6. a
7. b
8. c
9. a
10. c
Question:1
a. telegraphp line
b. simplex lines
d. all of above
Question 2:
a. a byte
b. a bit
c. 100 bits
d. none of above
Question 3:
The loss in signal power as light travels down the fiber is called
a. attenuation
b. progragation
c. scattering
d. interruption
Question 4:
a. 100 photons
b. 200 photons
c. 2000 photons
d. 300 photons
Question 5:
Communiction circuits that transmit data in both directions but not at the same time are
operating in
a. a simplex mode
d. an asynchronous mode
Question 6:
An example of a medium speed, switched communications service is
a. series 1000
b. data phone 50
c. DDD
Question 7:
a. detector
b. modulator
c. stations
d. transponders
Question 8:
While transmitting odd-parity coded symbols, the number of zeros in each symbol is
a. odd
b. even
c. a and b both
d. unknown
Question 9:
a. ENVIRON/1
b. TOTAL
c. BPL
d. Telnet
Question 10:
a. laser beam
b. microwave
Answers
Top of Form
Search
Bottom of Form
1. b
2. d
3. a
4. b
5. b
6. c
7. d
8. d
9. a
10. d
Question:1
Number of bits per symbol used in Baudot code is
a. 7
b. 5
c. 8
d. 9
Question 2:
What is the main difference between DDCMP and SDLC?
a. DDCMP does not need special hardware to final the beginning of a message
b. DDCMP has a message header
c. SDLC has a IP address
d. SDLC does not use CRC
Question 3:
An example of digital, rather than analog, communication is
a. DDD
b. DDS
c. WATS
d. DDT
Question 4:
Terminals are required for
a. real-time, batch processing & time-sharing
b. real time, time-sharing & distributed message processing
c. real time, distributed processing & manager inquiry
d. real-time, time sharing & message switching
Question 5:
The receive equilizer reduces delay distortions using a
a. tapped delay lines
b. gearshift
c. descrambler
d. difference engine
Question 6:
Ina synchronous modem, the receive equilizer is known as
a. adaptive equilizer
b. imparimentequilizer
c. statistical equilizer
d. compromise equilizer
Question 7:
The channel in the data communication model can be
a. postal mail services
b. telephone lines
c. radio lines
d. any of the above
Question 8:
A data terminal serves as an
a. Effector
b. sensor
c. both a and b
d. neither a nor b
Question 9:
Which of the following transmission systems provide the highest data rate to in individual device?
a. computer bus
b. telephone lines
c. voice and mode
d. lease lines
Question 10:
A protocol is a set of rules governing a time sequence of events that must take place
a. between peers
b. between an interface
c. between modems
d. across an interface
Answers
Top of Form
Search
Bottom of Form
1. b
2. a
3. b
4. d
5. a
6. a
7. d
8. c
9. a
10. a
Set - 1
a. Best case
b. Worst case
c. Average case
d. Null case
a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)
a. O(n)
b. O(log )
c. O(n2)
d. O(n log n)
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
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
19. Each array declaration need not give, implicitly or explicitly, the information about
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
d. Null case
a. O(n)
b. O(log n)
10. The complexity of Bubble sort algorithm is
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
c. side effect
13. Which of the following data structure is not linear data structure?
d. None of above
c. Arrays
d. Traversal
16. Finding the location of the element with a given value is:
b. Search
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
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
Set - 2
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. 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. tables arrays
b. matrix arrays
c. both of above
d. none of above
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
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
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
a. underflow
b. overflow
c. housefull
d. saturated
16. Which of the following is two way list?
a. FIFO lists
b. LIFO list
c. Piles
d. Push-down lists
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
Answers
d. base address
2. The memory address of fifth element of an array can be calculated by the formula
a. linear arrays
4. Which of the following is not the required condition for binary search algorithm?
c. both of above
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
d. All of above
12. Which of the following statement is false?
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
a. underflow
d. none of above
a. FIFO lists
c. stacks
19. A data structure where elements can be added or removed at either end but not in
the middle
d. Deque
b. FAEKCDHGB
Set - 3
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
a. Strings
b. Lists
c. Stacks
d. None of above
a. Strings
b. Lists
c. Queues
d. All of above
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
d. None of above
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
10. When converting binary tree into extended binary tree, all the original nodes in
binary tree are
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
a. Bubble sort
b. Insertion sort
c. Quick sort
d. All of above
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
d. None of above
a. Values in a node is greater than every value in left sub tree and smaller than right
sub tree
a. endpoints of e
b. adjacent nodes
c. neighbors
d. all of above
a. a tree graph
b. free tree
c. a tree
d. All of above
d. both b and c
a. isolated
b. complete
c. finite
d. strongly connected
Answers:
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
d. None of above
4. Which of the following data structure is linear type?
d. All of above
c. Tree
6. A binary tree whose every node has either zero or two children is called
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
10. When converting binary tree into extended binary tree, all the original nodes in
binary tree are
11. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
c. ABDECF
c. Quick sort
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
d. all of above
d. All of above
b. complete