New update is available. Click here to update.

CETPA Infotech Pvt. ltd. Interview Experience for Fresher Intern, Jun 2019

Posted: 13 Jan 2021

Selected

Interview Rounds

Application Process

Round 1

Round 2

Interview Process

Online Coding Interview

Easy

Duration:

30 minutes

Interview-Date:

2 Jun 2019

Problems:

Bubble sort

Bubble Sort is one of the sorting algorithms that works by repeatedly swapping the adjacent elements of the array if they are not in sorted order.

Try Problem

See my Approach

Preparation

Duration:

2 months

Topics:

JAVA Algorithms, C Problem Solving, MySQL

Preparation Tip

Tip 1 : Do Algorithms
Tip 2 : Keep basics clear
Tip 3 : be confident

Application Process

Where:

Other

Eligibility:

7 CGPA

Resume Tip

Tip 1 : Exclude information like your birth date or marital status. You do not have to respond to questions about religion, race, or gender on an application.
Tip 2 : Keep it Clean

5 upvotes

Have an interview experience that you want to contribute?

PreviousNext

Start a Discussion

CETPA Infotech Pvt. ltd. Mock Interviews

For college students & professionals looking to get into CETPA Infotech Pvt. ltd.

Similar Experiences

Categories:

Coding courses for beginners |

Web Development Courses |

Data Science & Machine Learning Courses |

Competitive Programming Course |

Android App Development Courses |

Courses for interview preparation

Popular Courses:

C++ Foundation with Data Structures |

Java Foundation with Data Structures |

Python Foundation with Data Structures |

Competitive Programming |

Full Stack Web Development

Career Tracks:

Ninja Competitive Programmer Track |

Ninja Android Developer Career Track |

Ninja Web Developer Career Track - NodeJS & ReactJs |

Ninja Web Developer Career Track - NodeJS |

Ninja Data Scientist Career Track |

Ninja Machine Learning Engineer Career Track

CETPA Infotech Pvt. ltd. Interview Experience for Fresher Intern, Jun 2019

Interview Process

Online Coding Interview

Bubble Sort is one of the sorting algorithms that works by repeatedly swapping the adjacent elements of the array if they are not in sorted order.

Preparation

Application Process

Similar Experiences

Interested in Coding Ninjas Flagship Courses?