Siksha O Anusandhan University Assistant Professor Interview Questions and Answers

Q1. Your marks in 10 ,12, graduation m.tech, phd
Ans. 
My marks are as follows: 10th - 90%, 12th - 85%, Graduation - 88%, M.Tech - 92%, PhD - 95%.
• 10th - 90%

• 12th - 85%

• Graduation - 88%

• M.Tech - 92%

• PhD - 95%
Answered by AI
Add your answer
Q2. What are your two favourite subjects
Ans. 
My two favorite subjects are Mathematics and Computer Science.
• I enjoy the problem-solving aspect of Mathematics and the logical thinking it requires.

• Computer Science allows me to apply my mathematical skills to real-world problems and create innovative solutions.

• I have taken advanced courses in both subjects during my academic career.

• I have also conducted research projects in areas related to Mathematics and Computer S
Answered by AI
Add your answer

Java coding mostly string based

Q1. Tell me about yourself.
Ans. Answer about your experience, projects, papers and educational background.
Answered Anonymously
Add your answer
Q2. They provide you a topic beforehand, you need to prepare an online presentation based on that topic and your will be asked questions around that topic. Interview is simple.
Add your answer
Q3. You might also be required to implement a coding question which could be either to implement a data structure like heap, tree etc, or to implement some algorithm. If you just know the algorithm or the conc...read more
Add your answer

Q1. I was asked to print a triangular pattern
Ans. 
To print a triangular pattern, use nested loops to iterate through rows and columns.
• Use two nested loops to iterate through rows and columns

• Print spaces for the first half of each row and asterisks for the second half

• Decrease the number of spaces and increase the number of asterisks for each row
Answered by AI
Add your answer
Q2. Reverse an array in optimized manner.
Ans. 
Reverse an array of strings in an optimized manner.
• Use two pointers, one at the beginning and one at the end, and swap the elements until they meet in the middle.

• Avoid using extra memory by swapping the elements in-place.

• Time complexity: O(n/2)
Answered by AI
Add your answer