Answer: C) Canonicalization error
Explanation:
Canonicalization error is the error or fault that occurs when data is changed into canonical form or standard form that persist different representation.This can create fault when different filenames or structure is assigned to data and canonization cannot take place as it works for simple data representation.
- Other options are incorrect because static buffer flow is stable writing or reading of data that reaches outside the buffer boundary.Index error is accessing of index by any user that is found beyond the index's list boundary.
- Heap overflow is the stack gets overlowed outside the boundary while overwriting heap.Thus, the correct option is option(C).
Answer:
If no values in WHERE clauses match the result of the selector in the CASE clause, the sequence of statements in the ELSE clause executes. ... When the IF THEN statement has no ELSE clause and the condition is not met, PL/SQL does nothing instead raising an error.
Explanation:
Answer:
It affects the system speed
Explanation:
The normal windows server OS can run the regular workstation applications like the MS Office or the Adobe Photoshop. Photoshop is an editor that have one of its function as being an editor that helps to edit the picture itself by changing the pixels or edit anything in the image.
On the other hand, Ms Office would help to crop or resize or adjust the brightness etc.
When it comes to cropping or reducing/increasing the brightness of the images then Office is of agreat help as it is free where as for photo shop advanced editing to the images can be done.There is the situation where both needs to be used.
Also running both the application on a egular workstation would make the system slow and also both the applications would not be required at the same time at many times.
Answer:
True
Explanation:
Enterprise resource planning is the integration of various corporate functions using information technology. The main objective of a small or large manufacturing company's ERP project is to track its supply chain activities from inventory purchase to processing and final shipment to customers.
Answer:
You can simplify the problem down by recognizing that you just need to keep track of the integers you've seen in array that your given. You also need to account for edge cases for when the array is empty or the value you get would be greater than your max allowed value. Finally, you need to ensure O(n) complexity, you can't keep looping for every value you come across. This is where the boolean array comes in handy. See below -
public static int solution(int[] A)
{
int min = 1;
int max = 100000;
boolean[] vals = new boolean[max+1];
if(A.length == 0)
return min;
//mark the vals array with the integers we have seen in the A[]
for(int i = 0; i < A.length; i++)
{
if(A[i] < max + 1)
vals[A[i]] = true;
}
//start at our min val and loop until we come across a value we have not seen in A[]
for (int i = 1; i < max; i++)
{
if(vals[i] && min == i)
min++;
else if(!vals[i])
break;
}
if(min > max)
return max;
return min;
}
