Sunday, November 25, 2012
Introduction to Go & Google Cloud Offerings @ Bangalore,Nov 30
SAP TechEd @ Bangalore on Nov 28-30
Saturday, November 24, 2012
jQuery Gems Book by Greg Sidelnikov released...
Thursday, November 22, 2012
SQL Server UG Meet @ Bangalore - Nov 24,2012
Labels:
Meetups
Location:
Bangalore, Karnataka, India
Microsoft User Group - Developer Day @ Hyderabad,Nov 24,2012
Labels:
Meetups
Location:
Hyderabad, Andhra Pradesh, India
Developer Day – November 24, @ S&P Capital IQ (Hyderabad)
Interesting News:
S&P Capital IQ is hiring Software Engineers & Architects (Microsoft Developer Technologies) for their Hyderabad location and they will be at the event on 24th November to meet & interact with you. So be there and do not miss this opportunity at any cost. And do not forget to bring along your CV !
Session details are as follows:
--------------------------------------------------------------
--------------------------------------------------------------
2.00 pm - 2.15 pm : Opening Keynote by Amit Bansal (co-founder, HelloWorldGeeks.com).
2.15 pm - 3.15 pm : Hidden facts of .NET 4.5 language jems by Abhishek Sur (co-founder, HelloWorldGeeks.com, MVP)
Abstract: Languages are essential component of any developer technology. .NET languages have been enhanced a lot recently. This session will introduce new language features and show the internals of its implementations to help you decide when and where a feature could be optimally utilized.
3.15 pm - 3.30 pm : Session by S&P Capital IQ HR Team.
3.30 pm - 3.45 pm : Refreshments.
3.45 pm - 4.45 pm : Panel Discussion (open ended) on Microsoft Developer Technologies
Abstract: Feel free to ask any developer related question to our expert panel comprising of Ramesh Viswanathan (S&P Capital IQ), Abhishek Sur & Himabindu Vejella (Microsoft). Do not miss this opportunity to interact with our expert panel in an open ended discussion around Microsoft Developer Technologies.
4.45 pm- 5.00 pm : Closing note.
--------------------------------------------------------------
Date: November 24' 2012, Saturday
Time: 1.00 pm to 5.00 pm
Venue: S&P Capital IQ,
SDE Prameela Techno Park, Survey No.12P, Kondapur Village,
RR Dist, Hyderabad
Opposite to Jayabheri Silicon valley or Google office
SDE Prameela Techno Park, Survey No.12P, Kondapur Village,
RR Dist, Hyderabad
Opposite to Jayabheri Silicon valley or Google office
Parking: Parking arrangements have been made in SP Capital premises.
(Note: The event will start sharp at 1.30 pm. Please come by 1.00 pm for registration. Please bring a valid photo ID. For any clarifications, feel free to call Mamita Sinha at +91 9007009017)
Labels:
Meetups
Location:
Hyderabad, Andhra Pradesh, India
Wednesday, October 24, 2012
Quiz 1: Answers...
If you have missed the previous articles of the Quiz,Please Read:
http://itsmyslife.blogspot.in/2012/10/quiz-1-introduction-to-computer-science.html
The answers for the quiz questions are below:
1) Why does 53 represent the number 5 in ASCII?
In this context, we're representing characters through numbers. As such, the number 53 links to the character '5'.
2) An ASCII Table is a large reference guide that show which numbers represent which characters.
True
3) Express this binary number as a decimal number: 10010110
A: 150
4) One algorithm has a run time of n/1000. Another algorithm has a run time of log(n). Considering that n is a very large number, which of these will complete first?
The log(n) algorithm
5) In David's phonebook example, if he turns one page at a time, it will take him log(n) steps to complete the search.
False
http://itsmyslife.blogspot.in/2012/10/quiz-1-introduction-to-computer-science.html
The answers for the quiz questions are below:
1) Why does 53 represent the number 5 in ASCII?
In this context, we're representing characters through numbers. As such, the number 53 links to the character '5'.
2) An ASCII Table is a large reference guide that show which numbers represent which characters.
True
3) Express this binary number as a decimal number: 10010110
A: 150
4) One algorithm has a run time of n/1000. Another algorithm has a run time of log(n). Considering that n is a very large number, which of these will complete first?
The log(n) algorithm
5) In David's phonebook example, if he turns one page at a time, it will take him log(n) steps to complete the search.
False
----------------------------------------------------
Continued...
Happy Learning..Happy Programming :)
Happy Learning..Happy Programming :)
Labels:
Computer Science
Location:
Bangalore, Karnataka, India
Subscribe to:
Posts (Atom)