i
Nippon Data Systems
Filter interviews by
State management is the process of maintaining the state of controls and variables across postbacks. Page life cycle is the sequence of events that occur during the processing of a page.
ASP .Net provides various techniques for state management such as view state, session state, application state, and cookies.
View state is used to maintain the state of controls between postbacks.
Session state is used to maintain the sta...
Stored Procedure is a precompiled SQL code that can be reused and executed multiple times.
Improves performance by reducing network traffic and server load
Enhances security by allowing access to only specific procedures
Simplifies maintenance and debugging
Examples: sp_insert_employee, sp_update_customer_details
Abstract class is a class that cannot be instantiated and Interface is a blueprint of a class. Static classes are used for utility functions.
Abstract class is used to provide a common base for its subclasses.
Interface is used to define a set of methods that a class must implement.
Static classes are used for utility functions that do not require an instance of the class.
Static classes cannot be instantiated and all memb
Out is used to return multiple values from a method while ref is used to pass a reference of a variable to a method.
Out parameters must be initialized inside the method before returning.
Ref parameters can be initialized before passing to the method.
Out parameters are used when a method needs to return multiple values.
Ref parameters are used when a method needs to modify the value of a variable passed to it.
Polymorphism is the ability of an object to take on many forms.
It allows objects of different classes to be treated as if they were objects of the same class.
It is achieved through method overriding and method overloading.
Example: A parent class Animal can have child classes like Dog, Cat, and Bird, each with their own unique implementation of the method 'makeSound'.
Polymorphism makes code more flexible and reusable.
Overloading is having multiple methods with the same name but different parameters. Overriding is having a method in a subclass with the same name and parameters as in the superclass.
Overloading is compile-time polymorphism while overriding is runtime polymorphism.
Overloading is used to provide different ways of calling the same method while overriding is used to provide a specific implementation of a method in a subcl...
View state is a feature in ASP .NET that allows the state of a web page to be saved and restored between postbacks.
View state is used to maintain the state of server-side controls between postbacks
It is stored in a hidden field on the page
View state can be disabled to improve performance
View state can also be encrypted for security purposes
Temporary table and table variable are used to store data temporarily in SQL.
Temporary tables are created in tempdb and are automatically dropped when the session ends.
Table variables are created in memory and have a limited scope.
Temporary tables can be used to store large amounts of data and perform complex operations.
Table variables are useful for storing small amounts of data and can improve performance.
Both can be...
Operator overloading is the ability to redefine operators for custom classes.
Allows operators to be used with user-defined types
Enables the use of familiar operators with custom classes
Can improve code readability and reduce complexity
Example: '+' operator can be overloaded to concatenate strings
It depends on the complexity of the authentication process and the technology stack used.
I would need to understand the requirements and design of the login page.
I would need to know the technology stack being used.
If there are any existing authentication systems that can be integrated.
If there are any security requirements that need to be considered.
On average, it could take anywhere from a few hours to a few days to
I applied via Naukri.com and was interviewed in Mar 2021. There were 4 interview rounds.
Top trending discussions
posted on 21 Nov 2020
posted on 11 Mar 2022
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process
Track the time taken to rot all oranges and return -1 if any fresh oranges remain
Handle edge cases like no fresh oranges or all oranges already rotten
Consider using a queue to efficiently process adjacent oranges
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Find the majority element in an array, return -1 if no majority element exists.
Iterate through the array and keep track of the count of each element using a hashmap.
Check if any element's count is greater than floor(N/2) to determine the majority element.
Return the majority element or -1 if no majority element exists.
You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...
Find the maximum path sum between two leaf nodes in a binary tree.
Traverse the tree to find the maximum path sum between two leaf nodes.
Keep track of the maximum sum found so far.
Consider all possible paths between leaf nodes.
Handle cases where the tree has only a single leaf node.
Implement a recursive function to calculate the maximum path sum.
Round duration - 60 minutes
Round difficulty - Medium
This was a technical round with DSA based questions.
You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.
If the given list is (1 -> -2 -&g...
Find the N-th node from the end of a Singly Linked List of integers.
Traverse the list to find the length L of the list.
Calculate the position of the N-th node from the beginning as L - N + 1.
Traverse the list again to reach the calculated position and return the node's value.
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...
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 or when one node is the LCA itself.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.
Split the input string by spaces to get individual words
Reverse the list of words
Join the reversed words with a single space in between
Handle leading/trailing spaces by stripping them before and after reversing
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA
Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...
Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.
Sort subjects in descending order
Assign subjects to friends one by one until all subjects are assigned
The maximum workload will be the sum of problems assigned to the friend with the most problems
Return the maximum workload as the minimum time required
Grammar in compiler design defines the syntax and structure of a programming language.
Grammar specifies the rules for forming valid statements in a programming language.
It consists of a set of production rules that define how valid programs can be constructed.
There are different types of grammars such as context-free grammar, regular grammar, etc.
Example: In C programming language, the grammar specifies that a for loop...
A token in compiler design is a basic unit of syntax that the compiler can understand and process.
Tokens are the smallest units of a program that are meaningful to the compiler.
Examples of tokens include keywords, identifiers, operators, and punctuation symbols.
Tokens are generated by the lexical analysis phase of the compiler.
Tokens are used by the parser to build the abstract syntax tree of the program.
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.
Traverse the binary tree from root to leaf nodes, keeping track of the current path sum
Add the current path sum to the total sum when reaching a leaf node
Use modulo (10^9 + 7) to handle large outputs
A regular language is a language that can be recognized by a finite automaton.
Regular languages can be described by regular expressions.
Regular languages are closed under union, concatenation, and Kleene star operations.
Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.
NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.
NP problems can be verified in polynomial time but not necessarily solved in polynomial time.
NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.
Examples of NP problems include the subset sum problem and the traveling salesm...
Round duration - 30 minutes
Round difficulty - Easy
That was the round for which I’ve been waiting for hours
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
posted on 20 Apr 2022
I applied via Recruitment Consulltant and was interviewed before Apr 2021. There was 1 interview round.
NoSQL databases are non-relational databases that store and retrieve data in a non-tabular format.
Document-oriented databases (MongoDB, Couchbase)
Key-value stores (Redis, Riak)
Column-family stores (Cassandra, HBase)
Graph databases (Neo4j, OrientDB)
Scaling refers to the process of increasing or decreasing the capacity of a system to handle more or less load.
Vertical Scaling: Adding more resources to a single node
Horizontal Scaling: Adding more nodes to a system
Load Balancing: Distributing the load across multiple nodes
Database Sharding: Splitting a database into smaller parts to distribute the load
Caching: Storing frequently accessed data in memory for faster acc
I applied via Recruitment Consultant and was interviewed in May 2019. There were 3 interview rounds.
I applied via Approached by Company and was interviewed before Apr 2021. There were 2 interview rounds.
I applied via Campus Placement and was interviewed in Oct 2020. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Nov 2020. There were 5 interview rounds.
posted on 27 Jul 2022
I applied via Campus Placement and was interviewed before Jul 2021. There were 5 interview rounds.
Round 1 was about 60 mins long. Basic Aptitude questions along with Programming MCQ
Round 2 had 2 coding questions with a time limit of 60mins. Intermediate level problem solving
knowledge is neccessary.
Some of the top questions asked at the Nippon Data Systems Software Engineer interview -
based on 5 reviews
Rating in categories
Software Developer
55
salaries
| ₹2 L/yr - ₹8 L/yr |
Software Engineer
47
salaries
| ₹3.5 L/yr - ₹9 L/yr |
Senior Software Developer
28
salaries
| ₹5.4 L/yr - ₹9.7 L/yr |
Senior Software Engineer
28
salaries
| ₹5 L/yr - ₹12.6 L/yr |
Developer
27
salaries
| ₹3.7 L/yr - ₹6 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant