Tata Group
ENROOT KNOWLEDGE SOLUTIONS Interview Questions and Answers
Q1. Cloud computing application in real world in project
Cloud computing is widely used in various industries for data storage, processing, and analysis.
Cloud computing allows for easy scalability and cost-effectiveness in managing large amounts of data.
Real-time collaboration and access to data from anywhere are some of the benefits of cloud computing.
Examples of cloud computing applications in real-world projects include Amazon Web Services (AWS), Microsoft Azure, and Google Cloud Platform.
In healthcare, cloud computing is used f...read more
Q2. What are pointers in c?
Pointers are variables that store memory addresses of other variables in C programming language.
Pointers are used to manipulate data structures like arrays, linked lists, and trees.
They can be used to pass values by reference to functions.
Pointers can also be used to allocate memory dynamically using functions like malloc() and calloc().
Q3. What is array?? Detail in programming
An array is a collection of similar data types stored in contiguous memory locations.
Arrays can be one-dimensional or multi-dimensional
Elements in an array can be accessed using their index
Arrays can be initialized during declaration or later in the code
Arrays can be passed as arguments to functions
Example: int arr[5] = {1, 2, 3, 4, 5};
Example: char str[10] = "Hello";
Q4. Applications of data structures
Data structures are used to organize and manipulate data efficiently in various applications.
Data structures are used in databases to store and retrieve data quickly.
In computer graphics, data structures are used to represent geometric objects.
Data structures are used in algorithms such as sorting and searching.
In networking, data structures are used to represent network packets and routing tables.
Data structures are used in artificial intelligence and machine learning for ef...read more
Q5. Write a linked list program.
A linked list program is a data structure that stores a sequence of elements with pointers to the next element.
Create a Node class with a value and a next pointer
Create a LinkedList class with a head pointer and methods to add, remove, and traverse nodes
Example: LinkedList ll = new LinkedList(); ll.add(5); ll.add(10); ll.remove(5);
Q6. Algorithm for merge sort
Merge sort is a divide and conquer algorithm that recursively divides the input array into two halves, sorts them and then merges them.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Repeat until the entire array is sorted
Top Software Engineer Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month