Time in transit would be correct
Answer:
A. 0
Explanation:
The technician should configure the RAID 0 for Joe.
RAID 0 also referred to as the striped volume or stripe set is configured to allow the fastest speed and the most storage capacity by splitting data evenly across multiple (at least two) disks, without redundancy and parity information.
Also, RAID 0 isn't fault tolerant, as failure of one drive will cause the entire array to fail thereby causing total data loss.
Answer:
If all the character pairs match after processing both strings, one string in stack and the other in queue, then this means one string is the reverse of the other.
Explanation:
Lets take an example of two strings abc and cba which are reverse of each other.
string1 = abc
string2 = cba
Now push the characters of string1 in stack. Stack is a LIFO (last in first out) data structure which means the character pushed in the last in stack is popped first.
Push abc each character on a stack in the following order.
c
b
a
Now add each character of string2 in queue. Queue is a FIFO (first in first out) data structure which means the character inserted first is removed first.
Insert cba each character on a stack in the following order.
a b c
First c is added to queue then b and then a.
Now lets pop one character from the stack and remove one character from queue and compare each pair of characters of both the strings to each other.
First from stack c is popped as per LIFO and c is removed from queue as per FIFO. Then these two characters are compared. They both match
c=c. Next b is popped from stack and b is removed from queue and these characters match too. At the end a is popped from the stack and a is removed from queue and they both are compared. They too match which shows that string1 and string2 which are reverse of each other are matched.
Answer:
The program is written using PYTHON SCRIPT below;
N=int(input(" Enter number of Rows you want:"))
M=[] # this for storing the matrix
for i in range(N):
l=list(map(int,input("Enter the "+str(i+1)+" Row :").split()))
M.append(l)
print("The 2D Matrix is:\n")
for i in range(N):
print(end="\t")
print(M[i])
W=[] # to store the first non zero elemnt index
T=[] # to store that value is positive or negative
L=len(M[0])
for i in range(N):
for j in range(L):
if (M[i][j]==0):
continue
else:
W.append(j) # If the value is non zero append that postion to position list(W)
if(M[i][j]>0): #For checking it is positive or negative
T.append(+1)
else:
T.append(-1)
break
print()
print("The first Non Zero element List [W] : ",end="")
print(W)
print("Positive or Negative List [T] : ",end="")
print(T)
Explanation:
In order for the program to determine a set of test cases it takes in input of 2D matrix in an N numbet of rows.
It goes ahead to program and find the column index of the first non-zero value for each row in the matrix A, and also determines if that non-zero value is positive or negative. The If - Else conditions are met accordingly in running the program.
Make the zig zag part more spaced out