RUBRIK INDIA Full Stack Developer Interview Questions and Answers

Q1. Apply for angular ui developer interview is very simple just recap your javascript basic to advanced and angular basic concepts deeply
Add your answer
Q2. Router components service angular performance optimization how to scale app, security
Ans. 
Optimizing Angular app performance and security with router components and services
• Use lazy loading to improve performance

• Implement caching for frequently accessed data

• Use Angular Universal for server-side rendering

• Implement HTTPS and secure authentication for security

• Use guards and interceptors to protect routes and prevent unauthorized access
Answered by AI
Add your answer

Q1. Salary negotiation and work experience
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions on DSA, Programming and OOPS.

Q1. 
Implement strstr() Function in C Problem Statement
Given two strings A and B, find the index of the first occurrence of A in B. If A is not present in B, return -1.
Example:
Input:
A = "bc", B = "abcdd...read more
Ans. 
Implement the strstr() function in C to find the index of the first occurrence of one string in another.
• Iterate through the main string and check if the substring matches at each position.

• Return the index if a match is found, else return -1.

• Handle edge cases like empty strings or when the substring is longer than the main string.
Answered by AI
Add your answer
Q2. What happens when we try to access a null pointer in C?
Ans. 
Accessing a null pointer in C results in a segmentation fault, as the program tries to access memory at address 0.
• Attempting to dereference a null pointer will result in a segmentation fault, as the program tries to access memory at address 0.

• It is important to always check if a pointer is null before attempting to access its value.

• Example: int *ptr = NULL; printf('%d', *ptr); // This will result in a segmentation faul
Answered by AI
Add your answer
Q3. What are the phases of a compiler?
Ans. 
Phases of a compiler include lexical analysis, syntax analysis, semantic analysis, optimization, and code generation.
• Lexical analysis: Converts source code into tokens.

• Syntax analysis: Checks the syntax of the code using a grammar.

• Semantic analysis: Checks the meaning of the code.

• Optimization: Improves the code for efficiency.

• Code generation: Generates machine code or intermediate code.
Answered by AI
Add your answer
Q4. What is a system stack?
Ans. 
A system stack is a data structure that stores information about the active subroutines of a computer program.
• A system stack typically consists of a stack of frames, each representing a subroutine call.

• The stack grows and shrinks as subroutines are called and returned.

• The top of the stack points to the currently executing subroutine.

