Upload Button Icon Add office photos

Filter interviews by

Ciber ETL Developer Interview Questions, Process, and Tips

Updated 12 Sep 2020

Ciber ETL Developer Interview Experiences

1 interview found

ETL Developer Interview Questions & Answers

user image Amirthaprakash C

posted on 12 Sep 2020

Interview Questionnaire 

4 Questions

  • Q1. What is RCP? In What scenario you have used this in your project?
  • Ans. 

    RCP stands for Rich Client Platform. It is a framework used for developing desktop applications.

    • RCP is based on Eclipse platform and provides a set of reusable components for building desktop applications.

    • It provides a modular architecture that allows developers to easily add or remove features.

    • RCP applications can be customized using plug-ins and extensions.

    • I have used RCP in a project where we needed to develop a des...

  • Answered by AI
  • Q2. What are the content of APT_CONFIG_FILE? Can you brief on the relationship between APT_CONFIG_FILE and Partition.
  • Ans. 

    APT_CONFIG_FILE is a configuration file used by Advanced Package Tool (APT) to manage packages in Linux.

    • APT_CONFIG_FILE contains settings for APT such as proxy settings, package sources, and authentication credentials.

    • Partition refers to dividing a hard drive into separate sections for different purposes.

    • APT_CONFIG_FILE can be used to specify package sources for specific partitions.

    • For example, if a user has a separate...

  • Answered by AI
  • Q3. What are the methods available in Aggregator stage?
  • Ans. 

    Aggregator stage methods include count, sum, average, min, max, first, last, and concatenate.

    • Count: counts the number of input rows

    • Sum: calculates the sum of a specified column

    • Average: calculates the average of a specified column

    • Min: finds the minimum value of a specified column

    • Max: finds the maximum value of a specified column

    • First: returns the first row of the input

    • Last: returns the last row of the input

    • Concatenate:

  • Answered by AI
  • Q4. Whats the prerequisites to use sort method in aggregator stage.
  • Ans. 

    The prerequisites to use sort method in aggregator stage.

    • The input data must be sorted by the same key as the one used in the aggregator stage.

    • The input data must be partitioned by the same key as the one used in the aggregator stage.

    • The sort method should be used before the aggregator stage in the data flow.

    • The sort method should be used only if the data is too large to fit in memory.

    • The sort method can be used with b

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Few questions about powercenter
Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Tell me about ur self
  • Q2. And some sql queries and questions

Interview Preparation Tips

Interview preparation tips for other job seekers - They informed me through call that i cleared first round . but no further response from them .for follow up also no reply ..citiustech Pune

I was interviewed 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

Interview Questionnaire 

1 Question

  • Q1. Interview questions on .net technology

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

We were supposed to give test in any time between 3 PM to 9 PM.

  • Q1. 

    Total Unique Paths Problem Statement

    You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...

  • Ans. 

    The problem involves finding the total number of unique paths from the top-left to bottom-right cell of a matrix by moving only right or down.

    • Use dynamic programming to solve the problem efficiently.

    • Create a 2D array to store the number of unique paths at each cell.

    • Initialize the first row and first column with 1 as there is only one way to reach them.

    • For each cell (i, j), the number of unique paths is the sum of paths...

  • Answered by AI
  • Q2. 

    Subtree Node Count Problem

    We are provided with a tree containing 'N' nodes, numbered from 0 to N-1. The objective is to determine the total number of nodes within each subtree of the provided tree. Speci...

  • Ans. 

    Given a tree with N nodes, find the number of elements in each subtree rooted at every node.

    • Traverse the tree using Depth First Search (DFS) to calculate subtree sizes for each node.

    • Use an array to store subtree sizes for each node, starting with leaf nodes having size 1.

    • The subtree size of a node is the sum of subtree sizes of its children plus 1 for the node itself.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 120 minutes
Round difficulty - Medium

Pair Programming Interview( this round is similar to machine coding round) it started around 11 AM

Focus Areas: Problem solving and implementation of extensions.

The pair coding round is focused on OOPS concepts. You are paired with a TWer for this round. They let you code first for an hour and in the next hour they review your code and suggest changes which would improve the code structure, readability and make it modular and reusable and functional.
 

  • Q1. 

    River Crossing: Help Ninja Cross Over

    Ninja stands at the start of a wooden bridge over a river. Some segments of the bridge are damaged. The undamaged segments, marked as 'safe', are listed in an array S...

  • Ans. 

    Check if Ninja can cross the river by jumping from one safe segment to another based on given constraints.

    • Iterate through the 'SAFE' array and check if Ninja can make the required jumps to reach the last safe segment.

    • Ensure that the next jump is either 'X' - 1, 'X', or 'X' + 1 units from the previous jump.

    • Return 'true' if Ninja can successfully cross the river, otherwise return 'false'.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 120 minutes
