Java Script-Text to Speech-Microsoft Edge-open using Microsoft Edge

Page Title

Java Corporate Training at Revature -Hyderabad

 I did Java Training at Hyderabad for a company called Revature for the final year students selected from many colleges in Andhra Pradesh and Telangana. They got monthly salary and accommodation from that company. After some time many got placed in MNCs through Revature.

Period: May 2022 to June 2022











Java Full stack training-Prodapt ,Chennai One-Kvaluent Solutions

 


Java Full stack Training done at Prodapt, Chennai.

I was employed at Kvaluent EdTech.

Duration :3 months(55 working days).

















 

Java Full Stack Training for college students with Internship and Placement Assistance

 Java Full Stack Training for college students and job seeking candidates with Internship and Placement Assistance.

I have completed 4 corporate training on Java and Java Full Stack.

A giant step towards the Job Market with a good resume.

Objective: This training is planned for college students studying MCA / MSC I.T/BCA/ B.Tech  or B.E CSE/I.T/ECE/EEE/E&I/Mech/Civil.


Hardware Requirements:

windows 10 with minimum 8GB Ram p5 or more...


Those who are willing to plan a career in Java Full Stack-the most prestigious career.

Those who are willing to travel and train and develop applications will get Internships minimum 20k to maximum 30 k plus food and travel accommodation.


Duration: 60 hours and more

Fees: 5000 in installments during the training period (2000+2000+1000) and 15000 in 3 instalments after got job(with in 2 years)  -any address proof must.

The trainees will get an official  mail id.


Course Contents:

Dos and Windows from a developer point of view.

Core Java - Deep drive the basics of OOPs with mini projects,

Control statements,

DOS based mini projects to learn the technologyin depth and to gain coding confidence.

Threads, Exception Handling, lang, io packages with mini projects.

Data structures and util packages with mini projects.

List ,stack and queue implementation in Java.

JDK 8 features

Concise coding -mini projects

GUI Programming-applets,AWT-Swings

JDBC-MySQL,Postgress,REDIS,Neo4J,MongoDB

Major project using GUI and Database.


Server side-programming: Tomcat server

Servlets-mini project

JSP-mini project

Servlet JSP -MVC1

JSTL and EL

JPA and Hibernate with mini project

Spring Framework in detail

Spring Boot- Web services and Micro Services

Cloud: AWS RDS-JDBC-Java ,Python, NodeJS

            S3  Bucket and EC2 Basics

 Major Project


Client Side Coding:

HTML and HTML 5

CSS and CSS3

Bootstrap

Java Script

Angular or React or both

Major project- front end

Tools: Eclipse, Maven, Git, MySQL work bench, Postman

Testing: Unit Testing, TestNG

DevOps Introduction: Jenkins

A java experts will join me on training when required. 

After completing the training a cap-stone project to be developed individually.

Resume sample will be given.


Regards

varnan alias vellaivarnan

Share your resumes to varnant@gmail.com

9791197980



Comfort Zone -ParulUniversity

 Completed 7 months Java FS Training at Parul University Vadodara Gujarat India

Receiving the Appreciation award from Dr. Priya Swami Narayan Dean MCA and Principal BCA department  and Director 


Mr.Vivek Dave HOD MCA,Dr.Priya Swamy Narayan,Dean and Director madam

Mr.Marthand MCA Final year receiving the appreciation award from the Director.
His role on buying the awards and arranging the meeting along with Rajiv Khurana is ever rememberable.
 




iOpext,Ambit IT Park,Chennai

Met my Java FS trainees after a long gap. All are working in projects using Service Now.

Shopping cart using Servlets

 This is an attempt to create a Shopping cart using Servlet Technology.



Hashing -Data Structure-Hashing in Java

 

Hashing

 

Why we need Hashing algorithm and how it differs from other algorithms

 

The main objective of Data Structure is effective way of organizing data in memory so that search and sort and other operations are fast.

Hashing is a special technique used to store and search data more effectively.

1.Compare with Array

We have 5 records and we want to store them in an effective way and retrieve any one from that collection. I want to search 13


 

Number iterations  5

Time Complexity O(n) ( n here denotes number of items in the Array)

 

 

 

 

 

2.Compare with Linked List

Trying search 13


 

Number of iterations 5

Time Complexity O(n)

 

3.Binary Search Tree


 

Number of iterations:4

Time complexity  O(log n)

/*For the input of size n, an algorithm of O(n) will perform steps proportional to n, while another algorithm of O(log(n)) will perform steps roughly log(n).

Clearly log(n) is smaller than n hence algorithm of complexity O(log(n)) is better. Since it will be much faster.

*/

Hash table a specialized array ,here we use special function called Hash function  to store and retrieve data in a collection.

But normal array we use index to store in a linear fashion.

 

Step 1: create a hash table

Step 2: Use a prime number

We have five records(5)

We need a prime number after the 5 that is 7

We need a hash function, it’s a mathematical formula .

A simple one is modulo operation


 


 

Search using Hash

We search 15


 

No of iterations 1  &Time Complexity O(1)

Collision:

Hash table size must be prime number, if we take the size as a non prime number:

Say for example the size is 8


 

While using prime number as size of Hashtable will also sometimes creates Collision.

To avoid that there are two methods:

 1.separate Chaining 2.Open Addressing

 

In separate chaining we use Linked List when collision occurs:


 Hash table size =7

 50%7=1  so 50 stored in 1st index

700%7=0 so 700 goes to 0th index

76%7=6 so 76 goes to 6th index

85 %7

Search speed would be not o(1)

 

Open Addressing:

The main advantage is no linked is used here.A new technique will followed when collision occurs:

a)Linear probing

b)Quadratic Probing

c)Double Hashing

Linear probing is scheme in computer programming for resolving collisions in a hashtable data structures for maintaining a collection of key-value pairs and looking up a value associated with a given key.

 

Quadratic probing operates by taking the original hash index and adding successive values of an arbitrary  quadratic polynomial until  an open slot is found.

Double hashing a technique  used in conjunction with open addressing in hash tables to resolve hash collisions  by using a secondary hash of the key as an offset when a collision occurs

=============================================================

 

Linear probing


 

Initially i=0, if collision occurs value increased by 1, increasing the value linearly from 0 to 1,2.. and so on.

 

 Hash(7)=(7+0)%11=7

Hash(36)=(36+0)%11=3

Hash(18)=(18+0)%11=7(collision occurs)

Repeat Hash(18)=(18+1)%11=8

Hash(62)=(62+0)%11=11(collisoion)

Repeat hash(62)=(62+1)%11=8 collision

Repeat hash(62)=(62+2)%11=9


 

Quadratic Probing

Jumping will be done

 


 

Hash(7)=(7+0)%11=7

Hash(36)=(36+0)%11=3

Hash(18)=(18+0)%11=7 collision occurs

Hash(18)=(18+1)%11=8

Hash(62)=(62+0)%11=7 collision

Hash(62)=(62+1)%11=8 collision

Hash(62)=(62+(2*2))%11=0

 


 

 

Search


 

Time complexity in Hashing is o(1) If no collision comes.

If collision comes time complexity will be little bit more.

 


python training with real time projects

Hibernate jar for jpa to download

https://drive.google.com/file/d/1i63I9tDcJwLJM-HYcrROBArp98LprqrR/view?usp=sharing

Technical Skills for B.Com and B.B.A