Netaji Subhas Institute of Technology (NSIT) Placement Interview Questions

Round duration - 90 minutes
Round difficulty - Easy

Timing - 10AM-11:30AM
Online proctored test

• Q1. Binary Tree Right View Problem Statement Given a binary tree of integers, your task is to print the right view of it. The right view represents a set of nodes ...read more
  View Answers (1)
• Q2. 0/1 Knapsack Problem Statement A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the...read more
  View Answers (1)

Round duration - 45 minutes
Round difficulty - Medium

Timing : 4PM-5PM
Environment - Online

There was a panel of 3 interviewers

• Q1. How can you find the size of an array in C or C++ without using sizeof or any standard function?
  View Answers (1)
• Q2. Explain how indexing in a database works using B+ trees.
  View Answers (1)

Round duration - 45 mintues
Round difficulty - Easy

Timing - 11AM-12:15PM
Environment - online video call

Again there was a panel of 2 senior engineers

• Q1. Maximum Path Sum Problem Statement You are given an n-ary tree consisting of 'N' nodes. Your task is to determine the maximum sum of the path from the root to ...read more
  View Answers (1)