UGC NET CS 2005 Dec-Paper-2

Question 1
T is a graph with n vertices. T is connected and has exactly n-1 edges, then :
A
T is a tree
B
T contains no cycles
C
Every pairs of vertices in T is connected by exactly one path
D
All of these
       Engineering-Mathematics       Graph-Theory
Question 1 Explanation: 
This is little bit tricky question.
Step-1:
n= number of vertices
n-1 = number of edges
Example: n=5 vertices and n-1=4 edges

Step-2: The above graph T won’t have cycle then we are calling as tree. Here, every pairs of vertices in T is connected by exactly one path.
Note: The above properties is nothing but minimum spanning tree properties.
Question 2
If the proposition ​ ¬ ​ P ​ → ​ Q is true, then the truth value of the proportion ​ ¬ ​ PV (P ​ → ​ Q) is:
A
True
B
Multi - Valued
C
Flase
D
Can not determined
       Engineering-Mathematics       Propositional-Logic
Question 2 Explanation: 
We can also write (¬p → q) into (p ∨ q)

Here, we can minimize the boolean form into
¬p ∨ (p → q)
= ¬p ∨ (¬p ∨ q)
= ¬p ∨ q
In question, they are not discussed about the truth values of p, it implies that ¬p ∨ q also be True or False. So, we cannot be determined.
Question 3
Let A and B be two arbitrary events, then :
A
P(A∩B) = P(A) P(B)
B
P(P∪B) = P(A) + P(B)
C
P(A∪B) ≤ P(A) + P(B)
D
P(A​ / ​ B) = P(A∩B) + P(B)
       Engineering-Mathematics       Probability
Question 3 Explanation: 
Option-A is happens when A and B are independent.
Option-B is happens when A and B are mutually exclusive.
Option-C is not happens.
Option-D is P(A∪B) ≤ P(A) + P(B) is true because P(A∪B) = P(A) + P(B) - P(A∩B).
Question 4
Which sentence can be generated by
S→d/bA
A→d/ccA
A
bccddd
B
aabccd
C
ababccd
D
abbbd
E
None of the above
       Theory-of-Computation       Languages-and-Grammars
Question 4 Explanation: 
Here, there is no terminal symbol ‘a’, so the answer never be option B,C,D.
Option-A is also wrong because the string generated by grammar is bccccd.
Question 5
Regular expression a+b denotes the set :
A
{a}
B
{ε, a, b}
C
{a, b}
D
None of these
       Theory-of-Computation       Regular-Expression
Question 5 Explanation: 
The regular expression a+b denotes the set {a, b}.
Question 6
Which of the following is divisible by 4 ?
A
100101100
B
1110001110001
C
11110011
D
10101010101010
       Digital-Logic-Design       Number-Systems
Question 6 Explanation: 
Option-A: (100101100)​ 2​ = (300)​ 10
300 is divisible by 4
Option-B: (1110001110001)​ 2​ = (7281)​ 10
7281 is not divisible by 4
Option-C: (11110011)​ 2​ = (243)​ 10
243 is not divisible by 4
Option-D: (10101010101010)​ 2​ = (10,922)​ 10
10,922 is not divisible by 4.
Question 7
A half-adder is also known as :
A
AND Circuit
B
NAND Circuit
C
NOR Circuit
D
EX-OR Circuit
       Digital-Logic-Design       Combinational-Circuit
Question 7 Explanation: 
→ The half adder adds two single binary digits A and B. It has two outputs, sum (S) and carry (C). The carry signal represents an overflow into the next digit of a multi-digit addition. The value of the sum is 2C + S. The simplest half-adder design incorporates an XOR gate for S and an AND gate for C. The Boolean logic for the sum (in this case S) will be A′B + AB′ whereas for the carry (C) will be AB.
Question 8
Consider the following sequence of instructions :
a=a⊕b, b=a⊕b, a=b⊕a
This Sequence
A
retains the value of the a and b
B
complements the value of a and b
C
swap a and b
D
negates values of a and b
       Digital-Logic-Design       Boolean-Expression
Question 8 Explanation: 
⇒ a=a⊕b
⇒ b=a ⊕b
= a⊕b ⊕b (Substitute (1))
= 0 ⊕ b
= b
⇒ a = b⊕a
= b⊕a⊕b (Substitute (1))
= a⊕b⊕b
= a⊕0
= a
Question 9
Consider the following circuit :

