Kiran Kumar
BAN USERI am very passionate about technology. I am a Microsoft Student Partner (MSP). My Areas of Interests include Data Structures & Operating Systems. I have done few projects in the field of cloud computing.
OBJECTIVE
To work in a challenging position that would exercise my technical skills and provide a platform for honing my skills further to propel the organization forward.
PERSONAL
Date of Birth : 14th November 1991
Sex : Male
Father’s Name : T. Mani
Mother Tongue : Tamil
Languages Known : English and Tamil (to read, write and speak)
EDUCATION
B.E., Computer Science and Engineering, 2013
P.S.G College of Technology, Coimbatore, Tamil Nadu.
CGPA: 8.49 (Till 5th Semester)
Bachelor’s degree in Computer Science and Engineering anticipated by April 2013
XII Standard, April 2009
Stanes Anglo-Indian Higher Secondary School, Coimbatore, Tamil Nadu.
Marks: 1130/1200 (94.17%)
X Standard, April 2007
Stanes Anglo-Indian Higher Secondary School, Coimbatore, Tamil Nadu.
Marks: 928/1000 (92.8%)
TECHNICAL EXPERTISE
Programming Languages : C, C++
Software Packages : MS Office, Oracle, MySQL
Platforms Worked On : Windows (XP, Vista, 7) and Linux (Debian based)
AREAS OF INTEREST
• Operating Systems
• Data Structures
• Cloud Computing
UNDER GRADUATE PROJECTS
FILE SYNCHRONIZATION IN THE CLOUD
Platform: Eucalyptus Language: Shell Script
The project involved setting up of cloud using Eucalyptus. The cloud set up was used to perform file synchronization using rsync, which incorporates “Delta Encoding” algorithm. Shell scripting language was used to initiate and schedule the synchronization process.
THREAT MANAGEMENT MASHAPP
Platform: Cordys Mashapps Composer
It is a cloud based solution, which helps anti-malware companies to handle emerging threats in an organized and an efficient manner. The app utilizes the services of Google Docs, Google Gadgets, 160by2 SMS and iGoogle. An Android app was developed using App Inventor to enable users with Android devices to access this Mashapp.
FORMULA ONE CONTENT MANAGEMENT SYSTEM (CMS)
Language: PHP Database: MySQL
It is a Content Management System (CMS), which enables the administrator to maintain a dynamic website containing the details about Formula One teams, drivers, circuits, etc.
INFOVAULT
Platform: Windows Phone 7 Language: C#
InfoVault helps the users to store confidential information in their Windows Phone without any worry. The user can store any text, which will be safe guarded by InfoVault. It will restrict access to the saved information until the password specified matches with the saved password.
PRIORITY BASED DYNAMIC SCHEDULING OF VIRTUAL MACHINES (UNDER PROGRESS)
Platform: Eucalyptus Language: Shell Script
The project involves implementation of a priority based dynamic scheduling algorithm. The Virtual Machines (VMs) in the cloud environment are allocated to the nodes having the maximum resource with load factor > 80%. This algorithm is energy efficient as unused nodes are turned off and only the node with maximum resource is turned on. This algorithm also prevents a particular node from being overloaded.
ACHIEVEMENTS
• Got selected as Microsoft Student Partner (MSP) for the year 2011-2012
• Won first place for creating a video to spread awareness about Kidney Cancer, in a competition organized by Kidney Cancer Association, United States of America. This was published in the Kidney Cancer Association’s Newsletter.
• Won 1st place in Teamsters (Business Game) conducted by Sri Ramakrishna Engineering College.
• Won 3rd place in Logics and Algorithms conducted by ISTE.
• Secured Rank 29 in worldwide IT Challenge Quiz of Imagine Cup 2012 conducted by Microsoft.
• Secured Rank 90 in worldwide Metro Style App Challenge Quiz of Imagine Cup 2012 conducted by Microsoft.
• Scored centum in Science and Maths-I during 10th standard public examination.
EXTRA- AND CO-CURRICULAR ACTIVITIES
• Designed the website for KruZade ’12 using PHP & MySQL .
• Event coordinator for Linux Event in KruZade ’12.
• Organized the Windows Phone 7 App Development workshop in KruZade ’12.
• Active member of CBEUG (Coimbatore User Group), formed by the Coimbatore MSPs.
• Member of the Digital Literacy Program (DLP), in which the Government School students are taught about the basics of computer.
• Participated in the cloud computing workshop organized by Cordys in Kumaraguru College of Technology (KCT), Coimbatore.
• Had presented the Threat Management MashApp in a cloud computing workshop organized by PSG Tech and IBM.
• Participated in various online coding competitions
• Participated in Aspirations 2020 organized by Infosys.
• Attended “As I Evolve” series, a personality development programme organized by Rotary club of Coimbatore.
HOBBIES
• Surfing the web
• Playing cricket
• Reading Tech articles
I, KIRAN KUMAR M do hereby confirm that the information given above is true to the best of my knowledge.
SIGNATURE
Sizeof needs to be an operator, since it should be evaluated at the compile time. Functions will be executed only at the run time. If sizeof is implemented as a function, then operations depending upon sizeof would fail (like static memory allocation using sizeof).
- Kiran Kumar February 07, 2013You can do it in 2N traversals. That is O(n). First find the product of N numbers and store it in a variable. Then, in the second traversal, traverse the array and divide by the element in each index and print the value.
- Kiran Kumar August 09, 2012Cool..works great :). Can u tell me the significance of "n--" here? Why is it used? I don't get it.
- Kiran Kumar August 07, 2012Can u please explain the code? If possible, explain it in steps.
- Kiran Kumar August 04, 2012To find the preorder successor of a node, locate that node in the tree.. then check if the left of the node is null. If it is not null then print it. Else if, check if the right of node is null. If it is not null then print it. Else print the right of the root.
- Kiran Kumar July 07, 2012@mk13: Thank you. I got it :)
- Kiran Kumar May 29, 2012@mk13: I didn't understand the second part of your answer
"select a number,add that in remaining 1GB, and while selecting this number, bring a number from corresponding chunk to replace it, finally write sorted 1GB to secondary storage."
Can you explain it more clearly?
@? : Yes. The regions would be loaded on demand.
Apart from these, when a context switch occurs, the virtual address translation should be done to locate the u-area as well as pregion table of the process to be executed from the process control block. So, these things cause an extra overhead for the process when compared to threads.
@siva.sai.2020 : It has nothing to do with the number of processors. If a thread or a process moves to a blocked state, then some other thread or process which is ready to run will be using the processor. It depends entirely the implementation of the threads, whether it is kernel level, user level or hybrid.
- Kiran Kumar May 12, 2012@? : Apart from the register set being restored, every process has a text(code), stack and data area. Each area consists of regions. Every time a context switch occurs, the stack, data and text area needs to be changed. If a particular region of an area is unavailable, then it needs to be loaded in the memory. But, in the case of multiple threads of a single process, all the threads share the same text, stack and data area.
@rukawa : Nothing was mentioned about the processors in the question. Normally the number of processes in a machine would be in hundreds and it isn't a wise idea to have hundreds of processors. So, context switching takes place.
Through system calls.
- Kiran Kumar May 10, 2012Single Process with multiple threads... Simple reason is that threads are light weight when compared to processes during context switch. Since the threads of a process share the same address space, the address space need not be changed every time a context switch occurs. This is not the same case with different processes.
- Kiran Kumar May 10, 2012It WILL be blocked if the thread is implemented as a user level thread and will NOT be blocked if it is implemented as a kernel level thread.
- Kiran Kumar May 10, 2012
I thought of the same solution. But, it won't work!
- Kiran Kumar February 17, 2013How many numbers would you keep track of, at any instant?
Consider the worst case, where a lot of numbers are inserted at one particular side of the median (i.e left or right of the median). Assume that you keep track of 4 numbers,
60,70,80,90 --> median = 70
I have lost track of other numbers like 50,55,95,100, since we are keeping track of the nearest neighbors of median, that is 4 here.
Now, I am inserting 20 numbers with values between (20 to 40). How would you get the median? You have lost the values 50, 55, etc which you should have considered. This is where it would fail.
So, the correct solution would be to use self-balancing trees like AVL tree. The root of the tree would be the median.