SameerShah21
BAN USERSAMEER SHAH
sshah30@nyit.edu|samomania21@gmail.com
516-508-8892
Education:
Master of Science in Computer Science, 05/2010
New York Institute of Technology, Old Westbury, NY
Bachelor of Science in Computer Science, 05/2008
Mumbai University, Mumbai, India
Related courses and achievements: Web Development, Database Management Systems, Operating System Security, Computer Networks, Software Engineering, Distributed Systems
● Held 1st rank for Web Development and Database Systems subjects in the state board exam of 2008(Mumbai, India)
Technical Skills:
• Development skills: C, C++, Microsoft .NET platform ( C#, VB, ASP, Silverlight), HTML, CSS, JavaScript, JQuery, MS SQL and elementary level knowledge on MY SQL.
• Analysis and Source Control: Git under Cygwin and Tortoise SVN Manager. Basic static code analysis using FXCop.
• Other languages and platforms: Familiarity and elementary level knowledge on Java. Coding and development applications based on Android OS using Java and SQL Lite as backend.
• RDBMS: SQL Server, MySQL
• Software: Microsoft Visual Studio 10, C++ Builder, NetBeans, Firebug plugin for FireFox, Windows toolkit, Photoshop, MS OFFICE.
• OS types comfortable with: Windows, Mac, UNIX
Experience:
Projects:
TNT (Presently employed as Application Developer)-08/2010 to Present:
Location: Melville, NY, USA.
● Performing analysis, design, programming, testing and other application development tasks for new projects and existing applications
● Designing, developing, maintaining and supporting existing Windows Forms and ASP.NET applications as well as both new and existing SQL Server databases
● Developing and updating supporting documentation for both users and technical staff
● Working with IT Helpdesk providing level II support within the Service Level Agreement (SLA)
● Occasionally providing after business hours support for mission critical systems; on call availability 7 X 24
● Evaluating systems and processes and making recommendations for improvements
Ziff Davis Enterprise (IT Developer and Database Administration Intern)-10/2009 to 12/2009:
Location: NYC, NY, USA.
● Primed the setup for the company's MICROSOFT SHAREPOINT Server setup and merged it with the existing SQL databases for internal usage.
● Set up their Application Server and maintained it with administrative tools like WSUS, IIS and ADS
● Database Administration: Set up their Microsoft SQL server and used queries for data mining solutions.
● Networking: Did the setup of their LAN extensions using CISCO routers, switches, PIX firewall.
● Desktop Administration: Installed terminals/ network devices, updating desktops, troubleshooting software issues mostly related to Microsoft Exchange servers.
●
Warner Music Group (Product Developer Intern)-05/2009 to 08/2009:
Location: NYC, NY, USA.
● .NET programming and development using Microsoft Silverlight and Java script with queries using LINQ to XML.
● Published projects using XHTML, HTML for internal use and merged them with stand-alone applications using AIR.
● Used Adobe CS4 (Photoshop, Illustrator, Flash) to create demos, applications and authoring tools for XML files.
● Coded a website for MICROSOFT SHAREPOINT for immediate use for the company.
● Produced ‘Windows media player’ plug-in for supporting the technology.
● Networking: used SIPERA systems to control CISCO VOIP phones, call manager.
E Biz Info Solutions (Application/Web Developer): 05/2006 to 05/ 2008:
Location: Mumbai, MH, India.
● Created various legacy apps on .NET and Microsoft Visual Studio platform and updated them according to client requirements.
● Created modules in different client websites under a team of 7 members – www.tesaindia.com, www.khayatalwafa.com
Interests and activities:
● Exploring unique methodologies implemented in different consoles and websites and getting to know their functioning.
● Chess and Cricket.
- 0of 0 votes
AnswersWrite a program that performs division and outputs quotient. You cannot use division operator.
- SameerShah21 in United States
I thought I could do it with mod but I was wrong. He, told that the solution will not work. After keeping the phone down I realized that subtracting the divisor from the dividend and continue this in a loop till dividend >= divisor would be the right way to go (along with other validations like check for 0.)| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer - 0of 0 votes
Answers - SameerShah21 in United States| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer - 0of 0 votes
AnswersIn a 3d space find points 10 points that are closest to the origin. Which data structure would you implement. What would be the time complexity of such a program.
- SameerShah21 in United States
I said that I would maintain 10 arrays that stores (x,y,z) coordinates and 10 int var to store the distance value.
int coordinates1[],value1,coordinates2[],value2,coordinates3[],value3....
We would start calculating Euclidean distance of the given point in hand and store it in those 10 arrays. As soon as we got 11th point we would replace it with the array corresponding to the highest value in the array.
As soon as we got the 12th point we would replace it with the 2nd highest corresponding value array ...after traversing through every point we would have the nearest 10 coordinates. I read this somewhere on career cup. I just modified the idea a little to accommodate 3d realm.
He asked what is space complexity. I said 10 arrays and 10 int values. A constant number will have a constant value n, O(n). He said fine, what if there are k points to be found. I said still it would be O(n). He said I was wrong it would be O(n square) since k points are inputted. I did not understand that part.| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer
User Datagram protocol can be used for communication that does not need to be reliable like voice signals
Transfer control protocol is used when reliable communicaion is necessary e.g., binary digits with hamming code check bit.
Domain name system should use reliable communication like PC1 may be 192.168.1.1 because we do not want data going from 192.168.1.2 instead of 192.168.1.1
RepEarned praise for analyzing acne for the government. Earned praised for my work implementing mantra to get desired husband in ...
RepNancy Nash, Area Sales Manager at Absolute Softech Ltd
Prior to my current job I was training soap scum in Africa. Earned praised for my work developing wooden trains ...
<pre lang="" line="1" title="CodeMonkey34755" class="run-this">#include "stdafx.h"
- SameerShah21 December 16, 2011#include "stdafx.h"
#include "stdio.h"
#include "conio.h"
#include "iostream"
#include "fstream"
#include "string"
#include "list"
#include "vector"
#include "map"
#include "string"
using namespace std;
vector<string> padrows(3);
void main()
{
bool allow = false;
int index = 0;
padrows[0]="123";
padrows[1]="456";
padrows[2]="789";
vector<string> code(3);
code[2] = "0000";//Result
cout<<"\n4 digit : ";
cin>> code[0];
cout<<"\n match : ";
cin>> code[1];
for(int i = 0; i < 4; i++)//check for each of the four digits
{
for(int tc1=0;tc1<=2;tc1++)//traverse row
{
for(int tc2=0;tc2<=2;tc2++)//traverse col
{
//int SR,SC,DR,DC;
vector<string> allowed(6);
if(code[1][i] == padrows[tc1][tc2])//get the row and col of to match code
{
//get every element of tc1 and tc2 in allowed vector
allowed[0]= padrows[tc1][0];
allowed[1]= padrows[tc1][1];
allowed[2]= padrows[tc1][2];
allowed[3]=padrows[0][tc2];
allowed[4]=padrows[1][tc2];
allowed[5]=padrows[2][tc2];
//cout<"\nFound in row number: "<<tc1+1;
//cout<<"\nFound in col number: "<<tc2+1;
//match code[0][i] with every element inside allowed
for (int e1=0; e1<=5; e1++)
{
if (code[0][i] ==allowed[e1][0])
{
code[2][i] ='1';
}
}
}
//if(code[0][i] == padrows[tc1][tc2])//get the row and col to the input code
//{
// DR=tc1;
// DC=tc2;
// //cout<<"\nFound in row number: "<<tc1+1;
// //cout<<"\nFound in col number: "<<tc2+1;
//}
}
}
}
if (code[2]=="1111")
cout <<"\nAllow";
else
cout <<"\nDo not allow";
}
</pre><pre title="CodeMonkey34755" input="yes">You can give whatever you want. This code is working. I compiled it.
Entered digit:1123
Match with digit: 1126</pre>