Microsoft office wizard guides you thought the steps to complete a complex task
Answer:
option d is the correct answer
Answer:
#include <iostream>
using namespace std;
int main() {
int a[4][5];//declaring a matrix of 4 rows and 5 columns.
for(int i=0;i<4;i++)
{
for(int j=0;j<5;j++)
{
if(i==3)//initializing last row as 0.
{
a[i][j]=0;
}
else//initializing last row as 1.
{
a[i][j]=1;
}
}
}
for(int i=0;i<4;i++)
{
for(int j=0;j<5;j++)
cout<<a[i][j]<<" ";//printing the matrix.
cout<<endl;
}
return 0;
}
Output:-
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
0 0 0 0 0
Explanation:
I have created a matrix of size 4 rows and 5 columns.I have used for loops to fill the array.To fill the last row with 0 i have used if statement.else we are filling it with 1.
Answer:
The simple algorithm is described below
Explanation:
assign all men and women as free
while some man m is free do
w = highest ranked women on m's list
if w is free
then m proposes w and m and w are engaged
else if w is not free and with m1
and if w picks m over m1
then w and m are engaged
free m1
end
output all the pairs
Answer:
<u>the answer is O(1)</u>
Explanation:
A priority queue is a type of queue whereby each of the elements are linked with a priority and the elements are served according to their priority.
The word enqueue means to add elements to the back of the queue
<em><u>For this question, while using an unordered list, O(1) is the big-O complexity of the enqueue operation. O(1) is a natural Choice for queues.</u></em>
