Rrootshell Technologiiss Software Developer Interview Questions and Answers

DSA ques were moderate and aptitude ques were also asked

Q1. DSA ques on array was asked
Add your answer
Q2. DSA ques on graph
Add your answer

Q1. Bascic html and django questions
Add your answer

Waste of time and energy sql queries

Q1. Salary negotation and location details
Add your answer

It is consisting of 5 questions,and each question carry 20 marks.difficulaty level of the question is easy to moderate.

Q1. They were asking mainy DSA, project,and internship
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Timing: Morning
How was the environment? It happened in the Computer Lab of my institution
All students were assigned a computer and we had to solve questions on hackerrank

Q1. Order of People Heights
There are ‘N’ people numbered from 0 to N - 1, standing in a queue. You are given two arrays ‘Height’ and ‘Infront‘ consisting of ‘N’ non-negative integers. ‘Height[i]’ gives the he...read more
Ans. 
The task is to find the actual order of people in a queue based on their heights and the number of taller people in front of them.
• Iterate through the given arrays and create a list of tuples containing the height and number of taller people for each person.

• Sort the list of tuples in descending order of height and ascending order of the number of taller people.

• Create an empty result list and insert each tuple into the r...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Round was a mix of concepts from OOPS, OS and Problem Solving

Q1. Find a value in BST
You have been given a Binary Search Tree and a key value ‘X’, find if a node with value ‘X’ is present in the BST or not.
Note:
You may assume that duplicates do not exist in the tree...read more
Ans. 
The task is to find if a given value is present in a Binary Search Tree (BST).
• Start from the root node and compare the value with the target value.

• If the value matches, return true.

• If the target value is less than the current node value, move to the left child.

• If the target value is greater than the current node value, move to the right child.

• Repeat the process until a match is found or a leaf node is reached.

• If a leaf...read more
Answered by AI
Add your answer

4 Easy to Medium Leetcode Type Questions on Signal Hire Platform

Q1. Not Selected as all Girls were only selected in OA
Add your answer

Leetcode live coding with team members

How do u design the network as per the cloud customer requirements

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions on OOPS and OS mainly.

Q1. CS Fundamentals Question
What is Little and Big Endian?
Ans. 
Little and big endian are two ways of storing multibyte data-types ( int, float, etc). In little endian machines, last byte of binary representation of the multibyte data-type is stored first. On the other hand, in big endian machines, first byte of binary representation of the multibyte data-type is stored first.
Answered Anonymously
Add your answer
Q2. CS Fundamentals Question
Program to determine if your system is little or big endian
Ans. 
#include <bits/stdc++.h>
using namespace std;

int main()
{
	if constexpr (endian::native == endian::big)
		cout << "big-endian";
	else if constexpr (endian::native == endian::little)
		cout << "little-endian";
	else
		cout << "mixed-endian";
}
Answered Anonymously
Add your answer
Q3. OOPS Question
What is a volatile keyword?
Ans. 
The volatile keyword is intended to prevent the compiler from applying any optimizations on objects that can change in ways that cannot be determined by the compiler. 
Objects declared as volatile are omitted from optimization because their values can be changed by code outside the scope of current code at any time. The system always reads the current value of a volatile object from the memory location rather than ...read more
Answered Anonymously
Add your answer
Q4. C Question
What is the use of a function pointer in C?
Ans. 
In the C function pointer is used to resolve the run time-binding. A function pointer is a pointer that stores the address of the function and invokes the function whenever required.
Answered Anonymously
Add your answer
Q5. Data Structure Question
Design data structure to implement multi threading.
Ans. 
If you're doing lots of reads and writes on it, a ConcurrentHashMap is possibly the best choice, if it's mostly reading, a common Map wrapped inside a collection using a ReadWriteLock (since writes would not be common, you'd get faster access and locking only when writing).
Collections.synchronizedMap() is possibly the worst case, since it might just give you a wrapper with all methods synchronized, avoid it at all cost
Answered Anonymously
Add your answer
Q6. Operating System Question
What does a kernel do?
Ans. 
Kernel acts as a bridge between applications and data processing performed at hardware level using inter-process communication and system calls.
Kernel loads first into memory when an operating system is loaded and remains into memory until operating system is shut down again. It is responsible for various tasks such as disk management, task management, and memory management.
Answered Anonymously
Add your answer
Q7. OOPS Question
What is a storage class?
Ans. 
Storage Classes are used to describe the features of a variable/function. These features basically include the scope, visibility and life-time which help us to trace the existence of a particular variable during the runtime of a program. To specify the storage class for a variable, the following syntax is to be followed:
Syntax: storage_class var_data_type var_name;
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.