Answer:
b) false
Explanation:
We know that Otto cycle is the ideal cycle for all petrol working engine.In Otto cycle all process are consider is ideal ,means there is no any ir-reversibility in the processes.
It consist four processes
1-2:Reversible adiabatic compression
2-3:Constant volume heat addition
3-4:Reversible adiabatic expansion
3-4:Constant volume heat rejection
Along with above 4 processes intake and exhaust processes are parallel to each other.From the P-v diagram we can see that all processes.
But actually in general we are not showing intake and exhaust line then it did not mean that in Otto cycle did not have intake and exhaust processes.
Answer:
Explanation:
ADT for an 2-D array:
struct array{
int arr[10];
}arrmain[10];
An application that stores an array with 1000 rows and 1000 columns, where less than 10,000 of the array values are non-zero. The two different implementations for such arrays that would be more space efficient than a standard two-dimensional array implementation requiring one million positions are :
1) struct array{
int *p;
}arr[1000];
2) struct array{
int *p;
}arr[1000];
Answer:
See explaination
Explanation:
#include <iostream>
#include<string.h>
using namespace std;
bool isPalindrome(string str, int lower, int upper){
if(str.length() == 0 || lower>=upper){
return true;
}
else{
if(str.at(lower) == str.at(upper)){
return isPalindrome(str,lower+1,upper-1);
}
else{
return false;
}
}
}
int main(){
string input;
cout<<"Enter string: ";
cin>>input;
if(isPalindrome(input,0,input.length()-1)){
cout<<input<<" is a palindrome"<<endl;
}
else{
cout<<input<<" is NOT a palindrome"<<endl;
}
return 0;
}
Answer:
At the point when the quantity of bit strings is not exactly the quantity of processors, at that point a portion of the processors would stay inert since the scheduler maps just part strings to processors and not client level strings to processors. At the point when the quantity of part strings is actually equivalent to the quantity of processors, at that point it is conceivable that the entirety of the processors may be used all the while. Be that as it may, when a part string obstructs inside the portion (because of a page flaw or while summoning framework calls), the comparing processor would stay inert. When there are more portion strings than processors, a blocked piece string could be swapped out for another bit string that is prepared to execute, in this way expanding the use of the multiprocessor system.When the quantity of part strings is not exactly the quantity of processors, at that point a portion of the processors would stay inert since the scheduler maps just bit strings to processors and not client level strings to processors. At the point when the quantity of bit strings is actually equivalent to the quantity of processors, at that point it is conceivable that the entirety of the processors may be used at the same time. Be that as it may, when a part string hinders inside the piece (because of a page flaw or while summoning framework calls), the relating processor would stay inert. When there are more portion strings than processors, a blocked piece string could be swapped out for another bit string that is prepared to execute, along these lines expanding the usage of the multiprocessor framework.
