Deepak Garg
BAN USERDEEPAK GARG
Ph. No – 09949998170
cs.deepakgarg@gmail.com
______________________________________________________________________________
SUMMARY:
Approx 2 years of experience in the IT industry with focus on C, C++, UNIX Shell.
6 Months Onsite (United State) Client Experienced.
Experienced with the entire Software Development Life Cycle using Object Oriented Technology.
Extensive knowledge of UNIX Shell programming and Object Oriented programming.
Best Performance award (SPOT Award) in year 2006.
Bachelors Degree in Computer Science from Govt. Engineering College Bikaner, Rajasthan University
TECHNICAL SKILLS:
Languages : C++, C, UNIX Shell
Operating Systems : UNIX, Sun Solaris, Windows NT/2000/XP
RDBMS : Informix
Tools : CVS
Scripting : Shell
Soft Skills Training : Effective Meetings, Written Communication, Client Oriented Communication, People Interaction, Emergency Response training.
PROFESSIONAL WORK EXPERIENCE:
Jun’06 – Till Date
Analyst, VERIZON Data Services, Hyderabad, India.
Projects handled:
Project: BAAIS-Video (Broadcast Assignment and Activation Inventory System - Video):
The purpose of this project is to provide video signal from Video Hub Office (VHO) to Video Service Office (VSO) on GigE Networks.
All Video Hub Office (VHO) are connected by high speed GigE Network and Each Hub office are used to feed the signal in different GigE Network Rings. All the GigE Network Rings inherits the basics SONET property and Equipments is Add Drop Multiplexer (ADM). BAAIS-Video System supports Optical and Electrical Networks and decides the signal flow from Video Hub Office to Video Service Office using provisioning rules.
BAAIS-Video system also interact with down stream system like Trouble shooting system, Inventory system and Activation system.
Role : Analyst – Design, Development and self-testing of the application.
Environment : C++, UNIX (Sun Solaris), CVS, Informix
Responsibilities:
Design the request and response messages format in xml for Client and server.
Extensively used C++ and Standard Template Library (STL) for development and implementation.
Wrote various Unix Shell Scripts as required to make the environment for the application, to generate the classes from xsd file and .sql file.
Leading core provisioning module.
.
Project: NTAS (National Telephone and Address System)
The purpose of this project is to validate and assign the Address and Telephone number in East part of United State. This system keep track of all the existing location and telephone numbers in east of United State and provide a future view of expansion telecom network.
NTAS system divides whole East United State in 14 different catalogs. On Basis of different catalogs system relates all the location and telephone numbers. To communicate with legacy system (Mainframe system) system use Verizon proprietary message and all the legacy system is either Telcordia system or Verizon proprietary system.
Role : Software Engineer- Development and self-testing of this application.
Environment : C++, UNIX (Sun Solaris), CVS, Informix.
Responsibilities:
Design the request and response messages format in xml for various APIs.
Extensively used C++ and Standard Template Library (STL) for development and implementation.
Wrote Unix Shell Scripts as required.
Leading Service order module.
EDUCATION:
Bachelors Degree in Computer Science from Govt. Engineering College Bikaner, Rajasthan University. (79.5% , 3rd rank )
Higher secondary from Bhopal wala array sr. sec. school, Sri-ganganagar (Rajasthan) (81.48%)
Secondary from Khalsa Model High School , Sadul Shahar , ( Rajasthan ) (75.67%)
ACHIEVEMENTS:
“SPOT (Excellence) Award” for my work in Verizon Data Service, Hyderabad, India.
I was rewarded for paper presentation on “Quantum Computers” in Saint Longowal Institute of Technology (Punjab) in National techfest 2004.
As mentioned in question tree is not binary tree, if we try to insert into second tree then search complexity will increase.
Use the DFS search algorithm as space complexity is much lesser than BFS.
As Joe mentioned:
By using DFS traverse first tree and create a hash table, now while traversing the second tree look into hash table.
BFS is the only search which looks for the sibling first then children.
- Deepak Garg May 26, 2008counting is another option which will sort the array and determine the frequency of each element. but this algorithm require more space as compare to another option.
If we donot have the space constraint then this algorithm will solve our purpose in O(n) time.
only drawback of this algorithm is that this algorithm assums that given integers are in 0 to k range.
However algo goes here
counting ( int A[],int C[],int k )
{
for i <-- 0 to k
do C[i] <-- 0
for j <-- 1 to length[A]
do C[A[j]] <-- C[A[j]] + 1
for i <--- to k
print value of number i and frequency C[i]
}
Algo goes here:
AbsolutePath( string relativePath , string &absolutePath )
{
step 1: Maniuplate the string with / baais and start a loop.
step 2: do
step 3: switch ( dir )
step 4: case "..": pop from stack
step 5: defalut : push to stack
step 6: done
step 7: iterate the stack and form the string
step 8: if absolutePath.empty() then
step 9: absolutePath = s.pop();
step 10: else
step 11: absolutePath = s.pop() +"\" + absoultePath
}
int array[15] = { 1,1,1,2,2,3,3,4,4,4,5,5,6,7,7 }
- Deepak Garg May 27, 2008I assumed that array size is given to us. let suppose it is N
1. start traversing the array from end.
2. compare current and next element if they are equal
then shift the array to next element location.
( Remember shifting of an element doesn't considered in complexity )
3. else cont. the loop
so time complexity O(N)