Round difficulty - Medium

Students who were shortlisted from Pair Programming round was selected for this round around 3 PM. In this round there were two interviewer.

  • Q1. 

    Middle of a Linked List

    You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.

    If there is an odd number of elements, return the ...

  • Ans. 

    Return the middle element of a singly linked list, or the one farther from the head if there are even elements.

    • Traverse the linked list with two pointers, one moving twice as fast as the other

    • When the fast pointer reaches the end, the slow pointer will be at the middle

    • Return the element pointed to by the slow pointer

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteriaIt was for 2020 undergraduateThought Works interview preparation:Topics to prepare for the interview - Object Oriented Programming, System Design, Operating System, DBMS, Data Structures and Algorithms (Dynamic Programming, Trees, LinkedList)Time required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Have good grasp on OOPS since they have a round named Pair Programming round which is focused upon this. 
Tip 2 : Write clean, modular and functional code.
Tip 3 : Practice Data Structures and Algorithms
Tip 4 : You should know breadth and depth of whatever is mentioned in your resume.
Tip 5 : Be loud and clear.

Application resume tips for other job seekers

Tip 1 : Make single page resume.
Tip 2 : Mention relevant things on resume.
Tip 3 : Do not put any false things on resume. Projects, internships you are mentioning be ready to answer questions related to it regarding what you solved, idea, databases, design.
Tip 4 : Contribute in open source, participate in hackathons.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Campus Placement and was interviewed in Jul 2020. There were 4 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. 1. Why are you a good fit for consultancy domain
  • Q2. 2. How will you solve a client's problem where is facing issue with existing old infrastructure and he wants to upgrade his infrastructure
  • Ans. 

    I will assess the client's current infrastructure, identify areas of improvement, and propose a customized upgrade plan.

    • Conduct a thorough assessment of the client's current infrastructure

    • Identify areas of improvement and prioritize them based on their impact on the client's business

    • Propose a customized upgrade plan that addresses the client's specific needs and budget

    • Ensure minimal disruption to the client's operation...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - 1. Prepare your intro well. That is the make and break of your interview
2. Provide short and crisp response for past experience. Try to make it relevant as per new job role.

I applied via Campus Placement and was interviewed before Jul 2021. There were 5 interview rounds.

Round 1 - Aptitude Test 

Round 1 was about 60 mins long. Basic Aptitude questions along with Programming MCQ

Round 2 - Coding Test 

Round 2 had 2 coding questions with a time limit of 60mins. Intermediate level problem solving
knowledge is neccessary.

Round 3 - Technical 

(1 Question)

  • Q1. Technical Round 1 was 1hr long. Detailed Insights about my project and a few programming questions in DSA
Round 4 - Technical 

(1 Question)

  • Q1. This Technical Round 2 was 1hr long and was mainly focused on problem solving skills and a few basic programming concepts.
Round 5 - HR 

(1 Question)

  • Q1. Three Situational questions were asked .

Interview Preparation Tips

Topics to prepare for Bounteous x Accolite Software Developer interview:
  • Data Structures
  • Algorithms
  • CPP
  • Problem Solving
Interview preparation tips for other job seekers - Prepare Well . Perform well with full confidence

Interview Questionnaire 

1 Question

  • Q1. Exam was conducted on programmes. 10 questions were asked
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
No response

I applied via Approached by Company and was interviewed in Dec 2024. There were 2 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Testing in React
  • Q2. Redux, Async Thunk
Round 2 - Coding Test 

- Test Cases
- Redux

Interview Preparation Tips

Topics to prepare for Brillio Software Developer interview:
  • React
  • Jest

Ciber Interview FAQs

What are the top questions asked in Ciber ETL Developer interview?

Some of the top questions asked at the Ciber ETL Developer interview -

  1. What are the content of APT_CONFIG_FILE? Can you brief on the relationship betw...read more
  2. What is RCP? In What scenario you have used this in your projec...read more
  3. What are the methods available in Aggregator stag...read more

Tell us how to improve this page.

Interview Questions from Similar Companies

CitiusTech Interview Questions
3.4
 • 268 Interviews
Altimetrik Interview Questions
3.8
 • 214 Interviews
Xoriant Interview Questions
4.1
 • 181 Interviews
ThoughtWorks Interview Questions
3.9
 • 147 Interviews
Brillio Interview Questions
3.4
 • 131 Interviews
TEKsystems Interview Questions
3.4
 • 115 Interviews
View all
Senior Consultant
68 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Principal Consultant
55 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Consultant
32 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
19 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Engineer
15 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Ciber with

ITC Infotech

3.6
Compare

Xoriant

4.1
Compare

CitiusTech

3.4
Compare

HTC Global Services

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