to make it a Tautology the ​ ? ​ should be :
A
NAND gate
B
AND gate
C
OR gate
D
EX-OR gate
       Digital-Logic-Design       Logic-Gates
Question 9 Explanation: 
Method 1:
(X+Y) + (XY)’
= X+Y+X’+Y’
= (X+X’)+(Y+Y’)
= 1
Method 2:
Question 10
When an inventor is placed between both inputs of an S-R flip flop, the resulting flip flop is :
A
JK flip-flop
B
D-flip-flop
C
T flip-flop
D
None of these
       Digital-Logic-Design       Sequential-Circuits
Question 10 Explanation: 
Given question is ambiguous. It is not mentioned how the inverter is connected. Placing NOT gate in different positions gives different solutions.
Question 11
What is the output of the following C-program
main()
{
printf(''%d%d%d'', sizeof(3.14f), sizeof(3.14), sizeof(3.141));
}
A
4 4 4
B
4 8 10
C
8 4 8
D
8 8 8
E
None of the above
       Programming       Operator
Question 11 Explanation: 
The sizeof operator will print number of bytes of a data type.
sizeof(3.14f) → It will consider as float data type. The float data type size is 4 bytes.
sizeof(3.14) → It will consider as double data type. The double data type size is 8 bytes.
sizeof(3.141) → It will consider as double data type. The double data type size is 8 bytes.
Output= 4 8 8
Note: The exact size of each of these 3 types depends on the C compiler implementation (or) platform
Question 12
The bitwise OR of 35 with 7 in C will be :
A
35
B
7
C
42
D
39
       Programming       Operator
Question 12 Explanation: 
Step-1: First we have to convert into binary numbers
(35)​ 10​ = (​ 0010 0011​ ) ​ 2
(7)​ 10​ = (0000 0111)​ 2
Step-2: Perform OR operation on both binary numbers.
0010 0011
0000 0111
---------------
0010 0111
----------------
Step-3: Convert result into Decimal number
(0010 0111)​ 2​ = (39)​ 10
Question 13
Data members and member function of a class by default is respectively :
A
private and public
B
public
C
public and private
D
private
       Programming-in-c++       Functions
Question 13 Explanation: 
If we do not specify any access modifiers for the members inside the class then by default the access modifier for the members will be Private.
Question 14
Function overloading done at :
A
Runtime
B
Compile time
C
Linking time
D
Switching from function to function
       Programming-in-c++       Properties
Question 14 Explanation: 
Function overloading done at compile time. In the Java programming language, function overloading is also known as compile-time polymorphism and static polymorphism.
Question 15
​ What will be the value of i for the following expression : int i=11, i=3 ; i+=(f >3) ? i & 2:5 ;
A
2
B
5
C
13
D
12
       Programming       Operator
