Answer:
3. ReFS
Explanation:
Only in ReFS include and others do not have all of the below features
1. Automatic integrity checking and data scrubbing
2. Removal of the need for running chkdsk
3. Protection against data degradation
4. Built-in handling of hard disk drive failure and redundancy
5. Integration of RAID functionality
6. A switch to copy/allocate on write for data and metadata updates
7. Handling of very long paths and filenames
8. Storage virtualization and pooling
The answer is b becuase a daily blog is a daily journal
00110001 00110100 00110000
Answer:
The correct answer for the given question is option(d).
Explanation:
Solution Explorer is found in Microsoft Visual Studio.When we create a project in the c# or another programming language the solution explorer window is used. The Solution Explorer takes care of the projects and files.
Solution Explorer displays an overall view of the current project. In the Solution Explorer we can delete or add the file in the project. The Solution Explorer window displays the list that is contained in the current solution.
- Option(a),Option(b) and Option(c) are the incorrect option for the Solution Explorer window.
- So, Option(d) is the correct answer for the solution explorer.
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.
