A. MAC address.
B. Node address.
C. NIU address.
D. Network address.
The NIC manufacturer assigns a unique physical address to each NIC card. This physical address is known as MAC address.
A. NIU.
B. Nodes.
C. circuit switching.
D. packet switching.
The NIU (Network Interface Unit) is a device that is attached to each of the workstations and server. It facilitates and manages a connection between two different physical medium in order to create a network connection.
A. TCP/IP.
B. UDP.
C. HTTP.
D. FTTP.
Communication protocol used by internet is known as TCP/IP. The TCP part is responsible for dividing the file into packets on the source computer. The IP part is responsible for handling the address of destination computer.
A. ARPANET.
B. NSFnet.
C. Protocols.
D. Gateway.
In internet, many smaller networks are connected and allow all the computers to exchange information with each other. This is possible through rules set for communication, called protocols.
A. Advanced Resource Planning Agency Network.
B. Advanced Research Project Agency Network.
C. Advanced Research Planning Agency Network.
D. Actual Resource Planning Agency Network.
ARPANET stands for Advanced Research Project Agency Network. The goal of this project was to connect computers at different universities and U.S. defense.
A. backbone.
B. internet.
C. LAN.
D. gateway.
In internet, most computers are connected to smaller networks, which in turn are connected through gateways to the internet backbone.
A. long cable length.
B. complexity.
C. centralization.
D. fault diagnosis problem.
Although the bus topology is very simple, but in this topology fault detection is very difficult.
A. affected by noise distortion.
B. costly.
C. not good in quality.
D. harmful to use.
The main disadvantage of the optical fiber cable is that it is very costly.Even though the raw materials for optical fibers are cheap and abundant, but still it is more expensive per metre than copper.
A. Wide Area Network.
B. World Action Number.
C. Wide Action Normalization
D. World Area Network.
Wide Area Network (WAN) is a computer network that covers a broad area (i.e., any network whose communication links cross metropolitan, regional, or national boundaries).
A. Gopher.
B. MOSAIC.
C. Archie.
D. Telnet.
Archie is a tool for indexing FTP archives, allowing people to find specific files. It is considered to be the first Internet search engine.
A. Network Folder Specification.
B. Notification Fact System.
C. Network File System.
D. Network and Firewall System.
NFS (Network File System) allows computers to share files across a network.
A. public and private.
B. bounded and unbounded.
C. dedicated and non-dedicated.
D. enabled and locked.
A server may be dedicated or non-dedicated. Dedicated servers are used only as a server, not as a workstation. Non-dedicated servers are used both as a server and a workstation.
A. Wide Area Information Server.
B. World Area Info-system.
C. World of Automated Server.
D. Wide Automatic System.
WAIS (Wide Area Information Servers) is an Internet system in which specialized subject databases are created at multiple server locations, keeps track by a directory of servers at one location, and make accessible for searching by users with WAIS client programs.
A Karnaugh Map is a graphical way of minimizing a boolean expression(Maxterms or Minterms).
Circuits using NAND and NOR are popular as they are easier to design and therefore cheaper. Functions of other gates can easily be implemented using NAND and NOR gates. For this reason they are called universal gates.
According to the Principle of Duality, the dual of any statement in Boolean algebra is obtained by interchanging '+' and '.' and simultaneously inter-changing 0 and 1 in the statement. In this way, starting with a boolean expression, we get another boolean expression.
For example:
(i) The dual of the statement
(x . 1 )(0 + x') = 0 is (x + 0)(1 . x') = 1
(ii) The dual of the statement
(x + y)(y + z) = x.z + y is x.y + y.z = (x + z).y
A Tautology is any logical statement that always results in True. Example, the statement – “Malaria is dangerous” is always true.
A Fallacy is a statement that always results in False. Example – “Toxic waste is easy to store” - is always false.
Logical operations involve the use of three operators – NOT, AND and OR. NOT simple negates a value. It uses one operand. For Example - a) Not True (which means, False as True and False are the only possible values) b) Knowing English AND French (means someone who knows both English AND French) c) Knowing English OR French (means someone who knows either English or French).
Boolean Algebra is a branch of mathematics, somewhat similar to, but different from ordinary algebra. It is a system of symbols and operators that apply to logical problems. It is an algebra in which elements can take only one of two values 0 or 1 that represent false or true and are subject to operations based on AND, OR and NOT.
The XNOR Gate is logically equivalent to an invertor XOR Gate i.e. XOR gate followed up by a NOT Gate(inventor). The XNOR Gate Produces 1 (high) Output when the input combination has even number of one 1's.
In Boolean algebra, 0 and 1 (False and True) are the only values allowed. The meaning and application of logical addition (+), logical multiplication (.), is very different from addition and multiplication in ordinary algebra. Other operators like /, * are not used. The basic postulates on which boolean expressions are based are not applicable in ordinary algebra. There are certain laws (like Indempotence law and Absorption law) and theorems like, De Morgan’s theorems that apply to boolean algebra.
A Minterm is a product of all the literals (inputs) into the system. Each literal may be with or without the bar (i.e. complemented).
A Maxterm is a sum of all the literals (inputs) into the system. The literals may be with or without the bar (i.e. complemented).
|
A |
B |
C |
D |
F |
|
0 |
0 |
0 |
0 |
1 |
|
0 |
0 |
0 |
1 |
0 |
|
0 |
0 |
1 |
0 |
1 |
|
0 |
0 |
1 |
1 |
0 |
|
0 |
1 |
0 |
0 |
0 |
|
0 |
1 |
0 |
1 |
1 |
|
0 |
1 |
1 |
0 |
0 |
|
0 |
1 |
1 |
1 |
1 |
|
1 |
0 |
0 |
0 |
1 |
|
1 |
0 |
0 |
1 |
0 |
|
1 |
0 |
1 |
0 |
1 |
|
1 |
0 |
1 |
1 |
0 |
|
1 |
1 |
0 |
0 |
0 |
|
1 |
1 |
0 |
1 |
1 |
|
1 |
1 |
1 |
0 |
0 |
|
1 |
1 |
1 |
1 |
1 |
Output is given below :-
|
A |
B |
C |
D |
F |
Minterms |
Maxterms |
|
0 |
0 |
0 |
0 |
1 |
A’B’C’D’ |
|
|
0 |
0 |
0 |
1 |
0 |
|
A+B+C+D’ |
|
0 |
0 |
1 |
0 |
1 |
A’B’CD’ |
|
|
0 |
0 |
1 |
1 |
0 |
|
A+B+C’+D’ |
|
0 |
1 |
0 |
0 |
0 |
|
A+B’+C+D |
|
0 |
1 |
0 |
1 |
1 |
A’BC’D |
|
|
0 |
1 |
1 |
0 |
0 |
|
A+B’+C’+D |
|
0 |
1 |
1 |
1 |
1 |
A’BCD |
|
|
1 |
0 |
0 |
0 |
1 |
AB’C’D’ |
|
|
1 |
0 |
0 |
1 |
0 |
|
A’+B+C+D’ |
|
1 |
0 |
1 |
0 |
1 |
AB’CD’ |
|
|
1 |
0 |
1 |
1 |
0 |
|
A’+B+C’+D’ |
|
1 |
1 |
0 |
0 |
0 |
|
A’+B’+C+D |
|
1 |
1 |
0 |
1 |
1 |
ABC’D |
|
|
1 |
1 |
1 |
0 |
0 |
|
A’+B’+C’+D |
|
1 |
1 |
1 |
1 |
1 |
ABCD |
|
Canonical Sum_of_Products expression as sum of minterms
= A’B’C’D’ + A’B’CD’ + A’BC’D + A’BCD + AB’C’D’ + AB’CD’ + ABC’D + ABCD
Canonical Product_of_Sums expression as sum of maxterms
The truth table is as follows:
|
X |
Y |
X+Y |
X.(X+Y) |
|
0 |
0 |
0 |
0 |
|
0 |
1 |
1 |
0 |
|
1 |
0 |
1 |
1 |
|
1 |
1 |
1 |
1 |
The truth table shows the two columns X and X.(X+Y) to be identical.
A Boolean expression that is composed of only Minterms or Maxterms is said to be in Canonical form. Thus, we can have expressions in Canonical Sum_of _Products form or Canonical Product_of_Sums form.
Wherever a literal is missing in a term, multiply it with the (missing literal + its negated missing literal)
YZ + X’ Y = (X + X’)YZ + X’Y(Z + Z’)
= XYZ + X’YZ + X’YZ + X’YZ’
= XYZ + X’YZ + X’YZ’
Wherever a literal is missing in a term, add (missing literal . negated missing literal)
(A + C).(C + D) = (A + C + DD’).(AA’ + C + D)
= (A+C+D)(A+C+D’)(A+C+D)(A’+C+D) as (X+YZ)=(X+Y)(X+Z)
A binary decision is one that results in either a Yes or a No.
Consider the statements below –
a) Is Mumbai an important city of India?
b) Is the train on time?
c) Is the library open?
|
X |
Y |
Z |
F |
|
0 |
0 |
0 |
0 |
|
0 |
0 |
1 |
0 |
|
0 |
1 |
0 |
1 |
|
0 |
1 |
1 |
0 |
|
1 |
0 |
0 |
1 |
|
1 |
0 |
1 |
0 |
|
1 |
1 |
0 |
0 |
|
1 |
1 |
1 |
1 |
X’YZ’ + XY’Z’ + XYZ = F
a)Complement of X’Y + XY’ + X’Y’
= (X’Y + XY’ + X’Y’)’
= (X’Y)’ . (XY’)’ . (X’Y’)’ as (X+Y+Z)’ = X’.Y’.Z’
= (X’’ + Y’) . (X’+ Y’’) . (X’’ + Y’’) as (X.Y)’ = X’+Y’
= (X+Y’).(X’+Y).(X+Y)
b) Complement of (B+D’)(A+C’)
= ((B+D’)(A+C’) )’
= (B+D’)’ + (A+C’)’
= B’D’’ + A’C’’
= B’D + A’C
Steps are:–
a) Derive the simplified POS expression
b) Draw the circuit diagram using NOT, AND and OR gates
c) Replace NOT, AND and OR gates with NOR gates
NOR gates are suitable for expressions in POS form