Question 15 Explanation: 
Let assume f=11 and i=3
i=i+(11>3) ? 3&2 : 5
/* 11>3 condition true. So, it will perform 3&2
(3)10 → (11)2
(2)10 → (10)2
----
10 (AND)
----
(10)2 = (2)10
So, i=3+2
i=5
Note: Instead of ‘f’ they given ‘i’ value in question. Excluded for evaluation.
Question 16
A schema describes :
A
data elements
B
records and files
C
record relationship
D
all of the above
       Database-Management-System       Databases
Question 16 Explanation: 
In a relational database, the schema defines the tables, fields, relationships, views, indexes, packages, procedures, functions, queues, triggers, types, sequences, materialized views, synonyms, database links, directories, XML schemas, and other elements.
Question 17
One approach to standardization storing of data :
A
MIS
B
CODASYL
C
Structured Programing
D
None of the above
       Database-Management-System       Database-Languages
Question 17 Explanation: 
→ CODASYL is an acronym for “Conference on Data Systems Language.
→ This specification defined several separate languages: a data definition language (DDL) to define the schema of the database, another DDL to create one or more subschemas defining application views of the database; and a data manipulation language (DML) to request and update data in the database.
Question 18
In a relational schema, each tuple is divided in fields called :
A
Relations
B
Domains
C
Queries
D
All the above
       Database-Management-System       Relational Schema
Question 18 Explanation: 
A domain describes the set of possible values for a given attribute(column), and can be considered a constraint on the value of the attribute. Mathematically, attaching a domain to an attribute means that any value for the attribute must be an element of the specified set.
For example in relation given below there are 4 attributes where domain of attributes "Name" and "Course" is character string while domain of "Roll-No" and "Marks" attributes is integer value.
Now the domains of each attribute is dividing a tuple(row) in in fields of sequence Character string, integer value, character string and integer value.

Question 19
An embedded pointer provides :
A
Physical record key
B
An inserted Index
C
A secondary access path
D
All the above
       Database-Management-System       Indexing
Question 19 Explanation: 
1. To understand how pointers and their associated data elements are allocated in Microsoft RPC, you have to differentiate between top-level pointers and embedded pointers
2. Top-level pointers are those that are specified as the names of parameters in function prototypes. Top-level pointers and their referents are always allocated on the server.
3. Embedded pointers are pointers that are embedded in data structures such as arrays, structures, and unions. When embedded pointers only write output to a buffer and are null on input, the server application can change their values to non-null. In this case, the client stubs allocate new memory for this data.
4. If the embedded pointer is not null on the client before the call, the stubs do not allocate memory on the client on return. Instead, the stubs attempt to write the memory associated with the embedded pointer into the existing memory on the client associated with that pointer, overwriting the data already there.
Note: Actual question, given embedded printer instead of embedded pointer.
Question 20
A locked file can be :
A
accessed by only one user
B
modified by users with the correct password
C
is used to hide sensitive information
D
both (B) and (C)
       Database-Management-System       File-System
Question 20 Explanation: 
File locking is a mechanism that restricts access to a computer file by allowing only one user or process to access it in a specific time.
Question 21
In what tree, for every node the height of its left subtree and right subtree differ at least by one :
A
Binary search tree
B
AVL - tree
C
Threaded binary tree
D
Complete tree
       Data-Structures       Trees
Question 21 Explanation: 
Threaded binary tree:​ A binary tree is threaded by making all right child pointers that would normally be null point to the inorder successor of the node (if it exists), and all left child pointers that would normally be null point to the inorder predecessor of the node.
1. Single Threaded: each node is threaded towards either the in-order predecessor or successor (left or right).
2. Double threaded: each node is threaded towards both the in-order predecessor and successor (left and right).
Question 22
A hash function ​ f ​ defined as ​ f ( ​ key)5 key mod 7, with linear probing it is used to insert the key 37,38,72,48,98,11,56 into a table index from 0 to 6. What will be the locations of 11 :
A
3
B
4
C
5
D
6
       Data-Structures       Hashing
Question 22 Explanation: 
Given data, insertion order is 37, 38, 72, 48, 98, 11, 56
Hash function = f(key) = key mod 7
Question 23
Consider the graph, which of the following is a valid topological sorting ?
A
ABCD
B
BACD
C
BADC
D
ABDC
       Data-Structures       Graphs-and-Tree
Question 23 Explanation: 
Finding valid topological sorting we have two methods.
1. Using DFS method
2. Using indegree elimination method
The simplest method is indegree elimination method.
Indegrees:
A →0
B →1
D →2
C → 1 (Final)
We can assume that indegree value of A is ‘0’. So, it is starting point.
Step-1: Remove ‘A’ from graph, then indegrees are
B →0
D →1
C →1
Sequence:

Step-2: Remove ‘B’ from graph, then indegrees are
D →0
C →1
Sequence:

Step-3: Remove ‘C’ from graph then indegrees are
C →0
Sequence:
Question 24
The initial configuration of queue is a, b, c, d. ‘​ a’​ is at the front. To get the configuration d, c, b, a how many deletions and additions required :
A
2 deletions, 3 additions
B
3 deletions, 2 additions
C
3 deletions, 4 additions
D
3 deletions, 3 additions
       Data-Structures       Queues-and-Stacks
Question 24 Explanation: 
Initially the queue order is

Step-1: Delete ‘a’ from queue. The deletion operation performs First In First Out.We will perform the deletion at front end
After deleting queue will become

Step-3: Delete ‘b’ from queue. The deletion operation performs First In First Out.
After deleting queue will become

Step-3: Delete ‘c’ from queue. The deletion operation performs First In First Out.
After deleting queue will become

Step-4: Insert the element “c” into the queue, We will perform the insertion at rear end
The elements of queue after inserting the element ”c” are

Step-5: Insert the element “b” into the queue,then the elements of queue after inserting the element ”b” are

step-6: Insert the element “a” into the queue,then the elements of queue after inserting the element ”a” are

→ Step-1,step-2 and step-3 are deletion operations and step-4,step-5 and step-6 are deletions operations.
→ So total 3 deletions and 3 insertions are required to get required configuration.
Question 25
Which traversal techniques lists the nodes of a binary search tree in ascending order ?
A
post – order
B
in - order
C
pre - order
D
linear - order
       Data-Structures       Binary-Trees
Question 25 Explanation: 
Inorder traversal technique in binary search tree will always produce ascending order.
Example:

In this traversal method, the left subtree is visited first, then the root and later the right subtree. We should always remember that every node may represent a subtree itself.
Question 26
The data unit in the TCP/IP application layer is called a __________ .
A
message
B
segment
C
datagram
D
frame
       Computer-Networks       TCP/IP
Question 26 Explanation: 
The PDU for Data Link layer, Network layer, Transport layer and Application layer are frame, datagram, segment and message respectively.
Question 27
Which of following file retrieval methods use hypermedia ?
A
HTML
B
Veronica
C
WAIS
D
HTTP
       Computer-Networks       Application-Layer-Protocol
Question 27 Explanation: 
The Hypertext Transfer Protocol (HTTP) is an application protocol for distributed, collaborative, hypermedia information systems. HTTP is file retrieval methods use hypermedia.
Question 28
Which of following is an example of a client - server model :
A
DNS
B
FTP
C
TELNET
D
All the above
       Computer-Networks       Application-Layer-Protocol
Question 28 Explanation: 
→ The client-server characteristic describes the relationship of cooperating programs in an application.
→ Clients and servers exchange messages in a request–response messaging pattern. The client sends a request, and the server returns a response. This exchange of messages is an example of inter-process communication.
Example:
1. FTP
2. DNS
3. TELNET
Question 29
__________ provide a method to recover data that has been delivered but not get used :
A
Segmentation
B
Concatenation
C
Translation
D
Synchronization
       Computer-Networks       ISO-OSI-layers
Question 29 Explanation: 
→ Translation provide a method to recover data that has been delivered but not get used.
→ The presentation layer handles translation, encryption, authentication and compression.
→ The presentation layer is layer 6 and serves as the data translator for the network. It is sometimes called the syntax layer.
Question 30
Encryption and decryption are the functions of the __________ layer of OSI model :
A
transport
B
session
C
router
D
presentation
       Computer-Networks       OSI-TCP-layers
Question 30 Explanation: 
Presentation layer functionalities:
1. Encryption and decryption
2. Compression and decompression
3. Translation
Question 31
The Register or main memory location which contains the effective address of the operand is known as :
A
Pointer
B
Indexed register
C
Special Locations
D
Scratch Pad
       Computer-Organization       Addressing-Modes
Question 31 Explanation: 
→ The effective address of the operand is the contents of a register or main memory location, location whose address appears in the instruction.
→ Indirection is noted by placing the name of the register or the memory address given in the instruction in parentheses.
→ The register or memory location that contains the address of the operand is a pointer. When an execution takes place in such mode, instruction may be told to go to a specific address. Once it's there, instead of finding an operand, it finds an address where the operand is located.
Note:Two memory accesses are required in order to obtain the value of the operand (fetch operand address and fetch operand value).
Example: (textbook) ADD (A), R0
(address A is embedded in the instruction code and (A) is the operand address = pointer variable)
Question 32
A Top-down Parser generates :
A
Leftmost derivation
B
Rightmost derivation
C
Rightmost derivation in reverse
D
Leftmost derivation in reverse
       Compiler-Design       Parsers
Question 32 Explanation: 
→ Top-down parsing can be viewed as an attempt to find leftmost derivations of an input-stream by searching for parse-trees using a top-down expansion of the given formal grammar rules.
→ Inclusive choice is used to accommodate ambiguity by expanding all alternative right-hand-sides of grammar rules.
Question 33
A general macroprocessor is an in built function of :
A
Loader
B
Linker
C
Editor
D
Assembler
       Compiler-Design       Assembler
Question 33 Explanation: 
→ A macro processor is a program that copies a stream of text from one place to another, making a systematic set of replacements as it does so.
→ Macro processors are often embedded in other programs, such as assemblers and compilers. Sometimes they are standalone programs that can be used to process any kind of text.
Question 34
Which of the following is not collision Resolution Technique :
A
Hash addressing
B
Chaining
C
Indexing
D
None of these
       Data-Structures       Hashing
Question 34 Explanation: 
→ Hash collisions are practically unavoidable when hashing a random subset of a large set of possible keys.
→ Two keys mapping to the same location in the hash table is called “Collision”.
Collision Resolving techniques
1. Separate chaining
2. Open addressing
i. Linear Probing
ii. Quadratic Probing
iii. Double hashing
Question 35
Which activities is not included in the first pass of two pass assembler ?
A
build the symbol table
B
construct the Intermediate code
C
separate mnemonic opcode and operand field.
D
none of these
       Compiler-Design       Assembler
Question 35 Explanation: 
Two Pass Assemblers:
Pass-1:
1. Assign addresses to all statements in the program
2. Save the values assigned to all labels for use in Pass2
3. Perform some processing of assembler directives
Pass-2:
1. Assemble instructions Generate data values defined by BYTE,WORD
2. Perform processing of assembler directives not done in Pass 1
3. Write the object program and the assembly listing
Question 36
Producer consumer problem can be solved using :
A
semaphores
B
event counters
C
monitors
D
all the above
       Operating-Systems       Process-Synchronization
Question 36 Explanation: 
→ Producer consumer problem can be solved using semaphores.
→ A semaphore is a variable or abstract data type used to control access to a common resource by multiple processes in a concurrent system such as a multitasking operating system. Semaphore basically two types.
1. Counting semaphores
2. Binary semaphores
Question 37
If you want to execute more than one program at a time, the systems software that are used must be capable of :
A
word processing
B
virtual memory
C
compiling
D
multitasking
       Operating-Systems       Types-of-Operating-System
Question 37 Explanation: 
→ Multitasking does not require parallel execution of multiple tasks at exactly the same time.
→ Multitasking allows more than one task to advance over a given period of time.
→ Even on multiprocessor computers, multitasking allows many more tasks to be run than there are CPUs.
Question 38
Which of the following checks cannot be carried out on the input data to a system ?
A
Consistency check
B
Syntax check
C
Range check
D
All the above
       Database-Management-System       Data-Validation
Question 38 Explanation: 
→ Consistency check ensures that the entered is logical. For example the delivery date cannot be before the order date.
→ Syntax check cannot be carried out on the input data to a system.
→ Range check does not apply to ISBN, but typically data must lie within maximum and minimum preset values. For example, customer account numbers may be restricted within the values 10000 to 20000, if this is the arbitrary range of the numbers used for the system.
Question 39
Nonmodifiable procedures are called :
A
Serially usable procedure
B
Concurrent procedure
C
Reentrant procedure
D
Top down procedure
       Programming       Functions
Question 39 Explanation: 
→ A computer program or subroutine is called reentrant if it can be interrupted in the middle of its execution and then safely be called again ("re-entered") before it’s previous invocation complete execution. → The interruption could be caused by an internal action such as a jump or call, or by an external action such as an interrupt or signal. The previous invocations may resume correct execution before the reentered invocation completes, unlike recursion, where the previous invocations may only resume correct execution once the reentered invocation completes.
Rules:
1. Reentrant code may not hold any static or global non-constant data.
2. Reentrant code may not modify itself.
3. Reentrant code may not call non-reentrant computer programs or routines.
Question 40
Banker​ ’s algorithm is used for __________ purpose :
A
Deadlock avoidance
B
Deadlock removal
C
Deadlock prevention
D
Deadlock continuations
       Operating-Systems       Deadlock
Question 40 Explanation: 
→ The Banker algorithm, sometimes referred to as the detection algorithm, is a resource allocation and deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety by simulating the allocation of predetermined maximum possible amounts of all resources, and then makes an "s-state" check to test for possible deadlock conditions for all other pending activities, before deciding whether allocation should be allowed to continue.
Question 41
The testing of software against SRS is called :
A
Acceptance testing
B
Integration testing
C
Regression testing
D
Series testing
       Software-Engineering       Software-testing
Question 41 Explanation: 
→ Acceptance testing is a test conducted to determine if the requirements of a specification or contract are met. This is test works on SRS document.
→ In software testing in which individual software modules are combined and tested as a group. Some different types of integration testing are big-bang, mixed (sandwich), risky-hardest, top-down, and bottom-up.
→ Regression testing is re-running functional and non-functional tests to ensure that previously developed and tested software still performs after a change. If not, that would be called a regression. Changes that may require regression testing include bug fixes, software enhancements, configuration changes, and even substitution of electronic components.
Question 42
The lower degree of cohesion is :
A
logical cohesion
B
coincidental cohesion
C
procedural cohesion
D
communicational cohesion
       Software-Engineering       Coupling-and-Cohesion
Question 42 Explanation: 
Cohesion is a measure of degree to which elements of a module are functionally related.
Given a list is least desirable to most desirable types in module cohesion
Question 43
The Reliability of the software is directly dependent upon :
A
Quality of the design
B
Programmer​ s experience
C
Number of error
D
Set of user requirements
       Software-Engineering       Software-Reliabiliy
Question 43 Explanation: 
→ Reliability of software is dependent on number of errors present in software.
→ Software Reliability is the probability of failure-free software operation for a specified period of time in a specified environment.
Question 44
Successive layer of design in software using bottom-up design is called :
A
Layer of Definement
B
Layer of Construction
C
Layer of abstraction
D
None of the above
       Software-Engineering       Software-design
Question 44 Explanation: 
Successive layer of design in software using bottom-up design is called layer of abstraction.
Question 45
Sliding window concept of software project management is :
A
Preparation of comprehensible plan
B
Preparation of the various stages of development
C
Ad-hoc planning
D
Requirement analysis
       Software-Engineering       Software-configuration-management
Question 45 Explanation: 
→ In the sliding window technique, starting with an initial plan, the project is planned more accurately in successive development stages.
→ At the start of a project, project managers have incomplete knowledge about the details of the project. Their information base gradually improves as the project progresses through different phases. After the completion of every phase, the project managers can plan each subsequent phase more accurately and with increasing levels of confidence.
Question 46
Which of the following transmission media is used in Bluetooth Technology :
A
Radio links
B
Microwave links
C
VSAT Communication
D
Fiber - optic
       Computer-Networks       Wifi-Bluetooth
Question 46 Explanation: 
→ Bluetooth uses less power and costs less to implement than Wi-Fi. Its lower power also makes it far less prone to suffering from or causing interference with other wireless devices in the same 2.4GHz radio band.
→ Bluetooth devices also shift radio frequencies often while paired, which prevents easy invasion.
Question 47
Which of the following is a EDI standard ?
A
ANSI X.15
B
ANSI X.14
C
ANSI X.13
D
ANSI X.12
       Database-Management-System       E-commerce
Question 47 Explanation: 
ANSI X.12: Chartered by ANSI (the American National Standards Institute) the Accredited Standards Committee (ASC) X12 develops, maintains, interprets, publishes and promotes the proper use of Electronic Data Interchange Standards. The ASC X12 standard has become the de-facto standard of choice for US based EDI operations.
Question 48
Analysis of large database to retrieve information is called :
A
OLTP
B
OLAP
C
OLDP
D
TLPP
       Database-Management-System       data-mining
Question 48 Explanation: 
→ Analysis of large database to retrieve information is called OLAP.
→ OLAP system is market oriented and is used for data analysis by knowledge workers including Managers, Executives and Analysts.
→ OLAP include business reporting for sales, marketing, management reporting, business process management (BPM), budgeting and forecasting, financial reporting and similar areas, with new applications emerging, such as agriculture.
Question 49
The cost of the network is usually determined by :
A
Time complexity
B
Switching complexity
C
Circuit complexity
D
None of these
       Computer-Networks       Switching
Question 49 Explanation: 
→ The cost of the network is usually determined by switching complexity. Switching complexity include, but not limited to, the number of switching components, the delay time of signal propagating through the network, the complexity of path selection algorithms, and the complexity of physically designing the network.
Question 50
The mechanism with which several uses can share a medium without interference is :
A
Frequency modulation
B
Amplitude modulation
C
Multiplexing
D
None of these
       Data-Communication       Multiplexing
Question 50 Explanation: 
Multiplexing is a method by which multiple analog or digital signals are combined into one signal over a shared medium. It can share a medium without interference.
There are 50 questions to complete.