Honeywell Technology Solutions Interview Questions, Process, and Tips

Technical questions were easy and straight forward

Hackathon was conducted to check coding skills

Q1. Basic OS, dbms and cpp questions
Add your answer
Q2. What is oops? Explain with examples
Ans. 
OOPs stands for Object-Oriented Programming. It is a programming paradigm based on the concept of objects, which can contain data and code.
• OOPs allows for the organization of code into reusable components called objects

• It emphasizes concepts like inheritance, encapsulation, and polymorphism

• Example: Inheritance - a class 'Car' can inherit properties and methods from a class 'Vehicle'
Answered by AI
Add your answer

Q1. SQL JOINS AND QUERY
Add your answer
Q2. PYTHON BASIC QUESTIONS
Add your answer

Q1. TELL ABOUT MYSELF
Add your answer
Q2. ABOUT PROJECT FROM STRACH
Add your answer

MCQs on DSA, OOPS, SQL

Q1. What is the difference between C and C++?
Ans. 
C is a procedural programming language while C++ is an object-oriented programming language.
• C is a procedural programming language, while C++ supports both procedural and object-oriented programming paradigms.

• C does not support classes and objects, while C++ does.

• C does not have built-in support for exception handling, while C++ does.

• C does not have namespaces, while C++ does.

• C does not have function overloading, while
Answered by AI
Add your answer
Q2. What are the features of OOPS?
Ans. 
OOPS (Object-Oriented Programming) features include encapsulation, inheritance, polymorphism, and abstraction.
• Encapsulation: Bundling data and methods that operate on the data into a single unit (class).

• Inheritance: Ability to create new classes based on existing classes, inheriting their attributes and methods.

• Polymorphism: Ability to use a single interface to represent different data types or objects.

• Abstraction: Hid...read more
Answered by AI
Add your answer
Q3. Explain Linked lists and double-linked lists.
Ans. 
Linked lists are data structures where each element points to the next element, while double-linked lists have pointers to both the next and previous elements.
• Linked lists are made up of nodes, where each node contains data and a pointer to the next node.

• Double-linked lists have nodes with pointers to both the next and previous nodes, allowing for traversal in both directions.

• Example: Singly linked list: 1 -> 2 -> 3 ->...read more
Answered by AI
Add your answer
Q4. What are the types of traversals in trees?
Ans. 
Types of traversals in trees include inorder, preorder, postorder, and level order traversal.
• Inorder traversal: Visit left subtree, root, right subtree (L-R-N)

• Preorder traversal: Visit root, left subtree, right subtree (N-L-R)

• Postorder traversal: Visit left subtree, right subtree, root (L-R-N)

• Level order traversal: Visit nodes level by level from left to right
Answered by AI
Add your answer

Hackerrank test objective selenium questions

Q1. Project explain
Ans. 
I have worked on various projects involving verification and validation of software systems to ensure they meet requirements and standards.
• Led testing efforts to verify software functionality and performance

• Developed test plans and test cases based on requirements

• Analyzed test results and reported findings to stakeholders

• Collaborated with developers to resolve issues and improve software quality
Answered by AI
Add your answer
Q2. Fluent wait have you used in your project
Add your answer
Q3. Static used where
Ans. 
Static is used in programming to declare variables and functions that are accessible only within the same file.
• Static keyword is used to declare variables and functions with a local scope.

• Static variables retain their values between function calls.

• Static functions can only be called within the same file where they are declared.

• Static keyword can also be used in classes to create class-level variables and functions.
Answered by AI
Add your answer

Q1. Explain linkedlist and its advantages
Ans. 
A linked list is a data structure where each element points to the next element, allowing for dynamic size and efficient insertion/deletion.
• Each element (node) in a linked list contains data and a reference to the next node

• Advantages include dynamic size, efficient insertion/deletion, and no need for contiguous memory allocation

• Examples: Singly linked list, doubly linked list, circular linked list
Answered by AI
Add your answer