Scribd
Upload
5 views2 pages

Java Question Set

The document covers various programming concepts including encapsulation, polymorphism, abstraction, and inheritance, along with memory allocation techniques like heap and stack. It also discusses string manipulation, the final and static keywords, and the collection framework. Additionally, it includes coding challenges related to character frequency, prime numbers, palindromes, and finding missing elements in arrays, alongside theoretical questions about Spring Boot annotations.

Uploaded by

lawojim575
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views2 pages

Java Question Set

The document covers various programming concepts including encapsulation, polymorphism, abstraction, and inheritance, along with memory allocation techniques like heap and stack. It also discusses string manipulation, the final and static keywords, and the collection framework. Additionally, it includes coding challenges related to character frequency, prime numbers, palindromes, and finding missing elements in arrays, alongside theoretical questions about Spring Boot annotations.

Uploaded by

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

what is encapsulation , polymorphism , abstraction , inheritance

heap and stack memory allocation


string vs string builder vs string buffer
string constant pool
final and static keyword
collection framework

coding

frequency of each character of given string


prime number
find largest and 2nd Largest number from given array
check number/string is pelindrom or not
start patterns questions

44
666
8888
[3:11 pm, 9/10/2024] sushmitadesai: 1 2 3 4 5 * * * * *
11 12 13 14 15 * * * * *
21 22 23 24 25 * * * * *
....
91 92 93 94 95 * * * * *
Prime number , fibonaci series , find 2nd lagest number from given array
: Find missing no. Without using sorting

Input :-
Int list[ ] = {1,5,6,8,2,7,3,4,10};

Output :-
pelindrom or not
character count from given string
[: Character count in string Without repetition
Ex:Engineering
Op:e3n3g2i2r1

Where need convert String into Lower case


Find long or Big word from one sentence

Ex:
"Hello every one good morning have a nice day"

Output:morning
Why because length of word is 7
Static method can be overloaded or overriding
Test the IQ with tell one number and add same number next subtraction With 5 and so on..
Kindly prepared this

1) find missing elements from given array

Sample array {1,3,2,5,4,7,8}


Output:- 6

2)find longest or highest word from sentence

Sample input:- hii Nikhil8053 Rindhe


Output: Nikhil8053

3)print pattern
12345****
1112131415***

Theory questions
Auto wired annotations,bean, configuration, spring boot application annotations explain

You might also like