Riverbed Technology Member Technical Staff Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Easy

Th interviewer asked me questions related to various topics of OS, Data Structures and Algorithm.
Tips: Have a strong hold on topics of OS like segmentation and buddy systems.

Q1. What is segmentation?
Ans. 
Segmentation is the process of dividing a larger entity into smaller parts or segments.
• Segmentation is commonly used in image processing to separate objects of interest from the background.

• It is also used in marketing to divide a target market into smaller groups based on demographics, behavior, or other factors.

• In networking, segmentation refers to dividing a network into smaller subnetworks to improve performance and
Answered by AI
Add your answer
Q2. What are the advantages and disadvantages of the buddy system?
Ans. 
The buddy system has advantages like increased safety and support, but also drawbacks like dependency and lack of independence.
• Advantages: increased safety, support, accountability, motivation

• Disadvantages: dependency, lack of independence, potential for conflicts

• Example: In a buddy system at work, colleagues can support each other in completing tasks and provide motivation to stay on track.

• Example: However, relying to...read more
Answered by AI
Add your answer
Q3. What is a page fault?
Ans. 
A page fault occurs when a program tries to access a page of memory that is not currently in physical RAM.
• Occurs when a program tries to access a page of memory not in physical RAM

• Results in the operating system needing to retrieve the page from disk

• Can lead to a temporary pause in program execution
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The round consisted of questions of heap, Towers of hanoi and other questions related to CV.
Tips: Time complexity analysis of Towers of Hanoi Problem is important. Good skillset in DS and Algorithms, Bit Manipulation.

Q1. 
Tower of Hanoi Problem Statement
You have three rods numbered from 1 to 3, and 'N' disks initially stacked on the first rod in increasing order of their sizes (largest disk at the bottom). Your task is to...read more
Ans. 
Tower of Hanoi problem where 'N' disks need to be moved to another rod following specific rules in less than 2^N moves.
• Implement a recursive function to move disks from one rod to another following the rules.

• Use the concept of recursion and backtracking to solve the Tower of Hanoi problem efficiently.

• Maintain a count of moves and track the movement of disks in a 2-D array/list.

• Ensure that larger disks are not placed on...read more
Answered by AI
Add your answer
Q2. 
Convert Array to Min Heap Task
Given an array 'ARR' of integers with 'N' elements, you need to convert it into a min-binary heap.
A min-binary heap is a complete binary tree where each internal node's va...read more
Ans. 
Convert the given array into a min-binary heap by modifying the array elements.
• Iterate through the array and heapify each node starting from the last non-leaf node to the root node.

• For each node, compare it with its children and swap if necessary to satisfy the min-heap property.

• Continue this process until the entire array is converted into a min-heap.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

The HR asked about my hobbies, extra curricular activities and checked my personality.