Computer Science Engineering

RESUME

DEVARAPALLI.ANUSHA

**-**-**, **** ********* hall,

Jojinagar, Bhavanipuram

Vijayawada-12, India.

E-mail:*************@*****.***

Phone: 888-**-**-***

Objective :

To work in an innovative and challenging environment equipped

with the state-of-art technology that enhances my skills and knowledge my

desire and drive to succeed will be an asset, which I will contribute to

the organization's growth and profitability.

Academic Qualifications :

Qualification Board/University Year of Percentage

passing

B.Tech Jawaharlal Nehru 2014 70.53%

Technological

University

Kakinada(JNTUK)

Intermediate Board of 2010 65.88%

Intermediate

X Class Board of secondary 2008 78.2%

education

Technical Skills :

Programming Languages : C, C++, Uml, Core java.

Operating Systems : Windows, UNIX.

Internet Technologies : DHTML, JavaScript..

Data base Systems : Oracle.

Web Technologies : HTML, JavaScript.

Academic Project :

Title of the Project : Distributed processing of probabilistic

TOP-K queries in wireless sensor networks

Client : VXL Academy

Front-End : java Virtual machine

Server Technologies : WINDOWS XP.

Back-End : MYSQL 1.5 and above

Team size : Three members

Project Role : coding with adding queries

About the Project:

In this project, we propose the notion of sufficient set and

necessary set for efficient in-network pruning of distributed uncertain

data in probabilistic top-k query processing. Accordingly, we

systematically derive sufficient and necessary boundaries and propose a

suite of algorithms, namely SSB, NSB, and BB algorithms, for in-network

processing of PT-Top-k queries. Additionally, we derive a cost model on

communication cost of the three proposed algorithms and propose a cost-

based adaptive algorithm that adapts to the application dynamics. Although

our work in this paper is based mainly under the setting of two-tier

hierarchical network, the concepts of sufficient set and necessary set are

universal and can be easily extend to a network with tree topology. The

performance evaluation validates our ideas and shows that the proposed

lgorithms reduce data transmissions significantly. While focusing on PT-Top-

k query in this paper, the developed concepts can be applied to other top-k

query variants. We plan to develop algorithms to support other

probabilistic top-k queries in the future

Contribution:

> Involved in Database.

> Involved in Designing.

Strong Points in Myself :

> Hardworking towards the achieving the Goal.

> Intellectual thinking.

> Flexibility in technical area.

Area Of Interests :

. C,C++

. Java, MYSQL

Personal Profile :

Name : DEVARAPALLI. ANUSHA

Father's name : DEVARAPALLI.PRABHAKARA RAO

Date of Birth : 25/08/1993

Gender : FEMALE

Martial Status : Single

Languages Known : English, Hindi and Telugu

Address : 76-13-04, near community hall,

Jojinagar, Bhavanipuram,

Vijayawada, krishna district

Andhra Pradesh

Pin-code: 520012

Declaration:

I here by declare that the above written particulars are true to the

best of my knowledge and brief.

Date: 27/04/2014

Place: Vijayawda

Anusha

Contact this candidate