A triggering event or statement is the SQL statement that causes a trigger to be fired.
A triggering event can be an INSERT, UPDATE, or DELETE statement on a table.
A database trigger is procedural code that is automatically executed in response to certain events on a particular table or view in a database.
The trigger is mostly used for maintaining the integrity of the information on the database. For example, when a new record (representing a new worker) is added to the employees table, new records should also be created in the tables of the taxes, vacations and salaries.
Triggers can also be used to log historical data, for example to keep track of employees' previous salaries.

The Rapid Application Development (or RAD) model is based on prototyping and iterative models with no (or less) specific planning.
RAD approach to software development means putting lesser emphasis on planning tasks and more emphasis on development and coming up with a prototype

Black-box testing is a method of software testing that examines the functionality of an application without peering into its internal structures or workings.
Alpha testing uses both black and white box testing while Beta testing uses only black box testing.
Alpha testing is performed by testers who are usually internal employees of the organization

A Page replacement algorithm is an algorithm that decides which pages should be written to disk or file, when a new page needs to be allocated.
Page replacement happens when a requested page is not in memory (page fault) and a free page cannot be used to satisfy the allocation, either because there are none, or because the number of free pages is lower than some threshold.
FIFO,LRU and optimal are examples of Page replacement algorithms
Critical section is a program section that once begin must complete execution before another processor accesses the same shared resource.

Whenever the process finishes executing its final statement and asks the operating system to delete it by using exit() system call.
If a process terminates either normally or abnormally, then all its children have to be terminated. This concept is referred to as cascading termination.

Software metrics can be classified into three categories −
Product metrics − Describes the characteristics of the product such as size, complexity, design features, performance, and quality level.
Process metrics − These characteristics can be used to improve the development and maintenance activities of the software.
Project metrics − These metrics describe the project characteristics and execution. Examples include the number of software developers, the staffing pattern over the life cycle of the software, cost, schedule, and productivity.

TRUE: Statement I: Conservative 2 PL is a deadlock-free protocol.
TRUE: Statement II: Thomas's write rule enforces conflict serializability.
TRUE: Statement III: Timestamp ordering protocol ensures serializability based on the order of transaction timestamps.

Hidden surface removal problem with minimal 3D pipeline can be solved with Window Clipping algorithm.
The z-buffer algorithm is the most widely used method for solving the hidden surface problem. It has the following major advantages over other hidden surface removal algorithms:
-No sorting is required. Models can be rendered in any order.
-No geometric intersection calculations are required. The algorithm produces the correct output even for intersecting or overlapping triangles.
-The algorithm is very simple to implement.

Disadvantages of the z-buffer algorithm include:
-A z-buffer requires a non-trivial amount of memory. For example, assuming each value in a z-buffer is a 32 bit floating point value, a rendered image that is 1024x768 pixels requires 3MB of memory to store its z-buffer.
-Every pixel of every primitive element must be rendered, even if many of them never write their color to the frame buffer.
-If two primitives are in exactly the same place in 3D space, as their positions are interpolated across their respective surfaces, the z values for each object will typically be different by a very small amount due to floating-point round-off errors. These small differences will alternate between primitives for adjacent pixels resulting in random and weird patterns in a rendering. This is called “z-fighting” and it can be avoided by never placing two primitives in the same location in 3D space.

Firmware --> ROM
Batch file --> Number of logical records into physical blocks
Packing --> ASCII format
Banker’s algorithm is a resource allocation algorithm.

Finiteness and Emptiness are not decidable

Mutation testing is a software testing type that is based on changes or mutations.
Changes are introduced into the source code to check whether the defined test cases can detect errors in the code.

Except !(num-65) can be replaced by num!=65

Load-and-go assemblers generate their object code in memory for immediate execution.
No object program is written out, no loader is needed.

Priority scheduling is CPU scheduling algorithm.
Elevator algorithm is Disk scheduling algorithm.
Stack Algorithm is Page replacement algorithm.
Havender's algorithm is Deadlock Prevention.

Alpha-beta pruning is a modified version of the minimax algorithm. It is an optimization technique for the minimax algorithm.

Alpha-beta Algorithm:
- Uses Depth first search
- only considers nodes along a single path from root at any time
α = highest-value choice found at any choice point of path for MAX (initially, α = −infinity)
β = lowest-value choice found at any choice point of path for MIN (initially, β = +infinity)
- Pass current values of α and β down to child nodes during search.
- Update values of α and β during search:
- MAX updates α at MAX nodes
- MIN updates β at MIN nodes

When to Prune:
- Prune whenever α ≥ β.
- Prune below a Max node whose alpha value becomes greater than or equal to the beta value of its ancestors.
- Max nodes update alpha based on children’s returned values. - Prune below a Min node whose beta value becomes less than or equal to the alpha value of its ancestors.
- Min nodes update beta based on children’s returned values.

Effectiveness of Alpha-Beta Search:
- Alpha/beta best case is O(b^(d/2)) rather than O(b^d)
- This is the same as having a branching factor of sqrt(b),
- (sqrt(b))^d/ = b^(d/2) (i.e., we have effectively gone from b to square root of b)
- In chess go from b ~ 35 to b ~ 6
- permitting much deeper search in the same amount of time
- In practice it is often b^(2d/3)

First instruction will take complete four cycle for execution. And then after that all 999 instruction will take only 1 cycle for execution to be completed. So time required to process 1000 instruction or data items is,
1st instruction × 4 × clock time + 999 instruction × 1 × clock time
1 × 4 × 165ns + 999 × 1 × 165ns
= 1654.95ns
= 165.5μs

Sliding window will send specified number of frames, wait for one ack for that set of frames
Given, 512 bytes x 8 bits/B = 4096 bits per frame
Transmission time to send one frame= 4096/64000 bps = 64 msec
Propagation time = 270msec
Round trip delay = (2*Propagation time)=540 msec
Transmission time + Round trip delay =604 msec
The maximum throughput is possible when Window size = [1+ 2T_propagation/T_transmission]
= (1+2*270/64)=9.43~10
= Window size =15
-The window size will give throughput as maximum bandwidth available that is 64 Kbps