i
K L
University
Work with us
Filter interviews by
Dynamic Regional Manager with over 10 years of experience in driving sales and team performance in the North East region.
Proven track record of increasing regional sales by 30% year-over-year through strategic planning and execution.
Led a team of 15 sales representatives, providing mentorship and training that resulted in a 25% improvement in team performance.
Implemented customer feedback systems that enhanced client s...
I can handle a significant number of admissions in Engineering, focusing on quality and efficiency.
Experience managing large teams, e.g., overseeing 50+ admissions staff.
Implemented streamlined processes, increasing admissions by 30% in one year.
Utilized data analytics to track and improve admission rates.
Established partnerships with local schools to boost outreach and admissions.
Top trending discussions
posted on 18 Jul 2021
I believe in the importance of organic and sustainable agriculture for the health of our planet and future generations.
Organic agriculture avoids the use of harmful pesticides and fertilizers, which can contaminate soil and water sources.
Sustainable agriculture practices help to preserve natural resources and reduce waste.
Supporting local and organic farmers can also have positive impacts on the economy and community.
E...
Yes, I have conducted experiments on tomato plants.
I conducted an experiment on the effect of different fertilizers on tomato plant growth.
I also experimented with different watering schedules and their impact on tomato yield.
I kept detailed records of the growth and yield of each plant to analyze the results.
The experiment helped me understand the importance of proper fertilization and watering for crop growth.
posted on 29 Aug 2024
Test of Excel knowledge
I applied via Campus Placement and was interviewed before Jun 2023. There was 1 interview round.
I applied via Referral and was interviewed in Sep 2023. There were 3 interview rounds.
posted on 16 Apr 2021
I applied via Company Website and was interviewed in Mar 2021. There was 1 interview round.
posted on 15 Jul 2022
I applied via Recruitment Consulltant and was interviewed in Jun 2022. There were 2 interview rounds.
posted on 11 Jul 2023
I applied via Walk-in
posted on 16 Aug 2023
I applied via Walk-in and was interviewed before Aug 2022. There were 3 interview rounds.
My PhD research area was in the field of computational biology.
I focused on developing algorithms to analyze genomic data and identify genetic variations associated with diseases.
I used machine learning techniques to predict protein structures and functions.
I collaborated with biologists and statisticians to integrate multiple data types and improve the accuracy of genomic predictions.
I published several papers in repu...
IoT stands for Internet of Things. It refers to the network of physical devices, vehicles, appliances, and other objects that are embedded with sensors, software, and connectivity to exchange data.
IoT enables devices to communicate and interact with each other over the internet.
Main challenges of IoT include security and privacy concerns.
Other challenges include scalability, interoperability, and data management.
Exampl...
The basic architectural design of a microprocessor includes components such as the control unit, arithmetic logic unit, registers, and memory.
The control unit manages the execution of instructions and coordinates the activities of other components.
The arithmetic logic unit performs mathematical and logical operations.
Registers store data and instructions temporarily during processing.
Memory stores data and instructions...
posted on 1 Aug 2025
I appeared for an interview before Aug 2024, where I was asked the following questions.
MST algorithms find the minimum spanning tree in a weighted graph, connecting all vertices with the least total edge weight.
MST stands for Minimum Spanning Tree, which connects all vertices in a graph with the minimum total edge weight.
Common algorithms include Prim's and Kruskal's algorithms.
Prim's algorithm starts from a vertex and grows the MST by adding the smallest edge from the tree to a new vertex.
Kruskal's algo...
A red-black tree is a balanced binary search tree with specific properties to ensure efficient operations.
Each node is colored either red or black.
The root node is always black.
Red nodes cannot have red children (no two reds in a row).
Every path from a node to its descendant leaves has the same number of black nodes.
This structure ensures O(log n) time complexity for insertion, deletion, and search operations.
Floyd-Warshall algorithm finds shortest paths in a weighted graph with positive or negative edge weights.
Dynamic programming approach to find shortest paths between all pairs of vertices.
Time complexity is O(V^3), where V is the number of vertices.
Works with graphs that have negative weights but no negative cycles.
Example: In a graph with vertices A, B, C, the algorithm updates paths like A->C via B if A->B + B-&...
A Binary Search Tree (BST) is a data structure that maintains sorted order for efficient searching, insertion, and deletion operations.
A BST is a binary tree where each node has at most two children.
The left child of a node contains only nodes with values less than the node's value.
The right child contains only nodes with values greater than the node's value.
Example: In a BST with values 10, 5, and 15, 5 is the left ch...
Assistant Professor
232
salaries
| ₹5.7 L/yr - ₹12 L/yr |
Associate Professor
80
salaries
| ₹9.9 L/yr - ₹16 L/yr |
Student Counsellor
26
salaries
| ₹2 L/yr - ₹6 L/yr |
Professor
21
salaries
| ₹12.6 L/yr - ₹20 L/yr |
HR Executive
16
salaries
| ₹2 L/yr - ₹3.6 L/yr |
Aptech
Pearson Education India
Galgotias University
Empower Pragati