Upload Button Icon Add office photos

IDC Technologies

Compare button icon Compare button icon Compare

Filter interviews by

IDC Technologies SQL Developer Interview Questions and Answers

Updated 23 Dec 2023

IDC Technologies SQL Developer Interview Experiences

1 interview found

SQL Developer Interview Questions & Answers

user image VIJAY KUMAR MANGALI

posted on 23 Dec 2023

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
-
Result
Selected Selected
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Technical 

(2 Questions)

  • Q1. What are joins
  • Ans. 

    Joins are used to combine rows from two or more tables based on a related column between them.

    • Joins are used in SQL to retrieve data from multiple tables based on a related column between them.

    • Common types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN.

    • Example: SELECT * FROM table1 INNER JOIN table2 ON table1.column = table2.column;

  • Answered by AI
  • Q2. What is DML and use
  • Ans. 

    DML stands for Data Manipulation Language and is used to manipulate data in a database.

    • DML is used to insert, update, delete, and retrieve data in a database.

    • Examples of DML statements include INSERT, UPDATE, DELETE, and SELECT.

    • DML is essential for managing and modifying data within a database.

  • Answered by AI
Round 3 - One-on-one 

(2 Questions)

  • Q1. Explain your job experience and projects done till now
  • Q2. What is your expected salary

Skills evaluated in this interview

