61. What will be the output of the following C++ code?
#include <cmath>
#include <iostream>
using namespace std;
void Cipher(string str)
{
int r, c;
for (int i = 0; str[i]; i++)
{
r = ceil((str[i] - 'a') / 5) + 1;
c = ((str[i] - 'a') % 5) + 1;
if (str[i] == 'k')
{
r = r - 1;
c = 5 - c + 1;
}
else if (str[i] >= 'j')
{
if (c == 1)
{
c = 6;
r = r - 1;
}
c = c - 1;
}
cout << r << c;
}
cout << endl;
}
int main()
{
string str = "nsit";
Cipher(str);
}
#include <cmath>
#include <iostream>
using namespace std;
void Cipher(string str)
{
int r, c;
for (int i = 0; str[i]; i++)
{
r = ceil((str[i] - 'a') / 5) + 1;
c = ((str[i] - 'a') % 5) + 1;
if (str[i] == 'k')
{
r = r - 1;
c = 5 - c + 1;
}
else if (str[i] >= 'j')
{
if (c == 1)
{
c = 6;
r = r - 1;
}
c = c - 1;
}
cout << r << c;
}
cout << endl;
}
int main()
{
string str = "nsit";
Cipher(str);
}
62. Which of the following is similar to Euclidean distance?
63. What is the space complexity of floyd's cycle finding algorithm?
64. What will be the cut vertex set of the graph given below?

65. What is the LCM of two coprime numbers?
66. Floyd's cycle detection algorithm is also called the 'tortoise and hare algorithm'.
67. Which of the following algorithms is the simplest?
68. How many Hamiltonian paths does the following graph have?

69. How many conditions have to be met if an NP- complete problem is polynomially reducible?
70. Which of the following problems is similar to that of a Hamiltonian path problem?
Read More Section(Miscellaneous on Data Structures)
Each Section contains maximum 100 MCQs question on Miscellaneous on Data Structures. To get more questions visit other sections.
- Miscellaneous on Data Structures - Section 1
- Miscellaneous on Data Structures - Section 2
- Miscellaneous on Data Structures - Section 3
- Miscellaneous on Data Structures - Section 4
- Miscellaneous on Data Structures - Section 5
- Miscellaneous on Data Structures - Section 6
- Miscellaneous on Data Structures - Section 7
- Miscellaneous on Data Structures - Section 8
- Miscellaneous on Data Structures - Section 9
- Miscellaneous on Data Structures - Section 10
- Miscellaneous on Data Structures - Section 11