Truth Table for 3 inputs, X, Y and Z is -![]()
|
X |
Y |
Z |
F |
|
0 |
0 |
0 |
0 |
|
0 |
0 |
1 |
0 |
|
0 |
1 |
0 |
0 |
|
0 |
1 |
1 |
1 |
|
1 |
0 |
0 |
0 |
|
1 |
0 |
1 |
1 |
|
1 |
1 |
0 |
1 |
|
1 |
1 |
1 |
0 |
F = m3 + m5 + m6

Marking the minterms in the Karnaugh map, we get the simplified SOP expression -
F = X’YZ + XY’Z + XYZ’
Logic gates are digital circuits constructed from diodes, transistors, and resistors that produce an output, from some given inputs.
NOT gates - They are also called Inverters. The NOT operation can be performed on a single input. For example, if the variable A is subjected to the NOT operation, the result x can be expressed as X = where represents the NOT operation.
The truth table of the NOT operation is as follows:
|
A |
X = |
|
0 |
1 |
|
1 |
0 |

AND gates - The AND gate uses 2 or more inputs to produce a single output. The resultant output 1 occurs only then all of the inputs are 1.
Truth Table for 2 input AND Gate
|
A |
B |
X = A . B |
|
0 |
0 |
0 |
|
0 |
1 |
0 |
|
1 |
0 |
0 |
|
1 |
1 |
1 |