Interview questions from similar companies

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.

  • Q1. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain

    • Handle edge cases like no fresh oranges or all oranges already rotten

    • Consider using a queue to efficiently process adjacent oranges

  • Answered by AI
  • Q2. 

    Majority Element Problem Statement

    Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.

    Exampl...

  • Ans. 

    Find the majority element in an array, return -1 if no majority element exists.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Check if any element's count is greater than floor(N/2) to determine the majority element.

    • Return the majority element or -1 if no majority element exists.

  • Answered by AI
  • Q3. 

    Maximum Path Sum Between Two Leaves Problem Description

    You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...

  • Ans. 

    Find the maximum path sum between two leaf nodes in a binary tree.

    • Traverse the tree to find the maximum path sum between two leaf nodes.

    • Keep track of the maximum sum found so far.

    • Consider all possible paths between leaf nodes.

    • Handle cases where the tree has only a single leaf node.

    • Implement a recursive function to calculate the maximum path sum.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a technical round with DSA based questions.

  • Q1. 

    N-th Node From The End Problem Statement

    You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.

    Example:

    Input:
    If the given list is (1 -> -2 -&g...
  • Ans. 

    Find the N-th node from the end of a Singly Linked List of integers.

    • Traverse the list to find the length L of the list.

    • Calculate the position of the N-th node from the beginning as L - N + 1.

    • Traverse the list again to reach the calculated position and return the node's value.

  • Answered by AI
  • Q2. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other or when one node is the LCA itself.

  • Answered by AI
  • Q3. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.

    • Split the input string by spaces to get individual words

    • Reverse the list of words

    • Join the reversed words with a single space in between

    • Handle leading/trailing spaces by stripping them before and after reversing

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on DSA

  • Q1. 

    Minimum Time To Solve The Problems

    Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...

  • Ans. 

    Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.

    • Sort subjects in descending order

    • Assign subjects to friends one by one until all subjects are assigned

    • The maximum workload will be the sum of problems assigned to the friend with the most problems

    • Return the maximum workload as the minimum time required

  • Answered by AI
  • Q2. What is grammar in the context of compiler design?
  • Ans. 

    Grammar in compiler design defines the syntax and structure of a programming language.

    • Grammar specifies the rules for forming valid statements in a programming language.

    • It consists of a set of production rules that define how valid programs can be constructed.

    • There are different types of grammars such as context-free grammar, regular grammar, etc.

    • Example: In C programming language, the grammar specifies that a for loop...

  • Answered by AI
  • Q3. What is a token in compiler design?
  • Ans. 

    A token in compiler design is a basic unit of syntax that the compiler can understand and process.

    • Tokens are the smallest units of a program that are meaningful to the compiler.

    • Examples of tokens include keywords, identifiers, operators, and punctuation symbols.

    • Tokens are generated by the lexical analysis phase of the compiler.

    • Tokens are used by the parser to build the abstract syntax tree of the program.

  • Answered by AI
Round 4 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.

  • Q1. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current path sum to the total sum when reaching a leaf node

    • Use modulo (10^9 + 7) to handle large outputs

  • Answered by AI
  • Q2. What is a regular language?
  • Ans. 

    A regular language is a language that can be recognized by a finite automaton.

    • Regular languages can be described by regular expressions.

    • Regular languages are closed under union, concatenation, and Kleene star operations.

    • Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.

  • Answered by AI
  • Q3. What are NP and NP-Hard problems?
  • Ans. 

    NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.

    • NP problems can be verified in polynomial time but not necessarily solved in polynomial time.

    • NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.

    • Examples of NP problems include the subset sum problem and the traveling salesm...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

That was the round for which I’ve been waiting for hours 
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAccolite Digital Pvt Ltd interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Walk-in and was interviewed before Nov 2020. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. A few terms related to mutual fund industry were asked.
  • Q2. What do you understand by market capitalisation?
  • Ans. 

    Market capitalisation is the total value of a company's outstanding shares.

    • Market cap is calculated by multiplying the current stock price by the total number of outstanding shares.

    • It is used to determine the size of a company and its overall worth.

    • Companies with higher market caps are generally considered more stable and less risky investments.

    • For example, Apple Inc. has a market cap of over $2 trillion as of 2021.

    • Mar...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Be calm, confident and honest.

I applied via Referral and was interviewed in Jul 2020. There were 3 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Why do you want to join Incedo, what is your plan in future, explain your past experience with an example
  • Q2. Basic of capital market
  • Q3. Market capitalisation, capital market, derivatives, accounting knowledge

Interview Preparation Tips

Interview preparation tips for other job seekers - One should be more confident and should give prompt response

I applied via Company Website and was interviewed in Jun 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Related to react js amd js

Interview Preparation Tips

Interview preparation tips for other job seekers - Average interview. There will he two rounds technical. One will be telephonic and second will be skyp video.
Round 1 - Aptitude Test 

Learn basics of aptitude

Round 2 - Technical 

(1 Question)

  • Q1. Learn oops conceps and knowledge of coding in any language
Round 3 - HR 

(2 Questions)

  • Q1. What are your strengths and weaknesses?
  • Q2. Tell me about yourself.

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn only basic things and knowledge of any language
Interview experience
3
Average
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed before Sep 2023. There was 1 interview round.

Round 1 - One-on-one 

(4 Questions)

  • Q1. Oops question related to java
  • Q2. Project related questions
  • Q3. String based coding questions
  • Q4. Database related questions
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Explain dependency injection, indexes in sql, SOLID principles.
  • Ans. 

    Dependency injection is a design pattern where dependencies are injected into a class rather than created within the class itself.

    • Dependency injection helps in achieving loose coupling between classes.

    • It allows for easier testing and maintenance of code.

    • Example: Constructor injection, setter injection, and interface injection are common types of dependency injection.

    • Indexes in SQL are used to improve the performance of...

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed in Aug 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Laravel middleware Packages PHP OOPs MySql
Round 3 - Coding Test 

Deeply concept of PHP working

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - One-on-one 

(2 Questions)

  • Q1. Will ask sql queries
  • Q2. Oops and design pattern

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well will acknowledge within a week if selected

IDC Technologies Interview FAQs

How many rounds are there in IDC Technologies SQL Developer interview?
IDC Technologies interview process usually has 3 rounds. The most common rounds in the IDC Technologies interview process are Resume Shortlist, Technical and One-on-one Round.
What are the top questions asked in IDC Technologies SQL Developer interview?

Some of the top questions asked at the IDC Technologies SQL Developer interview -

  1. what are jo...read more
  2. what is DML and ...read more

Tell us how to improve this page.

IDC Technologies SQL Developer Interview Process

based on 2 interviews

Interview experience

4.5
  
Good
View more
IDC Technologies SQL Developer Salary
based on 6 salaries
₹2.4 L/yr - ₹8 L/yr
At par with the average SQL Developer Salary in India
View more details

IDC Technologies SQL Developer Reviews and Ratings

based on 3 reviews

5.0/5

Rating in categories

5.0

Skill development

5.0

Work-life balance

5.0

Salary

5.0

Job security

5.0

Company culture

5.0

Promotions

5.0

Work satisfaction

Explore 3 Reviews and Ratings
Information Technology Recruiter
295 salaries
unlock blur

₹2 L/yr - ₹5.4 L/yr

Senior IT Recruiter
266 salaries
unlock blur

₹2.8 L/yr - ₹8.5 L/yr

Software Engineer
260 salaries
unlock blur

₹2.7 L/yr - ₹11 L/yr

Technical Recruiter
250 salaries
unlock blur

₹1.7 L/yr - ₹6 L/yr

Senior Technical Recruiter
231 salaries
unlock blur

₹2.8 L/yr - ₹10.2 L/yr

Explore more salaries
Compare IDC Technologies with

ITC Infotech

3.6
Compare

CMS IT Services

3.1
Compare

KocharTech

3.9
Compare

Xoriant

4.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview