A data structure is said to be linear if its elements form a sequence or a linear list.
Examples:
1. Array
2. Linked List
3. Stacks
4. Queues

The total number of comparisons in a bubble sort is O(n²)

→ Fibonacci Series using recursion using condition is
Condition: fibonacci(n-1) + fibonacci(n-2)
Recurrence relation is: T(n)=2T(n-1)+C
Time Complexity: O(2ⁿ)
→ Factorial number using recursion is
Condition: fact(n-1)*n
Recurrence relation is: T(n)=T(n+1)+1
Time Complexity: O(n)
→ Tower of Hanoi using recursion is
Step-1: Hanoi(disk - 1, source, aux, dest)
Step-2: move disk from source to dest
Step-3: Hanoi(disk - 1, aux, dest, source)
Recurrence relation is: T(n)=2T(n-1)+C
Time Complexity: O(2ⁿ)
→ Tree traversals like Preorder,Postorder and Inorder using recursion only
Note: Recursion is best in the case of Tower of Hanoi,Factorial number and Tree traversals but it is not give good performance to fibonacci numbers.

The set of vertices has size n, the number of such subsets is given by the binomial coefficient C(n,2)⋅C(n,2) = n(n-1)/2

Given data,
-- Hash table has space =75 slots.
-- For 6% filling it must take =6 slots.
-- Probability of no collision for first 6 entries=?
Step-1: According to given data,
= (⁷⁵P_{6) / (75⁶)
= 0.814586387
Step-2: We have to find at least one collision occurs in 6 entries
=1-Probability of no collision for first 6 entries
= 1-0.814586387
= 0.185413613
Note: Given options are wrong. Given option-B is correct answer according to original key.}

→ Blind carbon copy(BCC) is a useful way to let others see an email you sent without the main recipient knowing. It is faster than sending the original message and then forwarding the sent message to the other recipients. It is also good netiquette to use Bcc when copying a message to many people.

→ Hub is a term used with a star networks. When compare to switch, it is not an intelligent device.

→ The amount of uncertainty in a system of symbol is called entropy. → Generally we can call entropy is disorder or uncertainty.

An X.25 WAN consists of packet-switching exchange (PSE) nodes as the networking hardware, and leased lines, plain old telephone service connections, or ISDN connections as physical links.

→ Hot-potato routing is the practice of passing traffic off to another autonomous system as quickly as possible, thus using their network for wide-area transit. → Cold-potato routing is the opposite, where the originating autonomous system holds onto the packet until it is as near to the destination as possible.

Start and stop bits are used in serial communications for Synchronization.

→ Software Requirement Specification(SRS) establishes the basis for agreement between client and the supplier. It provides a reference for validation of the final product. SRS is a prerequisite to high quality software.
→ The system is considered as a black box whose internal details are not known that is, only its visible external (input/output) behavior is documented.
→ The Software Requirement Specification(SRS) is said to be Consistent if and only if no subset of individual requirements described in it conflict with each other.

Cyclomatic complexity uses 3 formulas
1. Number of regions + 1
2. Predicate + 1
3.Edges-Vertices+2(Connected components)
As per the above question, c=cyclomatic complexity
e=number of edges
n=number of vertices
p=predicates

Software maintenance is the modification of a software product after delivery to correct faults, to improve performance or other attributes.
Software maintenance types: 1. Adaptive: modifying the system to cope with changes in the software environment (DBMS, OS)
2. Perfective: Implementing new or changed user requirements which concern functional enhancements to the software.
3. Corrective: Diagnosing and fixing errors, possibly ones found by users.
4. Preventive: Increasing software maintainability or reliability to prevent problems in the future.

Design recovery from source code is done during reverse engineering, re-engineering and reusability.

→ 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.
→ As regression test suites tend to grow with each found defect, test automation is frequently involved.

Post order traversal tree is look like

Postorder: DEBFCA
Inorder: DBEAFC
Preorder: ABDECF

In B+ trees it is easy to reduce the number of last level access from the disk when the disk size is too large.

→ PACK statement removes all records marked for deletion permanently.
→ DELETE statement is used to delete existing records in a table.
→ ZAP deletes the entire file except the file structure.

SET ALTERNATE: Controls the recording of input and output in an alternate text file.
Syntax:
SET ALTERNATE on | OFF
SET ALTERNATE TO [ | ? | [ADDITIVE]]
→ The default for SET ALTERNATE is OFF. To change the default, set the ALTERNATE parameter in the [OnOffSetting Settings] section of PLUS.ini. To set a default file name for use with SET ALTERNATE, specify an ALTERNATE parameter in the [Command Settings] section of PLUS.ini.
→ Issuing SET ALTERNATE OFF does not close the alternate file. Before accessing the contents of an alternate file, formally close it with CLOSE ALTERNATE or SET ALTERNATE TO (with no file name). This ensures that all data recorded by dBASE Plus for storage in the alternate file is transferred to disk, and automatically turns SET ALTERNATE to OFF.

→ Hardware failure, encryption and decryption is not related to data security threats.
→ Privacy invasion and fraudulent manipulation of data is related to data security threats. But fraudulent manipulation of data is most appropriate answer.

