Tip 1: Be consistent.
Tip 2: Prepare daily.
Tip 3: Focus more on problem-solving.
Tip 1: Don't include clumsy details or things that could irritate the interviewer. Using a simple font will help make a good impression.
Tip 2: Include only what you truly know on your resume.
Tip 3: Use an Applicant Tracking System (ATS) when creating your resume.
MCQs and pseudocode on Aptitude, C++, and Java.
The train is coming this way, and this train is going in the opposite direction. At what time will they meet?
BinarySearch(ARR, X, LOW, HIGH)
repeat till LOW = HIGH
MID = (LOW + HIGH)/2
if (X == ARR[mid])
return MID
else if (x > ARR[MID])
LOW = MID + 1
else
HIGH = MID – 1
Prepare Basic Algorithms
Integer x, y
Set x = 15, y = 12
y = x – 1
do{
Print x
x = y + (x – 2)
}
while(x < 40)
end do while
What is output of this code
Firstly, variables x and y are initialized. Then, x and y are assigned the values 15 and 12, respectively. Next, y is assigned the value of x - 1. Then, print the value of x, which is 15. The do-while loop runs until x is less than 40. Inside the loop, x is updated with the value of y + x - 2, and then x is printed. The order in which the value of x changes is as follows: 15, then 27 (14 + 15 - 2), then 39 (14 + 27 - 2), then 51 (14 + 39 - 2), and finally, the do-while loop terminates.
Given three questions on coding.
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Can you solve this problem in O(N) time and O(1) space complexity?
The idea is to reverse the links of all nodes using three pointers:
prev: pointer to keep track of the previous node
curr: pointer to keep track of the current node
next: pointer to keep track of the next node
Starting from the first node, initialize curr with the head of linked list and next with the next node of curr. Update the next pointer of curr with prev. Finally, move the three pointer by updating prev with curr and curr with next.
What is CCNA?
What is packet? (Learn)
Tip 1: Do problems on the Coding Ninjas platform.
I was asked to introduce myself, share my screen, and write code in various languages mentioned in my resume. I was also asked SQL queries and some aptitude problems.
F(n) = F(n-1) + F(n-2),
Where, F(1) = F(2) = 1.
For ‘N’ = 5, the output will be 5.
Use recursion to solve this problem because any Fibonacci number nnn depends on the previous two Fibonacci numbers. Therefore, this approach repeatedly breaks down the problem until it reaches the base cases.
Recurrence relation:
Base case: F(n)=nF(n) = nF(n)=n, when n=0n = 0n=0 or n=1n = 1n=1 Recursive case: F(n)=F(n−1)+F(n−2)F(n) = F(n-1) + F(n-2)F(n)=F(n−1)+F(n−2) for n>1n > 1n>1
Prime Number Program
The idea to solve this problem is to iterate through all the numbers starting from 2 up to (N/2) using a for loop. For each number, we check if it divides N. If we find any number that divides N, we return false. If we do not find any number between 2 and N/2 that divides N, it means N is prime, and we will return true.
Write an SQL query to retrieve the OrderID, CustomerName, and OrderDate from the Orders and Customers tables. The query should display only the records where there is a match between the CustomerID in both tables using an INNER JOIN.
Tip 1: The concept of Joins is a must.
Write an SQL query to retrieve the ProductID, ProductName, and CategoryName from the "Products" and "Categories" tables, where the "CategoryID" matches in both tables.
SELECT ProductID, ProductName, CategoryName
FROM Products
INNER JOIN Categories ON Products.CategoryID = Categories.CategoryID;
Tip 1: Basic concepts must be clear.
More about projects and company-based questions.
What is your project and how many test cases has it passed?
Why Cisco, what our company will do? And questions about the agreement were asked.
My project is on the IR sensor. Actually, my project focuses on preventing accidents at U-turns by using the IR sensor to indicate the opposite side. He asked, 'When you are implementing this in a public place where there are four sides, and vehicles are coming from all four directions, what will you do?'
Tip 1: Be confident in the projects.
HR round questions
Asked about the company.
Tip 1: Be prepared for HR questions.
Seven people can complete the work in seven minutes. If eleven people do the work, in how much time will it be completed?
Tip 1: See logic-based questions.
How would you cope with a situation in which you realize you made a serious error at work?
Tip 1: Be prepared for HR questions.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL keyword removes duplicate records from a result set?