SDE - 1

C Programming (15 questions)
Aptitude (15 questions)
CSE fundamentals (15 questions) like OS, DBMS, and Networking

Number Of MCQs - 45 

Write a program to do basic string compression. For a character which is consecutively repeated more than once, replace consecutive duplicate occurrences with the count of repetitions.

Example:

If a string has 'x' repeated 5 times, replace this "xxxxx" with "x5".
The string is compressed only when the repeated character count is more than 1.

Note:

Consecutive count of every character in the input string is less than or equal to 9. You are not required to print anything. It has already been taken care of. Just implement the given function and return the compressed string.

What are semaphores?

Asked lots of core concepts of DBMS, that I used in my project especially triggers and concurrency control. and other fundamentals of computer science.

Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.

Example :

Merge Sort Algorithm -

Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

The above illustrates shows how merge sort works.

Note :

It is compulsory to use the ‘Merge Sort’ algorithm.

Asked me to explain my project in simple language and how would I teach Bit coin to 5th class students, since I mention coin collection in my hobby and love teaching.