Scribd
Upload
438 views

Subjective Test Paper Set II

The document contains 4 subjective technical test questions that can be answered in C#, C++, Java, or C without using built-in functions. The questions are: 1) Write a function to find the 2nd highest number in an array. 2) Write a function to check if a string is numeric. 3) Write a program to find the occurrences of repeated words in a sentence. 4) Write a program to merge two sorted lists.

Uploaded by

rohit singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
438 views

Subjective Test Paper Set II

The document contains 4 subjective technical test questions that can be answered in C#, C++, Java, or C without using built-in functions. The questions are: 1) Write a function to find the 2nd highest number in an array. 2) Write a function to check if a string is numeric. 3) Write a program to find the occurrences of repeated words in a sentence. 4) Write a program to merge two sorted lists.

Uploaded by

rohit singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Subjective Technical Test

Direction-Q.no 1-Q.no 4: Subjective type Questions, you can write these answers in following
languages: C#, C++, Java and C. Do not use any in-built functions like Date-Diff, Split, and
Reverse etc.

1. Write a function to find out the 2nd highest number from an Array

(Marks-5)

2. Write a function “IsNumeric” to check whether the given string is numeric

(Marks-5)

3. Write a program for finding out the occurrences of repeated word from a sentence.

For example, “We save the most critical, non-renewable resource of all - time - for all who
depend on our output in day to day transactions, by eliminating errors and omissions in the
work product we are responsible for.”, this sentence has the following repeated words:

We – occur – 2 times

All – occur – 2 times

Day – occur -2 times

( Marks-5)

4. Write program to Merging of two sorted lists

a. For example:

Array1 = {9, 1, 6, 2, 3, 5, 1, 6, 12, 7, 10, 9, 125, 100, 125, 12}

Array2 = {4,24,99, 10, 123, 8, 80, 54} ( Marks-5)

You might also like