i
Onward Technologies Inc
Filter interviews by
I applied via Naukri.com and was interviewed in Aug 2022. There was 1 interview round.
Data storage classes in C++
C++ provides several data storage classes, including 'auto', 'register', 'static', 'extern', and 'mutable'.
The 'auto' storage class is the default and is used for local variables.
The 'register' storage class is used to define local variables that should be stored in CPU registers for faster access.
The 'static' storage class is used for variables that retain their values across function calls.
...
OOP's concepts include encapsulation, inheritance, and polymorphism.
Encapsulation: Bundling data and methods together in a class.
Inheritance: Creating new classes from existing ones, inheriting their properties and behaviors.
Polymorphism: Objects of different classes can be treated as objects of a common superclass.
Example: A class 'Car' encapsulates data like 'color' and methods like 'startEngine'.
Example: Class 'SUV'...
Static polymorphism is resolved at compile-time, while runtime polymorphism is resolved at runtime.
Static polymorphism is achieved through function overloading and operator overloading.
Runtime polymorphism is achieved through virtual functions and function overriding.
Static polymorphism is faster as it is resolved at compile-time, while runtime polymorphism incurs overhead at runtime.
Static polymorphism is also known a...
Smart pointers are objects that manage the lifetime of dynamically allocated memory in C++.
Smart pointers automatically deallocate memory when it is no longer needed.
They prevent memory leaks and dangling pointers.
Examples of smart pointers in C++ are unique_ptr, shared_ptr, and weak_ptr.
New and delete operators are used for dynamic memory allocation in C++.
New operator is used to allocate memory dynamically for an object or an array.
Delete operator is used to deallocate the memory allocated by new operator.
New operator returns a pointer to the allocated memory.
Delete operator takes a pointer to the memory to be deallocated.
If delete is called on a null pointer, no action is taken.
Programs related to class and OOP
Create a class with attributes and methods
Implement inheritance and polymorphism
Use encapsulation to hide data
Demonstrate the concept of abstraction
Create objects and call their methods
I applied via Naukri.com and was interviewed before Apr 2021. There were 2 interview rounds.
I applied via Naukri.com and was interviewed before Nov 2021. There were 3 interview rounds.
Top trending discussions
I applied via Naukri.com and was interviewed in May 2021. There was 1 interview round.
I applied via Naukri.com and was interviewed before Jan 2021. There were 3 interview rounds.
The question covers various topics related to software development and testing.
SDLC stands for Software Development Life Cycle and is a process followed for software development.
STLC stands for Software Testing Life Cycle and is a process followed for software testing.
Agile is a software development methodology that emphasizes on iterative and incremental development.
Different types of testing include unit testing, int...
I applied via Walk-in and was interviewed before Jun 2021. There were 3 interview rounds.
Quantitative ability and logical ability
I am proficient in Java and Python.
Strong understanding of object-oriented programming concepts
Experience with Java frameworks such as Spring and Hibernate
Proficient in Python libraries such as NumPy and Pandas
Program to print HCF of numbers as output
Take input of two numbers from user
Find the smaller number between the two
Run a loop from 1 to the smaller number
Check if both numbers are divisible by the current loop variable
If yes, update the HCF variable
Print the HCF as output
I appeared for an interview in Sep 2020.
I applied via Approached by Company and was interviewed before May 2021. There were 3 interview rounds.
Multiple choice questions
I appeared for an interview before Oct 2021.
A nested list is a list that contains other lists as its elements.
Nested lists can be created using square brackets and separating the elements with commas.
Elements of a nested list can be accessed using indexing and slicing.
Example: my_list = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
Accessing element 5: my_list[1][1]
A queue is a data structure that follows the First In First Out (FIFO) principle.
Elements are added to the back of the queue and removed from the front.
Example: A line of people waiting for a movie ticket.
Operations: Enqueue (add element to back), Dequeue (remove element from front), Peek (view front element)
based on 3 interviews
Interview experience
based on 29 reviews
Rating in categories
Design Engineer
662
salaries
| ₹2.2 L/yr - ₹9.2 L/yr |
Senior Design Engineer
333
salaries
| ₹4 L/yr - ₹10.3 L/yr |
Software Engineer
225
salaries
| ₹1.9 L/yr - ₹11.5 L/yr |
Senior Software Engineer
167
salaries
| ₹5.3 L/yr - ₹22 L/yr |
Project Lead
163
salaries
| ₹5.5 L/yr - ₹16.3 L/yr |
Xoriant
Photon Interactive
CitiusTech
Iris Software