Cardinality: cardinality ratio for a binary relationship specifies the maximum number of relationship instances that an entity can participate in.
Participation: Participation for a binary relationship specifies the minimum number of relationship instances that an entity can participate in.

Multiplexer : It also known as a data selector, is a device that selects between several input signals and forwards it to a single output line. A multiplexer of 2ⁿ inputs has n select lines, which are used to select which input line to send to the output. Here in fourth option “S” is used as select line to select either “A” or “B”.
A multiplexer can be used to implement if-else statements.

a / b - c + d * e - a * c
* Start scanning the expression from RHS. * Push the operators on the top of the stack by ensuring that only high priority operator can be pushed over a low priority operator.
* If a low priority operator is encountered in expression while scanning it, and if top of stack have high priority operator then pop it and after that push low priority operator on top of stack.
* Print each operand just after scanning it.

W+ : Create a text file for both reading and writing. If the given file exists, its contents are cleared unless it is a logical file.
A+ : Open a text file in append mode for reading or updating at the end of the file. The fopen() function creates the file if it does not exist.
W : Create a text file for writing. If the given file exists, its contents are destroyed unless it is a logical file.
A : Open a text file in append mode for writing at the end of the file. The fopen() function creates the file if it does not exist and is not a logical file.
R+ : Open a text file for both reading and writing. The file must exist.

TRUE: IPSec support is an integral part of IPv6.
TRUE: IPv6 has no way to distinguish delay-sensitive packets from bulk data transfers.
FALSE: In comparison to IPA. IPv6 has improved header structure with less processing overhead.
An independent physician association (IPA) is a business entity organized and owned by a network of independent physician practices for the purpose of reducing overhead or pursuing business ventures such as contracts with employers, accountable care organizations (ACO) and/or managed care organizations (MCOs). There are substantial opportunities for innovation in delivery system modeling and benefit design in the creation of physician networks. Specifically, creation of practice networks involving patient-centered medical home (PCMH) practices may accelerate important and necessary changes in health care delivery.
TRUE: IPv6 routers no longer have to fragment packets.

Optimal Parenthesization is : (A((BC)D))
Optimal Cost is : 1232

View-serializability of a schedule is defined by equivalence to a serial schedule (no overlapping transactions) with the same transactions, such that respective transactions in the two schedules read and write the same data values ("view" the same data values).
Conflict-serializability is defined by equivalence to a serial schedule (no overlapping transactions) with the same transactions, such that both schedules have the same sets of respective chronologically ordered pairs of conflicting operations (same precedence relations of respective conflicting operations).

Double Ended Queue: It is abbreviated to deque and it is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail). It is also often called a head-tail linked list
Stack: Stack is an abstract data type that serves as a collection of elements, with two principal operations:
->push, which adds an element to the collection, and
->pop, which removes the most recently added element that was not yet removed.
Both PUSH and POP operations are done from a single end.The order in which elements come off a stack gives rise to its alternative name, LIFO (last in, first out).
Queue: a queue is a collection of entities that are maintained in a sequence and can be modified by the addition of entities at one end of the sequence and removal from the other end of the sequence. It allows addition and deletion of items from fixed different ends.

Optimal Substructure: The value of C(n, k) can be recursively calculated using following standard formula for Binomial Coefficients.
C(n, k) = C(n-1, k-1) + C(n-1, k)
C(n, 0) = C(n, n) = 1
Time Complexity: O(nk)
Space complexity: O(nk)

The entity integrity constraint states that primary key value can't be null. This is because the primary key value is used to identify individual rows in relation and if the primary key has a null value, then we can't identify those rows.

Process P will be executed first and then Process Q can be executed next.
At the process P: W=P(T)
X=V(S)
At the process Q: Y=P(S)
Z=V(T)
Here, S=0, T=1 then the process P executes first and then Q, and both can run on process alternate way start with P.

FTP protocols is built on client-server architecture and uses separate control and data connections between the client and the server

Organization have 60 departments, and to assign 60 subnet we need 6 bits for subnet. In Class B network first two octet are reserved for NID, so we take first 6 bit of third octet for subnets and subnet mask would be 255.255.11111100.00000000 = 255.255.252.0

CNF-Satisfiability problem belongs to NP-Complete.

I) TRUE: Operator precedence parser works on ambiguous grammar
II) FALSE: Top-down parser works on left recursive, unambiguous and deterministic grammar
Ill) TRUE: LL(I) is a non-recursive descent parser
IV) TRUE: CLR(I) is the most powerful parser

By default unsigned variables will consider integer data type.

Greedy Problems:
1. Job scheduling
2. Minimum spanning tree
3. Huffman code
Dynamic Programming:
1. O/1 knapsack
2. Optimal Binary search tree
3. Matrix chain multiplication

Decimal Number= (395)₁₀ =(110001011)₂ =(613)₈ = (18B)₁₆
Total 9 digits of binary number required to convert decimal number

Attenuation → Changes in shape of the signal
Shannon capacity → Noisy channel
Nyquist bit rate → Noiseless channel
Distortion → Loss of energy

BCNF Properties:
1. BCNF is the advance version of 3NF. It is stricter than 3NF.
2. A table is in BCNF if every functional dependency X → Y, X is the super key of the table.
3. For BCNF, the table should be in 3NF, and for every FD, LHS is super key.
4. Two (or) Binary tuples are always be in BCNF