• Common operations on a system stack include push (adding a new frame) and pop (removing
Answered by AI
Add your answer
Q5. 
Count Set Bits Problem Statement
Given an integer N, for each integer from 0 through N, find and print the number of set bits (1s) present in its binary representation.
Example:
Input:
N = 5
Output:
...read more
Ans. 
Count the number of set bits in binary representation of integers from 0 to N.
• Iterate through integers from 0 to N and count the number of set bits in their binary representation.

• Use bitwise operations to check if a bit is set in the binary representation.

• Return the count of set bits for each integer in the range.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions on DSA, Programming and OOPS.

Q1. 
Inorder Traversal of a Binary Tree Without Recursion
You are provided with a binary tree consisting of 'N' nodes, where each node contains an integer value. Your task is to perform the In-Order traversal ...read more
Ans. 
Perform In-Order traversal on a binary tree without recursion.
• Use a stack to simulate the recursive process of In-Order traversal.

• Start with the root node and keep traversing left until reaching a null node, pushing nodes onto the stack.

• Pop nodes from the stack, print the value, and move to the right child if it exists.

• Repeat until the stack is empty and all nodes have been visited.
Answered by AI
Add your answer
Q2. 
Detect Loop in Singly Linked List
Determine if a given singly linked list of integers contains a cycle.
Explanation:
A cycle in a linked list occurs when a node's next points back to a previous node in ...read more
Ans. 
Detect if a singly linked list has a cycle by using Floyd's Cycle Detection Algorithm.
• Use Floyd's Cycle Detection Algorithm to detect a cycle in a singly linked list.

• Maintain two pointers, one moving at twice the speed of the other.

• If there is a cycle, the two pointers will eventually meet.

• If one of the pointers reaches the end of the list (null), there is no cycle.
Answered by AI
Add your answer
Q3. What is an interrupt?
Ans. 
An interrupt is a signal sent to the CPU to alert it of an event that needs immediate attention.
• Interrupts can be generated by hardware devices or software programs.

• They can be used to handle events such as keyboard input, mouse clicks, or network activity.

• Interrupts can be classified as hardware interrupts, software interrupts, or exceptions.

• Examples of interrupts include the timer interrupt, which is used for multita...read more
Answered by AI
Add your answer
Q4. What is the CSMA protocol?
Ans. 
CSMA stands for Carrier Sense Multiple Access. It is a protocol used in network communication to avoid collisions.
• CSMA allows devices to listen to the network before transmitting data to avoid collisions.

• If a device senses that the network is busy, it waits for a random amount of time before attempting to transmit.

• CSMA/CD (Collision Detection) is a variant of CSMA used in Ethernet networks.

• CSMA/CA (Collision Avoidance)
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Typical Managerial round.

Round duration - 60 minutes
Round difficulty - Easy

This was the first technical round.

Q1. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. 
Reverse a singly linked list of integers and return the head of the reversed linked list.
• Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

• Keep track of the previous, current, and next nodes while reversing the linked list.

• Update the head of the reversed linked list as the last node encountered during reversal.
Answered by AI
View 1 more answer
Q2. 
LCA of Binary Tree Problem Statement
You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...read more
Ans. 
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
• Traverse the binary tree to find the paths from the root to nodes X and Y.

• Compare the paths to find the last common node, which is the LCA.

• Handle cases where one node is an ancestor of the other.

• Consider edge cases like when X or Y is the root node.

• Implement a recursive or iterative solution to find the LCA efficiently.
Answered by AI
Add your answer
Q3. What is internal fragmentation?
Ans. 
Internal fragmentation occurs when allocated memory is larger than the requested memory, leading to wasted space.
• Internal fragmentation is common in memory management systems.

• It occurs when a block of memory is allocated to a process, but the process does not use all of the allocated memory.

• This results in wasted space within the allocated block.

• For example, if a process requests 100 bytes of memory but is allocated a ...read more
Answered by AI
Add your answer
Q4. Which part of memory stores uninitialized static and global variables?
Ans. 
BSS segment in memory stores uninitialized static and global variables.
• BSS segment stands for 'Block Started by Symbol' and is a section of memory where uninitialized static and global variables are stored.

• Variables declared with the 'static' keyword or as global variables without initialization are stored in the BSS segment.

• For example, int a; or static int b; would be stored in the BSS segment.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions on DSA, OS, OOPS etc.

Q1. 
Integer Square Root Calculation
Given a positive integer 'N', compute its square root and return it. If 'N' is not a perfect square, then return the floor value of sqrt(N).
Example:
Input:
N = 25
N = 20
N...read more
Ans. 
Calculate the square root of a positive integer and return the floor value if not a perfect square.
• Use the sqrt() function to calculate the square root of the given integer.

• If the square root is not an integer, return the floor value using floor() function.

• Handle constraints such as the range of 'N' and the number of test cases.
Answered by AI
Add your answer
Q2. Where does the returned value for the 'main' function go?
Ans. 
The returned value for the 'main' function goes to the operating system.
• The returned value is typically an integer representing the exit status of the program.

• A return value of 0 usually indicates successful execution, while non-zero values indicate errors.

• The operating system can use the return value to determine the success or failure of the program.
Answered by AI
Add your answer
Q3. What is a segmentation fault?
Ans. 
A segmentation fault is a type of error that occurs when a program tries to access a memory location that it is not allowed to access.
• Occurs when a program tries to access memory outside of its allocated space

• Usually caused by bugs in the code such as accessing an uninitialized pointer or writing past the end of an array

• Can lead to program crashes or unexpected behavior

• Example: Accessing an element beyond the bounds of
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was a typical managerial round.