Post Job Free
Sign in

Design Project

Location:
Richardson, TX, 75080
Posted:
March 09, 2010

Contact this candidate

Resume:

Sinduja Sreshta

**** ********* ******* *** **** Phone: 425-***-****

Richardson TX 75080 Email: **************@*****.**.**

OBJECTIVE

Seeking a challenging position where I can apply my software design and development skills.

EDUCATION

M.S. in Computer Science Aug 2008 - Present

The University of Texas at Dallas, Richardson, TX

GPA: 3.95/4.0

B.E. in Computer Science and Engineering Aug 2004 - May 2008

Coimbatore Institute of Technology, Coimbatore, India

GPA: 9.10/10.00

TECHNICAL SKILLS

Languages: C, C++, Java, Visual Basic

Additional Skills: CGI Programming in Perl, PHP, AJAX

Operating Systems: Windows, Linux

Databases: MySQL, Access

Networking: TCP/IP, SCTP, UDP, LDAP, H.323, VOIP, DHCP, DNS,Frame Relay, HTTP, ICMP,IGMP, LAN/WAN,

SS7, TELNET, Routing, QOS, Design

PROJECTS

New protocol design and implementation in Network Simulator 2

Designed and implemented a new protocol for handling real time, reliable data for Mobile Ad-Hoc Networks (MANETS)

using Network Simulator 2 (NS2). Implemented a flat header above the MAC layer that included fields for handling

reliable data with guaranteed sequential delivery with acknowledgements Modified the DSR and AODV wireless

routing protocol to include a delay threshold such that real time packets that exceeded the delay threshold were

actively dropped during routing. The protocol and header specification was written in C++ using OTCL and TCL

scripts for simulation specifications. This project helped me understand design and implementation aspects of a new

protocol in wireless networks.

Secure peer to peer file sharing system

Developed a secure peer to peer file sharing system using sockets and multithreading in Java. The file sharing system

consists of a centralized server which maintains the list of files and the file hosing peers. Any machine in the system

could obtain the location of a desired file from the central server and then directly establish communication with the file

hosting peer to obtain the file. Confidentiality of the messages was guaranteed using TES (Tiny Encryption Standard),

authentication and integrity using MD5 hashing. Multithreading was extensively used since a peer could

simultaneously transfer a file to another peer and request a file for itself.

Virtual whiteboard using AJAX

Developing a web-based virtual whiteboard application to be used as an interactive and collaborative learning

environment in a classroom. Virtual whiteboard provides a real-time canvas for thinking, designing and sharing ideas

among teachers and students. Users can share information using text notes, symbols, spreadsheets and image

elements. Users can easily add, modify or delete whiteboard information and all changes can be seen in real-time on

every user session. The virtual whiteboard application is being developed using AJAX development techniques and

JavaScript.

Computing a path through a maze

Designed and developed an application that computes a path through a maze using the principles of backtracking. The

maze is generated dynamically using user-specified input for the maze dimensions, blockades and walls and the entry

and exit positions. The algorithm starts at a chosen point and performs a depth-first search of possible paths. If a path

hits a blockade during propagation, it retreats to the choice point and tries an alternative path. The search continues

recursively until all choice points are exhausted. The algorithm and the graphical front-end was developed in C.

Edge Connectivity of a graph

Implemented the Nagamochi-Ibaraki algorithm for finding the minimum cut in an undirected graph. Minimum cut or

edge connectivity refers to the minimum number of edges to be removed from the graph to make it disconnected. For

a set of thousand randomly generated graphs, a relationship between the degree of the graph and the edge

connectivity was derived. Edge connectivity is particularly important for network reliability. T his project, implemented in

Java, helped me understand methods for providing required reliability level during the design of network topologies.

Sinduja Sreshta page 2

Capital Budgeting (Knapsack problem) using branch and bound

Implemented the branch and bound algorithm for determining the optimal solution for the Knapsack Problem using

Java. Random values were generated for the profit and cost values of the knapsack items and the optimum

combination of items for inclusion was found. Capital budgeting problem is similar to the knapsack problem, where the

items of the knapsack could be treated as network components like routers and switches, so a derived optimum

placement could be used during the design of network topologies.

Implementation of AVL tree rotation

The AVL tree rotation algorithm height balances an ordered AVL tree after every insertion and deletion. The algorithm

implemented in C obtained a node’s value dynamically, inserted it into the tree and height balanced the tree, if

necessary. The tree structure, before and after balancing, was displayed graphically after every insertion and deletion

This project helped me understand height balanced search trees and the AVL tree rotation algorithm.

INTERNSHIPS

G. N. Sharma Investor Services Limited, Chennai, India Oct 2006 - Dec 2006

Worked as a member of the quality engineering team testing software used for processing credit card payments. The

software matched cash and check inflows into the credit card company with the statements of credit from banks in

order to identify bounced checks and overdrafts. Performed functional white-box testing using Visual Basic to detect

software quality issues and optimized existing code to improve the overall reliability and maintainability.

Sun Industrial Automation Systems, Chennai, India May 2006 - Jun 2006

Designed and developed a Visual Basic application used for monitoring and controlling the operation of an industrial

chemical plant. The application was built on top of a standard SCADA (Supervisory Control and Acquisition Design)

control system used in industrial processes. The application generated on the fly reports on real-time inventory levels,

process parameters and control data, at regular intervals. It used an Access database as the back-end data store for

real-time parameters and inventory levels.

RELEVANT COURSEWORK

• Advanced Computer Networks

• Algorithmic Aspects of Telecommunication Networks

• Network Security

• Telecommunication Network Management

• Database Design

• Data Structures and Algorithms I and II

HONORS

• One in five recipients of the Tektronix Graduate Student Fellowship award at the University of Texas at Dallas in

2008.

• One in three recipients of the Johnsons School Graduate fellowship award at the University of Texas at Dallas in

2009.

• Recipient of the IIPE Excellence Award for securing 100% in mathematics in Tamil Nadu State Board Higher

Secondary Examination in 2004.

• Recipient of the General Proficiency award during two academic years of secondary education.



Contact this candidate