Answer:
False
Explanation:
namespaces can be nested. That is we can have a hierarchy of namespaces.
For examples suppose we have a namespace top. Within this we have another namespace first. At the next level we have a namespace called second. Then we have a class MyClass as a member of this namespace second. Then the complete description of the class will be as follows:
top::first::second::MyClass
Answer:
// program in C++.
// headers
#include <bits/stdc++.h>
using namespace std;
// main function
int main()
{
// Variable
int num;
cout << "Enter a number between 1 and 10: ";
// read input
cin >> num;
// validate input number
while(num<1||num>10)
{
// if input is wrong then print error message
cout<<"Wrong input!!Enter again:";
// read again
cin>>num;
}
// print output
cout << "The Roman numeral for "<<num<<" is:";
// switch
switch (num)
{
case 1:
// if input is 1
cout<<"I"<<endl;
// exit the switch
break;
case 2:
// if input is 2
cout<<"II"<<endl;
// exit the switch
break;
case 3:
// if input is 3
cout<<"III"<<endl;
// exit the switch
break;
case 4:
// if input is 4
cout<<"IV"<<endl;
// exit the switch
break;
case 5:
// if input is 5
cout<<"V"<<endl;
// exit the switch
break;
case 6:
// if input is 6
cout<<"VI"<<endl;
// exit the switch
break;
case 7:
// if input is 7
cout<<"VII"<<endl;
// exit the switch
break;
case 8:
// if input is 8
cout<<"VIII"<<endl;
// exit the switch
break;
case 9:
// if input is 9
cout<<"IX"<<endl;
// exit the switch
break;
case 10:
// if input is 10
cout<<"X"<<endl;
// exit the switch
break;
// default
default:
break;
}
return 0;
}
Explanation:
Read a number from usr and assign it to variable "num". If the input number is less than 1 or greater than 10 then ask again to enter a number until user enter a number between 1-10 only.Then with the help of switch() function print the equivalent Roman number.
Output:
Enter a number between 1 and 10: -5
Wrong input!!Enter again:12
Wrong input!!Enter again:6
The Roman numeral for 6 is:VI
Answer:
Difference between Queue and Stack are as following:-
- Queue is a FIFO(First In First Out) type data structure while Stack is a LIFO(Last In First Out) type data structure.
- The insertion and deletion of elements from the queue happens from two ends insertion at the tail and deletion from the front.While the insertion and deletion from stack happens from one end only that is top.
- The insertion and deletion operation in queue are referred as enqueue and dequeue. While in stack they are referred as push and pop respectively.
Answer: D. Searches for a file only in the directories that are in the path variable
