Software Engineer

You are given a positive integer ‘N’. Your task is to print all prime numbers less than or equal to N.

Note: A prime number is a natural number that is divisible only by 1 and itself. Example - 2, 3, 17, etc.

You can assume that the value of N will always be greater than 1. So, the answer will always exist.

You are given an integer ‘N’, your task is to find and return the N’th Fibonacci number using matrix exponentiation.

Since the answer can be very large, return the answer modulo 10^9 +7.

Fibonacci number is calculated using the following formula:

F(n) = F(n-1) + F(n-2), 
Where, F(1) = F(2) = 1.

For Example:

For ‘N’ = 5, the output will be 5.

They asked to start questions on OOPS like:

Four Pillar of OOPS(Abstraction, Encapsulation, Polymorphism, Inheritance)
Constructor
Method Overloading
Method Overriding

After that, She asked me questions related to DBMS(Data Base Management System)

Start with Your Introduction.
What is Dbms?
SQL commands?
What is SQL?
Difference between Drop and Truncate?
SQL Injection?
Which Database do you use?