The output A.B can be written as AB, without the ‘.’ symbol.
OR gates - The OR gate uses 2 or more inputs to produce a single output. The result produced is 1 when any of the inputs is 1. The result 0 is produced only when all the input variables are 0.
Truth Table for OR Gate
|
A |
B |
X = A + B |
|
0 |
0 |
0 |
|
0 |
1 |
1 |
|
1 |
0 |
1 |
|
1 |
1 |
1 |

A. it corresponds to a maxterm.
B. the value of the variable in it is 1.
C. that square corresponds to a minterm.
D. it is a logical variable.
Minterm is a product of all the literals(with or without the bar) within the logic system.
A. Product of 2 integers is always negative
B. Leaders are born not made.
C. The sun shines on Sundays.
D. The square of an integer is another integer.
Tautology is a statement which is always true.
A. outputs 1 if any input is 1.
B. outputs 1 only if all inputs are 1.
C. outputs 1 if any input is 0.
D. outputs 0 if all inputs are 1.
The AND gate can have two or more than two input signals and produce an output signal. when all the inputs are 1 i.e. high then the output is 1 otherwise output is 0 only.
A. outputs 1 if any input is 1.
B. outputs 1 only if all inputs are 1.
C. outputs 0 if any input is 0.
D. outputs 0 if all inputs are 1.
The OR gate is a digital logic gate that implements logical disjunction.
A. has 2 inputs and one output.
B. has 1 input and 2 outputs.
C. outputs 1 if input is 0.
D. outputs 1 if input is 1.
The NOT operator operates on single variable and the operation performed by NOT operator is called complementation.
A. has 2 inputs and one output.
B. has 1 input and 2 outputs.
C. outputs 1 if input is 0.
D. outputs 1 if input is 1.
In digital logic, an inverter or NOT gate is a logic gate which implements logical negation.
A. Gray code.
B. boolean values.
C. minterms.
D. canonical terms.
In a Karnaugh map, the boolean variables are transferred (generally from a truth table) and ordered according to the principles of Gray code in which only one variable changes in between the squares.
A. 6 squares.
B. 32 squares.
C. 16 squares.
D. 8 squares.
A karnaugh map is an array of squares. A 3-variable K-map has 8 squares and 4-variable K-map will have 16 squares.
A. a sum of all the literals in the system.
B. a sum of products of all the literals in the system.
C. a product of sums of all the literals in the system.
D. a product of all the literals in the system.
A maxterm is a Boolean expression resulting in a 0 for the output of a single cell expression and 1s for all other cells in the Karnaugh map or truth table.
A. a sum of all the literals in the system.
B. a sum of products of all the literals in the system.
C. a product of sums of all the literals in the system.
D. a product of all the literals in the system.
A minterm is a Boolean expression resulting in 1 for the output of a single cell and 0s for all other cells in a Karnaugh map or truth table.
A. basic postulates of Boolean Algebra.
B. Absorption Law.
C. De Morgan's theorem.
D. Principle of Duality.
DeMorgan's theorem may be thought of in terms of breaking a long bar symbol. When a long bar is broken, the operation directly underneath the break changes from addition to multiplication or vice versa and the broken bar pieces remain over the individual variables.
A. boolean operator.
B. electronic circuit.
C. truth table.
D. boolean quantity.
A logic gate performs a logical operation on one or more logic inputs and produces a single logic output.
A. adds the latter half of a number.
B. adds the front half of the number.
C. adds 2 bytes.
D. adds 2 bits.
A half adder can add two bits. It has two inputs, generally labelled A and B and two outputs, the sum S and carry C.
A. AND.
B. OR.
C. NOT.
D. NOR.
OR operator is used to perform a logical disjunction on two expressions.
A. AND.
B. OR.
C. NOT.
D. NOR.
AND operator is used to perform a logical conjunction on two expressions.
A. Venn diagram.
B. K-map.
C. Truth Table.
D. AND logic gate.
The Karnaugh map, also known as a Veitch diagram (KV-map or K-map for short), is a method to simplify Boolean algebra expressions. The K-map reduces the need for extensive calculations by taking advantage of humans' pattern-recognition capability, permitting rapid identification and elimination of potential race hazards.
A. Conditional operations.
B. Relational operations.
C. Arithmetic operations.
D. Logical operations.
Logic problems are binary decisions and boolean algebra effectively deals with these binary values. The decision which results into either YES (TRUE) or NO (FALSE) is called a BINARY DECISION.
A. a statement that is usually true.
B. a statement that is never true.
C. a statement that is always true.
D. a statement that can be true.
If result of any logical statement or expression is always TRUE or 1, it is called tautology.
George Boole, was an Englishman who invented Boolean algebra. His concepts are well known today in the field of mathematical logic. He gave the operators 'And, Or, and Not' used to connect conditions. His major book on symbolic logic identified the concept of "Boolean Logic" in "The Mathematical Analysis of Logic" in 1847. He authored "An Investigation of the Laws of Thought" in 1854. Here, he described what the computer industry now calls cybernetics.
A Truth Table is a table that gives all possible values of logical variables in all possible combinations, and their corresponding results.
A. is composed entirely of minterms.
B. is composed entirely of maxterms.
C. is composed of minterms or maxterms.
D. is composed of 0s and 1s.
The boolean expression composed entirely either of Minterms or Maxterms is referred to as Canonical Expression. Canonical expression can be represented in following two forms : Sum-of-Products (S-O-P) form and Product-of-sums (P-O-S) form.
A. a sum of all the literals in the system.
B. a sum of products of all the literals in the system.
C. a product of sums of all the literals in the system.
D. a product of all the literals in the system.
If the value of a variable is 1, then its complement is added otherwise the variable is added as it is.
A. a sum of all the literals in the system.
B. a sum of products of all the literals in the system.
C. a product of sums of all the literals in the system.
D. a product of all the literals in the system.
For example, X+Y can be expressed as the sum of several products, each of the product containing letters X and Y. These products are called minterms and each contains all the literals with or without the bar.
A. a maxterm to the given function.
B. an algebraic function.
C. a minterm to the given function.
D. the size of the K-map.
Karnaugh map or K-map is a graphical display of the fundamental products in a truth table. For a function of n variables, there would be a map of 2n squares, each representing a minterm.
A. a boolean operator.
B. an electronic circuit.
C. a truth table.
D. a boolean quantity.
Gates are digital (two-state) circuits because the input and output signals are either low voltage (denotes 0) or high voltage (denotes 1). Gates are often called logic circuits because they can be analyzed with boolean algebra.
A. inverted gates.
B. combination gates.
C. universal gates.
D. dual gates.
Universal gates are the ones which can be used for implementing any gate like AND, OR and NOT, or any combination of these basic gates. NAND and NOR gates are universal gates.
A. entirely of minterms.
B. entirely of maxterms.
C. of minterms or maxterms.
D. of 0s and 1s.
In Boolean algebra, any boolean function can be expressed in a canonical form using the dual concepts of minterms and maxterms.
A. multiplication.
B. division.
C. addition.
D. subtraction.
A bitwise OR takes two bit patterns of equal length and produces another one of the same length by matching up corresponding bits (the first of each, the second of each and so on) and performing the logical inclusive OR operation on each pair of corresponding bits.
A. inverter.
B. converter.
C. opposer.
D. terminator.
In digital logic, an inverter or NOT gate is a logic gate which implements logical negation.
A. 44
B. 24
C. 23
D. 22
For a function of n variables, there would be a map of 2n squares.
A. Product of 2 integers is positive.
B. Leaders are born not made.
C. The sun shines on Sundays.
D. The square of an integer is another integer.
If result of any logical statement or expression is always TRUE or 1, it is called tautology.
A. AND, OR, NOT.
B. NOT, AND, IF.
C. TRUE, AND, IF.
D. TRUE,TURE or FALSE, FALSE.
AND Operator performs another important operation of boolean algebra called logical multiplication and the symbol for AND operation is (.) dot. Thus X.Y will be read as X and Y. OR operator denotes operation called logical addition and the symbol used for it is '+'. The + symbol, therefore, does not have the 'normal' meaning but it is a logical addition or logical OR symbol. The X+Y can be read as X OR Y. 
A. a statement that is usually false.
B. a statement that is never false.
C. a statement that is always false.
D. a statement that can be false.
If result of any logical statement or expression is always TRUE or 1, it is called tautology and if the result is always FASLE or 0 it is called fallacy.
A. is usually false.
B. is never false.
C. is always false.
D. can be false.
A fallacy is an argument which provides poor reasoning in support of its conclusion.
A. is usually true.
B. is never true.
C. is always true.
D. can be true.
In propositional logic, tautology is a propositional formula that is true under any possible valuation of its propositional variables.
A. conditional operations.
B. relational operations.
C. arithmetic operations.
D. logical operations.
Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in 1840s.
A. produces 0 if the number of 1 inputs is odd.
B. produces 1 if the number of 1 inputs is even.
C. produces 1 if the number of 1 inputs is odd.
D. produces 1 if the number of 0 inputs is odd.
The XOR gate (sometimes EOR gate) is a digital logic gate that implements exclusive disjunction.
A. have 3 variables.
B. have 4 variables.
C. have 2 variables.
D. have 1 variable.
The Karnaugh map, also known as a Veitch diagram (KV-map or K-map for short), is a method to simplify Boolean algebra expressions.
A. logical multiplication.
B. logical division.
C. logical addition.
D. logical subtraction.
A bitwise OR takes two bit patterns of equal length and produces another one of the same length by matching up corresponding bits (the first of each, the second of each, and so on) and performing the logical inclusive OR operation on each pair of corresponding bits.
A. take its complement.
B. add (X.X’).
C. add (X+X’).
D. take its dual.
A MAXTERM is a sum of all the literals (with or without the bar) within the logica system.
A. Infrared, Shielded Twisted Pair.
B. Twisted pair, Laser.
C. Coaxial Cable, Optical Fibers.
D. Radio waves, Microwave.
Unguided media is also called wireless where any phyisical path is not used for transmission.
A. Infrared, Shielded Twisted Pair.
B. Twisted pair, Laser
C. Coaxial Cable, Optical Fibers.
D. Radio waves, Microwave.
Guided media is that where we use any path for communication like cables(coaxial,fibre optic,twisted pair)etc.
A. acronym for Negligible Obstruction In Signal Energy.
B. disturbance due to unwanted energy from sources other than transmitter.
C. disturbance due to too much amplification of sound.
D. weakening of signal due to faulty transmitter.
The word noise means unwanted sound or noise pollution.
A. transmission of signal from an antenna.
B. weakening due to loss of energy as the signal propagates.
C. retransmission of the signal after amplifying.
D. inability to propagate in any medium.
Attenuation (in some contexts also called extinction) is the gradual loss in intensity of any kind of flux through a medium.
A. a physical connection between source and destination is established before message transmission takes place.
B. a message is broken into fixed sized packets which are then transmitted.
C. a message is sent to a switching office and stored till it can be forwarded to another switching office.
D. a message is sent by bouncing it off the walls of a copper wire.
In telecommunications, message switching was the precursor of packet switching, where messages were routed in their entirety, one hop at a time.
A. a physical connection between source and destination is established before message transmission takes place.
B. a message is broken into fixed sized packets which are then transmitted.
C. a message is sent to a switching office and stored till it can be forwarded to another switching office.
D. a message is sent by bouncing it off the walls of a copper wire.
In telecommunications, a circuit switching network is one that establishes a circuit (or channel) between nodes and terminals before the users may communicate, as if the nodes were physically connected with an electrical circuit.
A. a physical connection between source and destination is established before message transmission takes place.
B. a message is sent by bouncing it off the walls of a copper wire.
C. a message is sent to a switching office and stored till it can be forwarded to another switching office.
D. a message is broken into fixed sized packets which are then transmitted.
Packet switching is a network communications method that groups all transmitted data, irrespective of content, type, or structure into suitably-sized blocks, called packets. The network over which packets are transmitted is a shared network which routes each packet independently from all others and allocates transmission resources as needed.
A. WLL.
B. MAN.
C. WAN.
D. LAN.
A local area network (LAN) is a computer network covering a small physical area, like a home, office, or small group of buildings, such as a school, or an airport. The defining characteristics of LANs, in contrast to wide-area networks (WANs), include their usually higher data-transfer rates, smaller geographic range, and lack of a need for leased telecommunication lines.
A. LAN.
B. MAN.
C. WAN.
D. WLL.
A computer network that spans a relatively large geographical area. Typically, a WAN consists of two or more local-area networks (LANs).
A. node connection.
B. topology.
C. topography.
D. nodal system.
Network topology is the study of the arrangements or mapping of the elements of a network, especially the physical and logical inter-connection between nodes.
A. LAN.
B. WAN.
C. MAN.
D. ZAN.
A MAN is optimised for a larger geographical area unlike LAN, ranging from several blocks of buildings to entire cities.
A. backbone.
B. Internet.
C. LAN.
D. gateway.
In Internet, most computers are connected to smaller networks which in turn are connected through gateways to the Internet backbone.
A. of high speed cables.
B. of being on top of the range of computers.
C. data travels in one direction.
D. cables are connected through hubs.
In a ring network, data travels in one direction, passing through each machine until it reaches its destination device.
A. have duplicate documents.
B. take time to log-on.
C. contain viruses.
D. face problems in file sharing.
Because everything is linked in a large network, viruses can quickly spread through a network.
A. sharing printers.
B. security.
C. its cost effectiveness.
D. intruders.
Devices like printers can be shared easily on a network.
A. point-to-point communication.
B. star topology.
C. broadcasting.
D. mesh topology.
Single communication channel is a communication network which uses broadcasting for communication between its nodes.
A. broadcasting.
B. point-to-point communication.
C. LAN(Local Area Network).
D. WAN(Wide Area Network).
Point-to-point telecommunication generally refers to a connection restricted to two end-points.
A. Fiber Distributed Data Interface.
B. Fiber Division Data Internetwork.
C. Fiber Dividing Data Interface.
D. Fiber Distribution Data Interface.
The Fiber Distributed Data Interface (FDDI) topology is a ring with two counter-rotating rings for reliability and with no hubs.
A.
B.
C.
D.
A backbone is a part of computer network infrastructure that interconnects various pieces of network, providing a path for the exchange of information between different LANs or sub-networks.
A. is based on token ring topology.
B. is a kind of data transmission.
C. formed the basis for IEEE 802.3
D. is also called RJ-45 connector.
Ethernet network is the most commonly used technology whenever we have to set up a local area network (LAN). It is based on the IEEE 802.3 standard.
A. interpreter.
B. assembler.
C. compiler.
D. debugger.
If there is any error in any line then interpreter reports it at the same time and program execution cannot resume until the error is rectified.
A. compiler.
B. assembler.
C. interpreter.
D. multiprocessor.
Assembler is used because the computer does not understand any language other than its own machine language.
A. coaxial cable.
B. optical fibre cable.
C. twisted pair cable.
D. UTP cable.
Optical fibre is a glass or plastic fibre that carries light along its length. These are used in fibre optic communication, which permits transmission over long distances and at higher bandwidth.
A. NIC.
B. network connector.
C. modem.
D. internet card.
NIC stands for network interface controller. It is designed to allow computer to communicate over a computer network.
A. ISOC.
B. W3C.
C. IEEE.
D. IETE.
Internet society set the rules and standards for accessing the data on the internet.
A. storage.
B. network data transfer.
C. keystroke rate.
D. picture resolution.
SCSI is a set of standards for physically connecting and transferring data between computer and peripheral devices. It is used in hard disks, tape drives, scanners and CD drives.
A. CPM.
B. DPI.
C. PPM.
D. BIT.