Sikkim Manipal University Assistant Lecturer Interview Questions and Answers

I am comfortable in various subjects, particularly in advanced mathematics, computer science, and educational psychology.

• Advanced Mathematics: Proficient in calculus, linear algebra, and statistics, with experience teaching these subjects at the undergraduate level.

• Computer Science: Strong background in programming languages such as Python and Java, and experience in software development and algorithms.

• Educational Psyc...read more

Deep in deep learning refers to the multiple layers of neural networks used to process complex data.

• Deep learning involves multiple layers of artificial neural networks

• These layers allow for the processing of complex data such as images, speech, and natural language

• The depth of the network allows for more accurate predictions and classifications

• Examples of deep learning applications include image recognition, speech re...read more

No, the deepness of a model depends on the complexity of the problem and the number of abstract features it needs to learn.

• The number of layers and neurons can affect the performance and accuracy of the model, but it's not the only factor.

• A simple problem may require only a few layers and neurons, while a complex problem may need more.

• The deepness of a model can also be influenced by the type of layers used, such as co...read more

Answers to various technical questions related to computer science

• Thrashing is a phenomenon in which a computer system spends more time in swapping pages than executing actual instructions

• DBMS keys include primary key, foreign key, candidate key, super key, etc.

• A foreign key is a field in a table that refers to the primary key of another table

• 3NF or Third Normal Form is a database normalization technique that ensures t...read more

Quick sort is faster for small arrays, while Merge sort is more efficient for larger arrays.

• Quick sort has an average time complexity of O(nlogn), while Merge sort has a time complexity of O(nlogn) in all cases.

• Quick sort is an in-place sorting algorithm, while Merge sort requires extra space.

• Quick sort is not stable, while Merge sort is stable.

• Quick sort is often used in practice due to its efficiency, while Merge sor...read more

I prefer classless addressing due to its flexibility and efficient use of IP addresses.

• Classless addressing allows for more efficient use of IP addresses by allowing for variable-length subnet masks.

• Classful addressing is limited to fixed-length subnet masks, which can result in wasted IP addresses.

• Classless addressing also allows for more flexibility in network design and can accommodate networks of varying sizes.

• Clas...read more