Target
Technotask Business Solutions Interview Questions and Answers
Q1. Which scrolling option is the best for e-retail websites? Vertical scrolling or horizontal product scrolling or each product on a different page or something else?
Vertical scrolling is the best option for e-retail websites.
Vertical scrolling is more intuitive and easier to use for most users.
Horizontal scrolling can be confusing and frustrating for users.
Each product on a different page can lead to slower load times and more clicks for users.
Infinite scrolling can be a good option for some e-retail websites.
Consider the type of products being sold and the user experience when deciding on scrolling options.
Q2. What factors can you think of which will determine the pricing of product on our e-retail website?
Factors affecting pricing of products on e-retail website
Cost of production
Competitor pricing
Demand and supply
Target audience
Marketing and advertising costs
Q3. The ones i remember- Dbms: What is normalization? Different forms of normalization. Some joins related questions. Oops: access modifiers, abstract classes
Questions on DBMS and OOPs concepts
Normalization is the process of organizing data in a database to reduce redundancy and dependency.
Different forms of normalization include 1NF, 2NF, 3NF, BCNF, and 4NF.
Join is used to combine rows from two or more tables based on a related column between them.
Access modifiers in OOPs are public, private, protected, and default.
Abstract classes are classes that cannot be instantiated and are used as a base class for other classes.
Q4. reverse a linked list two sum indexin no sql vs sql access specifiers
The question is about reversing a linked list.
Iterative approach: Use three pointers to reverse the links between nodes.
Recursive approach: Recursively reverse the rest of the list and then fix the links.
Example: Given a linked list 1 -> 2 -> 3 -> 4, the reversed list will be 4 -> 3 -> 2 -> 1.
Q5. Level order traversal of a tree
Level order traversal is a tree traversal algorithm that visits nodes level by level.
Start at the root node and add it to a queue.
While the queue is not empty, remove the first node from the queue and add its children to the queue.
Repeat until the queue is empty.
The order in which nodes are visited is the level order traversal.
Q6. Sort an array of 0s and 1s
Sort an array of 0s and 1s
Use two pointers, one at the beginning and one at the end
Swap 0s from the beginning with 1s from the end until pointers meet
Time complexity: O(n)
Top HR Questions asked in Technotask Business Solutions
Interview Process at Technotask Business Solutions
Top Software Engineer Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month