i
Dixit Infotech Services
Filter interviews by
I applied via Naukri.com and was interviewed before May 2023. There were 2 interview rounds.
Oracle database architecture consists of multiple components like instance, memory structures, and physical storage.
Oracle database architecture includes instance, memory structures, and physical storage.
Instance consists of background processes and memory structures like SGA and PGA.
Physical storage includes data files, control files, and redo log files.
Oracle database architecture allows for scalability, high availab
Top trending discussions
posted on 10 Nov 2015
I appeared for an interview before Oct 2020.
Round duration - 40 minutes
Round difficulty - Medium
Asked about time complexity of algorithm, puzzles, DBMS, cutting edge technologies etc. What are indexes?
Given an array of integers ARR
of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.
Consider flipping a sub-array from index i to j and calculate the count of 1s in the resulting array.
Return the maximum count of 1s obtained by flipping a sub-array at most once.
Round duration - 20 minutes
Round difficulty - Medium
Asked 1 standard algorithm
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.
Mark visited cells to avoid redundant traversal.
Increment island count whenever a new island is encountered.
Tip 1 : prepare for competitive programming
Tip 2 : know about standard algorithm
Tip 3 : must be good with dbms
Tip 1 : must have projects, which you can explain to them
Tip 2 : have things on resume, that you are totally certain about.
I applied via Naukri.com and was interviewed in Oct 2020. There was 1 interview round.
I applied via Campus Placement and was interviewed in Dec 2021. There was 1 interview round.
I am a software engineer with expertise in developing and maintaining software applications.
Proficient in programming languages such as Java, C++, and Python
Experienced in developing web applications using frameworks like Spring and Django
Skilled in database management and SQL queries
Familiar with software development methodologies like Agile and Scrum
Strong problem-solving and analytical skills
Excellent communication
Output details of recent 10 graduates from a table storing student details.
Sort the table by graduation date in descending order.
Select the top 10 rows from the sorted table.
Output the selected rows.
Optimized approach to find third largest element from array using half traversal.
Sort the array in descending order and return the element at index 2.
Use a max heap to keep track of the top 3 elements while traversing the array.
Use two variables to keep track of the second and third largest elements while traversing the array.
Divide the array into two halves and find the maximum and second maximum in each half, then co
Answering how to print first character of words in a string using one stack and an array.
For using one stack, push each character onto the stack and pop when a space is encountered. Print the popped character.
For using an array, split the string into words and print the first character of each word.
In both cases, handle edge cases like empty string and string with only one word.
Hash table. No, it is not possible to create a data structure with all operations in O(1) time.
Hash table uses a hash function to map keys to indices in an array.
Insertion and deletion can be done in O(1) time on average.
Search retrieval can also be done in O(1) time on average.
However, worst-case scenarios can result in O(n) time complexity.
It is not possible to create a data structure with all operations in O(1) time
ACID properties ensure database transactions are reliable. Two transactions can occur simultaneously using locking and isolation.
ACID stands for Atomicity, Consistency, Isolation, and Durability.
Atomicity ensures that a transaction is treated as a single unit of work, either all or none of it is executed.
Consistency ensures that a transaction brings the database from one valid state to another.
Isolation ensures that co...
Indexes are used to improve query performance. Multiple clustered and non-clustered indexes can be created on a table.
Indexes are used to quickly locate data without scanning the entire table.
Clustered index determines the physical order of data in a table.
Non-clustered index is a separate structure that contains a copy of the indexed columns and a pointer to the actual data.
A table can have only one clustered index, b...
Given an array and a number, find if the number can be generated using sum of array members and output those numbers.
Iterate through the array and check if the number can be generated using the sum of array members
Use a hash table to store the difference between the number and each array element
If the difference is found in the hash table, output the corresponding array elements
If no such combination is found, output '
Time complexity of data structure operations
Arrays: O(1) for access, O(n) for search/insert/delete
Linked Lists: O(n) for access/search, O(1) for insert/delete
Stacks/Queues: O(1) for access/insert/delete
Hash Tables: O(1) for access/insert/delete (average case)
Trees: O(log n) for access/search/insert/delete (balanced)
Heaps: O(log n) for access/insert/delete
Graphs: Varies depending on algorithm used
Span is an inline element used for styling small portions of text, while div is a block-level element used for grouping and styling larger sections of content.
Span is an inline element, div is a block-level element
Span is used for styling small portions of text, div is used for grouping larger sections of content
Span does not create a new line, div creates a new block-level element
I appeared for an interview in Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
A time range is given you can attempt with in that time and once started you cant resume .
Given a string STR
containing both lowercase and uppercase letters, the task is to sort the string so that the resulting string contains uppercase and lower...
Sort a string with alternate lowercase and uppercase letters in sorted order.
Create two separate arrays for lowercase and uppercase letters.
Sort both arrays individually.
Merge the two arrays alternately to form the final sorted string.
Given a string containing only parentheses and letters, your goal is to remove the minimum number of invalid parentheses to make the input string valid and return all possible v...
Given a string with parentheses and letters, remove minimum invalid parentheses to make it valid and return all possible valid strings.
Use BFS to explore all possible valid strings by removing parentheses one by one
Keep track of visited strings to avoid duplicates
Return all unique valid strings obtained after removing minimum number of parentheses
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.
Start with base cases F(1) and F(2) as 1, then iterate to calculate F(N) efficiently.
Time complexity can be optimized to O(N) using dynamic programming.
Example: For N = 5, the 5th Fibonacci number is 5.
Given a non-negative integer 'K', determine the Kth row of Pascal’s Triangle.
K = 2
1 1
K = 4
1 4 6 ...
To find the Kth row of Pascal's Triangle given a non-negative integer K.
Create an array to store the values of the Kth row of Pascal's Triangle
Use the formula C(n, k) = C(n-1, k-1) + C(n-1, k) to calculate the values
Return the array as the output
Tip 1 : Basics of java should be clear
Tip 2 : Do maximum question on strings and array
Tip 1 : Atleast 1 good project
Tip 2 : Good ranks on websites like hackerrank , leetcode.
I applied via Campus Placement and was interviewed in Oct 2023. There were 5 interview rounds.
There were 19 questions consists of aptitude and technical subject. Then 2 codes were there . Then 1 code of SQL query .
Generate all permutations of a given string using recursion and backtracking.
Use recursion to generate all possible permutations of the string.
Use backtracking to backtrack and explore all possible combinations.
Store each permutation in an array of strings.
I applied via Campus Placement and was interviewed before Apr 2023. There were 2 interview rounds.
Simple DBMS and DSA Questions
based on 1 interview
Interview experience
Desktop Support Engineer
222
salaries
| ₹1.7 L/yr - ₹4.2 L/yr |
Technical Support Engineer
39
salaries
| ₹1.8 L/yr - ₹4.5 L/yr |
Desktop Support Engineer L2
37
salaries
| ₹2.5 L/yr - ₹4.6 L/yr |
System Administrator
31
salaries
| ₹2.5 L/yr - ₹6 L/yr |
Desktop Engineer
29
salaries
| ₹1.1 L/yr - ₹4.5 L/yr |
Foray Software
Black Knight
MAQ Software
ESDS Software Solutions