Here, EOF means End of File. When structure of database file with 20 records is modified then ?EOF will prints value is T. Here, T means TRUE.

Since the query is co-related that is same table is being used two times for comparison so compare each entry of table T with every entry of table S. Then the outcome for above query will be

So the output contains all branches that have greater asset than any branch located in DELHI.

Dijkstra's banking algorithm in an operating system, solves the problem of deadlock avoidance.

Probability of events for a Poisson distribution:
An event can occur 0, 1, 2, … times in an interval. The average number of events in an interval is designated (lambda). is the event rate, also called the rate parameter. The probability of observing k events in an interval is given by the equation
P(k events in interval)=e^-λ [(λ^k)/k!]
Where
→ λ is the average number of events per interval
→ e is the number 2.71828... (Euler's number) the base of the natural logarithms
→ k takes values 0, 1, 2, …
→ k! = k × (k − 1) × (k − 2) × … × 2 × 1 is the factorial of k.
→ Now it is given that in 1 hour (60 minutes) 20 requests are made
→ In 1 minute number of requests made= 20/60
→ In 45 minutes total number of requests made = (20/60) * 45
= 15
Probability= (e^-15 *(15)⁰) / 0!
= e^-15

A cylinder of data having maximum amount of information that is available in one portion of the disk access arm for a removal disk pack (without further movement of the arm with multiple heads).

Since we know page and frame both have the same size and since page size is given as 1024 words, it means frame size is of 1024 i.e. 2¹⁰. Hence to uniquely identify each word inside a frame 10-bits are needed.
→ Number of frames is given as 32 i.e 2⁵. So each frame can be uniquely identified using 5-bits.
→ Hence the total number of bits needed to identify a word inside memory is 5+10 = 15 bits.

A central processing unit (CPU) is the electronic circuitry within a computer that carries out the instructions of a computer program by performing the basic arithmetic, logical, control and input/output (I/O) operations specified by the instructions.

= If an integer needs two bytes of storage, then the maximum value of a signed integer is 2^n-1 -1
= 2¹⁵ -1

Negative numbers can be represented in
1. Signed magnitude form
2. 1’s complement form
3. 2’s complement form

The frequency reuse factor is related to cluster size then the frequency reuse factor=1/N

In Programming languages like C,C++ and Java we can write X-=Y+1 into X=X-Y+1
Note: X*=Z+1 → X=X*Z+1
X/=Z+1 → X=X/Z+1
X+=Z+1 → X=X+Z+1

Handoff is the mechanism that transfer an ongoing call from one base station to another.
→ Hard handover (or) Hard Handoff: Early systems used hard handoff. In a hard handoff, a mobile station only communicates with one base station. When the MS moves from one cell to another, communication must first be broken with the previous base station before communication can be established with the new one.
→ Soft handover (or) Soft Handoff: New systems use a soft Handoff. In this case, a mobile station can communicate with base stations at the same time. This means that, during handoff, a mobile station may continue with the new base station before breaking off from the old one.

Context-free languages are closed under Union,Concatenation and Kleene closure.
Context-free languages are not closed under set difference,Complementation and intersection.

→ Hackers,Viruses and identity theft are real security and privacy risks.
→ Spam is not related to real security and privacy risk.
Note: Spam is nothing but unwanted message(or) mail.

FALSE: The ATM adaptation layer is service dependent.
TRUE: Logical connections in ATM are referred to as virtual channel connections.
TRUE: ATM is streamlined protocol with minimal error and flow control capabilities
TRUE: ATM is also known as cell delays.

Software Risk estimation involves risk probability and risk impact.
→ Risk impact factors are
1. Negligible [low]
2. Marginal
3. Critical
4. Catastrophic [High]
→ Risk exposure:
RE=P*C
P=The probability of occurrence for a risk
C=The cost to the project should the risk actually occur

→ The number of bits required for an IPv6 address is 128.
→ The number of bits required for an IPv4 address is 32

Hence Option-B is correct answer

Enterprise Resource Planning (ERP) is automate and integrates the majority of business processes. ERP is the integrated management of core business processes, often in real-time and mediated by software and technology.

TRUE: It attempts to automate and integrate the majority of business processes.
TRUE: It shares common data and practices across the enterprise.
FALSE: It is expensive to implement.
TRUE: It provides and access information in a real-time environment.

All are correct.

Web Mining is used to filtering information,online transaction processing and click stream analysis.

A telephone conference call is an example of same time / different place type of communications.

Probability of getting a number = 1/10
Probability of not getting a number = 1- 1/(10) = 9/10
Now probability that correct number is chosen in first chance= 1/10
probability that correct number is chosen in second chance= (9/10)* (1/10)
probability that correct number is chosen in first chance= (9/10)* (9/10) *(1/10)
So total probability = (1/10)+ [(9/10)* (1/10) ]+ [(9/10)* (9/10) *(1/10)]
= (1/10)+(9/100)+(81/1000)
= 271/1000
Note: Excluded for evaluation because given options are wrong

The number of nodes in a complete binary tree of height h (with roots at level 0) is equal to 2⁰ + 2¹ + ….. 2^h. because every phase we are getting 2^h.
Suppose, in level-3, it have 2³=8 nodes.