<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href="http://www.blogger.com/styles/atom.css" type="text/css"?><feed xmlns='http://www.w3.org/2005/Atom' xmlns:openSearch='http://a9.com/-/spec/opensearchrss/1.0/' xmlns:georss='http://www.georss.org/georss' xmlns:gd='http://schemas.google.com/g/2005' xmlns:thr='http://purl.org/syndication/thread/1.0'><id>tag:blogger.com,1999:blog-19569682</id><updated>2011-10-16T02:22:50.919+05:30</updated><title type='text'>The Nameless Blog</title><subtitle type='html'></subtitle><link rel='http://schemas.google.com/g/2005#feed' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/posts/default'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default?max-results=100'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/'/><link rel='hub' href='http://pubsubhubbub.appspot.com/'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><generator version='7.00' uri='http://www.blogger.com'>Blogger</generator><openSearch:totalResults>94</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>100</openSearch:itemsPerPage><entry><id>tag:blogger.com,1999:blog-19569682.post-113379544162905203</id><published>2009-12-05T20:40:00.000+05:30</published><updated>2008-06-08T22:40:40.487+05:30</updated><title type='text'>Table of Content</title><content type='html'>&lt;table style="border-collapse: collapse; width: 100%; height: 134px; color: rgb(17, 17, 17);" id="AutoNumber13" border="0" cellpadding="0" cellspacing="0"&gt;&lt;tbody&gt;&lt;tr&gt;&lt;td valign="top" width="50%"&gt;&lt;fieldset style="border-style: dotted;"&gt;                  &lt;legend&gt;&lt;span style="color: rgb(255, 0, 255);"&gt;&lt;b&gt;Language/IT:-&lt;/b&gt;&lt;/span&gt;&lt;/legend&gt;                   &lt;table style="border-collapse: collapse; color: rgb(17, 17, 17);" id="AutoNumber14" border="0" cellpadding="0" cellspacing="0" width="100%"&gt;                     &lt;tbody&gt;&lt;tr&gt;                       &lt;td valign="top" width="100%"&gt;&lt;span style="font-size:100%;"&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/questions-on-c-part-i.html"&gt;Questions On C - I&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/questions-on-c-part-2.html"&gt;Questions On C - II&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/questions-on-c-iii.html"&gt;Questions On C - III&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/03/c-syntax-semantics-and-simple.html"&gt;Questions On C - IV&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/questions-on-c.html"&gt;Questions On C++ - I&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/questions-on-c-ii.html"&gt;Questions On C++ - II&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/01/questions-on-c-iii.html"&gt;Questions On C++ - III&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/03/c-syntax-semantics-and-simple_30.html"&gt;Questions On C++ - IV&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/c-oop-concepts.html"&gt;C++ and OOP Concept&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/cc-puzzles.html"&gt;C/C++ Puzzles&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/c-c-perl-and-unix.html"&gt;C, C++, Perl and Unix&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/01/questions-on-java-i.html"&gt;Questions On Java - I&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/03/questions-on-java-ii.html"&gt;Questions On Java - II&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/03/questions-on-java-iii-java.html"&gt;Questions On Java - III&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/01/questions-on-visual-basic-i.html"&gt;Questions On VB - I&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/04/questions-on-c-i.html"&gt;Questions On C# - I&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/03/questions-on-database-i.html"&gt;Questions On Database - I&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/03/questions-on-data-structure-i.html"&gt;Questions On Data Structure - I&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/04/questions-on-design-patterns.html"&gt;Questions On Design Patterns&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/03/miscellaneous-it-questions-i.html"&gt;&lt;span style="font-weight: bold;"&gt;Miscellaneous IT Questions - I&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/04/linux-admin-interview-questions.html"&gt;&lt;span style="font-weight: bold;"&gt;Linux Admin Interview Questions&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/question-banks.html"&gt;Question Banks&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/frequently-ased-questions.html"&gt;Frequently Asked Questions&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://kgptech.blogspot.com/2005/08/database-reference.html"&gt;                       &lt;/a&gt;&lt;/span&gt;&lt;/td&gt;                     &lt;/tr&gt;                   &lt;/tbody&gt;&lt;/table&gt;                    &lt;/fieldset&gt;&lt;br /&gt;&lt;fieldset style="border-style: dotted;"&gt;&lt;legend&gt;&lt;span style="color: rgb(255, 0, 255);"&gt;&lt;b&gt;Interview:-&lt;/b&gt;&lt;/span&gt;&lt;/legend&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/facing-job-interview.html"&gt;Facing a JOB Interview&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/commonly-asked-interviews-questions-i.html"&gt;Commonly Asked Interview Questions - I&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/25-most-difficult-questions-youll-be.html"&gt;The 25 Most Difficult Questions you will be asked on a job interview&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/03/50-common-interview-questions.html"&gt;50 Common Interview Questions&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/your-job-interview-is-beauty-contest.html"&gt;Your Job Interview is a beauty Contest&lt;/a&gt;&lt;br /&gt;&lt;/fieldset&gt;&lt;br /&gt;&lt;fieldset style="border-style: dotted;"&gt;&lt;legend&gt;&lt;span style="color: rgb(255, 0, 255);"&gt;&lt;b&gt;Miscellaneous:-&lt;/b&gt;&lt;/span&gt;&lt;/legend&gt;&lt;span style="color: rgb(204, 102, 0); font-weight: bold;"&gt;Aptitide and Puzzles&lt;/span&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/aptitude-test-questions-i.html"&gt;Aptitude Test Questions - I&lt;/a&gt;&lt;br /&gt;&lt;span&gt;&lt;span style="font-size:100%;"&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/04/de-shaw-aptitude-ii.html"&gt;&lt;span style="font-weight: bold;"&gt;DE Shaw :: Aptitude - II&lt;/span&gt;&lt;/a&gt;&lt;/span&gt;&lt;br /&gt;&lt;span style="font-weight: bold;"&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/03/logic-questions-i.html"&gt;Logic Questions - I&lt;/a&gt;&lt;/span&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/puzzles-to-puzzle-you.html"&gt;Puzzles to Puzzle you&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/04/job-puzzles-i.html"&gt;Job Puzzles - I&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(204, 102, 0); font-weight: bold;"&gt;Verbals&lt;/span&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/04/verbal-test-questions-i.html"&gt;Verbal Test Questions - I&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/04/verbal-test-questions-ii.html"&gt;Verbal Test Questions - II&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(204, 102, 0); font-weight: bold;"&gt;Miscellaneous&lt;/span&gt;&lt;br /&gt;&lt;span style="font-weight: bold;"&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/03/physcometric-test-i-tcs.html"&gt;TCS :: Pshycometric Test - I&lt;/a&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/02/8-commandments-for-job-seekers.html"&gt;8 Commandments for job-seekers&lt;/a&gt;&lt;br /&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/fieldset&gt;&lt;/td&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;td valign="top" width="50%"&gt;                   &lt;fieldset style="border-style: dotted;"&gt;                   &lt;legend&gt;&lt;span style="color: rgb(255, 0, 255);"&gt;&lt;b&gt;Electronics:-&lt;/b&gt;&lt;/span&gt;&lt;/legend&gt;                   &lt;table style="border-collapse: collapse; color: rgb(17, 17, 17);" id="AutoNumber15" border="0" cellpadding="0" cellspacing="0" width="100%"&gt;                     &lt;tbody&gt;&lt;tr&gt;                       &lt;td valign="top" width="100%"&gt;                       &lt;span style="font-size:100%;"&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/ece-digital-electronics.html"&gt;Digital Electronics - I&lt;/a&gt;&lt;/span&gt;&lt;span style="font-weight: bold;font-size:100%;" &gt;&lt;br /&gt;&lt;/span&gt;&lt;span style="font-size:100%;"&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/vlsi-design.html"&gt;VLSI Design&lt;/a&gt;&lt;br /&gt;&lt;/span&gt;&lt;span style="font-size:100%;"&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/02/miscellaneous-ece-question-links.html"&gt;Misc ECE Question Paper Link&lt;/a&gt;&lt;br /&gt;&lt;/span&gt;&lt;span style="font-size:100%;"&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/02/miscellaneous-ece-links-ii.html"&gt;Miscellaneous ECE Links - II&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/03/some-tough-ece-questions.html"&gt;Some Tough ECE Questions&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/03/questions-on-microprocessor-i.html"&gt;Questions On Microprocessor - I&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/04/ece-checklist.html"&gt;ECE Checklist&lt;/a&gt;&lt;/span&gt;&lt;span style="font-size:100%;"&gt;&lt;br /&gt;&lt;/span&gt;&lt;/td&gt;                     &lt;/tr&gt;                    &lt;/tbody&gt;&lt;/table&gt;                   &lt;/fieldset&gt;&lt;br /&gt;&lt;fieldset style="border-style: dotted;"&gt;                   &lt;legend&gt;&lt;span style="color: rgb(255, 0, 255);"&gt;&lt;b&gt;Computer Science:-&lt;/b&gt;&lt;/span&gt;&lt;/legend&gt;                   &lt;table style="border-collapse: collapse; color: rgb(17, 17, 17);" id="AutoNumber15" border="0" cellpadding="0" cellspacing="0" width="100%"&gt;                     &lt;tbody&gt;&lt;tr&gt;                       &lt;td valign="top" width="100%"&gt;                       &lt;span style="font-size:100%;"&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/computer-architecture-i.html"&gt;Computer Architecture - I&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/computer-architecture-ii.html"&gt;Computer Architecture - II&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2005/12/networking.html"&gt;Networking - I&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/01/networking-ii.html"&gt;Networking - II&lt;/a&gt;&lt;br /&gt;&lt;/span&gt;&lt;span style="font-weight: bold;font-size:100%;" &gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/03/questions-on-operating-systems-i.html"&gt;Questions On Operating Systems&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/03/tougher-programming-questions-i.html"&gt;Tougher Programming Questions&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/03/data-structures-and-algorithms-i.html"&gt;Data Structures &amp;amp; Algorithms - I&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/04/good-cs-interview-questions.html"&gt;Good CS Interview Questions - I&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/04/questions-from-code4bill-contest.html"&gt;Questions &lt;/a&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/04/questions-from-code4bill-contest.html"&gt;from Code4Bill Contest&lt;/a&gt;&lt;/span&gt;&lt;br /&gt;&lt;/td&gt;                     &lt;/tr&gt;                    &lt;/tbody&gt;&lt;/table&gt;                   &lt;/fieldset&gt;&lt;br /&gt;&lt;fieldset style="border-style: dotted;"&gt;                   &lt;legend&gt;&lt;span style="color: rgb(255, 0, 255);"&gt;&lt;b&gt;Placement Papers:-&lt;/b&gt;&lt;/span&gt;&lt;/legend&gt;&lt;span style="color: rgb(204, 102, 0); font-weight: bold;"&gt;ECE &amp;amp; CS&lt;br /&gt;&lt;/span&gt;&lt;span&gt;&lt;span style="font-size:100%;"&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/04/analog-devices-placement-paper-i.html"&gt;Analog Devices Question Paper - I&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/04/cadence-placement-paper-i.html"&gt;Cadence :: Placement Paper - I&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/04/cadence-placement-paper-ii.html"&gt;Cadence :: Placement Paper - II&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/04/de-shaw-programming-questions-i.html"&gt;&lt;span style="font-weight: bold;"&gt;DE Shaw :: Programming - I&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/04/de-shaw-aptitude-ii.html"&gt;&lt;span style="font-weight: bold;"&gt;DE Shaw :: Aptitude - II&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/04/de-shaw-placement-paper-iii.html"&gt;&lt;span style="font-weight: bold;"&gt;DE Shaw :: Placement Paper - III&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/04/google-placement-paper-i.html"&gt;Google :: Placement Paper - I&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/02/intel-interview-questions.html"&gt;Intel Question Paper - I&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/04/interra-placement-paper-i.html"&gt;&lt;span style="font-weight: bold;"&gt;Interra :: Placement Paper - I&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/04/mentor-graphics-placement-papers.html"&gt;&lt;span style="font-weight: bold;"&gt;Mentor Graphics Question Paper - I&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;/span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span style="font-weight: bold;font-size:100%;" &gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/03/microsoft-sample-placement-paper-i.html"&gt;Microsoft :: Placement Paper - I&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/04/microsoft-interview-questions-ii.html"&gt;Microsoft :: Interview Questions - II&lt;/a&gt;&lt;br /&gt;&lt;/span&gt;&lt;span&gt;&lt;span style="font-size:100%;"&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/04/motorola-question-paper-i.html"&gt;Motorola Questions Paper - I&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/05/oracle-aptitude-i.html"&gt;&lt;span style="font-weight: bold;"&gt;Oracle :: Aptitude - I&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/04/stm-question-paper-i.html"&gt;STM Questions Paper - I&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/04/stm-question-paper-ii.html"&gt;&lt;span style="font-weight: bold;"&gt;STM Questions Paper - II&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;/span&gt;&lt;span&gt;&lt;span style="font-size:100%;"&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/02/ti-and-intel-sample-question-paper-i.html"&gt;TI and Intel Question Paper - I&lt;/a&gt;&lt;/span&gt;&lt;br /&gt;&lt;span style="font-size:100%;"&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/04/ti-question-paper-i.html"&gt;TI Question Paper - I&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/04/ti-question-paper-ii.html"&gt;TI Question Paper - II&lt;/a&gt;&lt;br /&gt;&lt;a style="font-weight: bold;" href="http://the-name-less-blog.blogspot.com/2006/04/wipro-vlsi-i.html"&gt;Wipro :: VLSI - I&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/05/yahoo-india-placement-paper-i.html"&gt;&lt;span style="font-weight: bold;"&gt;Yahoo India :: Placement Paper - I&lt;/span&gt;&lt;br /&gt;&lt;/a&gt;&lt;/span&gt;&lt;span&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/fieldset&gt;&lt;/td&gt;                 &lt;/tr&gt;               &lt;/tbody&gt;&lt;/table&gt;               &lt;p&gt; &lt;/p&gt;&lt;fieldset style="border-style: dotted;"&gt;&lt;legend&gt;&lt;span style="color: rgb(255, 0, 255);font-size:100%;" &gt;&lt;b&gt;Placement Papers:-&lt;/b&gt;&lt;/span&gt;&lt;/legend&gt;               &lt;table style="border-collapse: collapse; color: rgb(17, 17, 17);" id="AutoNumber3" border="0" cellpadding="0" cellspacing="0" width="100%"&gt;                 &lt;tbody&gt;&lt;tr&gt;                   &lt;td valign="top" width="50%"&gt;&lt;span style="font-size:85%;"&gt;&lt;b&gt;                   &lt;a href="http://kgptech.blogspot.com/2005/07/algorithm-data-structure.html"&gt;&lt;/a&gt;&lt;/b&gt;&lt;/span&gt;&lt;a style="font-weight: bold;" href="http://kgptech.blogspot.com/2005/08/computer-science-miscellaneous.html"&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span style="color: rgb(204, 102, 0);"&gt;IT Companies&lt;br /&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/a&gt;&lt;span style="font-weight: bold;"&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/04/dharma-systems-placement-papers.html"&gt;Dharma Systems&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/05/drdo-placement-paper-i.html"&gt;DRDO - I&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/04/hcl-c-programing-i.html"&gt;HCL :: C Programming - I&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/05/onmobile-aptitude-i.html"&gt;OnMobile :: Aptitude - I&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/05/mindtree-placement-paper-i.html"&gt;Mindtree :: Placement Paper - I&lt;/a&gt;&lt;br /&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/td&gt;                   &lt;td valign="top" width="50%"&gt;&lt;span style="font-size:85%;"&gt;&lt;b&gt;                   &lt;/b&gt;&lt;/span&gt;&lt;span style="font-weight: bold;"&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/05/accenture-i.html"&gt;Accenture - I&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/05/accenture-ii.html"&gt;Accenture - II&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/05/infosys-aptitude-i.html"&gt;Infosys :: Aptitude - I&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/01/tcs-sample-question-paper-i.html"&gt;TCS :: Sample Question Paper - I&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/03/physcometric-test-i-tcs.html"&gt;TCS :: Pshycometric Test - I&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/05/tcs-aptitude-and-resoning-i.html"&gt;TCS :: Aptitude and Resoning - I&lt;/a&gt;&lt;br /&gt;&lt;a href="http://the-name-less-blog.blogspot.com/2006/05/wipro-i.html"&gt;Wipro - I&lt;/a&gt;&lt;br /&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/tbody&gt;&lt;/table&gt;&lt;/fieldset&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-113379544162905203?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/113379544162905203/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=113379544162905203' title='14 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/113379544162905203'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/113379544162905203'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/12/table-of-content.html' title='Table of Content'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>14</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-3066831543117141959</id><published>2009-08-05T22:35:00.000+05:30</published><updated>2009-08-05T22:36:19.868+05:30</updated><title type='text'>VLSI Interview Questions - II</title><content type='html'>&lt;a title="View VLSI interview questions on Scribd" href="http://www.scribd.com/doc/2910458/VLSI-interview-questions" style="margin: 12px auto 6px auto; font-family: Helvetica,Arial,Sans-serif; font-style: normal; font-variant: normal; font-weight: normal; font-size: 14px; line-height: normal; font-size-adjust: none; font-stretch: normal; -x-system-font: none; display: block; text-decoration: underline;"&gt;VLSI interview questions&lt;/a&gt; &lt;object codebase="http://download.macromedia.com/pub/shockwave/cabs/flash/swflash.cab#version=9,0,0,0" id="doc_319793501314270" name="doc_319793501314270" classid="clsid:d27cdb6e-ae6d-11cf-96b8-444553540000" align="middle" height="500" width="100%" &gt;  &lt;param name="movie" value="http://d.scribd.com/ScribdViewer.swf?document_id=2910458&amp;access_key=key-1ac9lvvb2cmn7qc6j1mv&amp;page=1&amp;version=1&amp;viewMode="&gt;   &lt;param name="quality" value="high"&gt;   &lt;param name="play" value="true"&gt;  &lt;param name="loop" value="true"&gt;   &lt;param name="scale" value="showall"&gt;  &lt;param name="wmode" value="opaque"&gt;   &lt;param name="devicefont" value="false"&gt;  &lt;param name="bgcolor" value="#ffffff"&gt;   &lt;param name="menu" value="true"&gt;  &lt;param name="allowFullScreen" value="true"&gt;   &lt;param name="allowScriptAccess" value="always"&gt;   &lt;param name="salign" value=""&gt;        &lt;embed src="http://d.scribd.com/ScribdViewer.swf?document_id=2910458&amp;access_key=key-1ac9lvvb2cmn7qc6j1mv&amp;page=1&amp;version=1&amp;viewMode=" quality="high" pluginspage="http://www.macromedia.com/go/getflashplayer" play="true" loop="true" scale="showall" wmode="opaque" devicefont="false" bgcolor="#ffffff" name="doc_319793501314270_object" menu="true" allowfullscreen="true" allowscriptaccess="always" salign="" type="application/x-shockwave-flash" align="middle"  height="500" width="100%"&gt;&lt;/embed&gt; &lt;/object&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-3066831543117141959?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/3066831543117141959/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=3066831543117141959' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/3066831543117141959'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/3066831543117141959'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2009/08/vlsi-interview-questions-ii.html' title='VLSI Interview Questions - II'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-842366443199442267</id><published>2009-04-18T14:37:00.000+05:30</published><updated>2009-04-18T14:38:35.797+05:30</updated><title type='text'>VLSI Interview questions</title><content type='html'>&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_01_FUNCTIONAL_VERIFICATION_QUESTIONS.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;FUNCTIONAL VERIFICATION QUESTIONS&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_02_FUNCTIONAL_VERIFICATION_QUESTIONS_2.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;FUNCTIONAL VERIFICATION QUESTIONS 2&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_03_TEST_YOUR_SYSTEMVERILOG_SKILLS_1.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR SYSTEMVERILOG SKILLS 1&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_04_TEST_YOUR_SYSTEMVERILOG_SKILLS_2.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR SYSTEMVERILOG SKILLS 2&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_05_TEST_YOUR_SYSTEMVERILOG_SKILLS_3.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR SYSTEMVERILOG SKILLS 3&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_06_TEST_YOUR_SYSTEMVERILOG_SKILLS_4.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR SYSTEMVERILOG SKILLS 4&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_07_TEST_YOUR_SVA_SKILLS.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR SVA SKILLS&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_08_TEST_YOUR_VERILOG_SKILLS_1.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR VERILOG SKILLS 1&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_09_TEST_YOUR_VERILOG_SKILLS_2.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR VERILOG SKILLS 2&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_10_TEST_YOUR_VERILOG_SKILLS_3.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR VERILOG SKILLS 3&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_11_TEST_YOUR_VERILOG_SKILLS_4.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR VERILOG SKILLS 4&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_12_TEST_YOUR_VERILOG_SKILLS_5.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR VERILOG SKILLS 5&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_13_TEST_YOUR_VERILOG_SKILLS_6.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR VERILOG SKILLS 6&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_14_TEST_YOUR_VERILOG_SKILLS_7.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR VERILOG SKILLS 7&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_15_TEST_YOUR_VERILOG_SKILLS_8.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR VERILOG SKILLS 8&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_16_TEST_YOUR_VERILOG_SKILLS_9.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR VERILOG SKILLS 9&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_17_TEST_YOUR_VERILOG_SKILLS_10.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR VERILOG SKILLS 10&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_18_TEST_YOUR_VERILOG_SKILLS_11.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR VERILOG SKILLS 11&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_19_TEST_YOUR_VERILOG_SKILLS_12.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR VERILOG SKILLS 12&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_20_TEST_YOUR_VERILOG_SKILLS_13.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR VERILOG SKILLS 13&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_21_TEST_YOUR_VERILOG_SKILLS_14.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR VERILOG SKILLS 14&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_22_TEST_YOUR_VERILOG_SKILLS_15.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR VERILOG SKILLS 15&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_23_TEST_YOUR_VERILOG_SKILLS_16.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR VERILOG SKILLS 16&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_24_TEST_YOUR_VERILOG_SKILLS_17.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR VERILOG SKILLS 17&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_25_TEST_YOUR_SPECMAN_SKILLS_1.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR SPECMAN SKILLS 1&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_26_TEST_YOUR_SPECMAN_SKILLS_2.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR SPECMAN SKILLS 2&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_27_TEST_YOUR_SPECMAN_SKILLS_3.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR SPECMAN SKILLS 3&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_28_TEST_YOUR_SPECMAN_SKILLS_4.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR SPECMAN SKILLS 4&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_29_TEST_YOUR_STA_SKILLS_1.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR STA SKILLS 1&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_30_TEST_YOUR_STA_SKILLS_2.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR STA SKILLS 2&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_31_TEST_YOUR_STA_SKILLS_3.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR STA SKILLS 3&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_32_TEST_YOUR_STA_SKILLS_4.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR STA SKILLS 4&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_33_TEST_YOUR_STA_SKILLS_5.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR STA SKILLS 5&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_34_TEST_YOUR_STA_SKILLS_6.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR STA SKILLS 6&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_35_TEST_YOUR_STA_SKILLS_7.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR STA SKILLS 7&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_36_TEST_YOUR_DFT_SKILLS_1.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR DFT SKILLS 1&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_37_TEST_YOUR_DFT_SKILLS_2.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR DFT SKILLS 2&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_38_TEST_YOUR_DFT_SKILLS_3.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR DFT SKILLS 3&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(255, 255, 255);"&gt;............&lt;/span&gt;&lt;a href="http://testbench.in/IQ_39_TEST_YOUR_DFT_SKILLS_4.html" target="_top"&gt;&lt;span style="color: rgb(102, 102, 102);font-size:85%;" &gt;&lt;b&gt;&lt;u&gt;TEST YOUR DFT SKILLS 4&lt;/u&gt;&lt;/b&gt;&lt;/span&gt;&lt;/a&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-842366443199442267?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/842366443199442267/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=842366443199442267' title='2 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/842366443199442267'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/842366443199442267'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2009/04/vlsi-interview-questions.html' title='VLSI Interview questions'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>2</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-1447354407565892081</id><published>2008-06-08T22:24:00.003+05:30</published><updated>2008-06-08T22:39:31.372+05:30</updated><title type='text'>Ultimate VLSI Interview Questions</title><content type='html'>Ultimate VLSI Interview Question Selection. Just have a look, you will get amazed for sure.&lt;span&gt;&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://subash.nayak.googlepages.com/interview_vlsibank.pdf"&gt;http://subash।nayak.googlepages.com/interview_vlsibank.pdf&lt;/a&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-1447354407565892081?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/1447354407565892081/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=1447354407565892081' title='2 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/1447354407565892081'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/1447354407565892081'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2008/06/ultimate-vlsi-interview-questions.html' title='Ultimate VLSI Interview Questions'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>2</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-116523472657182114</id><published>2006-12-04T17:47:00.000+05:30</published><updated>2006-12-04T17:48:46.583+05:30</updated><title type='text'>GD and PI Tips from ma Foi</title><content type='html'>&lt;a href="http://www.scholarsavenue.org/wordpress/2006/11/29/gd-and-pi-tips-from-ma-foi/"&gt;http://www.scholarsavenue.org/wordpress/2006/11/29/gd-and-pi-tips-from-ma-foi/ &lt;/a&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-116523472657182114?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/116523472657182114/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=116523472657182114' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/116523472657182114'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/116523472657182114'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/12/gd-and-pi-tips-from-ma-foi.html' title='GD and PI Tips from ma Foi'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114753593283520405</id><published>2006-05-13T21:23:00.000+05:30</published><updated>2006-05-13T21:28:52.836+05:30</updated><title type='text'>DRDO :: Placement Paper - I</title><content type='html'>&lt;ol&gt;&lt;li&gt;Which is the fastest Cruise Missile?&lt;/li&gt;&lt;li&gt;What is Wi Fi?&lt;/li&gt;&lt;li&gt;The New Biotechnology Software intorduced by TCS is?&lt;/li&gt;&lt;li&gt;Which country is not a Member of SAARC&lt;br /&gt;&lt;br /&gt;a) Bangladesh&lt;br /&gt;b) Myanmar&lt;br /&gt;c) Maldives&lt;br /&gt;d) Nepal&lt;/li&gt;&lt;li&gt;Laser is used for what?&lt;br /&gt;&lt;br /&gt;a) Treatment of Cancer&lt;br /&gt;b) Treatment of Eyes&lt;br /&gt;c) Treatment of Heart&lt;br /&gt;d) Treatment of Kidney&lt;/li&gt;&lt;li&gt;In Which Day world Telecom Day Celebrated?&lt;/li&gt;&lt;li&gt;The area of red planet where the Mars Rover Landed?&lt;/li&gt;&lt;li&gt;Find values for a,b,c,d&lt;br /&gt;&lt;br /&gt;c 1 1 1&lt;br /&gt;0 a 1 b&lt;br /&gt;_______&lt;br /&gt;1 0 d 0&lt;/li&gt;&lt;li&gt;&lt;br /&gt;The minumum no. of Multiplications needed to compute x^768 is&lt;br /&gt;&lt;br /&gt;a) 9&lt;br /&gt;b) 10&lt;br /&gt;c) 425&lt;br /&gt;d) 767&lt;/li&gt;&lt;li&gt;What is Interface Control Information?&lt;/li&gt;&lt;li&gt;In a switch the mean arrival rate of packets is 800 Packets/sec and the the mean service&lt;br /&gt;rate is 925 Packets/sec&lt;br /&gt;&lt;br /&gt;a) .008 Sec&lt;br /&gt;b) .08 sec&lt;br /&gt;c) .8 sec&lt;br /&gt;d) 1.1 sec&lt;/li&gt;&lt;li&gt;Average No. of Comparisons required to sort 3 elements is&lt;br /&gt;&lt;br /&gt;a) 2&lt;br /&gt;b) 2.33&lt;br /&gt;c) 2.67&lt;br /&gt;d) 3&lt;/li&gt;&lt;li&gt;The internal path length of a Bonary Tree with 10nodes is 25. The external path length is&lt;br /&gt;&lt;br /&gt;a) 25&lt;br /&gt;b) 35&lt;br /&gt;c) 40&lt;br /&gt;d) 45&lt;/li&gt;&lt;li&gt;The minumum number of comparisons requied to find the second smallest element in a&lt;br /&gt;1000 element array is&lt;br /&gt;&lt;br /&gt;a) 1008&lt;br /&gt;b) 1010&lt;br /&gt;c) 1999&lt;br /&gt;d) 2000&lt;/li&gt;&lt;li&gt;Suppose all elements above the principal diagonal od n x n matix A are zero. If non zero&lt;br /&gt;elements of the lower triangular Matrix is stored in an array B with A[1][1] stored at&lt;br /&gt;B[1]. The addressing formula to the nonzero element in A[i][j]=?&lt;br /&gt;&lt;br /&gt;a) A[i][j]&lt;br /&gt;b) i(j-1)/2 +i&lt;br /&gt;c) j(i-1)/2 +i&lt;br /&gt;d) i(i-1)/2 +j&lt;/li&gt;&lt;li&gt;A harddisk has a rotation speed of 4500RPM. then the latency time is&lt;br /&gt;&lt;br /&gt;a) .4&lt;br /&gt;b) .6&lt;br /&gt;c) .7&lt;br /&gt;d) .9&lt;/li&gt;&lt;li&gt;Average transfer speed of a i/p serial line is minimum 25,000 Bytes &amp; maximum 60000&lt;br /&gt;Bytes. Polling Strategy adopted takes 4microsec(whether there is any i/p byte or not). It is assured that byte that retrived from controller before next byte arrives are lost. Then the maximum safe polling interveal is&lt;br /&gt;&lt;br /&gt;a) 12&lt;br /&gt;b) 12.33&lt;br /&gt;c) 12.67&lt;br /&gt;d) 32&lt;/li&gt;&lt;li&gt;Assume a system has 16MB cache mean Disk Access Time &amp;amp; cache Access time is 76.5&lt;br /&gt;ns &amp; 1.5 overall mean Access time us 465ms for each tripling the memory the miss rate is&lt;br /&gt;halved. The memory required to bring down the mean Access time to 24ns is&lt;br /&gt;&lt;br /&gt;a) 16 MB&lt;br /&gt;b) 24 MB&lt;br /&gt;c) 32 MB&lt;br /&gt;d) 48 MB&lt;/li&gt;&lt;li&gt;The no. of edjes in disjoint Hamilton circuit in a complex graph with 17 edges is&lt;br /&gt;&lt;br /&gt;a) 8&lt;br /&gt;b) 9&lt;br /&gt;c) 136&lt;br /&gt;d) 17^2&lt;/li&gt;&lt;li&gt;If 100ns is Memory Access Time &amp;amp; 125 microsec is 1frame period. The no. of line that&lt;br /&gt;can be supported in a Time Divison Switch is&lt;br /&gt;&lt;br /&gt;a)125 Lines&lt;br /&gt;b)625 Lines&lt;br /&gt;c)525 Lines&lt;br /&gt;d)465 Lines&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114753593283520405?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114753593283520405/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114753593283520405' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114753593283520405'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114753593283520405'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/05/drdo-placement-paper-i.html' title='DRDO :: Placement Paper - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114753552804526332</id><published>2006-05-13T21:13:00.000+05:30</published><updated>2006-05-13T21:22:11.990+05:30</updated><title type='text'>Wipro - I</title><content type='html'>&lt;span style="color: rgb(153, 51, 0); font-weight: bold;"&gt;Analytical:-&lt;/span&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;A horse is tied to the corner of a square of side 15 m with a rope of&lt;br /&gt;length 14m.Find the area which the horse can graze and the area which&lt;br /&gt;it cannot.&lt;/li&gt;&lt;li&gt;The ratio of incomes of C and D is 3:4.the ratio of their&lt;br /&gt;expenditures is 4:5.Find the ratio of their savings if the savings of C if one&lt;br /&gt;fourths of his income.&lt;/li&gt;&lt;li&gt;Find the no of ways in which four balls can be selected from 4 green&lt;br /&gt;and 6 white balls&lt;/li&gt;&lt;li&gt;A is 6 times as fast as B and takes 100 days less to complete a work&lt;br /&gt;than B. find the total no of days taken by A and B to complete the&lt;br /&gt;work.&lt;/li&gt;&lt;li&gt;A cube is painted Black. It is divided into 125 equal cubes.find the&lt;br /&gt;no of cubes which have atleast 2 sides painted black.&lt;/li&gt;&lt;li&gt; If a covers 15 miles in 20 minutes and 20 miles in 30 min then find&lt;br /&gt;the average speed of A.&lt;/li&gt;&lt;li&gt;The ratio of the no of boys to teachers is 3:80.if 3/5 of the&lt;br /&gt;students r girls and the no of boys is 51 more then the no of girls find the&lt;br /&gt;no of teachers.( Not sure may be one more condition missing).&lt;/li&gt;&lt;/ol&gt;&lt;span style="color: rgb(153, 51, 0); font-weight: bold;"&gt;Technical:-&lt;/span&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt; Register variables can hold&lt;br /&gt;&lt;br /&gt;a Garbage values&lt;br /&gt;b Arrays&lt;br /&gt;c Double values&lt;br /&gt;d All of the above&lt;/li&gt;&lt;li&gt;When an array is passed to a function what exactly is passed.&lt;br /&gt;&lt;br /&gt;   the values of the array&lt;br /&gt;   the address of the starting variable in the array.&lt;br /&gt;   The addresses of the elements in the array&lt;br /&gt;   None&lt;/li&gt;&lt;li&gt;Compiler recognizes the function as pure virtual function if&lt;br /&gt;A The function if equated to 0.&lt;br /&gt;B the function has no body&lt;br /&gt;C if it is declared with the keyword virtual&lt;br /&gt;D none&lt;/li&gt;&lt;li&gt;which of the foll is correct&lt;br /&gt;&lt;br /&gt;A static enum num{ON,OFF}&lt;br /&gt;B static const enum num{ON, OFF}&lt;br /&gt;C const enum num{ON, OFF}&lt;br /&gt;D None&lt;/li&gt;&lt;li&gt; 1.     What is Peer to Peer protocol?&lt;br /&gt; 2.     What is Router, Modem, TCP/IP &amp; in which layer they operate?&lt;br /&gt; 3.     What is the function of router?&lt;br /&gt; 4.     What are the different types of Modems?&lt;br /&gt; 5.     What are the different types of Addressing?&lt;br /&gt; 6.     How does Internet work?&lt;br /&gt; 7.     What do you mean by Client- server?&lt;br /&gt; 8.     Can we call server as a Peer?&lt;br /&gt; 9.     What are the components of the Application Layer?&lt;/li&gt;&lt;/ol&gt;&lt;span style="color: rgb(153, 51, 0); font-weight: bold;"&gt;HR Questions:-&lt;br /&gt;&lt;/span&gt;&lt;ol&gt;&lt;li&gt; Very common HR questions were asked:&lt;br /&gt; 1.     Introduce urself.&lt;br /&gt; 2.     weakness?&lt;br /&gt; 3.     Why WIPRO?&lt;br /&gt; 4.     ready to relocate?&lt;br /&gt; 5.      what do you know about Wipro?&lt;br /&gt;&lt;br /&gt; Some questions were asked from the CV:&lt;br /&gt; 1.     Why did you scored less in Class-XII than class-X&lt;br /&gt; 2.     How did you get the project from MICROSOFT?&lt;br /&gt; 3.     What are your hobbies?&lt;br /&gt; 4.     What was the Debate Topic in which u participated?&lt;br /&gt; 5.     How were you selected for All India Mathematics Olympiad Exam?&lt;br /&gt; 6.     What were your contributions in the college Fest?&lt;/li&gt;&lt;li&gt; 1.     Introduce urself.&lt;br /&gt; 2.     Family background.&lt;br /&gt; 3.     Why JIS College of Engineering?&lt;br /&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114753552804526332?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114753552804526332/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114753552804526332' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114753552804526332'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114753552804526332'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/05/wipro-i.html' title='Wipro - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114731364062949865</id><published>2006-05-11T07:34:00.000+05:30</published><updated>2006-05-11T07:44:00.633+05:30</updated><title type='text'>Accenture - II</title><content type='html'>&lt;span style="color: rgb(153, 51, 0); font-weight: bold;"&gt;C/C++/Programming:-&lt;/span&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;&lt;span style="color: rgb(153, 51, 0); font-weight: bold;"&gt; &lt;/span&gt;&lt;span style="color: rgb(0, 0, 0);"&gt;Questions On &lt;/span&gt;&lt;ol&gt;&lt;li&gt;Ur Projects&lt;/li&gt;&lt;li&gt;memory management in Operating System.&lt;/li&gt;&lt;li&gt;Unix basic commands&lt;/li&gt;&lt;li&gt;doubly linked list&lt;/li&gt;&lt;li&gt;Fibonacci series and palindrome program in C&lt;/li&gt;&lt;li&gt;Gates(Be prepare on Digital Circuit Logic Design)&lt;/li&gt;&lt;li&gt;software development life cycle&lt;/li&gt;&lt;li&gt;complier design(phases)&lt;/li&gt;&lt;li&gt;TCP&amp;IP and OSI Model.&lt;/li&gt;&lt;li&gt;OOPS concepts.&lt;/li&gt;&lt;/ol&gt;&lt;/li&gt;&lt;/ol&gt;&lt;span style="font-weight: bold; color: rgb(153, 102, 51);"&gt;Personal Interview Question :: HR:-&lt;br /&gt;&lt;/span&gt;&lt;ol&gt;&lt;li&gt;Tell me about ur academics..&lt;br /&gt;Tell me about ur family background..&lt;br /&gt;What u are doing now..&lt;br /&gt;Why  bglore..&lt;br /&gt;Hobbies..&lt;br /&gt;What kind of music do u prefer..&lt;br /&gt;Ur recent favourite song..&lt;br /&gt;Who is ur favourite singer..&lt;br /&gt;Strength..with example..&lt;br /&gt;Weakness..with examples and how u can improve on this..&lt;br /&gt;What is ur greatest achievement in life..&lt;br /&gt;Which is ur favourite pgmng language..&lt;br /&gt;Rate urself in C..&lt;br /&gt;Briefly describe ur main project..&lt;br /&gt;Software development life cycle..explain each phase..&lt;br /&gt;Who is ur role model..why..&lt;br /&gt;Where do u c urself after 2 years..&lt;br /&gt;What is ur goal in life??what if company's goal is different from ur&lt;br /&gt;goals..&lt;br /&gt;Why should i hire you..&lt;br /&gt;Any questions..&lt;/li&gt;&lt;/ol&gt;&lt;span style="font-weight: bold; color: rgb(153, 102, 51);"&gt;Personal Interview Question :: Technical:-&lt;br /&gt;&lt;/span&gt;&lt;ol&gt;&lt;li&gt;tell me about ur academics..&lt;/li&gt;&lt;li&gt;what was ur engg entrance rank..&lt;/li&gt;&lt;li&gt;why u choosed this college..&lt;/li&gt;&lt;li&gt;why ur aggregate is 68%..&lt;/li&gt;&lt;li&gt;what is ur position in ur class..&lt;/li&gt;&lt;li&gt;which is ur favourite language..&lt;/li&gt;&lt;li&gt;can u compile c pgm in c++ compiler ? wot abt the reverse?&lt;/li&gt;&lt;li&gt;what is a static variable..&lt;/li&gt;&lt;li&gt;what is the size of a float variable..&lt;/li&gt;&lt;li&gt;what is the size of a pointer variable..&lt;/li&gt;&lt;li&gt;what is paging..&lt;/li&gt;&lt;li&gt;what is swapping..&lt;/li&gt;&lt;li&gt;why each process is loaded to the main memory for execution..&lt;/li&gt;&lt;li&gt;what is main memory..&lt;/li&gt;&lt;li&gt;what is page fault..&lt;/li&gt;&lt;li&gt;how its handled...&lt;/li&gt;&lt;li&gt;who is handling that...&lt;/li&gt;&lt;li&gt;what is multitasking..&lt;/li&gt;&lt;li&gt;what is multi threading..&lt;/li&gt;&lt;li&gt;if in a multi user system a static variable is initialised as 10 and first user increments its value by 1 and then the second user increments its value by one..what is the value of the variable now..&lt;/li&gt;&lt;li&gt;what is  DBMS..&lt;/li&gt;&lt;li&gt;what is RDBMS...&lt;/li&gt;&lt;li&gt;what is the difference b/w the two..&lt;/li&gt;&lt;li&gt;what is primary key..&lt;/li&gt;&lt;li&gt;whats foreign key..&lt;/li&gt;&lt;li&gt;whats 3rd normal form..&lt;/li&gt;&lt;li&gt;explain it with tables..&lt;/li&gt;&lt;li&gt;what are the advantages of normalisation..&lt;/li&gt;&lt;li&gt;1. pointer to structure.&lt;br /&gt;2. static variable and difference b/w(const char *p,char const&lt;br /&gt;*p,const char* const p).&lt;br /&gt;3 pass by value &amp; reference.&lt;br /&gt;4. string library functions(syntax).&lt;br /&gt;5. Write a program to compare two strings without using the strcmp()&lt;br /&gt;function.&lt;br /&gt;6. Write a program to concatenate two strings.&lt;br /&gt;7. Write a program to interchange 2 variables without using the&lt;br /&gt;third one.&lt;br /&gt;8. Write programs for String Reversal &amp;amp; Palindrome check .&lt;br /&gt;9. Write a program to find the Factorial of a number.&lt;br /&gt;10. Write a program to generate the Fibinocci Series.&lt;br /&gt;11. Searching and sorting alogorithms with complexities.&lt;br /&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114731364062949865?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114731364062949865/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114731364062949865' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114731364062949865'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114731364062949865'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/05/accenture-ii.html' title='Accenture - II'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114719098272873837</id><published>2006-05-09T21:17:00.000+05:30</published><updated>2006-05-09T21:40:28.343+05:30</updated><title type='text'>Accenture - I</title><content type='html'>&lt;span style="font-weight: bold; color: rgb(153, 102, 51);"&gt;Personal Interview Question :: HR:-&lt;/span&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;Tell about ur fmily background&lt;/li&gt;&lt;li&gt;What are your Interests?&lt;/li&gt;&lt;li&gt;What are your positive qualities?&lt;/li&gt;&lt;li&gt;Introduce Yourself&lt;/li&gt;&lt;li&gt;Why Accenture&lt;/li&gt;&lt;li&gt;Biggest Achievement&lt;/li&gt;&lt;li&gt;Strengths and Weakness&lt;/li&gt;&lt;li&gt;Career Objective&lt;/li&gt;&lt;li&gt;&lt;br /&gt;&lt;/li&gt;&lt;/ol&gt;&lt;span style="font-weight: bold; color: rgb(153, 102, 51);"&gt;Personal Interview Question :: Technical:-&lt;br /&gt;&lt;/span&gt;&lt;ol&gt;&lt;li&gt;Tell something abt OOP&lt;/li&gt;&lt;li&gt;What is inheritence&lt;/li&gt;&lt;li&gt;What is Polymorphism&lt;/li&gt;&lt;li&gt;Difference between Bubble sort and Insertion Sort&lt;/li&gt;&lt;li&gt;PL SQL triggers cursors strd procedures,&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Write Recursive Factorial Program&lt;/li&gt;&lt;li&gt;Virtual functions/ Abstract classes/ Pointer functions&lt;/li&gt;&lt;li&gt;Explain Primary Memory, Secondary Memory, Virtual Memory&lt;/li&gt;&lt;li&gt;diff. b/w c++ structures &amp; c structures&lt;/li&gt;&lt;li&gt;difference b/w char *str = "Hello"; char arr[] = "Hello";&lt;/li&gt;&lt;li&gt; list the various types of storage classes and  explain the scope &amp; lifetime of each one..&lt;/li&gt;&lt;li&gt;What is the minimum no. of weighing to make to find&lt;br /&gt;out a heavier ball among 8 balls&lt;/li&gt;&lt;/ol&gt;&lt;span style="font-weight: bold; color: rgb(153, 102, 51);"&gt;C/C++:-&lt;br /&gt;&lt;/span&gt;&lt;ol&gt;&lt;li&gt;Questions On&lt;br /&gt;1.   far and near pointer&lt;br /&gt;2.   question on macros : macros with arguments.&lt;br /&gt;3.   questions on structure pointer.&lt;br /&gt;4.   questions on files. Lseek , fputs, fwrite.&lt;br /&gt;5.   sorting and searching. Time complexity of BST.&lt;br /&gt;6.   malloc , realloc  syntax&lt;br /&gt;C++:&lt;br /&gt;1.     Multiple, multilevel inheritance.&lt;br /&gt;2.     templates and using template how to overload new and delete operators.&lt;br /&gt;3.     container classes.&lt;br /&gt;4.     friend functions and how they access member functions. Its use.&lt;br /&gt;5.      Questions on file handling.&lt;/li&gt;&lt;li&gt;Study the Following Points:&lt;br /&gt;a.One Cannot Take the address of a Bit Field&lt;br /&gt;b.bit fields cannot be arrayed&lt;br /&gt;c.Bit-Fields are machine Dependant&lt;br /&gt;d.Bit-fields cannot be declared as static&lt;br /&gt;Which of the Following Statements are true w.r.t Bit-Fields&lt;br /&gt;A)a,b&amp;c B)Only a &amp;amp; b C)Only c D)All&lt;/li&gt;&lt;li&gt;What is the function of ceil(X) defined in math.h do?&lt;br /&gt;A)It returns the value rounded down to the next lower integer&lt;br /&gt;B)it returns the value rounded up to the next higher integer&lt;br /&gt;C)the Next Higher Value&lt;br /&gt;D)the next lower value&lt;/li&gt;&lt;li&gt;Identify the correct argument for the function call fflush() in&lt;br /&gt;ANSI C:&lt;br /&gt;A)stdout&lt;br /&gt;B)stdin&lt;br /&gt;C)stderr&lt;br /&gt;D)All the above&lt;/li&gt;&lt;li&gt;Which of the Following will define a type NODE that is a node in a&lt;br /&gt;Linked list?&lt;br /&gt;A)struct node {NODE*next;int x;};type def struct node NODE;&lt;br /&gt;B)typedef struct NODE {struct NODE *next;int x;};&lt;br /&gt;C)typedef struct NODE {NODE *next;int x;};&lt;br /&gt;D)typedef struct {NODE *next;int x;}NODE;&lt;/li&gt;&lt;li&gt;.Study the code:&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;void show()&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;show();&lt;br /&gt;}&lt;br /&gt;void show (char *s)&lt;br /&gt;{&lt;br /&gt;printf("%s\n",s);&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;What will happen if it is compiled &amp; run on an ANSI C Compiler?&lt;br /&gt;A)It will compile &amp;amp; nothing will be printed when it is executed&lt;br /&gt;B)it will compile but not link&lt;br /&gt;C)the compiler will generate an error&lt;br /&gt;D)the compiler will generate a warning&lt;/li&gt;&lt;li&gt;.Look at the Code:&lt;br /&gt;#include&lt;string.h&gt;&lt;br /&gt;void main()&lt;br /&gt;{&lt;br /&gt;char s1[]=="abcd";&lt;br /&gt;char s2[10];&lt;br /&gt;char s3[]=="efgh";&lt;br /&gt;int i;&lt;br /&gt;clrscr();&lt;br /&gt;i==strcmp(strcat(s3,strcpy(s2,s1)),strcat(s3,"abcd"));&lt;br /&gt;printf("%d",i);&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;What will be the output?&lt;br /&gt;A)No output B) A Non Integer C)0 D) Garbage&lt;/string.h&gt;&lt;/li&gt;&lt;li&gt;.Look at the Code:&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;int a[]=={1,2,3},i;&lt;br /&gt;for(i==0;i&lt;3;i++)&gt;&lt;li&gt;what is the output?&lt;br /&gt;#define fun(a,b,t) (g ##t==(a),(a)==(b),(b)==g##t)&lt;br /&gt;float gfloat;&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;float a==1.12,b==3.14;&lt;br /&gt;fun (a,b,float);&lt;br /&gt;printf("\na==%4.2f,b==%4.2f",a,b);&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;A)Error in Defining Macro&lt;br /&gt;B)a==1.12,b==3.14&lt;br /&gt;C)a==3.14,b==1.12&lt;br /&gt;D)None of teh Above&lt;/li&gt;&lt;li&gt;study the code:&lt;br /&gt;#include&lt;stdio.h&gt;&lt;br /&gt;void main()&lt;br /&gt;{&lt;br /&gt;const int a=0;&lt;br /&gt;int *p;&lt;br /&gt;p==&amp;a;&lt;br /&gt;(*p)++;&lt;br /&gt;printf("a==%d\n(*p)==%d\n",a,*p);&lt;br /&gt;}&lt;br /&gt;What is printed?&lt;br /&gt;&lt;br /&gt;A)100,101 B)100,100 C)101,101 D)None of the above&lt;/stdio.h&gt;&lt;/li&gt;&lt;li&gt;Which of the following are valid "include" formats?&lt;br /&gt;A)#include and #include[file.h]&lt;br /&gt;B)#include (file.h) and #include&lt;br /&gt;C)#include [file.h] and #include "file.h"&lt;br /&gt;D)#include &lt;file.h&gt; and #include "file.h"&lt;br /&gt;&lt;/file.h&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114719098272873837?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114719098272873837/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114719098272873837' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114719098272873837'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114719098272873837'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/05/accenture-i.html' title='Accenture - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114700921238119751</id><published>2006-05-07T19:07:00.000+05:30</published><updated>2006-05-07T19:10:12.406+05:30</updated><title type='text'>Mindtree :: Placement Paper - I</title><content type='html'>&lt;ol&gt;&lt;li&gt;What is command to know the IP and MAC address of your machine in&lt;br /&gt;windows platform?&lt;br /&gt;a) ifconfig b)Ipconfig/all c)ping d) All the above&lt;/li&gt;&lt;li&gt;MTFS, CDFS, EXT3, FAT32, and EXT2, which of the below are the windows&lt;br /&gt;file system?&lt;br /&gt;a) FAT32 and EXT3 b)EXT3 c) NTFS and FAT32 d) CDFS and EXT2&lt;/li&gt;&lt;li&gt;The completion and base lining of the users manual and installation&lt;br /&gt;instructions should be an entry criteria into which of the following phase&lt;br /&gt;gate reviews.&lt;br /&gt;a) Critical design review b) System test readiness review c) Ready to&lt;br /&gt;ship review d) Post project review&lt;/li&gt;&lt;li&gt;The product quality risk from testing point of view is highest when the&lt;br /&gt;system under test is a&lt;br /&gt;a) Standalone b) Distributed System c) Client and server d) None of the&lt;br /&gt;above&lt;/li&gt;&lt;li&gt;Http is based on  which underline protocal&lt;br /&gt;a) TCP b) SNMP c) FTP d) IP&lt;/li&gt;&lt;li&gt;When can you say that performance of your application is high.&lt;br /&gt;a) High through put low latency b) Low through put high latency c) High&lt;br /&gt;through put High latency d) Low through put low latency&lt;/li&gt;&lt;li&gt;Which is the last/terminate state of a bug?&lt;br /&gt;a) Re-open b) Defered c) Enhanced d) None of the above&lt;/li&gt;&lt;li&gt;Which of the following is a testing technique?&lt;br /&gt;a) White box b) System testing c) unit testing d) Regression&lt;/li&gt;&lt;li&gt;How can you force the client to give up the dhcp lease if you have&lt;br /&gt;access to the client PC?&lt;br /&gt;a) ipconfig/release b) ipconfig/renew c) ipconfig/delete d)&lt;br /&gt;ipconfig/new&lt;/li&gt;&lt;li&gt;Testing of Non-Functional requirements does not involove&lt;br /&gt;a) Performance tests b) Reliability tests c) usability tests d)&lt;br /&gt;Configuration tests&lt;/li&gt;&lt;li&gt;DNS is used to&lt;br /&gt;a) MAP IP address to machine names b) MAP IP address to MAC address c)&lt;br /&gt;MAP IP address to domain names d) None of the above&lt;/li&gt;&lt;li&gt;Based on risk exposure, which of the following risks would have the&lt;br /&gt;highest priority?&lt;br /&gt;a) Risk A that has a 25% probability of a problem occuring that would&lt;br /&gt;cost $30,000&lt;br /&gt;b) Risk B that has a 15% probability of a problem occuring that would&lt;br /&gt;cost $400,000&lt;br /&gt;c) Risk C that has a 25% probability of a problem occuring that would&lt;br /&gt;cost $180,000&lt;br /&gt;d) Risk D that has a 25% probability of a problem occuring that would&lt;br /&gt;cost $250,000&lt;/li&gt;&lt;li&gt;When a varaible is deleted using "my" in perl, then&lt;br /&gt;a) It can be accessed only within the block it is declared&lt;br /&gt;b) It can be accessed outside the block it is declared&lt;br /&gt;c) It is visible in routines called from the block in which it is&lt;br /&gt;declared&lt;br /&gt;d)  It can be accessed globally across the program&lt;/li&gt;&lt;li&gt;what is the output of this perl statement&lt;br /&gt;    print join(':',split(/*/,'hi there'));&lt;br /&gt;a) h:i:t:h:e:r:e&lt;br /&gt;b) h:i: t:h:e:r:e&lt;br /&gt;c) :h:i:t:h:e:r:e&lt;br /&gt;d) h:i: :t:h:e:r:e&lt;/li&gt;&lt;li&gt;Which of these is reliable protocal?&lt;br /&gt;a) UDP b) SNMP c) FTP d) TCP&lt;br /&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114700921238119751?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114700921238119751/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114700921238119751' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114700921238119751'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114700921238119751'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/05/mindtree-placement-paper-i.html' title='Mindtree :: Placement Paper - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114693522808404063</id><published>2006-05-06T22:25:00.000+05:30</published><updated>2006-09-22T03:13:30.630+05:30</updated><title type='text'>OnMobile :: Aptitude - I</title><content type='html'>&lt;ol&gt;&lt;li&gt;A boy got bored of the class and started walking on&lt;br /&gt;a hall which contained 1024 lockers in a row. He first&lt;br /&gt;opened locker 1 and alternatively left one and opened&lt;br /&gt;one from thereon. When he reached the end he turned&lt;br /&gt;back and opened the first closed locker and from&lt;br /&gt;thereon continued what he did previously. He did this&lt;br /&gt;back and fro method till he opened the last locker.&lt;br /&gt;&lt;br /&gt;What is the number of the last locker he opened?&lt;/li&gt;&lt;li&gt;Two mathematicians met after 27 years in their&lt;br /&gt;college. This was their conversation.&lt;br /&gt;&lt;br /&gt;First: How are you doing?&lt;br /&gt;Second: Fine I got married and have three daughters.&lt;br /&gt;First: Fine. I also got married 2 years after the&lt;br /&gt;college. How old are your daughters?&lt;br /&gt;Second: Well, Product of their ages is 72 and their&lt;br /&gt;sum is equal to that house number (It was not&lt;br /&gt;mentioned).&lt;br /&gt;First: Wait, I am still counting.&lt;br /&gt;Second: Sorry, youngest of them has just started&lt;br /&gt;walking.&lt;br /&gt;First: Is it! Youngest of mine is also of the same&lt;br /&gt;age.&lt;br /&gt;&lt;br /&gt;How old are the three daughters?&lt;/li&gt;&lt;li&gt;In the 2nd world war Japan’s war ship named J was&lt;br /&gt;followed by the USA war ship U which is traveling at&lt;br /&gt;100kmph. By the time U was beside J and ready to&lt;br /&gt;launch the torpedo, the place was surrounded by fog&lt;br /&gt;and the army-general in U could not see anything.&lt;br /&gt;Taking this as a chance J changed in direction at an&lt;br /&gt;angle. After 6min the general in U realized it and&lt;br /&gt;informed the helicopter over it to find J. After 3&lt;br /&gt;minutes the helicopter replied that J turned at an&lt;br /&gt;angle 45 degrees and was 5km away from U at the time&lt;br /&gt;when the general asked for it. The intelligent general&lt;br /&gt;quickly turned U and successfully caught J.&lt;br /&gt;&lt;br /&gt;How much time “U” would have taken to catch “J”?&lt;/li&gt;&lt;li&gt;There is a temple on the top of the hill of height&lt;br /&gt;1000mtrs.Coconuts at the base of the hill are sold at&lt;br /&gt;5/- each and at the top of the hill at 50/- each. One&lt;br /&gt;intelligent businessman thought of buying coconuts at&lt;br /&gt;the base and selling them at the top. For that he&lt;br /&gt;appointed 2 people who can carry only 1000 coconuts at&lt;br /&gt;a time and takes 1 coconut for every mtr of walk.&lt;br /&gt;&lt;br /&gt;Can he succeed in his plan. If yes how much profit he&lt;br /&gt;earns for a rupee of investment?&lt;/li&gt;&lt;li&gt;There is bag containing balls of three colors-Red,&lt;br /&gt;Green and Yellow and there are three color blind&lt;br /&gt;people A, B and C.&lt;br /&gt;For A Red is invisible and every other color&lt;br /&gt;appears Gray.&lt;br /&gt;For B Green is invisible and every other color&lt;br /&gt;appears Gray.&lt;br /&gt;For A Yellow is invisible and every other color&lt;br /&gt;appears Gray.&lt;br /&gt;&lt;br /&gt;They were shown the box and when asked the question&lt;br /&gt;what can see their replies were&lt;br /&gt;A: I can see two balls.&lt;br /&gt;B: I can see two balls.&lt;br /&gt;C: I can see two balls.&lt;br /&gt;How many balls were there in the box and of what&lt;br /&gt;color?&lt;br /&gt;&lt;/li&gt;&lt;li&gt;There is a farm which contains super hens which r&lt;br /&gt;genetically made to lay eggs of double size than the&lt;br /&gt;normal ones. But as genetic engg. is not well&lt;br /&gt;understood there is only 50-50% chance of a super hen&lt;br /&gt;laying large egg.&lt;br /&gt;The farm is such tht it keeps the hen as long as&lt;br /&gt;it lays large eggs and removes the hen out of the farm&lt;br /&gt;as soon as it lays one normal egg.&lt;br /&gt;The farm followed the same process for one year&lt;br /&gt;and counted all the eggs laid by all the super hens.&lt;br /&gt;At the end of the year the ratio of large eggs to the&lt;br /&gt;normal ones is?&lt;/li&gt;&lt;li&gt;There are 8 stamps, 4 Red and 4 Green. There are&lt;br /&gt;three logicians also. One moderator sticks thow stamps&lt;br /&gt;each on the forhead of each logician such that each of&lt;br /&gt;them can see all the stamps except those on his&lt;br /&gt;forhead and the two in moderator's pocket. Then the&lt;br /&gt;moderator asked each whether he knows the colors of&lt;br /&gt;the stamps he wears? Then the answeres were:&lt;br /&gt;A: "No" B: "No" C: "No"&lt;br /&gt;A: "No" B: "Yes"&lt;br /&gt;What were the colours of the stamps that B wears?&lt;/li&gt;&lt;li&gt;There's a camel living in a desert. There is a&lt;br /&gt;market 1000 miles away. The camel has 3000 dates for&lt;br /&gt;sale. It has to take the date to the market. But for&lt;br /&gt;that hte camel eats one date per mile. How many dates&lt;br /&gt;the camel can trade?&lt;/li&gt;&lt;li&gt; There are following denominations of money: 1, 2,&lt;br /&gt;5, 10, 20, 50, and 100 paise. Alex has as twice mony&lt;br /&gt;as David, who has as twice as Bindya, who again has as&lt;br /&gt;twice money as Charles. Each has two coins in hand.&lt;br /&gt;Which coins Bindya has?&lt;/li&gt;&lt;li&gt; There are Brown and Black cows. In five days four&lt;br /&gt;black cows and 3 brown cows give as mush as milk that&lt;br /&gt;four brown cows and 5 black cows give in four days. If&lt;br /&gt;the black cow gives 10 litres of milk per day, how&lt;br /&gt;many liters of milk the Brown cow will give in one&lt;br /&gt;day?(Numbers are not certain)&lt;/li&gt;&lt;li&gt;One guy (some name) has Rs. 100/- in hand. He has&lt;br /&gt;to buy 100 balls. One football costs Rs. 15/, One&lt;br /&gt;Cricket ball costs Re. 1/- and one table tennis ball&lt;br /&gt;costs Rs. 0.25 He spend the whole Rs. 100/- to buy the&lt;br /&gt;balls. How many of each balls he bought?&lt;/li&gt;&lt;li&gt;U need 2 kill a dragon with 3 heads &amp; 3 tails. u&lt;br /&gt;have a magic sword dat can cut 1 head, 2 heads, 1&lt;br /&gt;tail, or 2 tails in 1 swing.&lt;br /&gt;if 1 head is cut -&gt; a new head grows&lt;br /&gt;if 1 tail is cut -&gt; 2 tails grow&lt;br /&gt;if 2 tails r cut -&gt; 1 head grows&lt;br /&gt;if 2 heads r chopped -&gt; nothing grows. What is d min.&lt;br /&gt;num of swings 2 b made?&lt;/li&gt;&lt;li&gt; Slow train runs b/w Blore &amp; Mumbai, up as well as&lt;br /&gt;down. It starts at 10:00pm everyday &amp;amp; reaches&lt;br /&gt;destination by 11:30pm after 3 days. If u travel by&lt;br /&gt;Slow train, how many such trains will u encounter&lt;br /&gt;during journey?&lt;/li&gt;&lt;li&gt;A num of birds, black &amp; white, r sitting on thhe&lt;br /&gt;tele wire. There is at least 1 bir of each color, also&lt;br /&gt;whenevr 2 birds are seperated by 4 or 7 other boirds&lt;br /&gt;of any color, both birds r of same color. Wot is the&lt;br /&gt;max. num of birds dat can b seated in this fashion?&lt;/li&gt;&lt;li&gt;5 ppl, A, B, C, D, E are supposed 2 cover a certain&lt;br /&gt;distance from their car to a house. There is only 1&lt;br /&gt;umbrela dat can b shared by 2 ppl at a time.&lt;br /&gt;It takes 1min for A 2 cover the dist, B-&gt;2 min,&lt;br /&gt;C-&gt;5min, D-&gt;10min, E-&gt;15min.&lt;br /&gt;Wot is d quickest poss time 4 the entire grp 2 get&lt;br /&gt;into the house?&lt;/li&gt;&lt;li&gt;Mr.X belongs 2 a grp of 8 ppl including himself. In&lt;br /&gt;d meeting, nobody shakes hands with the same person&lt;br /&gt;more than once but everyone shakes hands with at least&lt;br /&gt;1 person.&lt;br /&gt;After the meeting is over, Mr.X realizes dat all the&lt;br /&gt;other ppl in the party had shook a diff num of hands.&lt;br /&gt;How many hands did Mr.X shake?&lt;/li&gt;&lt;li&gt;Old Man Wrinkle&lt;br /&gt;------------------------&lt;br /&gt;Man Wrinkle spent one-fourth of his life as a boy,&lt;br /&gt;one-eighth as a youth, and one-half as an active man.&lt;br /&gt;If Man Wrinkle spent 8 years as an old man, then how&lt;br /&gt;many years did he spend as an active man?&lt;/li&gt;&lt;li&gt;A farmer has C chickens.A sack of feed comes for 9&lt;br /&gt;days.As the feed cost is increasing the&lt;br /&gt;farmer sells some chickens and retains 12 chicken.If&lt;br /&gt;he reduces the feed quantity by 10% .Then&lt;br /&gt;he observesthat the feed comes for 30 days.What is C?&lt;/li&gt;&lt;li&gt;The Carpenter and the Nails&lt;br /&gt;----------------------------------&lt;br /&gt;A 31" x 31" square metal plate needs to be fixed by a&lt;br /&gt;carpenter on to a wooden board. The carpenter uses&lt;br /&gt;nails all along the edges of the square such that&lt;br /&gt;there are 32 nails on each side of the square. Each&lt;br /&gt;nail is at the same distance from the neighboring&lt;br /&gt;nails. How many nails does the carpenter use?&lt;/li&gt;&lt;li&gt;Vacation time&lt;br /&gt;-----------------&lt;br /&gt;It was vacation time, and so I decided to visit my&lt;br /&gt;cousin's home. What a grand time we had! In the&lt;br /&gt;mornings, we both would go for a jog. The evenings&lt;br /&gt;were spent on the tennis court. Tiring as these&lt;br /&gt;activities were, we could manage only one per day,&lt;br /&gt;i.e., either we went for a jog or played tennis each&lt;br /&gt;day. There were days when we felt lazy and stayed home&lt;br /&gt;all day long.&lt;br /&gt;Now, there were 12 mornings when we did nothing, 18&lt;br /&gt;evenings when we stayed at home, and a total of 14&lt;br /&gt;days when we jogged or played tennis. For how many&lt;br /&gt;days did I stay at my cousin's place?&lt;/li&gt;&lt;li&gt;Monkeys and bananas:&lt;br /&gt;--------------------------&lt;br /&gt;Suppose 8 monkeys take 8 minutes to eat 8 bananas.&lt;br /&gt;(a) How many minutes would it take 3 monkeys to eat 3&lt;br /&gt;bananas?(b) How many monkeys would it take to eat 48 bananas&lt;br /&gt;in 48 minutes&lt;/li&gt;&lt;li&gt;Glenn and Jason each have a collection of cricket&lt;br /&gt;balls. Glenn said that if Jason would give him 2 of&lt;br /&gt;his balls they would have an equal number; but, if&lt;br /&gt;Glenn would give Jason 2 of his balls, Jason would&lt;br /&gt;have 2 times as many balls as Glenn. How many balls&lt;br /&gt;does Jason have?&lt;/li&gt;&lt;li&gt;A set of football matches is to be organized in a&lt;br /&gt;"round-robin" fashion, i.e., every participating team&lt;br /&gt;plays a match against every other team once and only&lt;br /&gt;once.&lt;br /&gt;If 21 matches are totally played, how many teams&lt;br /&gt;participated?&lt;/li&gt;&lt;li&gt;Gold coins:&lt;br /&gt;----------------&lt;br /&gt;A rich merchant had collected many gold coins. He did&lt;br /&gt;not want anybody to know about them. One day, his wife&lt;br /&gt;asked, "How many gold coins do we have?"&lt;br /&gt;After pausing a moment, he replied, "Well! If I divide&lt;br /&gt;the coins into two unequal numbers, then 37 times the&lt;br /&gt;difference between the two numbers equals the&lt;br /&gt;difference between the squares of the two numbers."&lt;br /&gt;The wife looked puzzled. Can you help the merchant's&lt;br /&gt;wife by finding out how many gold&lt;br /&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114693522808404063?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114693522808404063/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114693522808404063' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114693522808404063'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114693522808404063'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/05/onmobile-aptitude-i.html' title='OnMobile :: Aptitude - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114693432841617732</id><published>2006-05-06T22:18:00.000+05:30</published><updated>2006-09-03T18:34:32.646+05:30</updated><title type='text'>Yahoo India :: Placement Paper - I</title><content type='html'>&lt;ol&gt;&lt;li&gt;Algorithm to partition set of numbers into two s.t. diff bw their&lt;br /&gt;sum is min and they hav equal num of elements&lt;/li&gt;&lt;li&gt;Prog: given Numerator &amp; Denominator.... print 0.3333333333 as .(3)&lt;br /&gt;0.123123 as .(123)&lt;/li&gt;&lt;li&gt;There are $1070 dollars how to split them into bags such that asked&lt;br /&gt;for any denomination from $1 to $1070 , u must b able to give without&lt;br /&gt;opening bag...&lt;/li&gt;&lt;li&gt;Which is DS used for chess program...to predict move each and every&lt;br /&gt;time..&lt;/li&gt;&lt;li&gt; Which is the DS used in dictionary mode in mobile (t9)&lt;/li&gt;&lt;li&gt;Write 1,3,6,4 using +,-,*,/ to get 24 (no repeat of numbers)&lt;/li&gt;&lt;li&gt; In 1000 wine bottles stack 10 are poisoned given 10 rats what is&lt;br /&gt;the minimum number of tries to find the poisoned one. Rat dies once it&lt;br /&gt;licks the poisoned wine.&lt;/li&gt;&lt;li&gt;2n+1 numbers in a list except for 1 num all had duplicates, how to&lt;br /&gt;find duplicate in O(n)&lt;/li&gt;&lt;li&gt;In a village in each family they give birth to children till they&lt;br /&gt;get a boy. IF girl child they try again. What is the ratio of boys to&lt;br /&gt;girls.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114693432841617732?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114693432841617732/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114693432841617732' title='2 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114693432841617732'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114693432841617732'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/05/yahoo-india-placement-paper-i.html' title='Yahoo India :: Placement Paper - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>2</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114683030401651400</id><published>2006-05-05T17:20:00.000+05:30</published><updated>2006-05-05T17:28:24.036+05:30</updated><title type='text'>Infosys :: Aptitude - I</title><content type='html'>&lt;ol&gt;&lt;li&gt;BE * BE = ACB. Identify A,B,C. Ans : BE = 19&lt;/li&gt;&lt;li&gt;1/3 of water gets evaporated from a fully filled jar on the first day.&lt;br /&gt;    On the second day 2/3 rd of the left portion gets evaporated. What is&lt;br /&gt;    the amt of water left.&lt;/li&gt;&lt;li&gt; There are 9 cards in three rows and three columns. There is a Red card&lt;br /&gt;   either in the first or second row. There are Three yellow cards occupying&lt;br /&gt;   3 columns. There are three green cards one in each row, and one being in&lt;br /&gt;   the last column. There are two Blue cards one being in the last row.&lt;br /&gt;   Identify their locations.&lt;br /&gt;&lt;/li&gt;&lt;li&gt;I was in one of the 9 Aero-planes packed in a single rowIf the product&lt;br /&gt;    of my place from right and the planes to my left is lesser by three than&lt;br /&gt;    the product when I was shifted by 3 position towards right.&lt;br /&gt;    What is my position? (The figures in this pbm may not be exact).&lt;/li&gt;&lt;li&gt;M, T, K, E, and A went to collect berries. Only M collected 40 berries.&lt;br /&gt;     She distributed them among all others, keeping nothing for her. On the&lt;br /&gt;     way T found 2 berries, K lost 2, E doubled her qty, and A lost half of&lt;br /&gt;     what she had. Then all of them were left with equal berries.How many&lt;br /&gt;     beries did M give to each of them.&lt;br /&gt;&lt;/li&gt;&lt;li&gt;I walk down the escalator. If I walk 24 steps I require 34 min. If I walk&lt;br /&gt;  down 36 steps I need 26 min. What are the no of steps on the escalator.&lt;br /&gt;  ( Puzzle no 27 of PUZZLES TO PUZZLE YOU by Shakuntala Devi)&lt;/li&gt;&lt;li&gt;There are five people. Each one has a coin on his fore head. It is black&lt;br /&gt;   if he is a liar else it is white. A says I can see four Blacks. B says I&lt;br /&gt;   can see 2 black and 2 whites. WHo is lieing.&lt;/li&gt;&lt;li&gt;A person was collecting end pieces of Cigerettes.  He was managed to collect 49&lt;br /&gt;     pieces.  We need 7 such pieces to make new one.  So how many Cigerettes he can&lt;br /&gt;     make?      &lt;br /&gt;&lt;/li&gt;&lt;li&gt;A person moving from a place(camp)., towards East one mile, then towards North&lt;br /&gt;    half mile, towards West 1/4 the mile, towards South 1/8th mile and again&lt;br /&gt;    towards East 1/16th mile and so on.  That is the distance between him and the&lt;br /&gt;    starting point.&lt;br /&gt;&lt;/li&gt;&lt;li&gt; 500 men were arranged in 10 rows and 50 columns.  They picked the oldest person&lt;br /&gt;     from each row and the tallest of these persons is 'A'.  They replace them in&lt;br /&gt;     their places and again picked tallest person from each column and the shortest&lt;br /&gt;     of these persons is 'B'. Assume A &amp; B are different people. Who is the&lt;br /&gt;     tallest person among A &amp; B?&lt;/li&gt;&lt;li&gt;The product of two nonzero numbers is 1,000,000,000.  What are the&lt;br /&gt;     numbers ?  (Both number don't contain any zero) &lt;br /&gt;&lt;/li&gt;&lt;li&gt;There is Mathematician.  He met his friend and asked about his children.&lt;br /&gt;     His friend told in the form of a problem that he has three children. The&lt;br /&gt;     product of their ages is 36. The addition of their ages is the door number&lt;br /&gt;     of his left side house.  Mathematician went and checked the door number&lt;br /&gt;     He told that the clues are not sufficient.  He gave another clue that&lt;br /&gt;     is his younger daughter is clearly younger.  What are their ages ?&lt;/li&gt;&lt;li&gt;There is a light glows in the interval of 13 sec.  It glows first at one&lt;br /&gt;     hour 54 minutes 50 seconds and the last glow is at 3 hour 17 minute and 49&lt;br /&gt;     seconds.  How many times is that light glow, with in these two times ?&lt;/li&gt;&lt;li&gt;After spending 1/3 of money and then 1/4th of what remained and finally 1/5th &lt;br /&gt;     of what remained, I found that I had Rs.100/- left.  How much money I had&lt;br /&gt;     at first ?     &lt;br /&gt;&lt;/li&gt;&lt;li&gt;A Black Smith was given a chain torn into equal sections of 3 links&lt;br /&gt;     each and asked to fix it.  How many links(minimum) would he has to open&lt;br /&gt;     up and reforge ?&lt;/li&gt;&lt;li&gt;There are six boxes, of which some boxes contain only red balls and some other&lt;br /&gt;     boxes contain only Black balls.  The number of balls in six differnet boxes are&lt;br /&gt;     5,6,12,14,23,and 29.  If he sells&lt;/li&gt;&lt;li&gt; first person :  I am sure you are at least 40 years old and I am 5 years&lt;br /&gt;     younger than you.&lt;br /&gt;     second person : I am 35 and you are atleast 5 years elder than me.  None&lt;br /&gt;     of these persons spoke truth. What are their ages ?&lt;/li&gt;&lt;li&gt; Orange cup has Orange Juice.  White cup has apple Juice.  %0 ml of&lt;br /&gt;     Orange Juice is taken and mixed with Apple Juice.  From that mixture&lt;br /&gt;     50 ml is taken and poured into Orange cup.  Now whether apple Juice&lt;br /&gt;     in Orange Cupis more or Orange Juice in White cup is more and by what amount?&lt;/li&gt;&lt;li&gt; Ms. Sheela goes her home by car from Station.  Her driver comes and&lt;br /&gt;     picks her up daily at 5.00 p.m.  One day Sheela arrives at Station one&lt;br /&gt;     hour earlier and starts walking towards  home.  On the way driver&lt;br /&gt;     picked her up. By this they reached home 30 minutes earlier.  For how&lt;br /&gt;     long she was walking ?&lt;/li&gt;&lt;li&gt;Some students went on a trip to Goa in holidays.  Unfortunately it&lt;br /&gt;     rained on some days.  In a surprising manner if it rained in the&lt;br /&gt;     morning, they had a good afternoon and vice versa.  They had 11 morning&lt;br /&gt;     visits and 12 afternoon visits.  Altogether it rained for 13 days&lt;br /&gt;     during their stays.  What is the duration of Holidays ?&lt;/li&gt;&lt;li&gt;A survey was conducted for 100 people by Door Darshan&lt;br /&gt;     1.  44 people watched channel I&lt;br /&gt;     2.  43  "       "       "     II&lt;br /&gt;     3.  27  "       "       "     III&lt;br /&gt;     4.  17  "       "       "     I &amp; II&lt;br /&gt;     5.  14  "       "       "     I &amp;III&lt;br /&gt;     6.  13   "      "       "     II &amp;  III&lt;br /&gt;     7. 23 watched none.&lt;br /&gt;     How many watched I II &amp; III ?&lt;/li&gt;&lt;li&gt;Two Swimmers at different rate but at constant Speed were swimming.&lt;br /&gt;     They met at 18 meters from deep end.  Both swimmers took rest for&lt;br /&gt;     4.5 seconds.  During their return they crossed at 10 meters from&lt;br /&gt;     ashlor end.  What is the length of the pool ?&lt;/li&gt;&lt;li&gt;Mr. Raj goes to Office by Train.  First train in Main line Starts at&lt;br /&gt;    5:02:0.  In Harbour Line it starts at 5:10:0.  Every Ten minutes there&lt;br /&gt;    is one train.  What is the probability that Raj travels in harbour line&lt;br /&gt;    at a random time of Driving      the Station?&lt;br /&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114683030401651400?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114683030401651400/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114683030401651400' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114683030401651400'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114683030401651400'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/05/infosys-aptitude-i.html' title='Infosys :: Aptitude - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114668053849684069</id><published>2006-05-03T23:48:00.000+05:30</published><updated>2006-05-03T23:52:18.503+05:30</updated><title type='text'>Oracle :: Aptitude - I</title><content type='html'>&lt;pre&gt;Questions 1-3 are based on the following:&lt;br /&gt;&lt;br /&gt;&lt;blockquote&gt;In a group there are five persons A,B,C,D and E. There&lt;br /&gt;is a sitarist, a professor and a sports person in&lt;br /&gt;thegroup. E is the husband of a member of the&lt;br /&gt;group.This couple is the only married couple in the&lt;br /&gt;group. B is the brother of C. B is neither a professor&lt;br /&gt;nor a sports person. None of the women is either a&lt;br /&gt;sitarist or a sports person. A and D are unmarried and&lt;br /&gt;neither of them is a sitarist or a professsor or a&lt;br /&gt;sports person.&lt;/blockquote&gt;&lt;br /&gt;&lt;br /&gt;1. Which of the following people is E's wife?&lt;br /&gt;&lt;br /&gt;          1]A   2]B    3]C    4]D&lt;br /&gt;&lt;br /&gt;2. Who is a sports person?&lt;br /&gt;&lt;br /&gt;          1]A   2]E    3]B    4]C&lt;br /&gt;&lt;br /&gt;3. Who is a sitarist?&lt;br /&gt;&lt;br /&gt;          1]B    2]A    3]C    4]D&lt;br /&gt;&lt;br /&gt;4. In a factory, 'a' men work 'b'  hours a day and&lt;br /&gt;produce 'c' articles each day. If 'd' men are&lt;br /&gt;released, how many hours a day will the remaining men&lt;br /&gt;have to work to produce 'c'articles each day?&lt;br /&gt;&lt;br /&gt;         1]ab/d    2]ab/b    3]a-d/b    4]ab/a-d&lt;br /&gt;&lt;br /&gt;5. A county cricket team has won 10 matches and lost&lt;br /&gt;4. If these matches represent 70% of the matches to be&lt;br /&gt;played, how many more matches should the team win so&lt;br /&gt;as to have a record of 75% iwns?&lt;br /&gt;&lt;br /&gt;      1]5     2]6     3]4      4]3&lt;br /&gt;&lt;br /&gt;For questions 6-10, read the passage and answer the&lt;br /&gt;questions that follow:&lt;br /&gt;&lt;br /&gt;    &lt;blockquote&gt;At a time when impressive breakthroughs in&lt;br /&gt;technology are providing new and better products and&lt;br /&gt;services, when improved communications are&lt;br /&gt;transforming thw world into a global village, and when&lt;br /&gt;democracies are sprouting in former communist lands,&lt;br /&gt;we are simultaneously witnessing events that makie us&lt;br /&gt;questioin whether so much progress is indeed&lt;br /&gt;"progress".&lt;br /&gt;    For example, we see reports of widespread&lt;br /&gt;bribery by Italina and Japanese government officials,&lt;br /&gt;exorbitant salaries for executives in North America,&lt;br /&gt;extensive environmental pollution in eastern Europe,&lt;br /&gt;and other instances of immoral or morally questionable&lt;br /&gt;conduct in our organizations. In many otherwise&lt;br /&gt;prospeous and afluent cities, we see an increase in&lt;br /&gt;the numbers of homeless people. Even those who are&lt;br /&gt;fortunate enough to have a job find that work is not&lt;br /&gt;only not an opportunity for growth, but a source of&lt;br /&gt;anxiety and insecurity.&lt;br /&gt;    In the popular media as well as in academic&lt;br /&gt;journals, we see great interest in the proposition&lt;br /&gt;that business and other organizations leaders need to&lt;br /&gt;become more responsible not just ot their stock&lt;br /&gt;jolders but also to other stake holders- consumers,&lt;br /&gt;employees, suppliers,government, and locla communites.&lt;br /&gt;     Put simply, the quality of life and perhaps the&lt;br /&gt;survivial of society depend on the moral caliber of&lt;br /&gt;its members. This moral caliber, however, is largely&lt;br /&gt;determined by people in leadership positions. The way&lt;br /&gt;leaders function in their positions of influence&lt;br /&gt;directly contributes to strengthening pr weakening the&lt;br /&gt;moral fiber or society. The lives of Buddha, Mohammed,&lt;br /&gt;Lao-Tzu, Gandhi and Socrates attest to their salutary&lt;br /&gt;influence in their own way as well as for all time.&lt;br /&gt;     A human being functions not just through the&lt;br /&gt;physical body but also through the use of the&lt;br /&gt;intellect and the will. The intellect penetrates those&lt;br /&gt;deep levels of reality that are spiritual in nature&lt;br /&gt;but that the physical senses and processes cannot&lt;br /&gt;access. It does this through abstract concepts and&lt;br /&gt;ideas that help to make sense of and give meaning to&lt;br /&gt;the acts in the light of spiritual knowledge. It helps&lt;br /&gt;us to make moral choices in living a spiritually&lt;br /&gt;guided life.&lt;br /&gt;    How do we describe the concept of spirituality&lt;br /&gt;and its place in that domain? Spirituality is&lt;br /&gt;difficult to define in a manner that is universally&lt;br /&gt;acceptablke because religious beliefs and rites differ&lt;br /&gt;widely age to age and from one society to another.&lt;br /&gt;However, if we analyze the spiritual experience per se&lt;br /&gt;and its behavioral manifestations among individuals of&lt;br /&gt;different religious backgrounds, there is much accord&lt;br /&gt;on the understanding and appreciation of the essence&lt;br /&gt;of spirit at three levels: cognitive, affective, and&lt;br /&gt;outward behavior.&lt;br /&gt;    At a cognitive level,spiritual experience&lt;br /&gt;represents a realization that,a t the core of human&lt;br /&gt;existence, there is set of virtues and vices. Virtues&lt;br /&gt;- prudence, justice, fortitude, and temperance- are&lt;br /&gt;good habits that enable us to stirve toward relizng&lt;br /&gt;our full potential. Ideally, the goal of human life is&lt;br /&gt;to live these values and overcome the vices.&lt;br /&gt;   At an affective or emotional level, the spiritual&lt;br /&gt;experience represents a complete trust and dependence&lt;br /&gt;on such virtues. In its most sublime, the spiritual&lt;br /&gt;experience represents a complete identification with&lt;br /&gt;these values,or with an individual embodying these&lt;br /&gt;values, tha aim being to achieve some forme of&lt;br /&gt;enduring blissful state of existence.&lt;br /&gt;   How is the spiritual experience expressed in&lt;br /&gt;outward behavior? What are the sources of the norms&lt;br /&gt;andd principles within the spiritual domain? Response&lt;br /&gt;to such questions generally come from prescriptions of&lt;br /&gt;moral observance of the laws. It is not a question of&lt;br /&gt;an act being legal or illegal, but whether the act is&lt;br /&gt;good or evil. A morally good act is necessarily an&lt;br /&gt;expression of a spirtual act.&lt;br /&gt;   The ability to distinguish between morally good&lt;br /&gt;and evil acts is critical to the formation of&lt;br /&gt;character. Knowing ehtical principles alone is of&lt;br /&gt;little value unless we make an effort to habitually&lt;br /&gt;incorporate these principles in our behaviour.&lt;br /&gt;   In the final analysis, the reward of the&lt;br /&gt;spiritual experience is that it enables each&lt;br /&gt;individual to grow and fully realize the tremendous&lt;br /&gt;potential unique to that person. If a good moral&lt;br /&gt;character is of the essence of every human being,&lt;br /&gt;thern with much greater reason does it become so of&lt;br /&gt;leaders who, in the words of Stanford management&lt;br /&gt;professor Harold Leavitt, by their "vision, values,&lt;br /&gt;and determination, add soul to the organization".&lt;/blockquote&gt;&lt;br /&gt;&lt;br /&gt;6. The author does not consider the progress made as&lt;br /&gt;'progress' as there is&lt;br /&gt;&lt;br /&gt;   1]widespread corruption.  2]environmental&lt;br /&gt;pollution.&lt;br /&gt;   3]widespread poverty.   4]all of the above.&lt;br /&gt;&lt;br /&gt;7. The author draws the analogy of Buddha and Gandhi&lt;br /&gt;to emphasize that&lt;br /&gt;&lt;br /&gt;  1]organizational leaders need to be more&lt;br /&gt;responsible.&lt;br /&gt;  2]a society is known by its leader(s).&lt;br /&gt;  3]the quality of a society is determined by the&lt;br /&gt;quality of its leader(s).&lt;br /&gt;  4]survival of the leader is determined by its&lt;br /&gt;society.&lt;br /&gt;&lt;br /&gt;8. According to the passage&lt;br /&gt;&lt;br /&gt;  1]academic journals advocate progress in society.&lt;br /&gt;  2]there is extensive environmental pollution in&lt;br /&gt;Japan.&lt;br /&gt;  3]affluent cities witness the greatest number of&lt;br /&gt;homeless people.&lt;br /&gt;  4]breakthroughs in technology have transformed the&lt;br /&gt;world into a global village.&lt;br /&gt;&lt;br /&gt;9. If a person follows certain values as principles,&lt;br /&gt;then he is appreciating the essence of spirit at the&lt;br /&gt;&lt;br /&gt;  1]cognitive level.     2]emotional level.&lt;br /&gt;  3]social level.      4]both 2&amp;3.&lt;br /&gt;&lt;br /&gt;10. The author is likely to agree with all of the&lt;br /&gt;following except&lt;br /&gt;&lt;br /&gt; 1]knowledge of ethical values will lead to the full&lt;br /&gt;realization fo one's potential.&lt;br /&gt; 2]spiritual acceptance of values by the individuals&lt;br /&gt;of the society will lead to its progress.&lt;br /&gt; 3]a morally good act is an expression of&lt;br /&gt;spirituality.&lt;br /&gt; 4]man functions through both body and mind.&lt;br /&gt;&lt;br /&gt;11. Derek and Saily together have $300. After giving&lt;br /&gt;Saily $40, Derek finds that he has 1/4 tha amount that&lt;br /&gt;Saily has. How much money does Derek have now?&lt;br /&gt;&lt;br /&gt;1]$60  2]$100   3]$80   4]$40&lt;br /&gt;&lt;br /&gt;12.Jason purchased  60 shares of Trump corporation sat&lt;br /&gt;$40 and later bought 40 more at $36. At what price&lt;br /&gt;should he purchase 50 additional shares so that the&lt;br /&gt;average cost of the shares is $35?&lt;br /&gt;&lt;br /&gt;1]$26.40   2]$20.50  3]$28.20   4]$29.00&lt;br /&gt;&lt;br /&gt;13. Mike loves hiking. He starts from point A and&lt;br /&gt;walks 4 miles due east to point B. from there he walks&lt;br /&gt;3 miles south to point C. From point C he walks 8&lt;br /&gt;miles east to point D and from there he walks 6 miles&lt;br /&gt;west to point E. What is the shortest distance between&lt;br /&gt;point A and point E?&lt;br /&gt;&lt;br /&gt;  1]8 miles 2]5 miles 3]7 miles  4]6.7 miles&lt;br /&gt;&lt;br /&gt;Questions 14-15 are based on the following:&lt;br /&gt;&lt;br /&gt;&lt;blockquote&gt;The inhabitants of Kya-Kya island always answer any&lt;br /&gt;question with two sentences; one of which is true and&lt;br /&gt;the other is false.&lt;/blockquote&gt;&lt;br /&gt;&lt;br /&gt;14. You are looking for Venkat's house and you meet&lt;br /&gt;three people- Anand, Ravi and Som. You ask them "Which&lt;br /&gt;is Venkat's house?"&lt;br /&gt;&lt;br /&gt;Anand says:Venkat's house is No.9, I am his&lt;br /&gt;neighbour.&lt;br /&gt;Ravi says:Anand is not my neighbour.Anand and Som&lt;br /&gt;live in the same house.&lt;br /&gt;Som says:Venkat's house is not No.9. Anand is Ravi's&lt;br /&gt;neighbour.&lt;br /&gt;         There are only two houses and four people&lt;br /&gt;in Kya-Kya. Two people live in each house.&lt;br /&gt;&lt;br /&gt;From the above you can decide that&lt;br /&gt;&lt;br /&gt;1]Venakt stays in house No.9  &lt;br /&gt;2]Venkat does not stay in house No.9&lt;br /&gt;3]Venakt does not stay in Kya-Kya.&lt;br /&gt;4]Ravi and Som stay together.&lt;br /&gt;&lt;br /&gt;15. Who stays with Anand?&lt;br /&gt;&lt;br /&gt;1]Ravi  2]Venkat   3]Som    4]Can't say.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Questions 16-17 are based on the following:&lt;br /&gt;&lt;br /&gt;&lt;blockquote&gt;The average life expectancy for the United States&lt;br /&gt;population as a whole is 73.9 years, but children born&lt;br /&gt;in Hawaii will live an average of 77 years, and those&lt;br /&gt;born in Louisiana,71.7 years. If a newly wed couple&lt;br /&gt;from Louisiana were to begin their family in Hawaii,&lt;br /&gt;their children would live longer than if the couple&lt;br /&gt;began their family to Louisiana.&lt;/blockquote&gt;&lt;br /&gt;&lt;br /&gt;16. Which of the following, if true, would most&lt;br /&gt;seriously weaken the conclusion drawn in the passage?&lt;br /&gt;&lt;br /&gt;1]Insurance company statisticians do not believe that&lt;br /&gt;moving to Hawaii will significantly lengthen the&lt;br /&gt;average Louisianian's life.&lt;br /&gt;2]The governor of Louisiana has falsely alleged that&lt;br /&gt;statistics of his state are inaccurate.&lt;br /&gt;3]The longevity attributed to Hawaii's current&lt;br /&gt;population is attributed mostly to genetically&lt;br /&gt;determined  factors.&lt;br /&gt;4]Thirty percent of all Louisianians can expect to&lt;br /&gt;live longer than 77 years.&lt;br /&gt;&lt;br /&gt;17. Which of the following, if true, would most&lt;br /&gt;significantly strengthen the conclusion drawn in the&lt;br /&gt;passage?&lt;br /&gt;&lt;br /&gt;1]As population density increases in Hawaii,life&lt;br /&gt;expectancy figures for the state are likely to be&lt;br /&gt;revised downward.&lt;br /&gt;2]Environmental factors tending to favor longevity&lt;br /&gt;are abundant in Hawaii and less numerous in Louisiana.&lt;br /&gt;3]Over the last decade, average life expectancy has&lt;br /&gt;risen at a higher rate for Louisianians than for&lt;br /&gt;Hawaiians.&lt;br /&gt;4]Twnty-five percent of all Louisianians who move to&lt;br /&gt;Hawaii live longer than 22 years.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;For questions 18-21,read the following paragraph:&lt;br /&gt;&lt;br /&gt; &lt;blockquote&gt;Nursery "Hara Bara" plans to undertake a project of&lt;br /&gt;planting 100 sunflower plants daily for the next 100&lt;br /&gt;weeks.Further,15% of the remaining plants die within 4&lt;br /&gt;weeks of plantations.If a plant survives till the end&lt;br /&gt;of 4th week it becomes available for sale, and the&lt;br /&gt;company sells it iommediately at the beginning of the&lt;br /&gt;next week at a fixed price of Rs.35 per plant.&lt;/blockquote&gt;&lt;br /&gt;&lt;br /&gt;18. Total number of plants sold by the end of 10 weeks&lt;br /&gt;is&lt;br /&gt;&lt;br /&gt;1]4760   2]2730   3]4550    4]2856&lt;br /&gt;&lt;br /&gt;19. Total revenue generated by the nursery(in Rs.000s)&lt;br /&gt;from the project is&lt;br /&gt;&lt;br /&gt;1]1666.0   2]1592.5   3]1246.0  4]None of these.&lt;br /&gt;&lt;br /&gt;20. Revenue generated by the nursery by the end of&lt;br /&gt;50th week is what proportion of total revenue&lt;br /&gt;generated by the project?&lt;br /&gt;&lt;br /&gt; 1]48.2%   2]46%    3]50%   4]53%&lt;br /&gt;&lt;br /&gt;21. A pesticide available in the market reduces the&lt;br /&gt;number of plants dying within 4 weeks of plantation by&lt;br /&gt;25%. If each bottle of pesticide costs Rs.770 and&lt;br /&gt;lasts for seven days and the nursery starts using it&lt;br /&gt;only on the plants planted after the 50th week, the&lt;br /&gt;net income (in Rs.'000s) from the project (net of&lt;br /&gt;pesticide expenses) is:&lt;br /&gt;&lt;br /&gt;1]1592.5   2]1725.5    3]2106.5   4]None of these.&lt;br /&gt;&lt;br /&gt;22. Forty percent of the members of a singles club are&lt;br /&gt;men. Eighty percent of he single men and 90 percent of&lt;br /&gt;the single women own automobiles. A car is found in&lt;br /&gt;the parking lot. What is the probability that hte car&lt;br /&gt;belongs to a woman?&lt;br /&gt;&lt;br /&gt;1]0.8352   2]0.6279   3]0.4869   4]0.5535&lt;br /&gt;&lt;br /&gt;23. Three boxes, identical in appearance, each have&lt;br /&gt;two drawers. The first box contains a  gold coin in&lt;br /&gt;each drawer. The second contains a silver coin in each&lt;br /&gt;drawer. But the third contains a gold coin in one and&lt;br /&gt;a silve coin in the other. A box is chosen, one of its&lt;br /&gt;drawers opened and a gold coin found. What is the&lt;br /&gt;probability that the other contains a silver coin?&lt;br /&gt;&lt;br /&gt;1]1/2   2]1/3   3]1/6   4]1/4&lt;br /&gt;&lt;br /&gt;Questions 24-25 are based on the following:&lt;br /&gt;&lt;br /&gt;&lt;blockquote&gt;The fewer restricitons there are on the advertising of&lt;br /&gt;legal services, the more lawyers there are who&lt;br /&gt;advertise their services, and the lawyers who&lt;br /&gt;advertise a specific service usually charge less for&lt;br /&gt;that service than lawyers who do not advertise.&lt;br /&gt;Therefroe, if the state removes any of its current&lt;br /&gt;restrictions, such as the ones against advertisements&lt;br /&gt;that do not specify fee arrangements, overall consumer&lt;br /&gt;legal costs will be lower than if the state retains&lt;br /&gt;its current restrictions.&lt;/blockquote&gt;&lt;br /&gt;&lt;br /&gt;24. If the statements are true, which of  the&lt;br /&gt;following must be true?&lt;br /&gt;&lt;br /&gt;1]Some lawyers, who now advertise will charge more&lt;br /&gt;for specific services if they do not have to specify&lt;br /&gt;fee arrangements in the advertisements.&lt;br /&gt;2]More consumers will use legal services if there are&lt;br /&gt;fewer restrictions on the advertising of legal&lt;br /&gt;services.&lt;br /&gt;3]If the restriction against advertisements that do&lt;br /&gt;not specify fee arrangements is removed more lawyers&lt;br /&gt;will advertise their services.&lt;br /&gt;4]If more lawyers advertise, lawyers who do not&lt;br /&gt;advertise will also charge less than they currently&lt;br /&gt;charge for those services.&lt;br /&gt;&lt;br /&gt;25. Which of the following. if true, would most&lt;br /&gt;seriously weaken the argument concerning overall&lt;br /&gt;consumer legal costs?&lt;br /&gt;&lt;br /&gt;1]The state has recently removed some other&lt;br /&gt;restrictions that had limited the advertising of legal&lt;br /&gt;services.&lt;br /&gt;2]The state is unlikely to remove all of the&lt;br /&gt;restrictions that apply solely to the advertising of&lt;br /&gt;legal services.&lt;br /&gt;3]Most lawyers who now specify fee arrangements in&lt;br /&gt;their advertisements would continue to do so even if&lt;br /&gt;the specifications were not required.&lt;br /&gt;4]Most lawyers who advertise specific services do not&lt;br /&gt;lower their fee for those services when they begin to&lt;br /&gt;advertise.&lt;br /&gt;&lt;br /&gt;26.In a certain election only 2/5th of the voters&lt;br /&gt;promised to vote for P and the rest for Q. However on&lt;br /&gt;the day of elections, 15 voters went back on their&lt;br /&gt;promise to P and voted for Q. Similarly 25 voters went&lt;br /&gt;back on their promise to Q and voted for P, P lost the&lt;br /&gt;election by two votes. The number of votes in the&lt;br /&gt;election is&lt;br /&gt;&lt;br /&gt; 1]90    2]110   3]130   4]None of these.&lt;br /&gt;&lt;br /&gt;27. A bath has two taps and a waste pipe. One of the&lt;br /&gt;taps on the ownwould fill the bath in ten minutes, the&lt;br /&gt;other would take a quarter of an hour, the waste pipe&lt;br /&gt;can empty a full bath in exactly seven and half&lt;br /&gt;minutes. Now if we start with an empty bath with both&lt;br /&gt;taps fully on, when (if ever) will the bath be full if&lt;br /&gt;the waste pipe is left open?&lt;br /&gt;&lt;br /&gt; 1]15 min   2]44 min   3]22.5 min   4] 30 min&lt;br /&gt;&lt;br /&gt;Questions 28-30 are based on the following&lt;br /&gt;From exactly seven people- R,S,T,U,X,Y and Z- a&lt;br /&gt;group of exactly four must be selected in accordance&lt;br /&gt;with the following conditions:&lt;br /&gt;   If R is selected, T must also be selected.&lt;br /&gt;   If S is selected, U must also be selected.&lt;br /&gt;   If X and Y are both selected, T cannot be&lt;br /&gt;selected.&lt;br /&gt;&lt;br /&gt;28. If X and Y are both selected together, which of&lt;br /&gt;the following must also be selected?&lt;br /&gt;  1]R   2]S   3]U   4]Z&lt;br /&gt;&lt;br /&gt;29. If S and Z are both selected, each of the&lt;br /&gt;following could also be selected except:&lt;br /&gt;  1]R   2]T   3]U   4]X&lt;br /&gt;&lt;br /&gt;30.If U is not selected, which of the following can&lt;br /&gt;be, not does not have to be, selected?&lt;br /&gt;  1]R  2]S   3]T   4]X &lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114668053849684069?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114668053849684069/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114668053849684069' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114668053849684069'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114668053849684069'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/05/oracle-aptitude-i.html' title='Oracle :: Aptitude - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114657273082026680</id><published>2006-05-02T17:40:00.000+05:30</published><updated>2006-05-02T18:02:25.340+05:30</updated><title type='text'>TCS :: Aptitude and Resoning - I</title><content type='html'>&lt;span style="color: rgb(153, 51, 0); font-weight: bold;"&gt;APTITUDE:-&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;&lt;div style="text-align: justify;"&gt;1.)  two pencils cost 8 cents. then 5 pencils cost?&lt;br /&gt;  (20 cents)&lt;br /&gt;&lt;br /&gt;  2. A work is done by the people in 24 minutes.  One of them can do&lt;br /&gt;  this workalonely in 40 minutes.  How much time to do the same work&lt;br /&gt;  for the second person?&lt;br /&gt;  (60 minutes)&lt;br /&gt;&lt;br /&gt;  3. A car is filled with four and half gallons of fuel for a round trip.&lt;br /&gt;  Fuel is taken 1/4 more in going then coming.  What is the fuel&lt;br /&gt;  consumed in coming up? (2 gallons)&lt;br /&gt;&lt;br /&gt;  4.Low temperature at the night in a city is 1/3 more than 1/2 high as&lt;br /&gt;  higher temperature in a day.  Sum of the low tem. and highest temp.&lt;br /&gt;  is 100 degrees.  Then what is the low temp? (40 deg.)&lt;br /&gt;&lt;br /&gt;  5. A person, who decided to go to weekened trip should not&lt;br /&gt;  exceed 8 hours driving in a day.  Average speed of forward journey&lt;br /&gt;  is 40 m/h. Due to traffic in sundays, the return journey average speed&lt;br /&gt;  is 30 m/h. How far he can select a picnic spot?&lt;br /&gt;    a) 120 miles&lt;br /&gt;    b) between 120 and 140 miles&lt;br /&gt;    c) 160 miles&lt;br /&gt;  ans: 120 miles&lt;br /&gt;&lt;br /&gt;  6. A salesperson multiplied a number and get the answer 3,&lt;br /&gt;  instead of that number devided by 3.&lt;br /&gt;  what is the answer he actually has to get?&lt;br /&gt;        1 x 3 = 3&lt;br /&gt;        so number = 1&lt;br /&gt;    devided by 3, the ans. is 1/3.&lt;br /&gt;&lt;br /&gt;  7. A ship started from port and moving with I miles per hour and another&lt;br /&gt;  ship started from L and moving with H miles per hour.&lt;br /&gt;  At which place these two ships meet? (between I and J, nearer to J)&lt;br /&gt;      |----|----|----|----|----|----|&lt;br /&gt;    port     G    H    I    J    K    L&lt;br /&gt;&lt;br /&gt;  8. A building with height D shadow upto G. A neighbour building with&lt;br /&gt;  what height shadows C feet.   (height = B ft)&lt;br /&gt;      |----|----|----|----|----|----|----|&lt;br /&gt;      A    B    C    D    E    F    G    H&lt;br /&gt;&lt;br /&gt;    9. A person was fined for exceeding the speed limit by 10 mph.&lt;br /&gt;  Another person was also fined for exceeding the same speed limit&lt;br /&gt;  by twice the same.  If the second person was travelling at a&lt;br /&gt;  speed of 35 mph, find the speed limit.  (15 mph)&lt;br /&gt;&lt;br /&gt;  10.A bus started from bustand at 8.00am, and after 30 minutes staying&lt;br /&gt;   at destination, it returned back to the busstand.  The destination&lt;br /&gt;   is 27 miles from the busstand.  The speed of the bus is 18mph.  In&lt;br /&gt;   return journey bus travels with 50% fast speed.&lt;br /&gt;   At what time it returns to the busstand? (11.00am).&lt;br /&gt;&lt;br /&gt;11.In a mixture, R is 2 parts, S is 1 part. In aoder to make S to&lt;br /&gt;   25% of the mixture, howmuch R is to be added?  ( one part of R)&lt;br /&gt;&lt;br /&gt;12. wind flows 160 miles in 330 min, for 80 miles how much time required.&lt;br /&gt;&lt;br /&gt;13. with 4/5 full tank vehicle travels 12 miles, with 1/3 full tank&lt;br /&gt;    how much distance travels    ( 5 miles )&lt;br /&gt;&lt;br /&gt;14. two trees are there. one grows at 3/5 of the other in 4 years,&lt;br /&gt;    total growth of trees is 8 ft. what growth will smaller tree will have&lt;br /&gt;    in 2 years  (  &amp;lt; 2 ft. )&lt;br /&gt;&lt;br /&gt;15. A storm will move with a velocity of     towards the centre in   hours,&lt;br /&gt;     At the same rate how much far will it move in hrs.&lt;br /&gt;      ( but the answer is 8/3 or 2 2/3  )&lt;br /&gt;&lt;br /&gt;&lt;span style="color: rgb(153, 51, 0); font-weight: bold;"&gt;REASONING:-&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;&lt;fieldset&gt;&lt;br /&gt;&lt;legend style="color: rgb(153, 102, 51);"&gt;NOTE:-&lt;/legend&gt; Below questions along with answers are directly copied and pasted from a large text file containing a large number of questions. The accuracy of these answers are is not known to me. Better sit with 2-3 friends and get the answers by solving urselves. These are some paragraphs followed by 3-4 statements. The student has to mark these statements as T (True), F (False), or C (Can't say) based on the informations provided in the paragraph&lt;br /&gt;&lt;/fieldset&gt;&lt;br /&gt;&lt;br /&gt;&gt; &gt; A.&lt;br /&gt;&gt; &gt; my father had no brothers but his 3 sisters are all married and each has 2&lt;br /&gt;&gt; &gt; children.my grandfather has 2 sons.&lt;br /&gt;&lt;blockquote&gt;&gt; &gt; 1.mu father was an only child     F&lt;br /&gt;&gt; &gt; 2.3 of my aunts have sons         C&lt;br /&gt;&gt; &gt; 3.i have six cousins on my mother's side   C&lt;br /&gt;&gt; &gt; 4. i have only one uncle   F&lt;/blockquote&gt;&lt;br /&gt;&gt; &gt;&lt;br /&gt;&gt; &gt; B.&lt;br /&gt;&gt; &gt; Senior managers in a leading company said that new japanese investment&lt;br /&gt;&gt; &gt; in india was transforming the car industry and warned that jobs were&lt;br /&gt;&gt; &gt; under threat from japanese competition. they stated that increasing&lt;br /&gt;&gt; &gt; competition would be coupled with an in evitable downturn i the car market&lt;br /&gt;&gt; &gt; and the recent rise in interst rates whaich had already hit demand.&lt;br /&gt;&lt;blockquote&gt;&gt; &gt; 5.some senior managers said that more people will want to buy new cars in&lt;br /&gt;&gt; &gt; the future.  F&lt;br /&gt;&gt; &gt; 6.managers told workers that japanese workers are taking jobs away from&lt;br /&gt;&gt; &gt; indian workers in the car industry.  F&lt;br /&gt;&gt; &gt; 7.the managers issued their warning after a rise in interest rates.  T&lt;br /&gt;&gt; &gt; 8.the increased rate of the interest will mean that japanese firms will&lt;br /&gt;&gt; &gt; cease to operate in this country.  C&lt;/blockquote&gt;&lt;br /&gt;&gt; &gt;&lt;br /&gt;&gt; &gt; C.Researchers in mumbai have found that certain types of gallstones can be&lt;br /&gt;&gt; &gt; dissolved by injecting them with a gasoline additive in the form of ether&lt;br /&gt;&gt; &gt; the ether is injected through a tube directly into a tube directly into&lt;br /&gt;&gt; &gt; the gallbladder.the one day treatment works only on cholesterol-based&lt;br /&gt;&gt; &gt; stones.not those composed largely o calcium.however as the clolesterol&lt;br /&gt;&gt; &gt; stones are by far the most common typefor millions of gallstones&lt;br /&gt;&gt; &gt; sufferers the treatment should offer a welcome alternative tosurgery&lt;br /&gt;&gt; &gt; the commonest option in nost hospitals.&lt;br /&gt;&lt;blockquote&gt;&gt; &gt; 9.injecting ether into the gallbladder dissolves most gallstones   T&lt;br /&gt;&gt; &gt; 10.surgery is the only treatment for calcium stones   T&lt;br /&gt;&gt; &gt; 11.hundreds of peoplecontains calcium stones    C&lt;br /&gt;&gt; &gt; 12.calcium stones will be cured in one day  F&lt;/blockquote&gt;&lt;br /&gt;&gt; &gt;&lt;br /&gt;&gt; &gt; D.organising the home can be perceived as conferring power so large&lt;br /&gt;&gt; &gt; numbers of women are unwilling to let go of chores,even when they have&lt;br /&gt;&gt; &gt; careers.a survey found that,out of 65 new marriages not one single wife&lt;br /&gt;&gt; &gt; expected her husband to share work equally.according to the family policy&lt;br /&gt;&gt; &gt; studies center 81% working wives return home to do all th cooking.The&lt;br /&gt;&gt; &gt; average male has nearly half as much more tfree time at weekends&lt;br /&gt;&gt; &gt; than his wife and the typical new father spends just 37 seconds a day&lt;br /&gt;&gt; &gt; talking to his baby.&lt;br /&gt;&lt;blockquote&gt;&gt; &gt; 13.most working wives do not expect their husbands to share chores&lt;br /&gt;&gt; &gt; equally.   T&lt;br /&gt;&gt; &gt; 14.the average wife has half as much free time at weekends as her husband.&lt;br /&gt;&gt; &gt; F&lt;br /&gt;&gt; &gt; 15.some women collude in the unequal distribution of house hold work&lt;br /&gt;&gt; &gt; because they want to retain control    C&lt;br /&gt;&gt; &gt; 16. 39% of all men with working wives do the cooking and all the cleaning&lt;br /&gt;&gt; &gt; F&lt;/blockquote&gt;&lt;br /&gt;&gt; &gt;&lt;br /&gt;&gt; &gt; E.confucius said that to know the future we have to understand the pasthis&lt;br /&gt;&gt; &gt; time transport ,communications and scientific knowledge were less&lt;br /&gt;&gt; &gt; developed than they are today.news took weeks to travel where as today&lt;br /&gt;&gt; &gt; satellite links connect the continents virtually instantaneously.but&lt;br /&gt;&gt; &gt; our technological advances in the field of communications seem not to have&lt;br /&gt;&gt; &gt; improved our capacity to understand one another&lt;br /&gt;&lt;blockquote&gt;&gt; &gt; 17.in confucius daay people were more intelligent    C&lt;br /&gt;&gt; &gt; 18.we understand each otheer better now than in confucius time because&lt;br /&gt;&gt; &gt; we can travel more quickly.  F&lt;br /&gt;&gt; &gt; 19.we have made great improvements in transport since confucius day  T&lt;br /&gt;&gt; &gt; 20.none of our scientific discoveries has really improved our lives  C&lt;/blockquote&gt;&lt;br /&gt;&gt; &gt;&lt;br /&gt;&gt; &gt; F.words in totalitarian systems have aN Unhealthy importance and in such&lt;br /&gt;&gt; &gt; states now attempting to return to a more democratic normality there has&lt;br /&gt;&gt; &gt; been a natural inevitable and healthy devaluation of words whereas&lt;br /&gt;&gt; &gt; previouslu a single word used in a sppech or even a play or poem could be&lt;br /&gt;&gt; &gt; a serious political event now the words come cheaper almost free.&lt;br /&gt;&gt; &gt; politics is politics again and poetry only poetry&lt;br /&gt;&lt;blockquote&gt;&gt; &gt; 21.totalitarian state devalue words  T&lt;br /&gt;&gt; &gt; 22.only non-totalitarian regimes produce poetry of political importance&lt;br /&gt;&gt; &gt; T&lt;br /&gt;&gt; &gt; 23.writers under totalitarian regimes have to choose their words care&lt;br /&gt;&gt; &gt; fully   T&lt;br /&gt;&gt; &gt; 24. the democratic political system is healthier than others   C&lt;/blockquote&gt;&lt;br /&gt;&gt;&lt;br /&gt;&gt;&lt;br /&gt;&gt;    G.statistics show that millions of vehicals have beencarried by shuttle&lt;br /&gt;&gt; over the past 30 years through alpine tunnels withouty one ever catching&lt;br /&gt;&gt; tire.in the alpine tunnels.drivers and passengers sit in theirvhehicals on&lt;br /&gt;&gt; the shuttle trains.only one vehical has evercaught fire on the bussy&lt;br /&gt;&gt; french motorail equivalent system.this sort of accidents is not possible&lt;br /&gt;&gt; in a closed shuttle. assertinos that a vehical fire  will lead to&lt;br /&gt;&gt; catastophe have no basis. since the resoures exit do detect,control and&lt;br /&gt;&gt; extingush  a fire and to remove any persons present safely to an adjoning&lt;br /&gt;&gt; wagon, leaving any surviving fire facing rapid extinction within a wagan&lt;br /&gt;&gt; built to contain fire for 30 minutes. catastrophe seems very unlikely.&lt;br /&gt;&gt;&lt;br /&gt;&lt;blockquote&gt;&gt; 25. if a car cauget fire in a rail shuttle, probably none would be killed.&lt;br /&gt;&gt; &lt;br /&gt;&gt;     (T) &lt;br /&gt;&gt; 26.at least one vehical has cauht fire in an alpine tunnel.(f)&lt;br /&gt;&gt; 27.if a fire started in a wagon, it would be allowed to burn itself out in&lt;br /&gt;&gt;    30 minutes.(f)&lt;br /&gt;&gt; 28.if would theoreticaly be possible for a car to cath fire in aclosed&lt;br /&gt;&gt;     shuttle system.(F)&lt;/blockquote&gt;&lt;br /&gt;&lt;br /&gt;&gt;&lt;br /&gt;&gt; H)every form of art is protected by copy write,upon the expiration&lt;br /&gt;&gt;&lt;br /&gt;&gt;  of whitch the property passes into the public domain and becomes freely&lt;br /&gt;&gt; available to any one wishing to exploit it commercialy. the time has come&lt;br /&gt;&gt; when all treasures shoud pass to the controled of a trust,and by this made&lt;br /&gt;&gt; readily available to anyone on pament of a fee or royality.the income&lt;br /&gt;&gt; fromthe works of tagore would alone be enarmous.these who now main&lt;br /&gt;&gt; financialbenifit from his genius should make some contribution to the&lt;br /&gt;&gt; welfare of the arts in general.&lt;br /&gt;&lt;blockquote&gt;&gt; 29.tagore's plays are not protected by copyright.  F&lt;br /&gt;&gt; 30.tagore's decendants should be asked to make some contribution  to the&lt;br /&gt;&gt; arts C&lt;br /&gt;&gt; 31.instead of buying a ticket , theatregoers should pay a fee to trust for&lt;br /&gt;&gt; the benefit of the arts.  C&lt;br /&gt;&gt; 32. More people could go to the theatre if copy rightwere abolished  C&lt;/blockquote&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&gt; I. Hacking is a crime made possible by a relatively new technology,&lt;br /&gt;&gt; which one of the reasons it is often poorly understood and reported.&lt;br /&gt;&gt; Many computers, but no means all,are now linked togetherin networks which&lt;br /&gt;&gt; allow users on one computer to communicate with others on the same&lt;br /&gt;&gt; network.If a computer is not networked,no manipulation of its datafrom&lt;br /&gt;&gt; another machine is possible.So long as users are authorised, networking&lt;br /&gt;&gt; is just a way of making work easier and more productive.Hacking on the&lt;br /&gt;&gt; other hand,is the unauthorised use of networks or unauthorised entty&lt;br /&gt;&gt; into the computers themselves.Most people do not need to break into the&lt;br /&gt;&gt; networks they use,since they are already accredited users.&lt;br /&gt;&lt;blockquote&gt;&gt; 33. Most hackers are authorised to break into networks  F&lt;br /&gt;&gt; 34. Computers are only vulerable to the unauthorised manipulation of&lt;br /&gt;&gt;   their data via another computer if they are networked  T&lt;br /&gt;&gt; 35.The main reason why it is relatively easy to break into a computer is&lt;br /&gt;&gt; that few people understand the technology.  C&lt;br /&gt;&gt; 36.Hackers do not work fot the firms whose networks they break into.  T&lt;/blockquote&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&gt; J.Although invaders represent a threat to the conservation of flora and&lt;br /&gt;&gt; fauna,there are two special cases in which invasion have been deliberately&lt;br /&gt;&gt; brought about.One is the desire to control presents by natural predators,&lt;br /&gt;&gt; whichmay have to be brought in from other countries.The second is&lt;br /&gt;&gt; releasing organisms into the wild(or on to farms,from which they might&lt;br /&gt;&gt; escape)that are completely novel,beacause they have been genetically&lt;br /&gt;&gt; engineered.There is nothing intrinsically sinister about engineered&lt;br /&gt;&gt; organisms,but any novelty must be regarded as a potential invader.&lt;br /&gt;&lt;blockquote&gt;&gt; 37.Pest control does not threat the conservation of flora and fauna. T&lt;br /&gt;&gt; 38.Genetically engineered organisms must always be regarded as poten-&lt;br /&gt;&gt; tially dangerous.  F&lt;br /&gt;&gt; 39.Natural predators are work harmful than pests.T&lt;br /&gt;&gt; 40.Genetically engineered organisms escaped from the farm,they will be&lt;br /&gt;&gt; pose a threat to wildlife. T&lt;br /&gt;&gt; &lt;/blockquote&gt;&lt;br /&gt;&lt;br /&gt;&gt; &gt;&lt;br /&gt;&gt; &gt; K.electronics technology is coming to the rescue of helicopters which can&lt;br /&gt;&gt; &gt; be grounded or crash in icy conditions the machines are especially&lt;br /&gt;&gt; &gt; vulnerable to the build up of ice on both their rotors and engine air&lt;br /&gt;&gt; &gt; intake when operating in cold damp conditions.the problem is 2 fold&lt;br /&gt;&gt; &gt; ice increases the weight and the build upp makes the aerofoils&lt;br /&gt;&gt; &gt; less efficient .now at last a detector has been devised which the company&lt;br /&gt;&gt; &gt; hopes will mean safer flightsand less frequent grounding.unlike most&lt;br /&gt;&gt; &gt; devices in use at present it can detect the liquid water content of cloud&lt;br /&gt;&gt; &gt; above freezing level.so the warning is ginven before the potential hazard&lt;br /&gt;&gt; &gt; is encountered.&lt;br /&gt;&gt; &gt;&lt;br /&gt;&lt;blockquote&gt;&gt; &gt; 39.an electronic device has been invented which will prevent  the build&lt;br /&gt;&gt; &gt; up of ice on helicopter rotors   F&lt;br /&gt;&gt; &gt; 40.helicopters are sometimes grounded because in cold damp weather their&lt;br /&gt;&gt; &gt; engine air intakes and rotors malfuntion owing to the formatrion of ice.&lt;br /&gt;&gt; &gt; T&lt;br /&gt;&gt; &gt; 41.only one device can at present detect the liquid water content of&lt;br /&gt;&gt; &gt; cloud above freezing level  C&lt;br /&gt;&gt; &gt; 42.in future fewer helicopters will crash or have to grounded   T&lt;br /&gt;&gt; &gt; &lt;/blockquote&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&gt; &gt; L.anyone whos has systematically examined faces will have perceived a&lt;br /&gt;&gt; &gt; prepondreance although not a proliferation of asymmtry.whether or not&lt;br /&gt;&gt; &gt; the expression is volitinal and self controlled or spontaneous appears&lt;br /&gt;&gt; &gt; to predict facial asymmetry as does the type of emotion protrayed.positive&lt;br /&gt;&gt; &gt; emotions are usually displayed symmetrically although a left sided&lt;br /&gt;&gt; &gt; representation of a negative emotion is more common.posed expressions and&lt;br /&gt;&gt; &gt; negative emotions are less likely to be symmetrically represented.&lt;br /&gt;&lt;blockquote&gt;&gt; &gt; 43.an angry person is more likely to have a lopsided expression than&lt;br /&gt;&gt; &gt; someone who is smiling  T&lt;br /&gt;&gt; &gt; 44.a deliberately assumed facial expression will always be asymmetrical  F&lt;br /&gt;&gt; &gt; 45.an actor is likely to smile symmetrically when acting   C&lt;br /&gt;&gt;   46.more self conscious people are likely to have less asymmetrically&lt;br /&gt;&gt; facial expressions than those who are less aware of themselves   T&lt;br /&gt;&gt; &lt;/blockquote&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&gt;  M. human existence is not susceptible of arbitary division between&lt;br /&gt;&gt; consciousness and unconsciousness.the conscious world invades and shapes&lt;br /&gt;&gt; the activities of the unconscious while many of the great  achievements of&lt;br /&gt;&gt; humanity's waking hours were wholly or partly inspires bu dreams .even if&lt;br /&gt;&gt; it could be argued that dreams precede experience such a dichotomy could&lt;br /&gt;&gt; not be drawn as the influence of dreaming on the waking state would remain&lt;br /&gt;&gt; unclear but as yet no common vocabulary exists to record the substance&lt;br /&gt;&gt; of prenatal dreaming&lt;br /&gt;&lt;blockquote&gt;&gt; 47.sleep can be a creative state.   T&lt;br /&gt;&gt; 48.it is difficult to tell whether a sleeper is dr3eaming or not   C&lt;br /&gt;&gt; 49. if we knew what babies dream about before they are born we could&lt;br /&gt;&gt; show that conscious and unconscious mond influence one another   F&lt;br /&gt;&gt; 50. it is untrue to claim that the conscious and unconscious worlds never&lt;br /&gt;&gt; impinge on one another  F&lt;/blockquote&gt;&lt;br /&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114657273082026680?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114657273082026680/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114657273082026680' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114657273082026680'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114657273082026680'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/05/tcs-aptitude-and-resoning-i.html' title='TCS :: Aptitude and Resoning - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114638054596312912</id><published>2006-04-30T12:14:00.000+05:30</published><updated>2006-04-30T12:32:25.996+05:30</updated><title type='text'>JOB Puzzles - I</title><content type='html'>&lt;h2&gt;&lt;a name="algs"&gt;&lt;span style="color: black;"&gt;Algorithms &lt;/span&gt;&lt;/a&gt;&lt;span style=""&gt;&lt;/span&gt;&lt;span style="font-size: 10pt; color: black;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/h2&gt;  &lt;ul type="disc"&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What's the difference between a      linked list and an array? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Implement a linked list. Why      did you pick the method you did? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Implement an algorithm to sort      a linked list. Why did you pick the method you did? Now do it in O(n)      time. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Describe advantages and      disadvantages of the various stock sorting algorithms. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Implement an algorithm to      reverse a linked list. Now do it without recursion. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Implement an algorithm to      insert a node into a circular linked list without traversing it. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Implement an algorithm to sort      an array. Why did you pick the method you did? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Implement an algorithm to do      wild card string matching. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Implement strstr() (or some      other string library function). &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Reverse a string. Optimize for      speed. Optimize for space. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Reverse the words in a      sentence, i.e. "My name is Chris" becomes "Chris is name      My." Optimize for speed. Optimize for space. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Find a substring. Optimize for      speed. Optimize for space. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Compare two strings using O(n)      time with constant space. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Suppose you have an array of      1001 integers. The integers are in random order, but you know each of the      integers is between 1 and 1000 (inclusive). In addition, each number      appears only once in the array, except for one number, which occurs twice.      Assume that you can access each element of the array only once. Describe      an algorithm to find the repeated number. If you used auxiliary storage in      your algorithm, can you find an algorithm that does not require it? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Count the number of set bits in      a number. Now optimize for speed. Now optimize for size. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Multiple by 8 without using      multiplication or addition. Now do the same with 7. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Add numbers in base &lt;i&gt;n&lt;/i&gt;      (not any of the popular ones like 10, 16, 8 or 2 -- I hear that Charles      Simonyi, the inventor of Hungarian Notation, favors -2 when asking this      question). &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Write routines to read and      write a bounded buffer. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Write routines to manage a heap      using an existing array. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Implement an algorithm to take      an array and return one with only unique elements in it. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Implement an algorithm that      takes two strings as input, and returns the intersection of the two, with      each letter represented at most once. Now speed it up. Now test it. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Implement an algorithm to print      out all files below a given root node. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Given that you are receiving      samples from an instrument at a constant rate, and you have constant      storage space, how would you design a storage algorithm that would allow      me to get a representative readout of data, no matter when I looked at it?      In other words, representative of the behavior of the system to date. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How would you find a cycle in a      linked list? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Give me an algorithm to shuffle      a deck of cards, given that the cards are stored in an array of ints. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;The following asm block      performs a common math function, what is it? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ul&gt;  &lt;pre style="margin-left: 36pt; text-indent: -18pt;"&gt;&lt;!--[if !supportLists]--&gt;&lt;span style="font-family: Symbol;"&gt;&lt;span style=""&gt;·&lt;span style="font-family: &amp;quot;Times New Roman&amp;quot;; font-style: normal; font-variant: normal; font-weight: normal; font-size: 7pt; line-height: normal; font-size-adjust: none; font-stretch: normal;"&gt;                &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;!--[endif]--&gt;cwd xor ax, dx&lt;/pre&gt;&lt;pre style="margin-left: 36pt;"&gt;sub ax, dx&lt;/pre&gt;  &lt;ul type="disc"&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Imagine this scenario:&lt;br /&gt;     I/O completion ports are communictaions ports which take handles to files,      sockets, or any other I/O. When a Read or Write is submitted to them, they      cache the data (if necessary), and attempt to take the request to      completion. Upon error or completion, they call a user-supplied function      to let the users application know that that particular request has      completed. They work asynchronously, and can process an unlimited number      of simultaneous requests.&lt;br /&gt;     Design the implementation and thread models for I/O completion ports.      Remember to take into account multi-processor machines. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Write a function that takes in      a string parameter and checks to see whether or not it is an integer, and      if it is then return the integer value. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Write a function to print all      of the permutations of a string. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Implement malloc. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Write a function to print the      Fibonacci numbers. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Write a function to copy two      strings, A and B. The last few bytes of string A overlap the first few      bytes of string B. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How would you write qsort? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How would you print out the      data in a binary tree, level by level, starting at the top? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ul&gt;  &lt;div class="MsoNormal" style="text-align: center;" align="center"&gt;&lt;span style="font-size: 10pt; font-family: Arial; color: black;"&gt;  &lt;hr align="center" size="2" width="100%"&gt;  &lt;/span&gt;&lt;/div&gt;  &lt;h2&gt;&lt;a name="apps"&gt;&lt;span style="color: black;"&gt;Applications&lt;/span&gt;&lt;/a&gt;&lt;span style="color: black;"&gt; &lt;/span&gt;&lt;span style="font-size: 10pt; color: black;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/h2&gt;  &lt;ul type="disc"&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How can computer technology be      integrated in an elevator system for a hundred story office building? How      do you optimize for availability? How would variation of traffic over a      typical work week or floor or time of day affect this? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How would you implement      copy-protection on a control which can be embedded in a document and      duplicated readily via the Internet? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Define a user interface for      indenting selected text in a Word document. Consider selections ranging      from a single sentence up through selections of several pages. Consider      selections not currently visible or only partially visible. What are the      states of the new UI controls? How will the user know what the controls      are for and when to use them? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How would you redesign an ATM? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Suppose we wanted to run a      microwave oven from the computer. What kind of software would you write to      do this? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the difference between      an Ethernet Address and an IP address? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How would you design a      coffee-machine for an automobile. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;If you could add any feature to      Microsoft Word, what would it be? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How would you go about building      a keyboard for 1-handed users? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How would you build an alarm      clock for deaf people? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ul&gt;  &lt;div class="MsoNormal" style="text-align: center;" align="center"&gt;&lt;span style="font-size: 10pt; font-family: Arial; color: black;"&gt;  &lt;hr align="center" size="2" width="100%"&gt;  &lt;/span&gt;&lt;/div&gt;  &lt;h2&gt;&lt;a name="think"&gt;&lt;span style="color: black;"&gt;Thinkers&lt;/span&gt;&lt;/a&gt;&lt;span style="color: black;"&gt; &lt;/span&gt;&lt;span style="font-size: 10pt; color: black;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/h2&gt;  &lt;ul type="disc"&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How are M&amp;Ms made? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;If you had a clock with lots of      moving mechanical parts, you took it apart piece by piece without keeping      track of the method of how it was disassembled, then you put it back      together and discovered that 3 important parts were not included; how      would you go about reassembling the clock? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;If you had to learn a new      computer language, how would you go about doing it? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;You have been assigned to      design Bill Gates bathroom. Naturally, cost is not a consideration. You      may not speak to Bill. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What was the hardest question      asked of you so far today? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;If MS told you we were willing      to invest $5 million in a start up of your choice, what business would you      start? Why? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;If you could gather all of the      computer manufacturers in the world together into one room and then tell      them one thing that they would be compelled to do, what would it be? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Explain a scenario for testing      a salt shaker. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;If you are going to receive an      award in 5 years, what is it for and who is the audience? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How would you explain how to      use Microsoft Excel to your grandma? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Why is it that when you turn on      the hot water in any hotel, for example, the hot water comes pouring out      almost instantaneously? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Why do you want to work at      Microsoft? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Suppose you go home, enter your      house/apartment, hit the light switch, and nothing happens - no light      floods the room. What exactly, in order, are the steps you would take in      determining what the problem was? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style="color: black;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Interviewer hands you a black      pen and says nothing but "This pen is red."&lt;/span&gt;&lt;br /&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt; &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ul&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114638054596312912?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114638054596312912/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114638054596312912' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114638054596312912'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114638054596312912'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/job-puzzles-i.html' title='JOB Puzzles - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114634063536237746</id><published>2006-04-30T01:44:00.000+05:30</published><updated>2006-04-30T01:42:26.386+05:30</updated><title type='text'>Wipro :: VLSI - I</title><content type='html'>&lt;ol&gt;&lt;li&gt;For Realising EX-OR gate how many NAND gates are  required&lt;/li&gt;&lt;li&gt;The time required for the data to setting, before the triggering edge of the clock.&lt;br /&gt;Ans. Setup Time.&lt;/li&gt;&lt;li&gt;How can we change DFF to TFF&lt;/li&gt;&lt;li&gt;How can we change SRFF to JKFF&lt;/li&gt;&lt;li&gt;Minimum Number of 2:1 MUX required for 16:1 MUX&lt;/li&gt;&lt;li&gt;A 12 address lines maps to the memory of&lt;br /&gt;&gt;&lt;br /&gt;&gt;  [a] 1k bytes  [b] 0.5k bytes [c] 2k bytes  [d] none&lt;br /&gt;&gt;&lt;br /&gt;&gt;  Ans: b&lt;/li&gt;&lt;li&gt;In a processor these are 120 instructions . Bits&lt;br /&gt;needed to impliment&lt;br /&gt;&gt;    this instructions&lt;br /&gt;&gt;    [a] 6  [b] 7  [c] 10  [d] none&lt;br /&gt;&gt;&lt;br /&gt;&gt;   Ans: b&lt;/li&gt;&lt;li&gt;n=7623&lt;br /&gt;&gt;    {&lt;br /&gt;&gt;         temp=n/10;&lt;br /&gt;&gt;         result=temp*10+ result;&lt;br /&gt;&gt;        n=n/10&lt;br /&gt;&gt;    }&lt;br /&gt;&gt;&lt;br /&gt;&gt; Ans : 3267&lt;/li&gt;&lt;li&gt;C program code&lt;br /&gt;&gt;&lt;br /&gt;&gt;    int zap(int n)&lt;br /&gt;&gt;    {&lt;br /&gt;&gt;     if(n&lt;=1)then zap=1;&lt;br /&gt;&gt;     else  zap=zap(n-3)+zap(n-1);&lt;br /&gt;&gt;    }&lt;br /&gt;&gt;    then the call zap(6) gives the values of zap&lt;br /&gt;&gt;    [a] 8  [b]  9  [c] 6  [d]  12  [e] 15&lt;br /&gt;&gt;&lt;br /&gt;&gt;   Ans: b&lt;/li&gt;&lt;li&gt;Virtual memory size depends on&lt;br /&gt;&gt;    [a] address lines    [b] data bus&lt;br /&gt;&gt;    [c] disc space         [d] a &amp; c    [e] none&lt;br /&gt;&gt;&lt;br /&gt;&gt;  Ans :  a&lt;/li&gt;&lt;li&gt;load a&lt;br /&gt;&gt;    mul  a&lt;br /&gt;&gt;    store t1&lt;br /&gt;&gt;    load  b&lt;br /&gt;&gt;    mul   b&lt;br /&gt;&gt;    store t2&lt;br /&gt;&gt;    mul t2&lt;br /&gt;&gt;    add t1&lt;br /&gt;&gt;&lt;br /&gt;&gt;   then the content in accumulator is&lt;br /&gt;&gt;&lt;br /&gt;&gt; Ans : a**2+b**4&lt;/li&gt;&lt;li&gt;E=I*I*R what is the effect of E when I becomes I/2&lt;br /&gt;ans:1/4E(E decreses by 4 times)&lt;/li&gt;&lt;li&gt;out of 55 eggs 5 are defective. what is % of defective eggs&lt;br /&gt;ans:9/11%&lt;/li&gt;&lt;li&gt;A&gt;B,B&gt;C,C=D,D&gt;E,then which is greatest&lt;br /&gt;a)A/B  b) A/C  c) A/E d)none&lt;br /&gt;ans: c&lt;/li&gt;&lt;li&gt;section 2.  letter series&lt;br /&gt;  -------------------------&lt;br /&gt;    1. a c b d f e g i __           ans: h&lt;br /&gt;    2. x y z u v w r s t __     ans: o&lt;br /&gt;    3. a c f j o __                    ans:u&lt;/li&gt;&lt;li&gt; section 3.   numerical ability&lt;br /&gt;-------------------------------&lt;br /&gt;  1. 10099+99=10198&lt;br /&gt;  2. 31 - 29+2/33=__       ans:64/33&lt;br /&gt;  3. 2.904+0.0006=___  ans: 2.9046&lt;br /&gt;  4. 55/1000=___            ans:.005&lt;br /&gt;  5. 0.799*0.254= 0.202946&lt;br /&gt;  6. 200/7*5.04=144&lt;br /&gt;  7. 842.8 +602=1444.8&lt;br /&gt;  8. 5.72% of 418= 23.9096&lt;br /&gt;  9. 625% of 7.71=48.1875&lt;br /&gt; 10. 25% of 592=148.00&lt;br /&gt; 11. 665+22.9=687.9&lt;br /&gt; 12. 15% of 86.04=12.906&lt;/li&gt;&lt;li&gt;what is the direction of motion of an electron kept in an electromagnetic field.&lt;br /&gt;&lt;/li&gt;&lt;li&gt;in a transistor, the saturation current can be controlled by changing&lt;br /&gt;a)anode potential&lt;br /&gt;b)grid potential&lt;br /&gt;c)cathod potential&lt;br /&gt;d)non of the above&lt;br /&gt;&lt;/li&gt;&lt;li&gt;probability for speaking truth for A -&gt;75% for B -&gt;80%&lt;br /&gt;what is the probability that both of them will tell lie for a given fact&lt;br /&gt;&lt;/li&gt;&lt;li&gt;what will be order of SURITI in the dictionary if the letters of the word is arranged in&lt;br /&gt;lexicographical order&lt;br /&gt;&lt;/li&gt;&lt;li&gt;two persons are select any number from 1 to 25. they win if&lt;br /&gt;they select the same one.whatis the probability that they will win .&lt;br /&gt;&lt;/li&gt;&lt;li&gt;f(x)=(1-cos(x)(1-cos(x)))/(x*x*x)&lt;br /&gt;What is the value of f(x) at x=0, so that it is continious&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Same atomic no. &amp;amp; atomic mass&lt;br /&gt;(a) isotone&lt;br /&gt;(b) isomer&lt;br /&gt;(c) isobar&lt;br /&gt;(d) isomar.&lt;br /&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114634063536237746?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114634063536237746/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114634063536237746' title='2 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114634063536237746'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114634063536237746'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/wipro-vlsi-i.html' title='Wipro :: VLSI - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>2</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114589543340270787</id><published>2006-04-24T21:38:00.000+05:30</published><updated>2006-04-24T23:13:35.243+05:30</updated><title type='text'>Interra :: Placement Paper - I</title><content type='html'>&lt;ol&gt;&lt;li&gt;&lt;pre&gt;Optimize the below 1,2,3,4 questions for time:&lt;br /&gt;&lt;br /&gt;1)&lt;br /&gt;int i;&lt;br /&gt;if i=0 then i:=1;&lt;br /&gt;if i=1 then i:=0;&lt;br /&gt;&lt;br /&gt;2)&lt;br /&gt;int i;&lt;br /&gt;if i=0 then i:=1;&lt;br /&gt;if i=1 then i:=0;&lt;br /&gt;(given that i can take only two values (1,0))&lt;br /&gt;&lt;br /&gt;3)&lt;br /&gt;int i;&lt;br /&gt;if i=0 then i:=1;&lt;br /&gt;else if i=1 then i:=0;&lt;br /&gt;(given that i can take only two values (1,0))&lt;br /&gt;&lt;br /&gt;4)&lt;br /&gt;int m,j,i,n;&lt;br /&gt;for i:=1 to n do&lt;br /&gt;m:=m+j*n&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;Expand the following&lt;br /&gt;a) ISDN&lt;br /&gt;b) CASE&lt;br /&gt;c) CSMA/CD&lt;br /&gt;d) OOPS&lt;br /&gt;e) MIMD&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;n the following questions, answer A,B,C,D depending on when&lt;br /&gt;the errors are  detected?&lt;br /&gt;A if no error is detected&lt;br /&gt;B if semantic and syntactic checking&lt;br /&gt;C if during Code genration &amp; Symbol allocation&lt;br /&gt;D run time&lt;br /&gt;&lt;br /&gt;a) Array overbound&lt;br /&gt;b) Undeclared identifier&lt;br /&gt;c) stack underflow&lt;br /&gt;d) Accessing an illegal memory location&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;If a CPU has 20 address lines but MMU does'nt use two of them.&lt;br /&gt; OS occupies 20K. No virtual memory is supported. What is the&lt;br /&gt; maximum memory available for a user program?&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt; For a binary tree with n nodes, How many nodes are there which&lt;br /&gt;has got both a parent and a child?&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;Which of the following can be zero? (only one)&lt;br /&gt;  a)  swap space&lt;br /&gt;  b)  physical memory&lt;br /&gt;  c)  virtual memory&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;What is a must for multitasking?&lt;br /&gt;  a) Process preemption&lt;br /&gt;  b) Paging&lt;br /&gt;  c) Virtual memory&lt;br /&gt;  d) None of the above&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;Using the following instructions and two registers , A&amp;amp;B.&lt;br /&gt; find out A XOR B and put the result in A&lt;br /&gt; PUSH &lt;reg&gt;&lt;br /&gt; POP  &lt;reg&gt;&lt;br /&gt; NOR    These instructions operates with A &amp; B and puts the result in&lt;br /&gt; AND     A&lt;br /&gt;&lt;br /&gt;(question basically to get XOR in terms of NOR and AND)&lt;/reg&gt;&lt;/reg&gt;&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;int i=0;&lt;br /&gt;int j=0;&lt;br /&gt;&lt;br /&gt;loop:&lt;br /&gt;if(i = 0)&lt;br /&gt;   i++;&lt;br /&gt;i++;&lt;br /&gt;j++;&lt;br /&gt;if(j&lt;= 25)    goto loop xxx:    question1 : how many times is the loop entered &lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;For which of following is it not possible to write an algorithm.&lt;br /&gt;&lt;br /&gt;a) To find out 1026th prime number&lt;br /&gt;b) To write program for NP-complete problem&lt;br /&gt;c) To write program which generates true Random numbers.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;what is the essential requirement for an real-time systems&lt;br /&gt;&lt;br /&gt;a) pre-emption&lt;br /&gt;b) virtual memory&lt;br /&gt;c) paging  etc...&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;a cube has colors blue,red ,yellow each on two opposite sides.cube is&lt;br /&gt;divided into "32 small cubes and 4 large cubes".&lt;br /&gt;question:how many cubes (on 36 cubes) have blue at leat one side.&lt;br /&gt;      how many cubes have colors on two sides.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;aa person sold two articles for 80 /- each.with 20% profit on one&lt;br /&gt;article and 20% loss on another article, what is the loss / prifit he&lt;br /&gt;will gain on both.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;main()&lt;br /&gt;{int a,b;&lt;br /&gt;int *p,*q;&lt;br /&gt;a=10;b=19;&lt;br /&gt;p=&amp;(a+b);&lt;br /&gt;q=&amp;max;&lt;br /&gt;} Q a)error in p=&amp;(a+b) b)error in p=&amp;amp;max c)error in both d) no error &lt;/pre&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114589543340270787?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114589543340270787/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114589543340270787' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114589543340270787'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114589543340270787'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/interra-placement-paper-i.html' title='Interra :: Placement Paper - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114589349302154480</id><published>2006-04-24T21:07:00.000+05:30</published><updated>2006-04-24T23:14:29.306+05:30</updated><title type='text'>DE Shaw Placement Paper - III</title><content type='html'>&lt;span style="font-weight: bold; color: rgb(153, 102, 51);"&gt;Aptitude:-&lt;/span&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;What is the area covered in in 14 minutes by the minute hand of a clock of length 15 cm ?&lt;/li&gt;&lt;li&gt;What is the diameter of a wheel if it covers 440 m in 1000 revolutions?&lt;/li&gt;&lt;li&gt;There are 1 Re, 50 p, 25 p coins in the ratio 3:3:4 respectively. if the total amount is Rs.550, how many 1 Re coins are there?&lt;br /&gt;ans: 300&lt;/li&gt;&lt;li&gt; if A can do 1/3rd of work in 4 days and B can do 1/6th of work in 3 days, then in how many days can both A and B complete the work.&lt;br /&gt;ans: 7 1/7 days&lt;/li&gt;&lt;li&gt; if a number is divided by 935 remainder is 69. if same no. is divided by 38, what will be the remainder?&lt;br /&gt;ans: 29&lt;/li&gt;&lt;li&gt; if a tank is filled by 10 pumps, it takes 12 hours. if the same tank is filled by 15 pumps, then it will take 6 hours. how much time will it take to fill the tank if 25 pumps are used?&lt;/li&gt;&lt;li&gt;what is the probability of having b'days of 2 persons on the same day in a gathering of 50 persons?&lt;/li&gt;&lt;li&gt; how many words can be formed by the letters of the word DELCIOUS starting with D and ending with E?&lt;br /&gt;ans: 6! = 720&lt;/li&gt;&lt;li&gt; if a man works for 3 hours he gets Rs.15 + 1 meal. if he works for 12 hours he gets Rs.90 + 2 meals. what is the cost of a meal?&lt;br /&gt;ans: Rs.15/-&lt;br /&gt;&lt;/li&gt;&lt;li&gt;if a tank can be filled by pipe A in 24 mins and by pipe B in 32 mins. if A and B both are open, when should B be stopped to fill the tank in 18 mins.&lt;/li&gt;&lt;/ol&gt;&lt;span style="font-weight: bold; color: rgb(153, 51, 0);"&gt;C Programming&lt;/span&gt;&lt;br /&gt;&lt;pre&gt;1.   typedef struct{&lt;br /&gt;char *;&lt;br /&gt;nodeptr next;&lt;br /&gt;} * nodeptr;&lt;br /&gt;what does nodeptr stand for?&lt;br /&gt;&lt;br /&gt;2. supposing thaty each integer occupies 4 bytes and each charactrer&lt;br /&gt;1 byte , what is the output of the following programme?&lt;br /&gt;&lt;br /&gt;#include&lt;stdio.h&gt;&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;int a[] ={ 1,2,3,4,5,6,7};&lt;br /&gt;char c[] = {' a','x','h','o','k'};&lt;br /&gt;printf("%d\t %d ", (&amp;a[3]-&amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;a[0]),(&amp;c[3]-&amp;amp;c[0]));&lt;br /&gt;}&lt;br /&gt;ans : 3  3&lt;br /&gt;&lt;br /&gt;3. what is the output of the program?&lt;br /&gt;&lt;br /&gt;#include&lt;stdio.h&gt;&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;struct s1 {int i; };&lt;br /&gt;struct s2 {int i; };&lt;br /&gt;struct s1 st1;&lt;br /&gt;struct s2 st2;&lt;br /&gt;st1.i =5;&lt;br /&gt;st2 = st1;&lt;br /&gt;printf(" %d " , st2.i);&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;ans: nothing  (error)&lt;br /&gt;expl: diff struct variables should not assigned using "=" operator.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;4.what is the output of the program?&lt;br /&gt;&lt;br /&gt;#include&lt;stdio.h&gt;&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;int i,j;&lt;br /&gt;int mat[3][3] ={1,2,3,4,5,6,7,8,9};&lt;br /&gt;for (i=2;i&gt;=0;i--)&lt;br /&gt;for ( j=2;j&gt;=0;j--)&lt;br /&gt;printf("%d" , *(*(mat+j)+i));&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;ans : 9 6 3 8 5 2 7 4 1&lt;br /&gt;&lt;br /&gt;&lt;b)? a="" x="1," y="2;" 3="" 4="" 2="" 10="" correct="" declaration="" function="" main="" char="" 11="" if="" is="" defined="" as="" which="" of="" the="" following="" correctly="" allocates="" memory="" for="" ans="" ptr="" 100="" int=""&gt;&lt;/b)?&gt;&lt;/stdio.h&gt;&lt;/stdio.h&gt;&lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114589349302154480?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114589349302154480/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114589349302154480' title='2 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114589349302154480'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114589349302154480'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/de-shaw-placement-paper-iii.html' title='DE Shaw Placement Paper - III'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>2</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114576721190714957</id><published>2006-04-23T09:51:00.000+05:30</published><updated>2006-11-01T12:51:54.553+05:30</updated><title type='text'>DE Shaw :: Aptitude - II</title><content type='html'>&lt;span style="font-weight: bold; color: rgb(153, 51, 0);"&gt;Aptitude:-&lt;/span&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;&lt;pre&gt;ONE RECTANGULAR PLATE WITH LENGTH 8INCHES,BREADTH 11&lt;br /&gt;  INCHES AND 2 INCHES THICKNESS IS THERE.WHAT IS THE LENGTH&lt;br /&gt;  OF THE CIRCULAR ROD WITH DIAMETER 8 INCHES AND EQUAL TO&lt;br /&gt;  VOLUME OF RECTANGULAR PLATE?&lt;br /&gt;  ANS: 3.5INCHES&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;WHAT IS THE NUMBER OF ZEROS AT THE END OF THE PRODUCT&lt;br /&gt;  OF THE NUMBERS FROM 1 TO 100&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;in some game 139 members have participated every time&lt;br /&gt;  one fellow will get bye what is the number of matches to&lt;br /&gt;  choose the champion to be held?&lt;br /&gt;  ans: 138&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;one fast typist type some matter in 2hr and&lt;br /&gt;  another slow typist type the&lt;br /&gt;  same matter in 3hr. if both do combinely in how much time&lt;br /&gt;  they will finish.&lt;br /&gt;  ans: 1hr 12min&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;in 8*8 chess board what is the total number of squares&lt;br /&gt;  refer odel&lt;br /&gt;  ans:204&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;falling height is proportional to square of the time.&lt;br /&gt;  one object falls 64cm in 2sec than in 6sec from how much&lt;br /&gt;  height the object will fall.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;gavaskar average in first 50 innings was 50 . after the 51st&lt;br /&gt;  innings his average was 51 how many runs he made in the 51st&lt;br /&gt;  innings&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;2 oranges,3 bananas and  4 apples cost Rs.15 . 3 ornages&lt;br /&gt;  2 bananas 1 apple costs Rs 10. what is the cost of 3 oranges,&lt;br /&gt;  3 bananas and 3 apples&lt;br /&gt;  ans Rs 15.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;in 80 coins one coin is counterfiet what is minimum number of&lt;br /&gt;   weighings to find out counterfiet coin&lt;br /&gt;&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;in a company 30% are supervisors and 40% employees are male&lt;br /&gt;  if 60% of supervisors are male. what is the probability&lt;br /&gt;  that a randomly choosen employee is a male or female?&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;THERE WERE 750 PEOPLE WHEN THE FIRST SONG WAS SUNG. AFTER EACH&lt;br /&gt;SONG 50 PEOPLE ARE LEAVING THE HALL. HOWMANY SONGS ARE SUNG TO MAKE&lt;br /&gt;THEM ZERO?&lt;br /&gt;&lt;br /&gt;ANS:16&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;A PERSON IS CLIMBING OF 60 MTS . FOR EVERY MINUTE HE IS  CLIMBING 6 MTS&lt;br /&gt;AND SLIPPING 4 MTS . AFTER HOWMANY MINUTES HE MAY REACH THE TOP?&lt;br /&gt;&lt;br /&gt;ANS: (60-6)/2 +1  :28&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;SALARY IS INCREASED BY 1200 ,TAX IS DECREASED FROM 12% TO 10% BUT PAYING&lt;br /&gt;SAME AMOUNT  AS TAX . WHAT IS THE PREVISIOUS SALARY?&lt;br /&gt;&lt;br /&gt;ANS:6000&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;THE LEAST NO. WHICH IS WHEN DEVIDED BY 4,6,7  LEAVES A REMAINDER OF 2 ?&lt;br /&gt;&lt;br /&gt;ANS: 86&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;A MAN DRIVING THE CAR AT TWICE THE SPEED OF AUTO ONEDAY HE WAS DRIVEN&lt;br /&gt;CAR FOR 10 MIN. AND CAR IS FAILED. HE LEFT THE CAR AND TOOK AUTO TO GOTO&lt;br /&gt;THE OFFICE . HE SPENT 30 MIN. IN THE AUTO. WHAT WILL BE THE TIME TAKE BY&lt;br /&gt;CAR TO GO OFFICE?&lt;br /&gt;&lt;br /&gt;ANS:25 MIN&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;OUT OF 100 FAMILIES IN NEIGHBOUR HOOD , 55 OWN RADIO, 75 OWN T.V&lt;br /&gt;AND 25 OWN VCR. ONLY 10 FAMILIES HAVE ALLOF THESE, AND EACH VCR OWNER&lt;br /&gt;HAS TV . IF 25 FAMILIES HAVE THE RADIO ONLY, THE NO. OF FAMILIES HAVE&lt;br /&gt;ONLY TV ARE?&lt;br /&gt;&lt;br /&gt;ANS: 30&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;KYA KYA IS AN ISLAND IN THE SOUTH PACIFI . THE INHABITANTS OF KYA KYA&lt;br /&gt;ALWAYS ANSWER ANY QUESTION WITH TWO SENTENCES, ONE OR WHICH IS ALWAYS&lt;br /&gt;TRUE AND OTHER IS ALWAYS FALSE.&lt;br /&gt;&lt;br /&gt;1. YOU ARE WALKING ON THE ROAD AND COME TO A FORK. YOU ASK ,THE INHABITANTS&lt;br /&gt;RAM.LAXMAN, AND LILA AS" WHICH ROAD WILL TAKE ME TO THE VILAGE?&lt;br /&gt;&lt;br /&gt;RAM SAYS: I NEVER SPEAK TO STRANGERS. IAM NEW TO THIS PLACE&lt;br /&gt;LAXMAN SAYS: IAM MARRIED TO.LILA. TAKE THE LEFT ROAD&lt;br /&gt;LILA SAYS: IAM MARRIED TO RAM. HE IS NOT NEW TO THIS PLACE&lt;br /&gt;&lt;br /&gt;ANS:  LEFT ROAD TAKE YU TO THE VILLAGE&lt;br /&gt;&lt;br /&gt;2. YOU FIND THAT YOUR BOAT IS STOLLEN. U QUESTIONED THREE INHABITANTS OT&lt;br /&gt;ISLANDS AND THEIR REPLIES ARE&lt;br /&gt;&lt;br /&gt;JOHN   : I DIDNOT DO IT. MATHEW DIDNOT DO IT&lt;br /&gt;MATHEW :  I DIDNOT DO IT. KRISHNA DIDNOT DO IT&lt;br /&gt;KRISHNA: I DID NOT DO IT; I DONOT KNOW WHO DID IT&lt;br /&gt;&lt;br /&gt;ANS: MATHEW STOLEN THE BOAT&lt;br /&gt;&lt;br /&gt;3. YOU WANT TO SPEAK TO THE CHIEF OF VILLAGE , U ASK THREE FELLOWS AMAR&lt;br /&gt;BOBBY, CHARLES AND BOBBY IS WEARING RED SHIRT&lt;br /&gt;&lt;br /&gt;AMAR    : IAM NOT BOBBY`S SON ; THE CHIEF WEARS RED SHIRT&lt;br /&gt;BOBBY   : IAM AMARS FATHER ; CHARLES IS THE CHIEF&lt;br /&gt;CHARLES : THE CHIEF IS ONE AMONG US; IAM THE CHIEF&lt;br /&gt;&lt;br /&gt;ANS: BOBBY IS THE CHIEF&lt;br /&gt;&lt;br /&gt;4. THERE IS ONLY OPNE POLOT IN THE VILLAGE(ISLAND). YOU INTERVIEWED THREEM MAN&lt;br /&gt;KOISK ,LORRY AND MISHRA&lt;br /&gt;U ALSO NOTICE THAT KOISK IS WEARING CAP.&lt;br /&gt;&lt;br /&gt;M SAYS : LARRY IS FATHER IN THE PILOT .LARRY IS NOT THE PRIESTS SON&lt;br /&gt;KOISK  : IAM THE PRIEST ON THEIS ISLAND ONLY PRISTS CAN WEAR THE CAPS&lt;br /&gt;LARRY  : IAM THE PRIEST SON . KOISK IS NOT THE PREST&lt;br /&gt;&lt;br /&gt;ANS : KOISK IS THE PILOT&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;LCM OF 3 PRIME NO.S  IS 1729. THE HIGHEST NUMBER&lt;br /&gt;AMONG THEM IS ?&lt;br /&gt;         A 13      B 19  C 23  D 11.&lt;br /&gt;         ANS 19&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;A SHIP LEFT THE YARD AND TRAVELLED 180 MILES. NOW&lt;br /&gt;ANOTHER FLIGHT WITH 10 TIMES THE SPEED OF THE SHIP&lt;br /&gt;STARTED . WHEN BOTH WILL MEET?&lt;br /&gt;ANS 200  MILES&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;THE PRBABILITY OF HITTING A TARGET BY X IS 0.9 AND&lt;br /&gt;THAT OF B   IS  0.8, THEN IF BOTH TRY WHAT IS THE&lt;br /&gt;PROBABILITY OF HITTING THE TARGET.&lt;br /&gt;ANS 0.98.     &lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;THE LENGTH OF THE ROPE IS 660M. WHAT IS THE MAXIMUM&lt;br /&gt;AREA COVERED BY THIS ROPE?&lt;br /&gt;ANS 34650&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;a MAN IS INCREASING HIS SPEED  5% EVRY hr ANOTHER&lt;br /&gt;INCREASES 1% IN 1ST AND 3% IN SECOND  AND SO.ON  WHEN&lt;br /&gt;THY MEET?&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;A TAP CAN FILL THE TANK IN 10hrS,10 HOLES CAN&lt;br /&gt;EMPTY WITHIN  6hr, OF SAME CAPACITY 15 HOLES WHITH IN&lt;br /&gt;6hr.if  ALL OPERATE THEN THE TIME OF FILLING THE TANK.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/pre&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114576721190714957?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114576721190714957/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114576721190714957' title='3 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114576721190714957'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114576721190714957'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/de-shaw-aptitude-ii.html' title='DE Shaw :: Aptitude - II'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>3</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114568401667370067</id><published>2006-04-22T10:45:00.000+05:30</published><updated>2006-04-22T11:07:06.746+05:30</updated><title type='text'>DE Shaw :: Programming Questions - I</title><content type='html'>&lt;span style="color: rgb(204, 102, 0); font-weight: bold;"&gt;Programming:-&lt;/span&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;Swapping two variables x,y without using a temporary variable.&lt;/li&gt;&lt;li&gt;Write a program for reversing the given string.&lt;span style="font-family:monospace;"&gt;&lt;/span&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;The integers from 1 to n are stored in an array in a random&lt;br /&gt;fashion. but one integer is missing. write a program to find the&lt;br /&gt;missing integer.&lt;br /&gt;   ans. idea. the sum of n natural numbers is = n(n+1)/2.&lt;br /&gt;        if we subtract the above sum from the sum of all the&lt;br /&gt;        numbers in the array , the result is nothing but the&lt;br /&gt;        missing number.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;Write a c program to find whether a stack is progressing in forward or reverse direction.&lt;/li&gt;&lt;li&gt;Write a c program that reverses the linked list.&lt;/li&gt;&lt;/ol&gt;&lt;span style="font-weight: bold; color: rgb(153, 51, 0);"&gt;C/C++:-&lt;/span&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;&lt;pre&gt;typedef struct{&lt;br /&gt; char *;&lt;br /&gt; nodeptr next;&lt;br /&gt; } * nodeptr;&lt;br /&gt;what does nodeptr stand for?&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;int   *x[](); means&lt;br /&gt;expl: Elments of an array can't be functions.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;o/p=?&lt;br /&gt;int i;&lt;br /&gt;i=1;&lt;br /&gt;i=i+2*i++;&lt;br /&gt;printf(%d,i);&lt;br /&gt;                    ans: 4&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;#include&lt;malloc.h&gt;&lt;br /&gt;char *f()&lt;br /&gt;{char *s=malloc(8);&lt;br /&gt;strcpy(s,"goodbye")}&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;char *f();&lt;br /&gt;printf("%c",*f()='A');&lt;br /&gt;o/p=?&lt;/malloc.h&gt;&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;FILE *fp1,*fp2;&lt;br /&gt;fp1=fopen("one","w")&lt;br /&gt;fp2=fopen("one","w")&lt;br /&gt;fputc('A',fp1)&lt;br /&gt;fputc('B',fp2)&lt;br /&gt;fclose(fp1)&lt;br /&gt;fclose(fp2)}&lt;br /&gt;ans: no error. But It will over writes on same&lt;br /&gt;file.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;#define MAN(x,y) (x)&gt;(y)?(x):(y)&lt;br /&gt;{  int i=10;j=5;k=0;&lt;br /&gt;k= MAX(i++,++j)&lt;br /&gt;printf(%d %d %d %d,i,j,k)}&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;a=10;b=5; c=3;d=3;&lt;br /&gt;if(a&lt;b)&amp;&amp;(c=d++) else="" printf="" d=""&gt;&lt;/b)&amp;&amp;(c=d++)&gt;&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;what is o/p&lt;br /&gt;&gt;   #include&lt;stdarg.h&gt;&lt;br /&gt;&gt;   show(int t,va_list ptr1)&lt;br /&gt;&gt;   {&lt;br /&gt;&gt;   int a,x,i;&lt;br /&gt;&gt;   a=va_arg(ptr1,int)&lt;br /&gt;&gt;   printf("\n %d",a)&lt;br /&gt;&gt;   }&lt;br /&gt;&gt;   display(char)&lt;br /&gt;&gt;   {int x;&lt;br /&gt;&gt;   listptr;&lt;br /&gt;&gt;   va_star(otr,s);&lt;br /&gt;&gt;   n=va_arg(ptr,int);&lt;br /&gt;&gt;   show(x,ptr);&lt;br /&gt;&gt;   }&lt;br /&gt;&gt;   main()&lt;br /&gt;&gt;   {&lt;br /&gt;&gt;   display("hello",4,12,13,14,44);&lt;br /&gt;&gt;   }&lt;br /&gt;&gt;   a) 13 b) 12 c) 44 d) 14&lt;/stdarg.h&gt;&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;main()&lt;br /&gt;&gt; {&lt;br /&gt;&gt; printf("hello");&lt;br /&gt;&gt; fork();&lt;br /&gt;&gt; }&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;main()&lt;br /&gt;&gt; {&lt;br /&gt;&gt; int i = 10;&lt;br /&gt;&gt; printf(" %d %d %d \n", ++i, i++, ++i);&lt;br /&gt;&gt; }&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;#include&lt;stdio.h&gt;&lt;br /&gt;&gt; main()&lt;br /&gt;&gt; {&lt;br /&gt;&gt; int *p, *c, i;&lt;br /&gt;&gt; i = 5;&lt;br /&gt;&gt; p = (int*) (malloc(sizeof(i)));&lt;br /&gt;&gt; printf("\n%d",*p);&lt;br /&gt;&gt; *p = 10;&lt;br /&gt;&gt; printf("\n%d  %d",i,*p);&lt;br /&gt;&gt; c = (int*) calloc(2);&lt;br /&gt;&gt; printf("\n%d\n",*c);&lt;br /&gt;&gt; }&lt;/stdio.h&gt;&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;#define MAX(x,y) (x) &gt;(y)?(x):(y)&lt;br /&gt;&gt; main()&lt;br /&gt;&gt; {&lt;br /&gt;&gt;  int i=10,j=5,k=0;&lt;br /&gt;&gt;   k=  MAX(i++,++j);&lt;br /&gt;&gt;    printf("%d..%d..%d",i,j,k);&lt;br /&gt;&gt;  }&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;#include &lt;stdio.h&gt;&lt;br /&gt;&gt; main()&lt;br /&gt;&gt; {&lt;br /&gt;&gt;         enum _tag{ left=10, right, front=100, back};&lt;br /&gt;&gt;         printf("left is %d, right is %d, front is&lt;br /&gt;&gt; %d, back is&lt;br /&gt;&gt; %d",left,right,front,back);&lt;br /&gt;&gt; }&lt;/stdio.h&gt;&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;main()&lt;br /&gt;&gt; {&lt;br /&gt;&gt;         int a=10,b=20;&lt;br /&gt;&gt;  a&gt;=5?b=100:b=200;&lt;br /&gt;&gt;         printf("%d\n",b);&lt;br /&gt;&gt; }&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;#define PRINT(int) printf("int = %d  ",int)&lt;br /&gt;&gt; main()&lt;br /&gt;&gt; {&lt;br /&gt;&gt; int x,y,z;&lt;br /&gt;&gt; x=03;y=02;z=01;&lt;br /&gt;&gt; PRINT(x^x);&lt;br /&gt;&gt; z&lt;&lt;=3;PRINT(x); &gt; y&gt;&gt;=3;PRINT(y);&lt;br /&gt;&gt; }&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;what is the o/p of the program&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt; int rows=3,colums=4;&lt;br /&gt; int a[rows][colums]={1,2,3,4,5,6,7,8,9,10,11,12};&lt;br /&gt;   i=j=k=99;&lt;br /&gt;   for(i=0;i&lt;rows;i++) j="0;j&lt;colums;j++)"&gt;&lt;k) printf="" n="" k="a[i][j];"&gt;&lt;/k)&gt;&lt;/rows;i++)&gt;&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;what is o/p&lt;br /&gt;main()&lt;br /&gt;{int i=3;&lt;br /&gt;while(i--)&lt;br /&gt;{&lt;br /&gt;int i=100&lt;br /&gt;i--;&lt;br /&gt;printf("%d..",i);&lt;br /&gt;}&lt;br /&gt;}&lt;br /&gt;a) infinite loop&lt;br /&gt;b) error&lt;br /&gt;c) 99..99..99..99&lt;br /&gt;d) 3..22..1..&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;&lt;br /&gt;'-'=45  '/'=47&lt;br /&gt;printfr(%d/n,'-','-','-','-','/','/','/');&lt;br /&gt;o/p =?&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;{ ch='A';&lt;br /&gt;while(ch&lt;='F'){   switch(ch){   case'A':case'B':case'C':case'D':ch++;continue;   case'E':case'F':ch++;   }   putchar(ch);   }   }     a)ABCDEF  b.EFG c.FG d.error&lt;/pre&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114568401667370067?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114568401667370067/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114568401667370067' title='9 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114568401667370067'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114568401667370067'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/de-shaw-programming-questions-i.html' title='DE Shaw :: Programming Questions - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>9</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114562096041475176</id><published>2006-04-21T17:27:00.000+05:30</published><updated>2006-07-14T20:08:15.726+05:30</updated><title type='text'>Analog Devices :: Placement Paper - I</title><content type='html'>&lt;span style="color: rgb(153, 51, 0); font-weight: bold;"&gt;Analytical&lt;/span&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;&lt;pre&gt;One number of five digit is given if we append 9 before the number&lt;br /&gt;it will become 4 times when append 9 at end . WHAT  IS NUMBER?&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;6 MONKS  6 cannible( can eat monks if C&gt; M any time&lt;br /&gt;any where) One boat . boat can sustain at most 3 persons. Trivial&lt;br /&gt;question....&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;Two inputs in a block are going (N1 and N2) two outputs (Max and&lt;br /&gt;min of that). If U have 4 numbers than how u use this as a building&lt;br /&gt;block to sort 4 numbers. &lt;span style="font-family: Georgia,serif;"&gt;&lt;/span&gt;&lt;/pre&gt;&lt;/li&gt;&lt;/ol&gt;&lt;span style="color: rgb(153, 51, 0); font-weight: bold;"&gt;Technical&lt;br /&gt;&lt;/span&gt;&lt;ol&gt;&lt;li&gt;&lt;pre&gt;1) static (wrt dynamic circuits)&lt;br /&gt;2) Electromigration&lt;br /&gt;3) Hot electron&lt;br /&gt;4) Tr in Saturation&lt;br /&gt;5) Latch-up&lt;br /&gt;6) Seq. Ckt.&lt;br /&gt;7) CLM&lt;br /&gt;8) FIR filter.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;1) Dynamic circuits.......with feedback   called HALF LATCH.&lt;br /&gt;2) inv with PMOS and NMOS exchanged&lt;br /&gt;3) which circuit is having smallest fall delay . options 1) NAND both&lt;br /&gt;input connected 2) NOR  both input connected 3) NAND with one input&lt;br /&gt;at VDD  4) nor with one input at GND&lt;br /&gt;4) question on microprocessor&lt;br /&gt;6) question on DMA&lt;br /&gt;7) Network simple question on charge sharing&lt;br /&gt;8) Implement following statement with logic gates  if(a==b) {y=p} else{y=q}&lt;br /&gt;9) One complicated ckt with two inputs and one output and VDD and&lt;br /&gt;no GND and is XNOR.&lt;br /&gt;10) Current mirror simple question current is I2 = 2I1 answer.&lt;br /&gt;11) NAND and NOR equivalent to the inverter with same rise and&lt;br /&gt;fall time.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;1) Layout routing&lt;br /&gt;2) Capacitance from layout&lt;br /&gt;3) Fringing and area capacitance calculation&lt;br /&gt;4) Sheet resistance is given u have to calculate total resistance.&lt;br /&gt;5) Microprocessor question with 3-stage pipeline instruction.&lt;br /&gt;Easy question&lt;br /&gt;6) Simple circuit with glitch in that how to remove it and draw&lt;br /&gt;the waveforms. K map has given.&lt;br /&gt;7) Implemet ckt with AND/OR/INV .&lt;/pre&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114562096041475176?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114562096041475176/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114562096041475176' title='4 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114562096041475176'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114562096041475176'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/analog-devices-placement-paper-i.html' title='Analog Devices :: Placement Paper - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>4</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114550565759664624</id><published>2006-04-20T09:30:00.000+05:30</published><updated>2006-04-20T09:30:57.596+05:30</updated><title type='text'>Questions on Design Patterns</title><content type='html'>&lt;h2&gt; Object Oriented Programming Concepts &lt;/h2&gt; &lt;ul&gt;&lt;li&gt; Generally, which is the stronger relationship, containment or composition? &lt;/li&gt;&lt;li&gt; What is coupling? &lt;/li&gt;&lt;li&gt; What is "cohesion and coupling"? &lt;/li&gt;&lt;li&gt; What is abstract coupling? &lt;/li&gt;&lt;li&gt; What is Parmetric polymorphism? &lt;/li&gt;&lt;li&gt; Why will you need multiple inheritence? &lt;/li&gt;&lt;li&gt; What is the &lt;i&gt; Liskov's Substitution Principle&lt;/i&gt;? &lt;/li&gt;&lt;li&gt; Describe these design methodologies: Booch, OMT, Use cases. &lt;/li&gt;&lt;li&gt; Differentiate between subtyping and subclassing. &lt;/li&gt;&lt;/ul&gt; &lt;div class="editsection" style="float: right; margin-left: 5px;"&gt;&lt;br /&gt;&lt;/div&gt;&lt;a name="Design_Patterns"&gt;&lt;/a&gt;&lt;h2&gt; Design Patterns &lt;/h2&gt; &lt;ul&gt;&lt;li&gt; What does Design mean to you? (Factor 5) &lt;/li&gt;&lt;li&gt; What is Pimpl and what is it used for? &lt;/li&gt;&lt;li&gt; What is an adapter? Is it different from a wrapper? &lt;/li&gt;&lt;/ul&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114550565759664624?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114550565759664624/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114550565759664624' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114550565759664624'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114550565759664624'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/questions-on-design-patterns.html' title='Questions on Design Patterns'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114546750690815468</id><published>2006-04-19T22:36:00.000+05:30</published><updated>2006-12-11T20:52:14.746+05:30</updated><title type='text'>Mentor Graphics :: Placement Papers</title><content type='html'>&lt;span style="color: rgb(153, 102, 51); font-weight: bold;"&gt;C/C++&lt;/span&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;Grade ur knowledge in c and c++ from 0 to 100&lt;/li&gt;&lt;li&gt;What is virtuval distrcuctor.&lt;/li&gt;&lt;li&gt;Are there any default concstructors in c++? what are they?&lt;/li&gt;&lt;li&gt;What is the difference between copy constructor and Overkloading =. Why language is provided two of these?&lt;/li&gt;&lt;li&gt;What are inline functions, what is  the difference between #define  and inline&lt;/li&gt;&lt;li&gt;What is the difference between inline and normal function. will the compiler take inline functions always inline ,if not on which basis it will decide to ignore inline.&lt;/li&gt;&lt;li&gt;Prog which illustrates difference between extern and static&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Virtual and Friend Function in C++&lt;/li&gt;&lt;li&gt;The sequence in which constructors of classes A, B and C are called when class A is inherited from class B which is inherited from class C.&lt;/li&gt;&lt;li&gt;Steps in the compilation of a C program. or steps in preprocessing in sequence.&lt;/li&gt;&lt;li&gt;Differences between a reference and a pointer in C++.&lt;/li&gt;&lt;li&gt;Differences between typedef and #define&lt;/li&gt;&lt;li&gt; If we have a union with three variables int i, char c, float f; and we store a value in say the variable c now. and we forget what is the variable of the union that holds a value currently,&lt;br /&gt;after some time. for this is there any mechanism provided by the language  using which we can find out whether it is i or c or f that currently holds a value.&lt;/li&gt;&lt;li&gt;padding bytes for structures: suppose there is structure struct x{int x, char c}; and the compiler is a four byte compiler. then what is memory allocated to variable of this struct type. if the structure definition is struct y{char x; int y;}; then what is the memory allocated for a variableof this type.&lt;/li&gt;&lt;li&gt;Prototype definition of the printf() function.&lt;/li&gt;&lt;li&gt;How do you dynamically allocate a two dimensional array of size a by b.&lt;br /&gt;ans: int **x;&lt;br /&gt;x = (int**)malloc(sizeof(int*)*a);&lt;br /&gt;for(int i=0;i&lt;a;i++) i="(int*)malloc(sizeof(int)*b);&lt;/li"&gt;&lt;/a;i++)&gt;&lt;/li&gt;&lt;li&gt;Then what if it is assigned as: int *y = (int*)x;&lt;/li&gt;&lt;li&gt;Questions on declarations of function pointers in C.&lt;/li&gt;&lt;li&gt;Differences between Java and C++.&lt;/li&gt;&lt;li&gt;Inorder, preorder, and post order traversals.&lt;/li&gt;&lt;li&gt;how do you find out if a loop(cycle) exists in a linked list,efficiently&lt;/li&gt;&lt;li&gt;name the oo concepts.&lt;br /&gt;&lt;/li&gt;&lt;/ol&gt;&lt;span style="color: rgb(153, 102, 51); font-weight: bold;"&gt;OS/Compiler/AI/Networking&lt;/span&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;What is the light weight process ?&lt;/li&gt;&lt;li&gt;Why thread is lightweight?&lt;/li&gt;&lt;li&gt;What is the best Scheduling algo that will give best throughput?&lt;/li&gt;&lt;li&gt;Semaphores and mutexes.&lt;/li&gt;&lt;li&gt;What is that we can't do with boolean variables that can be done with semaphores?&lt;/li&gt;&lt;li&gt;Question about UNIX file system.&lt;/li&gt;&lt;li&gt;Inode number 0 corresponds to what?&lt;/li&gt;&lt;li&gt;Name few compiler optimizations (little more about compiler optimizations)&lt;/li&gt;&lt;li&gt;What is LALR parser.&lt;/li&gt;&lt;li&gt;What is hill climbing?&lt;/li&gt;&lt;li&gt;What is simulated annealing?&lt;/li&gt;&lt;li&gt;What is piggybacking?&lt;/li&gt;&lt;li&gt;Tell some differences between congestion control and flow control?&lt;/li&gt;&lt;li&gt;Theory of computations&lt;br /&gt;1) about various complexity classes;&lt;br /&gt;2). NP-hard  and NP-copmleteness,&lt;br /&gt;examples;&lt;br /&gt;3). what is universal Turing machine?&lt;/li&gt;&lt;/ol&gt;&lt;span style="color: rgb(153, 102, 51); font-weight: bold;"&gt;Aptitude&lt;/span&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;There are 100 gates with doors ( 1.... 100).Intially they are open. Switching the gates ( if open then close , if closed then open ) can be done. First they will switch the multiples of 1's then they will switch the multiple's of 2's and soooo on multiple's of 100's. Now, at the end how many doors are closed and what are they?&lt;/li&gt;&lt;li&gt;10 58 ____  Ans: 3^n+7^n --&gt; 3^3+7^3&lt;br /&gt;Ans: ( 1,4,9,16,25,36,49,64,81,100)&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114546750690815468?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114546750690815468/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114546750690815468' title='3 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114546750690815468'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114546750690815468'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/mentor-graphics-placement-papers.html' title='Mentor Graphics :: Placement Papers'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>3</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114528736143212819</id><published>2006-04-17T20:18:00.000+05:30</published><updated>2006-04-17T20:52:41.513+05:30</updated><title type='text'>Cadence :: Placement Paper - II</title><content type='html'>&lt;ol&gt;&lt;li&gt;&lt;pre&gt;#include&lt;stdio.h&gt;&lt;br /&gt;#include&lt;conio.h&gt;&lt;br /&gt;int main()&lt;br /&gt;{&lt;br /&gt;  int p,q;&lt;br /&gt;  clrscr();&lt;br /&gt;  p=5&lt;br /&gt;  -&lt;br /&gt;  -&lt;br /&gt; -&lt;br /&gt;     -&lt;br /&gt;     3*&lt;br /&gt;     6;&lt;br /&gt;   printf("%d \n",p);&lt;br /&gt;}&lt;br /&gt;#include&lt;stdio.h&gt;&lt;br /&gt;#include&lt;conio.h&gt;&lt;br /&gt;int main()&lt;br /&gt;{&lt;br /&gt;  int p,q;&lt;br /&gt;  clrscr();&lt;br /&gt;  p=5&lt;br /&gt;  +&lt;br /&gt;  +&lt;br /&gt;  +&lt;br /&gt;  +&lt;br /&gt;  3*&lt;br /&gt;  6;&lt;br /&gt;   printf("%d \n",p);&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;ans : 23 23&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;postfix expression was given&lt;br /&gt;622+-382/*+2^3+&lt;br /&gt;solve it&lt;br /&gt;&lt;br /&gt;ans : 199&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;A tree was given , find the postorder&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;what do you mean by operator overloading&lt;br /&gt;ans : assigning user defined meaning to an existing operator&lt;br /&gt;     by an operator function&lt;br /&gt;&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;     ___________________________________________________&lt;br /&gt;___|___       ___|___              ___|___             |&lt;br /&gt;|       |     |       |            |       |            |&lt;br /&gt;|       |__   |       |___         |       |___         |&lt;br /&gt;|_______|  |  |_______|   |______  |_______|   |        |&lt;br /&gt;          not                   |             |        |&lt;br /&gt;          |_____________________|_____________|____and_|___&lt;br /&gt;&lt;br /&gt;ans : modulo 6 counter&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;1001000  is the initial state of ring counter after how many clock&lt;br /&gt;pulses initial state is again achieved.&lt;br /&gt;&lt;br /&gt;ans.  7&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;minm. no. of flip flop required for mod 33&lt;br /&gt;ans.  6&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;a no. is given in base 21 which is the extension of hex. i.e.&lt;br /&gt;10,11,12......20&lt;br /&gt; A, B, C,......K&lt;br /&gt;WHAT IS the value of KA in octal&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;DMA IS:&lt;br /&gt;ans. i/o to memory without intereferene of cpu&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;no. of 0's in 15*1024+7*32+3&lt;br /&gt;ans.  5&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;A man while going dowm in a escalator(which is moving down) takes&lt;br /&gt;50&lt;br /&gt;steps to reach down and while going up takes 125 steps. If he goes 5&lt;br /&gt;times&lt;br /&gt;faster upwards than downwards. What will be the total no of steps if&lt;br /&gt;the&lt;br /&gt;escalator werent moving.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;2/3 of corckery(plates) are broken, 1/2 have someother thing&lt;br /&gt;(handle)&lt;br /&gt;broken , 1/4 are both broken and handle broken. Ultimately only 2&lt;br /&gt;pieces&lt;br /&gt;of corckery were without any defect. How many crockery were there in&lt;br /&gt;total.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;odd one out&lt;br /&gt; a) person&lt;br /&gt; b) time&lt;br /&gt; c) object&lt;br /&gt; d) reason            ans : d) reason&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;a) owc&lt;br /&gt;b)hepes&lt;br /&gt;c)roseh&lt;br /&gt;d)gunenip&lt;br /&gt;&lt;br /&gt;ans : d)penguin&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;insert three letter words so that it makes 2 words&lt;br /&gt;ring(_ _ _)ter&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;Insert 4 letter word that has exact meaning as given outside the&lt;br /&gt;bracket&lt;br /&gt;WILLING (_ _ _ _)SPORT &lt;/pre&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114528736143212819?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114528736143212819/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114528736143212819' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114528736143212819'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114528736143212819'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/cadence-placement-paper-ii.html' title='Cadence :: Placement Paper - II'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114519475357996674</id><published>2006-04-16T19:06:00.001+05:30</published><updated>2006-04-16T19:09:13.583+05:30</updated><title type='text'>Microsoft :: Interview Questions - II</title><content type='html'>Here are soem Microsoft Interview Questions form &lt;a href="http://alien.dowling.edu/%7Erohit/wiki/index.php/Microsoft_Interview_Questions"&gt;http://alien.dowling.edu/%7Erohit/wiki/index.php/Microsoft_Interview_Questions&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;li&gt; If you had an infinite supply of water and a 5 quart and 3 quart pail, how would you measure exactly 4 quarts? &lt;/li&gt;&lt;li&gt; If you are on a boat and you throw out a suitcase, will the level of water increase? &lt;/li&gt;&lt;li&gt; On an average, how many times would you have to open the Seattle phone book to find a specific name? &lt;/li&gt;&lt;li&gt; There are 3 ants at 3 corners of a triangle, they randomly start moving towards another corner. What is the probability that they don't collide? &lt;/li&gt;&lt;li&gt; If you look at a clock and the time is 3:15, what is the angle between the hour and the minute hands? ( The answer to this is not zero!) &lt;/li&gt;&lt;li&gt; What new feature would you add to MSWORD if you were hired? &lt;/li&gt;&lt;li&gt; Why did you pick the school you graduated from? &lt;/li&gt;&lt;li&gt; Why do you want to work for Microsoft? &lt;/li&gt;&lt;li&gt; How many Gas stations are there in the US? &lt;/li&gt;&lt;li&gt; How would you weigh a plane without using scales? &lt;/li&gt;&lt;li&gt; How would you move Mt. Everest? &lt;/li&gt;&lt;li&gt; Two math graduates bump into each other at Fairway on the upper west side. They hadn't seen each other in over 20 years. The first grad says to the second: "how have you been?" Second: "Great! I got married and I have three daughters now" First: "Really? how old are they?" Second: "Well, the product of their ages is 72, and the sum of their ages is the same as the number on that building over there.." First: "Right, ok.. oh wait.. hmmmm.., I still don't know" second: "Oh sorry, the oldest one just started to play the piano" First: "Wonderful! my oldest is the same age!" Problem: How old are the daughters? &lt;/li&gt;&lt;/ul&gt;  &lt;ul&gt;&lt;li&gt; Why are beer cans tapered at the top and bottom? &lt;/li&gt;&lt;li&gt; Why is it that hot water in a hotel comes out instantly but at home it takes time? &lt;/li&gt;&lt;li&gt; How many times a day a clock's hands overlap? &lt;/li&gt;&lt;li&gt; Mike has $20 more than Todd. How much does each have given that combined they have $21 between them. You can't use fractions in the answer.(Hint: This is a trick question, pay close attention to the condition) &lt;/li&gt;&lt;li&gt; There are four dogs, each at the counter of a large square. Each of the dogs begins chasing the dog clockwise from it. All of the dogs run at the same spd. All continously adjust their direction so that they are always heading straight towards their clockwise neighbor. How long does it take for the dogs to catch each other? Where does this happen? (Hint: Dog's are moving in a symmetrical fashion, not along the edges of the square). &lt;/li&gt;&lt;/ul&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114519475357996674?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114519475357996674/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114519475357996674' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114519475357996674'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114519475357996674'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/microsoft-interview-questions-ii.html' title='Microsoft :: Interview Questions - II'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114519474831113499</id><published>2006-04-16T19:06:00.000+05:30</published><updated>2006-04-16T19:09:08.326+05:30</updated><title type='text'>Microsoft :: Interview Questions - I</title><content type='html'>Here are soem Microsoft Interview Questions form &lt;a href="http://alien.dowling.edu/%7Erohit/wiki/index.php/Microsoft_Interview_Questions"&gt;http://alien.dowling.edu/%7Erohit/wiki/index.php/Microsoft_Interview_Questions&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;li&gt; If you had an infinite supply of water and a 5 quart and 3 quart pail, how would you measure exactly 4 quarts? &lt;/li&gt;&lt;li&gt; If you are on a boat and you throw out a suitcase, will the level of water increase? &lt;/li&gt;&lt;li&gt; On an average, how many times would you have to open the Seattle phone book to find a specific name? &lt;/li&gt;&lt;li&gt; There are 3 ants at 3 corners of a triangle, they randomly start moving towards another corner. What is the probability that they don't collide? &lt;/li&gt;&lt;li&gt; If you look at a clock and the time is 3:15, what is the angle between the hour and the minute hands? ( The answer to this is not zero!) &lt;/li&gt;&lt;li&gt; What new feature would you add to MSWORD if you were hired? &lt;/li&gt;&lt;li&gt; Why did you pick the school you graduated from? &lt;/li&gt;&lt;li&gt; Why do you want to work for Microsoft? &lt;/li&gt;&lt;li&gt; How many Gas stations are there in the US? &lt;/li&gt;&lt;li&gt; How would you weigh a plane without using scales? &lt;/li&gt;&lt;li&gt; How would you move Mt. Everest? &lt;/li&gt;&lt;li&gt; Two math graduates bump into each other at Fairway on the upper west side. They hadn't seen each other in over 20 years. The first grad says to the second: "how have you been?" Second: "Great! I got married and I have three daughters now" First: "Really? how old are they?" Second: "Well, the product of their ages is 72, and the sum of their ages is the same as the number on that building over there.." First: "Right, ok.. oh wait.. hmmmm.., I still don't know" second: "Oh sorry, the oldest one just started to play the piano" First: "Wonderful! my oldest is the same age!" Problem: How old are the daughters? &lt;/li&gt;&lt;/ul&gt;  &lt;ul&gt;&lt;li&gt; Why are beer cans tapered at the top and bottom? &lt;/li&gt;&lt;li&gt; Why is it that hot water in a hotel comes out instantly but at home it takes time? &lt;/li&gt;&lt;li&gt; How many times a day a clock's hands overlap? &lt;/li&gt;&lt;li&gt; Mike has $20 more than Todd. How much does each have given that combined they have $21 between them. You can't use fractions in the answer.(Hint: This is a trick question, pay close attention to the condition) &lt;/li&gt;&lt;li&gt; There are four dogs, each at the counter of a large square. Each of the dogs begins chasing the dog clockwise from it. All of the dogs run at the same spd. All continously adjust their direction so that they are always heading straight towards their clockwise neighbor. How long does it take for the dogs to catch each other? Where does this happen? (Hint: Dog's are moving in a symmetrical fashion, not along the edges of the square). &lt;/li&gt;&lt;/ul&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114519474831113499?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114519474831113499/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114519474831113499' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114519474831113499'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114519474831113499'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/microsoft-interview-questions-i.html' title='Microsoft :: Interview Questions - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114506828461879699</id><published>2006-04-15T07:47:00.000+05:30</published><updated>2006-04-15T08:01:24.643+05:30</updated><title type='text'>Google :: Placement Paper - I</title><content type='html'>&lt;ol&gt;&lt;li&gt; Given a number, describe an algorithm to find the next number which is prime.&lt;/li&gt;&lt;li&gt; There are 8 stones which are similar except one which is heavier than the others. To find it, you are given a pan balance. What is the minimal number of weighing needed to find out the heaviest stone ?&lt;/li&gt;&lt;li&gt; There are a set of 'n' integers. Describe an algorithm to find for each of all its subsets of &lt;i&gt;n-1&lt;/i&gt; integers the product of its integers. For example, let consider (6, 3, 1, 2). We need to find these products :  &lt;/li&gt;&lt;ul&gt;&lt;li&gt; 6 * 3 * 1 = 18 &lt;/li&gt;&lt;li&gt; 6 * 3 * 2 = 36 &lt;/li&gt;&lt;li&gt; 3 * 1 * 2 = 6 &lt;/li&gt;&lt;li&gt; 6 * 1 * 2 = 12&lt;/li&gt;&lt;/ul&gt;&lt;li&gt;&lt;pre&gt;&lt;span style="font-size:85%;"&gt;&lt;span style="font-size:85%;"&gt;Given two sorted postive integer arrays A[n] and B[n] (W.L.O.G, let's&lt;br /&gt;say they are decreasingly sorted), we define a set S = {(a,b) | a \in A&lt;br /&gt;and b \in B}. Obviously there are n^2 elements in S. The value of such&lt;br /&gt;a pair is defined as Val(a,b) = a + b. Now we want to get the n pairs&lt;br /&gt;from S with largest values. The tricky part is that we need an O(n)&lt;br /&gt;algorithm. &lt;/span&gt;&lt;/span&gt;&lt;br /&gt;&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;Solve this cryptic equation, realizing of course that values for M          and E could be interchanged. No leading zeros are allowed.        &lt;p&gt;WWWDOT - GOOGLE = DOTCOM &lt;/p&gt;&lt;/li&gt;&lt;li&gt;Write a haiku describing possible methods for predicting search traffic          seasonality&lt;/li&gt;&lt;li&gt;1&lt;br /&gt;        1 1&lt;br /&gt;        2 1&lt;br /&gt;        1 2 1 1&lt;br /&gt;        1 1 1 2 2 1&lt;br /&gt;        What's the next line?        &lt;p&gt;312211. This is the "look and say" sequence in which each term          after the first describes the previous term: one 1 (11); two 1s (21);          one 2 and one 1 (1211); one 1, one 2, and two 1's (111221); and so on.          See the look and say sequence entry on MathWorld for a complete write-up          and the algebraic form of a fascinating related quantity known as Conway's          constant. &lt;/p&gt;&lt;/li&gt;&lt;li&gt;You are in a maze of twisty little passages, all alike. There is a          dusty laptop here with a weak wireless connection. There are dull, lifeless          gnomes strolling around. What dost thou do?        &lt;p&gt;A) Wander aimlessly, bumping into obstacles until you are eaten by a          grue.&lt;br /&gt;        B) Use the laptop as a digging device to tunnel to the next level.&lt;br /&gt;        C) Play MPoRPG until the battery dies along with your hopes.&lt;br /&gt;        D) Use the computer to map the nodes of the maze and discover an exit          path.&lt;br /&gt;        E) Email your resume to Google, tell the lead gnome you quit and find          yourself in whole different world [sic]. &lt;/p&gt;       &lt;p&gt;In general, make a state diagram . However, this method would not work          in certain pathological cases such as, say, a fractal maze. For an example          of this and commentary, see Ed Pegg's column about state diagrams and          mazes . &lt;/p&gt;&lt;/li&gt;&lt;li&gt;What's broken with Unix?        &lt;p&gt;Their reproductive capabilities. &lt;/p&gt;       &lt;p&gt;How would you fix it? &lt;/p&gt;&lt;/li&gt;&lt;li&gt;On your first day at Google, you discover that your cubicle mate wrote          the textbook you used as a primary resource in your first year of graduate          school. Do you:        &lt;p&gt;A) Fawn obsequiously and ask if you can have an autograph.&lt;br /&gt;        B) Sit perfectly still and use only soft keystrokes to avoid disturbing          her concentration&lt;br /&gt;        C) Leave her daily offerings of granola and English toffee from the food          bins.&lt;br /&gt;        D) Quote your favorite formula from the textbook and explain how it's          now your mantra.&lt;br /&gt;        E) Show her how example 17b could have been solved with 34 fewer lines          of code. &lt;/p&gt;&lt;/li&gt;&lt;li&gt;Which of the following expresses Google's over-arching philosophy?       &lt;p&gt;A) "I'm feeling lucky"&lt;br /&gt;        B) "Don't be evil"&lt;br /&gt;        C) "Oh, I already fixed that"&lt;br /&gt;        D) "You should never be more than 50 feet from food"&lt;br /&gt;        E) All of the above &lt;/p&gt;&lt;/li&gt;&lt;li&gt;How many different ways can you color an icosahedron with one of three          colors on each face?&lt;/li&gt;&lt;li&gt;On an infinite, two-dimensional, rectangular lattice of 1-ohm resistors,          what is the resistance between two nodes that are a knight's move away&lt;/li&gt;&lt;li&gt; In your opinion, what is the most beautiful math equation ever derived?               &lt;p&gt;There are obviously many candidates. The following list gives ten of          the authors' favorites: &lt;/p&gt;       &lt;p&gt;1. Archimedes' recurrence formula : , , ,&lt;br /&gt;        2. Euler formula :&lt;br /&gt;        3. Euler-Mascheroni constant :&lt;br /&gt;        4. Riemann hypothesis: and implies&lt;br /&gt;        5. Gaussian integral :&lt;br /&gt;        6. Ramanujan's prime product formula:&lt;br /&gt;        7. Zeta-regularized product :&lt;br /&gt;        8. Mandelbrot set recursion:&lt;br /&gt;        9. BBP formula :&lt;br /&gt;        10. Cauchy integral formula: &lt;/p&gt;&lt;/li&gt;&lt;li&gt;Which of the following is NOT an actual interest group formed by          Google employees?       &lt;p&gt;A. Women's basketball&lt;br /&gt;        B. Buffy fans&lt;br /&gt;        C. Cricketeers&lt;br /&gt;        D. Nobel winners&lt;br /&gt;        E. Wine club &lt;/p&gt;&lt;/li&gt;&lt;li&gt;What will be the next great improvement in search technology?&lt;/li&gt;&lt;li&gt;What is the optimal size of a project team, above which additional          members do not contribute productivity equivalent to the percentage increase          in the staff size?        &lt;p&gt;A) 1&lt;br /&gt;        B) 3&lt;br /&gt;        C) 5&lt;br /&gt;        D) 11&lt;br /&gt;        E) 24 &lt;/p&gt;&lt;/li&gt;&lt;li&gt;Given a triangle ABC, how would you use only a compass and straight          edge to find a point P such that triangles ABP, ACP and BCP have equal          perimeters? (Assume that ABC is constructed so that a solution does exist.)          &lt;/li&gt;&lt;li&gt;Consider a function which, for a given whole number n, returns the          number of ones required when writing out all numbers between 0 and n.          For example, f(13)=6. Notice that f(1)=1. What is the next largest n such          that f(n)=n?&lt;/li&gt;&lt;li&gt;What is the coolest hack you've ever written?&lt;/li&gt;&lt;li&gt;What number comes next in the sequence: 10, 9, 60, 90, 70, 66, ?       &lt;p&gt;A) 96&lt;br /&gt;        B) 1000000000000000000000000000000000        0000000000000000000000000000000000        000000000000000000000000000000000&lt;br /&gt;        C) Either of the above&lt;br /&gt;        D) None of the above &lt;/p&gt;&lt;/li&gt;&lt;li&gt;In 29 words or fewer, describe what you would strive to accomplish          if you worked at Google Labs.&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114506828461879699?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114506828461879699/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114506828461879699' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114506828461879699'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114506828461879699'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/google-placement-paper-i.html' title='Google :: Placement Paper - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114501981979576781</id><published>2006-04-14T18:29:00.000+05:30</published><updated>2006-04-14T18:33:39.816+05:30</updated><title type='text'>Questions On C# - I</title><content type='html'>&lt;h2&gt; General C# Questions &lt;/h2&gt; &lt;ul&gt;&lt;li&gt; Does C# support multiple-inheritance? &lt;/li&gt;&lt;li&gt; Who is a protected class-level variable available to?     &lt;/li&gt;&lt;li&gt; Are private class-level variables inherited?   &lt;/li&gt;&lt;li&gt; Describe the accessibility modifier “protected internal”.     &lt;/li&gt;&lt;li&gt; What’s the top ._NET class that everything is derived from?       &lt;/li&gt;&lt;li&gt; What does the term immutable mean?        &lt;/li&gt;&lt;li&gt; What’s the difference between System.String and System.Text.StringBuilder classes? &lt;/li&gt;&lt;li&gt; What’s the advantage of using System.Text.StringBuilder over System.String? &lt;/li&gt;&lt;li&gt; Can you store multiple data types in System.Array? &lt;/li&gt;&lt;li&gt; What’s the difference between the System.Array.CopyTo() and System.Array.Clone()? &lt;/li&gt;&lt;li&gt; How can you sort the elements of the array in descending order? &lt;/li&gt;&lt;li&gt; What’s the ._NET collection class that allows an element to be accessed using a unique key?        &lt;/li&gt;&lt;li&gt; What class is underneath the SortedList class?        &lt;/li&gt;&lt;li&gt; Will the finally block get executed if an exception has not occurred? &lt;/li&gt;&lt;li&gt; What’s the C# syntax to catch any possible exception?       &lt;/li&gt;&lt;li&gt; Can multiple catch blocks be executed for a single try statement?        &lt;/li&gt;&lt;li&gt; Explain the three services model commonly know as a three-tier application. &lt;/li&gt;&lt;/ul&gt; &lt;a name="C.23_OOP"&gt;&lt;/a&gt;&lt;h2&gt; C# OOP &lt;/h2&gt; &lt;ul&gt;&lt;li&gt; What is the syntax to inherit from a class in C#?  &lt;/li&gt;&lt;li&gt; Can you prevent your class from being inherited by another class? &lt;/li&gt;&lt;li&gt; Can you allow a class to be inherited, but prevent the method from being over-ridden?  &lt;/li&gt;&lt;li&gt; What’s an abstract class?  &lt;/li&gt;&lt;li&gt; When do you absolutely have to declare a class as abstract? &lt;/li&gt;&lt;li&gt; What is an interface class?  &lt;/li&gt;&lt;li&gt; Why can’t you specify the accessibility modifier for methods inside the interface? &lt;/li&gt;&lt;li&gt; Can you inherit multiple interfaces?  &lt;/li&gt;&lt;li&gt; What happens if you inherit multiple interfaces and they have conflicting method names? &lt;/li&gt;&lt;li&gt; What’s the difference between an interface and abstract class? &lt;/li&gt;&lt;li&gt; What is the difference between a Struct and a Class? &lt;/li&gt;&lt;/ul&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114501981979576781?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114501981979576781/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114501981979576781' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114501981979576781'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114501981979576781'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/questions-on-c-i.html' title='Questions On C# - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114494277374569409</id><published>2006-04-13T20:58:00.000+05:30</published><updated>2006-04-13T21:13:43.166+05:30</updated><title type='text'>Cadence :: Placement Paper - I</title><content type='html'>&lt;ol&gt;&lt;li&gt;Inorder and preorder trees (expressions) are given and postorder tree (expression) is to be found out&lt;/li&gt;&lt;li&gt;&lt;pre&gt;int v,u;&lt;br /&gt; while(v != 0)&lt;br /&gt;{&lt;br /&gt;  t = v % u;&lt;br /&gt;  v = u;&lt;br /&gt;u = t;&lt;br /&gt;}&lt;br /&gt;find the time complexity of the above program.&lt;br /&gt;&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;x is passed by reference, y passed by value.&lt;br /&gt;x = 3, y = 2;&lt;br /&gt;foo(x, y)&lt;br /&gt;var integer x, y;&lt;br /&gt;{&lt;br /&gt; x = x + 2;&lt;br /&gt; y = y + 3;&lt;br /&gt;}&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;x = 5;&lt;br /&gt;y = 5;&lt;br /&gt;foo(x, y);&lt;br /&gt;print (x, y);&lt;br /&gt;}&lt;br /&gt;output of the above pseudo code.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;how many flip flops you require for modulo 19 counter.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;ring counter's initial state is 01000. after how many clock cylces will&lt;br /&gt;it return to the initial state.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;given 6 bit mantissa in 2s complement form and 4 bit exponent is in&lt;br /&gt;excess-4 form in a floating point representation, find the number&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;A signed no is stored in 10-bit register, what is the max and min&lt;br /&gt;possible value of the number.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;A room is 30 X 12 X 12. a spider is ont the middle of the samller&lt;br /&gt;wall, 1 feet from the top, and a fly is ont he middle of the opposite wall&lt;br /&gt;1 feet from the bottom. what is the min distance reqd for the spider to&lt;br /&gt;crawl to the fly.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;A man while going dowm in a escalator(which is miving down) takes 50&lt;br /&gt;steps to reach down and while going up takes 125 steps. If he goes 5 times&lt;br /&gt;faster upwards than downwards. What will be the total no of steps if the&lt;br /&gt;escalator werent moving.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;2/3 of corckery(plates) are broken, 1/2 have someother thing(handle)&lt;br /&gt;broken , 1/4 are both broken and handle broken. Ultimately only 2 pieces&lt;br /&gt;of corckery were without any defect. How many crockery were there in&lt;br /&gt;total.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;     ___________________________________________________&lt;br /&gt;___|___       ___|___              ___|___             |&lt;br /&gt;|       |     |       |            |       |            |&lt;br /&gt;|       |__   |       |___         |       |___         |&lt;br /&gt;|_______|  |  |_______|   |__not_  |_______|   |        |&lt;br /&gt;         |                     |             |        |&lt;br /&gt;         |_____________________|_____________|____and_|___&lt;br /&gt;&lt;br /&gt;boxes are negative edge triggered flip flops and 'not' and 'and' are&lt;br /&gt;gates. What is this figure.&lt;br /&gt;ans-  modulo-5&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;There is six letter word VGANDA . How many ways you can arrange the&lt;br /&gt; letters in the word in such a way that both the A's are together.&lt;br /&gt;  Ans : 120    (5x4!)&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;If two cards are taken one after another without replacing from&lt;br /&gt;   a pack of 52 cards what is the probability  for the two cards be&lt;br /&gt;      queen.&lt;br /&gt;&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;51 x 53 x ... x 59 ; symbols ! - factorial&lt;br /&gt;                           ^ - power of 2&lt;br /&gt;(a) 99!/49! (b)  (c)   (d) (99! x 25!)/(2^24 x 49! x 51!)&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;The ratio fo Boys to Girls is 6:4. 60% of the boys and 40% of girls&lt;br /&gt;  take lunch in the canteen. What % of class takes lunch in canteen.&lt;br /&gt;      Ans : 52%    (60/100)*60 + (40/100)*40&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;Zulus always speak truth and  Hutus always speak lies. There are&lt;br /&gt;three persons A,B&amp;C. A met B and says " I am a Zulu or I am Hutu".&lt;br /&gt;We don't know what exactly he said. then B meets C and says to c&lt;br /&gt;that " A is a Zulu ". Then C replied " No, A is a Hutu ".&lt;br /&gt;&lt;br /&gt;1. How many Zulus are there ?&lt;br /&gt;2. Who must be a Zulu ? &lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;What is&lt;br /&gt;  int *p(char (*s)[])&lt;br /&gt;  Ans : p is a function which is returning a pointer to integer&lt;br /&gt;  which takes arguments as pointer to array of characters.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;what is the o/p&lt;br /&gt;  printf(" Hello \o is the world ");&lt;br /&gt; Ans : Hello is the world.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;Find the prototype of sine function.&lt;br /&gt;  Ans : extern double sin(double)&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;i=2&lt;br /&gt;  printf("%old %old %old %old ",i, i++,i--,i++);&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;what is the value of 'i'?&lt;br /&gt; i=strlen("Blue")+strlen("People")/strlen("Red")-strlen("green")&lt;br /&gt; Ans : 1&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;what does exit() do?&lt;br /&gt; Ans : come out of executing programme.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;what does " calloc" do?&lt;br /&gt;  Ans :  A memory allocation and initialising to zero.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;what does find command do ? Ans : search a file&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;Which of following is used for back-up files?&lt;br /&gt;  (a) compress (b) Tar (c) make (d) all the above  Ans : b&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;What does chmod 654 stand for.&lt;br /&gt;&lt;br /&gt; Ans : _rw_r_xr__&lt;/pre&gt;&lt;/li&gt;&lt;/ol&gt;&lt;br /&gt;&lt;pre&gt;&lt;br /&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114494277374569409?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114494277374569409/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114494277374569409' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114494277374569409'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114494277374569409'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/cadence-placement-paper-i.html' title='Cadence :: Placement Paper - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114494191393294961</id><published>2006-04-13T20:48:00.000+05:30</published><updated>2006-04-13T20:55:13.946+05:30</updated><title type='text'>ECE Checklist</title><content type='html'>Usually it is usefull to prepare a checklist at the beggining phase of preparation for JOB. It helps by reducing the chance of missing some important topic. Here is a sample checklist for a guy preparing for ECE related JOB.&lt;br /&gt;&lt;br /&gt;Basic EE&lt;br /&gt;&lt;ul&gt;&lt;li&gt;Basic circuit analysis&lt;/li&gt;&lt;li&gt;Kirchov’s laws, Thevenin and Norton equivalents&lt;/li&gt;&lt;li&gt;IV characteristics of circuit elements (R, L, C, diodes, etc.)&lt;/li&gt;&lt;li&gt;Transient response of basic circuits, RC delays&lt;/li&gt;&lt;li&gt;Intuitive operation of PN junctions and MOSFETs&lt;/li&gt;&lt;li&gt;Circuits with opamps&lt;/li&gt;&lt;li&gt;Transmission lines&lt;/li&gt;&lt;li&gt;Power dissipation&lt;/li&gt;&lt;/ul&gt;VLSI&lt;br /&gt;&lt;ul&gt;&lt;li&gt;CMOS gates, complex gates, Latch and FF design&lt;/li&gt;&lt;li&gt;Regions of operation of a MOSFET, IV characteristics in different regions, transistor IV curves&lt;/li&gt;&lt;li&gt;Transistor cross-sections&lt;/li&gt;&lt;li&gt;Charge storage and how it impacts certain circuits&lt;/li&gt;&lt;li&gt;Capacitive coupling&lt;/li&gt;&lt;li&gt;Dynamic logic&lt;/li&gt;&lt;li&gt;Sources of capacitive load, capacitances between terminals of a MOSFET&lt;/li&gt;&lt;li&gt;Various kinds of inverters, switching delay, gain, wire delays&lt;/li&gt;&lt;li&gt;Transistor sizing&lt;/li&gt;&lt;/ul&gt;Logic / Architecture&lt;br /&gt;&lt;ul&gt;&lt;li&gt;Boolean logic Minimization&lt;/li&gt;&lt;li&gt;State machine design&lt;/li&gt;&lt;li&gt;Synchronous circuit timing, races, testability&lt;/li&gt;&lt;li&gt;Pipelines and hazards&lt;/li&gt;&lt;li&gt;Processor block diagrams, Cache architecture&lt;/li&gt;&lt;li&gt;Microarchitecture techniques &lt;/li&gt;&lt;/ul&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114494191393294961?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114494191393294961/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114494191393294961' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114494191393294961'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114494191393294961'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/ece-checklist.html' title='ECE Checklist'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114481674121248018</id><published>2006-04-12T09:59:00.000+05:30</published><updated>2006-09-16T02:34:08.676+05:30</updated><title type='text'>STM Question Paper - II</title><content type='html'>&lt;a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="http://photos1.blogger.com/blogger/1078/291/1600/ST_nbsp_Paper_20_08.jpg"&gt;&lt;img style="margin: 0px auto 10px; display: block; text-align: center; cursor: pointer;" src="http://photos1.blogger.com/blogger/1078/291/320/ST_nbsp_Paper_20_08.jpg" alt="" border="0" /&gt;&lt;/a&gt;&lt;span style="font-weight: bold; color: rgb(204, 102, 0);"&gt;Some More Questions:-&lt;/span&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;&lt;pre&gt;In a VCO,the capacitance is varied by  using __________.&lt;br /&gt;ans: rev biased varactor diode&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;A pnp trans. in active region has  _____________.&lt;br /&gt;ans:b-e junction fwd biased &amp; b-c rev biased.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;in a nmos how is V-threshold affected by increasing doping conc. of substrate ?&lt;br /&gt;ans:increases&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;condition for sustained oscillations in a osc is___.&lt;br /&gt;ans:A=1 &amp;amp; phase shift = n*pi.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;if  A?B=C and C?A=B then what is the boolean operator ?&lt;br /&gt;ans:xor&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;clk is given with some period T to a logic gate.&lt;br /&gt;the same clk is again fed to the gate via a delay&lt;br /&gt;element with a delay of T/4 duration.if the gate&lt;br /&gt;acts as a freq.doubler then identify the gate.&lt;br /&gt;ans:xor&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;define the setup time &amp; hold time in a f/f.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;given a D f/f ,construct a T f/f from it.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;given a 2:1 mux,how will u implement an AND &amp;amp; OR gate ?&lt;/pre&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114481674121248018?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114481674121248018/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114481674121248018' title='2 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114481674121248018'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114481674121248018'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/stm-question-paper-ii.html' title='STM Question Paper - II'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>2</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114472420072959858</id><published>2006-04-11T08:20:00.000+05:30</published><updated>2006-04-11T08:26:40.730+05:30</updated><title type='text'>Motorola Question Paper - I</title><content type='html'>&lt;a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="http://photos1.blogger.com/blogger/1078/291/1600/motorola1.jpg"&gt;&lt;img style="margin: 0px auto 10px; display: block; text-align: center; cursor: pointer;" src="http://photos1.blogger.com/blogger/1078/291/400/motorola1.jpg" alt="" border="0" /&gt;&lt;/a&gt;&lt;a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="http://photos1.blogger.com/blogger/1078/291/1600/motorola2.jpg"&gt;&lt;img style="margin: 0px auto 10px; display: block; text-align: center; cursor: pointer;" src="http://photos1.blogger.com/blogger/1078/291/400/motorola2.jpg" alt="" border="0" /&gt;&lt;/a&gt;&lt;br /&gt;&lt;a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="http://photos1.blogger.com/blogger/1078/291/1600/motorola1.jpg"&gt;&lt;img style="margin: 0px auto 10px; display: block; text-align: center; cursor: pointer;" src="http://photos1.blogger.com/blogger/1078/291/400/motorola1.jpg" alt="" border="0" /&gt;&lt;/a&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114472420072959858?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114472420072959858/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114472420072959858' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114472420072959858'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114472420072959858'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/motorola-question-paper-i.html' title='Motorola Question Paper - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114460216137430143</id><published>2006-04-09T22:27:00.000+05:30</published><updated>2006-06-15T17:22:21.226+05:30</updated><title type='text'>STM Question Paper - I</title><content type='html'>&lt;a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="http://photos1.blogger.com/blogger/1078/291/1600/stpaper.jpg"&gt;&lt;img style="margin: 0px auto 10px; display: block; text-align: center; cursor: pointer;" src="http://photos1.blogger.com/blogger/1078/291/320/stpaper.jpg" alt="" border="0" /&gt;&lt;/a&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114460216137430143?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114460216137430143/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114460216137430143' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114460216137430143'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114460216137430143'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/stm-question-paper-i.html' title='STM Question Paper - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114446676221826426</id><published>2006-04-08T08:43:00.000+05:30</published><updated>2006-04-08T08:57:27.936+05:30</updated><title type='text'>TI Question Paper - II</title><content type='html'>&lt;span style="font-weight: bold; color: rgb(204, 102, 0);"&gt;&lt;/span&gt;&lt;span style="font-weight: bold; color: rgb(204, 102, 0);"&gt;Digital&lt;/span&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;&lt;pre&gt;simplyfy k map&lt;br /&gt;&lt;br /&gt;1 x x 0&lt;br /&gt;1 x 0 1&lt;/pre&gt;&lt;/li&gt;&lt;/ol&gt;&lt;span style="font-weight: bold; color: rgb(204, 102, 0);"&gt;Programming&lt;br /&gt;&lt;/span&gt;&lt;ol&gt;&lt;li&gt;&lt;span style="font-weight: bold; color: rgb(204, 102, 0);"&gt;&lt;/span&gt;&lt;pre&gt;&lt;span style="font-family:monospace;"&gt;I&lt;/span&gt;mplementation of priority queue&lt;br /&gt;a. tree&lt;br /&gt; b linked list&lt;br /&gt;  c doubly linked list.&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;max and avg. height of sorted binary tree&lt;span style="font-family:Georgia,serif;"&gt;.&lt;/span&gt;&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;size of integer is&lt;br /&gt;  a. 2 bytes&lt;br /&gt;  b 4 bytes&lt;br /&gt;  c. machine dependant&lt;br /&gt;  d compiler dependent.&lt;span style="font-family:Georgia,serif;"&gt;&lt;/span&gt;&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;span style="font-family:Georgia,serif;"&gt;Questions On Pointer to Function&lt;/span&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;main()&lt;br /&gt;{&lt;br /&gt;int i,*j;&lt;br /&gt;i=5;&lt;br /&gt;j=&amp;i;&lt;br /&gt;printf("\ni= %d",i);&lt;br /&gt;f(j);&lt;br /&gt;&lt;br /&gt;printf("\n i= %d",i);&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;void f(int*j)&lt;br /&gt;{&lt;br /&gt;int k=10;&lt;br /&gt;j= &amp;k;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;output is&lt;br /&gt;a 5 10&lt;br /&gt;b 10 5&lt;br /&gt;c 5 5&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;int f(int a)&lt;br /&gt;{&lt;br /&gt;a=+b;&lt;br /&gt;&lt;br /&gt;//some stuff&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;x=fn(a);&lt;br /&gt;y=&amp;fn; }&lt;br /&gt;what are x &amp; y types&lt;br /&gt;a) x is int y is pointer to afunction which takes integer value&lt;br /&gt;&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;main()&lt;br /&gt;{&lt;br /&gt;char a[10]="hello";&lt;br /&gt;strcpy(a,'\0');&lt;br /&gt;printf("%s",a);&lt;br /&gt;}&lt;br /&gt;output of the program?&lt;br /&gt;a) string is null b) string is not null  c) program error d)&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;void f(int *p){&lt;br /&gt;static val=100;&lt;br /&gt;val=&amp;p;&lt;br /&gt;}&lt;br /&gt;main(){&lt;br /&gt;int a=10;&lt;br /&gt;printf("%d ",a);&lt;br /&gt;f(&amp;a);&lt;br /&gt;printf("%d ",a);&lt;br /&gt;}&lt;br /&gt;what will be out put?&lt;br /&gt;a)10,10&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;void f(int value){&lt;br /&gt;for (i=0;i&lt;16;i++){&gt;&gt;1) printf("1")&lt;br /&gt;else printf("0");&lt;br /&gt;}&lt;br /&gt;}&lt;br /&gt;what is printed?&lt;br /&gt;a) bineray value of argument b)bcd value c) hex value d) octal value&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;for hashing which is best on terms of buckets&lt;br /&gt;a)100 b)50 c)21 d)32  ans 32&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;size of(int)&lt;br /&gt;a) always 2 bytes&lt;br /&gt;b) depends on compiler that is being used&lt;br /&gt;c) always 32 bits&lt;br /&gt;d) can't tell&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;    struct a&lt;br /&gt;  {&lt;br /&gt;  int a;&lt;br /&gt;  char b;&lt;br /&gt;  int c;&lt;br /&gt;  }&lt;br /&gt;&lt;br /&gt;  union b&lt;br /&gt;  {&lt;br /&gt;  char a;&lt;br /&gt;  int b;&lt;br /&gt;  int c;&lt;br /&gt;  };&lt;br /&gt;  which is correct .&lt;br /&gt;  a. size of a is always diff. form size of b.(ans.)&lt;br /&gt;  b. size of a is always same  form size of b.&lt;br /&gt;  c. we can't say anything because of not-homogeneous (not in ordered)&lt;br /&gt;  d. size of a can be same if ...&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;x=x^y;&lt;br /&gt; y=x^y;&lt;br /&gt; x=x^y;&lt;br /&gt;x=?&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;In a link list we want to go from last to first element and vice&lt;br /&gt;versa.&lt;br /&gt;Which is efficient&lt;br /&gt;a. Cirular List&lt;br /&gt;b. Doubly Link List&lt;br /&gt;c. Double Ended Link List&lt;br /&gt;d. Simple List&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;Hash function h(i)=i mod 5, there are 5 buckets 0,1,2,3,4. Rehashing is&lt;br /&gt;(h(i)+1)mod 5,(h(i)+2)mod 5......&lt;br /&gt;5 numbers are to be enterd, Find the number in a given bucket..&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;To reconstuct a Tree which sequence is enough&lt;br /&gt;a. Inoreder sequence&lt;br /&gt;b. Preorder and Post order&lt;br /&gt;c. In, Pre, Post order are required&lt;br /&gt;d. Any one can be used&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;(i)&lt;br /&gt;for(i=0;i&lt;max;i++) ii="" j="0;" i="0;i&lt;MAX;i++)" which="" code="" is="" faster="" if="" demand="" paging="" used=""&gt;&lt;/max;i++)&gt;&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;convert a inorder string to post order&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;int (*a[5])() what is this declaration?&lt;/pre&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114446676221826426?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114446676221826426/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114446676221826426' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114446676221826426'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114446676221826426'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/ti-question-paper-ii.html' title='TI Question Paper - II'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114441029319480939</id><published>2006-04-07T16:50:00.000+05:30</published><updated>2006-04-07T17:14:53.263+05:30</updated><title type='text'>TI Question Paper - I</title><content type='html'>&lt;div style="text-align: justify;"&gt;Again it is too compiled from a group of text file. So maximum number of circuit questions with "ASCII circuit diagram" are not presented here.&lt;br /&gt;&lt;br /&gt;&lt;span style="font-weight: bold; color: rgb(204, 102, 0);"&gt;Analog&lt;/span&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;Cube each side has r units resistence then the resistence across diagonal of cube&lt;/li&gt;&lt;li&gt;y=kx^2. This is transfer function of a block with i/p &lt;span style="font-weight: bold;"&gt;x&lt;/span&gt; &amp; o/p &lt;span style="font-weight: bold;"&gt;y&lt;/span&gt;.if i/p is sum of a &amp; b then o/p is :--&lt;br /&gt;a. AM b.FM  c. PM&lt;/li&gt;&lt;li&gt;find equivalent C. &lt;br /&gt;    -------------------&lt;br /&gt;             |                     |&lt;br /&gt;             C1                  c2&lt;br /&gt;             |-----c3-----|&lt;br /&gt;             |                      |&lt;br /&gt;             C1                   C2&lt;br /&gt;             |-----C3-----|&lt;br /&gt;             |                      |&lt;br /&gt;             C1                   C2&lt;br /&gt;             |                      |&lt;br /&gt;     -------------------&lt;/li&gt;&lt;li&gt;one question on Switch closed at t=0 find v at C a t&lt;br /&gt;&lt;br /&gt;     ------R1--------------switch-----&lt;br /&gt;     |                  |                                     |&lt;br /&gt;     |                R1                                   |&lt;br /&gt;     V                 |                                    C&lt;br /&gt;     |                |                                       |&lt;br /&gt;      ---------------------------------&lt;/li&gt;&lt;li&gt;&lt;pre&gt;                      |----Res---|&lt;br /&gt;                     |          |&lt;br /&gt;        in----Res----+--Inv-----+--- out&lt;br /&gt;                        CMOS&lt;br /&gt;   What is the given circuit&lt;br /&gt;a) Latch b)Amplifier   c)Schmitt trigger. d)&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;                   o Vdd&lt;br /&gt;                  |&lt;br /&gt;          --------+&lt;br /&gt;          |       |&lt;br /&gt;       B  |C      |&lt;br /&gt; o------- Tr NPN  |&lt;br /&gt;          |E      |-------------o&lt;br /&gt;          |       |&lt;br /&gt;          |    B  |C&lt;br /&gt;          +------ Tr NPN&lt;br /&gt;                  |E&lt;br /&gt;                  |&lt;br /&gt;  o---------------+-------------o&lt;br /&gt;the gain of the circuit is&lt;br /&gt;a) beta^2 b)beta + 1 c) (beta+1)^2 d)&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;Function of C in the circuit below is&lt;br /&gt;a) Improve switching b)dc coupling c) ac coupling d) None&lt;br /&gt;                                    o&lt;br /&gt;                       C            |&lt;br /&gt;                 +------||--+       |&lt;br /&gt;                 |          |       |C&lt;br /&gt;          o------+----Res---+------Tr NPN&lt;br /&gt;                                    |E&lt;br /&gt;                                    |&lt;br /&gt;                                   _|_&lt;br /&gt;                                   __&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;br /&gt;&lt;/li&gt;&lt;/ol&gt;&lt;span style="font-weight: bold; color: rgb(204, 102, 0);"&gt;&lt;br /&gt;Digital&lt;/span&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;With 2 i/p AND gates u have to form a 8 i/p AND; Give the fastest Implementation possible&lt;/li&gt;&lt;li&gt;With howmany 2:1 MUX u can for   8:1 MUX. answer is 7.&lt;/li&gt;&lt;li&gt;There are n states then ffs used are ??  Ans: log n.&lt;/li&gt;&lt;li&gt;universal gates can impliment.&lt;br /&gt;  a.  Digital ckts.&lt;br /&gt;  b.   Digital logic&lt;br /&gt;  c   all digital and analog ckts.&lt;br /&gt;  d.  only combinational ckts.&lt;/li&gt;&lt;li&gt;&lt;pre&gt;if a 5-stage pipe-line is flushed and then we have to execute 5 and 12&lt;br /&gt;instructions respectively then no. of  cycles will be&lt;br /&gt;a. 5 and 12&lt;br /&gt;b. 6 and 13&lt;br /&gt;c. 9 and 16&lt;br /&gt;d.none&lt;br /&gt;&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;nand gate is&lt;br /&gt;   a) associative &amp;cumulative b)cumulative but not&lt;br /&gt;  associative&lt;br /&gt;   c)not cumulative but associative d)not cumultive&lt;br /&gt;  and associative&lt;br /&gt;&lt;br /&gt; ANS. b&lt;/li&gt;&lt;li&gt; which imp has les delay&lt;br /&gt;  a)  (a xor b) xor (c xor d)&lt;br /&gt;  b) (((a xor b) xor c) xor d)&lt;/li&gt;&lt;li&gt;3 dffs was given with common clk; setup time 3ns; hold time 1ns; clk to q delay 2ns; find the maximum frequency of operation&lt;/li&gt;&lt;li&gt;&lt;pre&gt;Minimize the K-map&lt;br /&gt;        A'B' A'B  AB  AB'&lt;br /&gt;       \_________________&lt;br /&gt;     c'| 1    X   0   1 |&lt;br /&gt;       |----------------|&lt;br /&gt;      c| 1    X   0   1 |&lt;br /&gt;       |----------------|&lt;br /&gt;a) A'B' b) A'+B' c)B' d)A'+B'+C'&lt;/pre&gt;&lt;/li&gt;&lt;/ol&gt;&lt;span style="font-weight: bold; color: rgb(204, 102, 0);"&gt;Programming&lt;br /&gt;&lt;/span&gt;&lt;ol&gt;&lt;li&gt;&lt;span style="font-weight: bold; color: rgb(204, 102, 0);"&gt;&lt;/span&gt;CHAR  A[10][15] AND INT B[10][15] IS DEFINED&lt;br /&gt;&lt;pre&gt;WHAT'S THE ADDRESS OF A[3][4] AND B[3][4]&lt;br /&gt;IF ADDRESS OD A IS OX1000 AND B IS 0X2000&lt;br /&gt;&lt;br /&gt;A. 0X1030 AND 0X20C3&lt;br /&gt;B. OX1031 AND OX20C4&lt;br /&gt;AND SOME OTHERS..&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;int f(int *a)&lt;br /&gt;{&lt;br /&gt;int b=5;&lt;br /&gt;a=&amp;b;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;int i;&lt;br /&gt;printf("\n %d",i);&lt;br /&gt;f(&amp;i);&lt;br /&gt;printf("\n %d",i);&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;what's the output .&lt;br /&gt;&lt;br /&gt;1.10,5&lt;br /&gt;2,10,10&lt;br /&gt;c.5,5&lt;br /&gt;d. none&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;main()&lt;br /&gt;{&lt;br /&gt;int i;&lt;br /&gt;fork();&lt;br /&gt;fork();&lt;br /&gt;fork();&lt;br /&gt;printf("----");&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;how many times the printf will be executed .&lt;br /&gt;a.3&lt;br /&gt;b. 6&lt;br /&gt;c.5&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;void f(int i)&lt;br /&gt;{&lt;br /&gt;int j;&lt;br /&gt;for (j=0;j&lt;16;j++)&lt;br /&gt;{&lt;br /&gt;if (i &amp; (0x8000&gt;&gt;j))&lt;br /&gt;printf("1");&lt;br /&gt;else&lt;br /&gt;printf("0");&lt;br /&gt;}&lt;br /&gt;}&lt;br /&gt;what's the purpose of the program&lt;br /&gt;&lt;br /&gt;a. its output is hex representation of i&lt;br /&gt;b. bcd&lt;br /&gt;c. binary&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;#define f(a,b) a+b&lt;br /&gt;#define g(a,b) a*b&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;int m;&lt;br /&gt;m=2*f(3,g(4,5));&lt;br /&gt;printf("\n m is %d",m);&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;what's the value of m&lt;br /&gt;a.70&lt;br /&gt;b.50&lt;br /&gt;c.26&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;main()&lt;br /&gt;{&lt;br /&gt;char a[10];&lt;br /&gt;strcpy(a,"\0");&lt;br /&gt;if (a==NULL)&lt;br /&gt;printf("\a is null");&lt;br /&gt;else&lt;br /&gt;printf("\n a is not null");}&lt;br /&gt;&lt;br /&gt;what happens with it .&lt;br /&gt;a. compile time error.&lt;br /&gt;b. run-time error.&lt;br /&gt;c. a is  null&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;char a[5]="hello"&lt;br /&gt;&lt;br /&gt;a. in array we can't do the operation .&lt;br /&gt;b. size of a is too large&lt;br /&gt;c. size of a is too small&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;local variables can be store by compiler&lt;br /&gt;a. in register or heap&lt;br /&gt;b. in register or stack&lt;br /&gt;c .in stack or heap .&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;global variable conflicts due to multiple file occurance&lt;br /&gt;is resolved during&lt;br /&gt;a. compile-time&lt;br /&gt;b. run-time&lt;br /&gt;c. link-time&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;two program is given of factorial.&lt;br /&gt;one  with  recursion and one without recursion .&lt;br /&gt;question was which program won't run for very big no. input because of&lt;br /&gt;stack overfow .&lt;br /&gt;a. i only  (ans.)&lt;br /&gt;b. ii only&lt;br /&gt;c. i&amp; ii both .&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;struct a&lt;br /&gt;{&lt;br /&gt;int a;&lt;br /&gt;char b;&lt;br /&gt;int c;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;union b&lt;br /&gt;{&lt;br /&gt;char a;&lt;br /&gt;int b;&lt;br /&gt;int c;&lt;br /&gt;};&lt;br /&gt;which is correct .&lt;br /&gt;a. size of a is always diff. form size of b.(ans.)&lt;br /&gt;b. size of a is always same  form size of b.&lt;br /&gt;c. we can't say anything because of not-homogeneous (not in ordered)&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;&lt;br /&gt;d. size of a can be same if ...&lt;br /&gt;c. none&lt;br /&gt;d. load-time&lt;br /&gt;d. global memory.&lt;br /&gt;d. nothing wrong with it .&lt;br /&gt;d. a is not  null.&lt;br /&gt;d. 69&lt;br /&gt;d. decimal&lt;br /&gt;d. 8&lt;/pre&gt;&lt;/li&gt;&lt;li&gt;&lt;pre&gt;IF the rate of removal of elements in a queue containing N elements is&lt;br /&gt;proportional to the no of  elements already existing in the queue at that&lt;br /&gt;instant then the no. of elements----&lt;br /&gt;a)decrease linearly b)Exponetialy decrease b) Logarithmcally&lt;/pre&gt;&lt;/li&gt;&lt;/ol&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114441029319480939?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114441029319480939/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114441029319480939' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114441029319480939'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114441029319480939'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/ti-question-paper-i.html' title='TI Question Paper - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114430251066862713</id><published>2006-04-06T10:59:00.000+05:30</published><updated>2006-04-06T11:18:30.720+05:30</updated><title type='text'>HCL :: C Programing - I</title><content type='html'>&lt;div style="text-align: justify;"&gt;Here are a compiled set of questions that have been asked by HCL in various institutions during their campus interview process. I have got these questions from IITKGP LAN. These questions are usually posted in the various job/campus related yahoo groups. I am just coping and pasting from the various text files, not sure about accuracy of the answers, do check urself if you have any doubts.&lt;br /&gt;&lt;span style="font-weight: bold; color: rgb(153, 51, 0);font-size:100%;" &gt;&lt;br /&gt;Section I - C Programming&lt;br /&gt;&lt;/span&gt;&lt;ol&gt;&lt;li&gt;Which of the following about the following two declaration is true&lt;br /&gt;i ) int *F()&lt;br /&gt;ii) int (*F)()&lt;br /&gt;Choice :&lt;br /&gt;a) Both are identical&lt;br /&gt;b) The first is a correct declaration and the second is wrong&lt;br /&gt;c) The first declaraion is a function returning a pointer to an integer and the second is a pointer to function returning int&lt;br /&gt;d) Both are different ways of declarin pointer to a function&lt;br /&gt;Answer : c) The first de...&lt;/li&gt;&lt;li&gt;What are the values printed by the following program?&lt;br /&gt;#define dprint(expr) printf(#expr "=%d\n",expr)&lt;br /&gt;main() {&lt;br /&gt;int x=7;&lt;br /&gt;int y=3;&lt;br /&gt;dprintf(x/y);&lt;br /&gt;}&lt;br /&gt;Choice:&lt;br /&gt;a) #2 = 2 b) expr=2 c) x/y=2 d) none&lt;br /&gt;Answer: c)x/y=2&lt;/li&gt;&lt;li&gt;output of the following.&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;int i;&lt;br /&gt;char *p;&lt;br /&gt;i=0X89;&lt;br /&gt;p=(char *)i;&lt;br /&gt;p++;&lt;br /&gt;printf("%x\n",p);&lt;br /&gt;}&lt;br /&gt;ans:0X8A&lt;/li&gt;&lt;li&gt;When an array is passed as parameter to a function, which of thefollowing statement is correct, choice:&lt;br /&gt;a) The function can change values in the original array&lt;br /&gt;b) In C parameters are passed by value. The funciton cannot change the original value in the array&lt;br /&gt;c) It results in compilation error when the function tries to access the elements in the array&lt;br /&gt;d) Results in a run time error when the funtion tries to access the elements in the array&lt;br /&gt;Answer: a) The fu.&lt;/li&gt;&lt;li&gt;The type of the controlling _expression of a switch statement cannot be of the type&lt;br /&gt;a) int b) char c) short d)float e) none&lt;br /&gt;Answer : d)float&lt;/li&gt;&lt;li&gt;What is the value assigned to the variable X if b is 7 ?&lt;br /&gt;X = b&gt;8 ? b &lt;&lt;3&gt;4 ? b&gt;&gt;1:b;&lt;br /&gt;a) 7 b) 28 c) 3 d) 14 e) None&lt;br /&gt;ans: 3;&lt;/li&gt;&lt;li&gt;Which is the output produced by the following program&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;int n=2;&lt;br /&gt;printf("%d %d\n", ++n, n*n);&lt;br /&gt;}&lt;br /&gt;a) 3,6 b) 3,4 c) 2,4 d) cannot determine&lt;br /&gt;Answer : b) 3,4&lt;/li&gt;&lt;li&gt;What is th output of the following program?&lt;br /&gt;int x= 0x65;&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;char x;&lt;br /&gt;printf("%d\n",x)&lt;br /&gt;}&lt;br /&gt;a) compilation error b) 'A' c) 65 d) unidentified&lt;/li&gt;&lt;li&gt;What is the output of the following program&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;int a=10;&lt;br /&gt;int b=6;&lt;br /&gt;if(a=3)&lt;br /&gt;b++;&lt;br /&gt;printf("%d %d\n",a,b++);&lt;br /&gt;}&lt;br /&gt;a) 10,6 b)10,7 c) 3,6 d) 3,7 e) none&lt;br /&gt;Answer : d) 3,7&lt;/li&gt;&lt;li&gt;What can be said of the following program?&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;enum Months {JAN =1,FEB,MAR,APR};&lt;br /&gt;Months X = JAN;&lt;br /&gt;if(X==1)&lt;br /&gt;{&lt;br /&gt;printf("Jan is the first month");&lt;br /&gt;}&lt;br /&gt;}&lt;br /&gt;a) Does not print anything&lt;br /&gt;b) Prints : Jan is the first month&lt;br /&gt;c) Generates compilation error&lt;br /&gt;d) Results in runtime error&lt;br /&gt;Answer: b) Prints : Jan..&lt;/li&gt;&lt;li&gt;What is the output of the following program?&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;char *src = "Hello World";&lt;br /&gt;char dst[100];&lt;br /&gt;strcpy(src,dst);&lt;br /&gt;printf("%s",dst);&lt;br /&gt;}&lt;br /&gt;strcpy(char *dst,char *src)&lt;br /&gt;{&lt;br /&gt;while(*src) *dst++ = *src++;&lt;br /&gt;}&lt;br /&gt;a) "Hello World" b)"Hello" c)"World" d) NULL e) unidentified&lt;br /&gt;Answer: d) NULL&lt;/li&gt;&lt;li&gt;What is the output of the following program?&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;int l=6;&lt;br /&gt;switch(l)&lt;br /&gt;{ default : l+=2;&lt;br /&gt;case 4: l=4;&lt;br /&gt;case 5: l++;&lt;br /&gt;break;&lt;br /&gt;}&lt;br /&gt;printf("%d",l);&lt;br /&gt;}&lt;br /&gt;a)8 b)6 c)5 d)4 e)none&lt;br /&gt;Answer : c)5&lt;/li&gt;&lt;li&gt;What is the output of the following program?&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;int x=20;&lt;br /&gt;int y=10;&lt;br /&gt;swap(x,y);&lt;br /&gt;printf("%d %d",y,x+2);&lt;br /&gt;}&lt;br /&gt;swap(int x,int y)&lt;br /&gt;{&lt;br /&gt;int temp;&lt;br /&gt;temp =x;&lt;br /&gt;x=y;&lt;br /&gt;y=temp;&lt;br /&gt;}&lt;br /&gt;a)10,20 b) 20,12 c) 22,10 d)10,22 e)none&lt;br /&gt;Answer:d)10,22&lt;/li&gt;&lt;li&gt;What is the output of the following problem ?&lt;br /&gt;#define INC(X) X++&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;int X=4;&lt;br /&gt;printf("%d",INC(X++));&lt;br /&gt;}&lt;br /&gt;a)4 b)5 c)6 d)compilation error e) runtime error&lt;br /&gt;Answer : d) compilation error&lt;br /&gt;&lt;/li&gt;&lt;li&gt;what can be said of the following&lt;br /&gt;struct Node {&lt;br /&gt;char *word;&lt;br /&gt;int count;&lt;br /&gt;struct Node left;&lt;br /&gt;struct Node right;&lt;br /&gt;}&lt;br /&gt;a) Incorrect definition&lt;br /&gt;b) structures cannot refer to other structure&lt;br /&gt;c) Structures can refer to themselves. Hence the statement is OK&lt;br /&gt;d) Structures can refer to maximum of one other structure&lt;br /&gt;Answer :c)&lt;/li&gt;&lt;li&gt;What is the size of the following union. Assume that the size of int =2, size of float =4 and size of char =1.&lt;br /&gt;Union Tag{&lt;br /&gt;int a;&lt;br /&gt;flaot b;&lt;br /&gt;char c;&lt;br /&gt;};&lt;br /&gt;a)2 b)4 c)1 d) 7&lt;/li&gt;&lt;li&gt;What is printed when this program is executed&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;printf ("%d\n",f(7));&lt;br /&gt;}&lt;br /&gt;f(X)&lt;br /&gt;{&lt;br /&gt;if (x&lt;= 4)&lt;br /&gt;return x;&lt;br /&gt;return f(--x);&lt;br /&gt;}&lt;br /&gt;a) 4&lt;br /&gt;b) 5&lt;br /&gt;c) 6&lt;br /&gt;d) 7&lt;br /&gt;ans: a&lt;/li&gt;&lt;li&gt;On a machine where pointers are 4 bytes long, what happens when the following code is executed.&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;int x=0,*p=0;&lt;br /&gt;x++; p++;&lt;br /&gt;printf ("%d and %d\n",x,p);&lt;br /&gt;}&lt;br /&gt;a) 1 and 1 is printed&lt;br /&gt;b) 1 and 4 is printed&lt;br /&gt;c) 4 and 4 is printed&lt;/li&gt;&lt;li&gt;Which of the following is the correct code for strcpy, that is used to copy the contents from src to dest?&lt;br /&gt;a) strcpy (char *dst,char *src)&lt;br /&gt;{&lt;br /&gt;while (*src)&lt;br /&gt;*dst++ = *src++;&lt;br /&gt;}&lt;br /&gt;b) strcpy (char *dst,char *src)&lt;br /&gt;{&lt;br /&gt;while(*dst++ = *src++)&lt;br /&gt;}&lt;br /&gt;c) strcpy (char *dst,char *src)&lt;br /&gt;{&lt;br /&gt;while(*src)&lt;br /&gt;{ *dst = *src;&lt;br /&gt;dst++; src++;&lt;br /&gt;}&lt;br /&gt;}&lt;br /&gt;d) strcpy(char *dst, char *src)&lt;br /&gt;{&lt;br /&gt;while(*++dst = *++src);&lt;br /&gt;}&lt;br /&gt;ans:b&lt;/li&gt;&lt;li&gt;Consider the following program&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;int i=20,*j=&amp;i;&lt;br /&gt;f1(j);&lt;br /&gt;*j+=10;&lt;br /&gt;f2(j);&lt;br /&gt;printf("%d and %d",i,*j);&lt;br /&gt;}&lt;br /&gt;f1(k)&lt;br /&gt;int *k;&lt;br /&gt;{&lt;br /&gt;*k +=15;&lt;br /&gt;}&lt;br /&gt;f2(x)&lt;br /&gt;int *x;&lt;br /&gt;{&lt;br /&gt;int m=*x,*n=&amp;m;&lt;br /&gt;*n += 10;&lt;br /&gt;}&lt;br /&gt;The values printed by the program will be&lt;br /&gt;a) 20 and 55&lt;br /&gt;b) 20 and 45&lt;br /&gt;c) 45 and 45&lt;br /&gt;d) 45 and 55&lt;br /&gt;e) 35 and 35&lt;/li&gt;&lt;li&gt;what is printed when the following program is compiled and&lt;br /&gt;executed?&lt;br /&gt;&lt;br /&gt;int&lt;br /&gt;func (int x)&lt;br /&gt;{&lt;br /&gt;if (x&lt;=0)&lt;br /&gt;return(1);&lt;br /&gt;return func(x -1) +x;&lt;br /&gt;}&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;printf("%d\n",func(5));&lt;br /&gt;}&lt;br /&gt;a) 12&lt;br /&gt;b) 16&lt;br /&gt;c) 15&lt;br /&gt;d) 11&lt;/li&gt;&lt;/ol&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114430251066862713?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114430251066862713/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114430251066862713' title='2 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114430251066862713'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114430251066862713'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/hcl-c-programing-i.html' title='HCL :: C Programing - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>2</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114422219075161603</id><published>2006-04-05T12:57:00.000+05:30</published><updated>2006-04-05T12:59:50.753+05:30</updated><title type='text'>Verbal Test Questions - II</title><content type='html'>&lt;p&gt;&lt;em&gt;&lt;b&gt;Directions: &lt;/b&gt;&lt;/em&gt;&lt;strong&gt;Give the synonyms for the following words&lt;/strong&gt;&lt;/p&gt;  &lt;p&gt;1. Depreciation: deflation, depression, devaluation, fall, slump&lt;/p&gt;  &lt;p&gt;2. Depricate : feel and express disapproval, &lt;/p&gt;  &lt;p&gt;3. Incentive : thing one encourages one to do (stimulus)&lt;/p&gt;  &lt;p&gt;4. Echelon : level of authority or responsibility&lt;/p&gt;  &lt;p&gt;5. Innovation : make changes or introduce new things&lt;/p&gt;  &lt;p&gt;6. Intermittent : externally stopping and then starting&lt;/p&gt;  &lt;p&gt;7. Detrimental: harmful&lt;/p&gt;  &lt;p&gt;8. Conciliation : make less angry or more friendly&lt;br /&gt;&lt;br /&gt;9. Orthodox: conventional or traditional, superstitious&lt;br /&gt;&lt;br /&gt;10. Fallible : liable to error&lt;br /&gt;&lt;br /&gt;11. Volatile : ever changing&lt;br /&gt;&lt;br /&gt;12. Manifest: clear and obvious&lt;br /&gt;&lt;br /&gt;13. Connotation : suggest or implied meaning of expression&lt;br /&gt;&lt;br /&gt;14. Reciprocal: reverse or opposite&lt;br /&gt;&lt;br /&gt;15. Agrarian : related to agriculture&lt;br /&gt;&lt;br /&gt;16. Vacillate : undecided or dilemma&lt;br /&gt;&lt;br /&gt;17. Expedient : fitting proper, desirable&lt;br /&gt;&lt;br /&gt;18. Simulate : produce artificially resembling an existing one.&lt;br /&gt;&lt;br /&gt;19. Access : to approah&lt;br /&gt;&lt;br /&gt;20. Compensation: salary&lt;br /&gt;&lt;br /&gt;21. Truncate : shorten by cutting&lt;br /&gt;&lt;br /&gt;22. Adherence : stick&lt;br /&gt;&lt;br /&gt;23. Heterogenous: non similar things&lt;br /&gt;&lt;br /&gt;24. Surplus : excessive&lt;br /&gt;&lt;br /&gt;25. Assess : determine the amount or value&lt;br /&gt;&lt;br /&gt;26. Congnizance : knowledge&lt;br /&gt;&lt;br /&gt;27. Retrospective : review&lt;br /&gt;&lt;br /&gt;28. Naive : innocent,rustic&lt;br /&gt;&lt;br /&gt;29. Equivocate : tallying on both sides, lie, mislead&lt;br /&gt;&lt;br /&gt;30. Postulate : frame a theory&lt;br /&gt;&lt;br /&gt;31. Latent : dormant, secret&lt;br /&gt;&lt;br /&gt;32. Fluctuation : wavering,&lt;br /&gt;&lt;br /&gt;33. Eliminate : to reduce&lt;br /&gt;&lt;br /&gt;34. Affinity : strong liking&lt;br /&gt;&lt;br /&gt;35. Expedite : hasten&lt;br /&gt;&lt;br /&gt;36. Console : to show sympathy&lt;br /&gt;&lt;br /&gt;37. Adversary : opposition&lt;br /&gt;&lt;br /&gt;38. Affable : lovable or approachable&lt;br /&gt;&lt;br /&gt;39. Decomposition : rotten&lt;br /&gt;&lt;br /&gt;40. Agregious : apart from the crowd, especially bad&lt;br /&gt;&lt;br /&gt;41. Conglomaration: group, collection&lt;br /&gt;&lt;br /&gt;42. Aberration: deviation&lt;br /&gt;&lt;br /&gt;43. Aurgury : prediction&lt;br /&gt;&lt;br /&gt;44. Crediability : ability to common belief, quality of being credible&lt;br /&gt;&lt;br /&gt;45. Coincident: incidentally&lt;br /&gt;&lt;br /&gt;46. Constituent : accompanying&lt;br /&gt;&lt;br /&gt;47. Differential : having or showing or making use of&lt;br /&gt;&lt;br /&gt;48. Litigation : engaging in a law suit&lt;br /&gt;&lt;br /&gt;49. Maratorium: legally or offficiallly determined period of dealy before&lt;br /&gt;fulfillment of the agreement of paying of debts.&lt;br /&gt;&lt;br /&gt;50. Negotiate : discuss or bargain&lt;br /&gt;&lt;br /&gt;51. Preparation : act of preparing&lt;br /&gt;&lt;br /&gt;52. Preponderant : superiority of power or quality&lt;br /&gt;&lt;br /&gt;53. Relevance : quality of being relevant&lt;br /&gt;&lt;br /&gt;54. Apparatus : appliances&lt;br /&gt;&lt;br /&gt;55. Ignorance : blindness, in experience&lt;br /&gt;&lt;br /&gt;56. Obsession: complex enthusiasm&lt;br /&gt;&lt;br /&gt;57. precipitate : speed,active&lt;/p&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114422219075161603?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114422219075161603/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114422219075161603' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114422219075161603'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114422219075161603'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/verbal-test-questions-ii.html' title='Verbal Test Questions - II'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114422167663753340</id><published>2006-04-05T12:46:00.000+05:30</published><updated>2006-04-05T12:51:16.656+05:30</updated><title type='text'>Dharma Systems :: Placement Papers</title><content type='html'>&lt;p&gt;&lt;strong&gt;&lt;i&gt;&lt;span style="color: black;"&gt;Give the output of the programs in each case unless mentioned otherwise&lt;/span&gt;&lt;/i&gt;&lt;/strong&gt;&lt;span style="color: black;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: black;"&gt;1.&lt;br /&gt;void main()&lt;br /&gt;{&lt;br /&gt;int d=5;&lt;br /&gt;printf("%f",d);&lt;br /&gt;}&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: maroon;"&gt;Ans: Undefined&lt;/span&gt;&lt;span style="color: black;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: black;"&gt;&lt;br /&gt;2.&lt;br /&gt;void main()&lt;br /&gt;{&lt;br /&gt;int i;&lt;br /&gt;for(i=1;i&lt;4,i++)&lt;br /&gt;switch(i)&lt;br /&gt;case 1: printf("%d",i);break;&lt;br /&gt;{&lt;br /&gt;case 2:printf("%d",i);break;&lt;br /&gt;case 3:printf("%d",i);break;&lt;br /&gt;}&lt;br /&gt;switch(i) case 4:printf("%d",i);&lt;br /&gt;}&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: maroon;"&gt;Ans: 1,2,3,4 &lt;/span&gt;&lt;span style="color: black;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: black;"&gt;&lt;br /&gt;3.&lt;br /&gt;void main()&lt;br /&gt;{&lt;br /&gt;char *s="\12345s\n";&lt;br /&gt;printf("%d",sizeof(s));&lt;br /&gt;}&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: maroon;"&gt;Ans: 6&lt;/span&gt;&lt;span style="color: black;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: black;"&gt;&lt;br /&gt;4.&lt;br /&gt;void main()&lt;br /&gt;{&lt;br /&gt;unsigned i=1; /* unsigned char k= -1 =&gt; k=255; */&lt;br /&gt;signed j=-1; /* char k= -1 =&gt; k=65535 */&lt;br /&gt;/* unsigned or signed int k= -1 =&gt;k=65535 */&lt;br /&gt;if(i&lt;j)&lt;br /&gt;printf("less");&lt;br /&gt;else&lt;br /&gt;if(i&gt;j)&lt;br /&gt;printf("greater");&lt;br /&gt;else&lt;br /&gt;if(i==j)&lt;br /&gt;printf("equal");&lt;br /&gt;}&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: maroon;"&gt;Ans: less&lt;/span&gt;&lt;span style="color: black;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: black;"&gt;&lt;br /&gt;5.&lt;br /&gt;void main()&lt;br /&gt;{&lt;br /&gt;float j;&lt;br /&gt;j=1000*1000;&lt;br /&gt;printf("%f",j);&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;1. 1000000&lt;br /&gt;2. Overflow&lt;br /&gt;3. Error&lt;br /&gt;4. None &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: maroon;"&gt;Ans: 4 &lt;/span&gt;&lt;span style="color: black;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: black;"&gt;&lt;br /&gt;6.  How do you declare an array of N pointers to functions returning&lt;br /&gt;     pointers to functions returning pointers to characters?&lt;br /&gt;&lt;br /&gt;&lt;/span&gt;&lt;span style="color: maroon;"&gt;Ans: The first part of this question can be answered in at least&lt;br /&gt;        three ways:&lt;br /&gt;&lt;br /&gt;    1. char *(*(*a[N])())();&lt;br /&gt;&lt;br /&gt;    2. Build the declaration up incrementally, using typedefs:&lt;br /&gt;&lt;br /&gt;        typedef char *pc;    /* pointer to char */&lt;br /&gt;        typedef pc fpc();    /* function returning pointer to char */&lt;br /&gt;        typedef fpc *pfpc;    /* pointer to above */&lt;br /&gt;        typedef pfpc fpfpc();    /* function returning... */&lt;br /&gt;        typedef fpfpc *pfpfpc;    /* pointer to... */&lt;br /&gt;        pfpfpc a[N];         /* array of... */&lt;br /&gt;&lt;br /&gt;    3. Use the cdecl program, which turns English into C and vice&lt;br /&gt;    versa:&lt;br /&gt;&lt;br /&gt;        cdecl&gt; declare a as array of pointer to function returning&lt;br /&gt;            pointer to function returning pointer to char&lt;br /&gt;        char *(*(*a[])())()&lt;br /&gt;&lt;br /&gt;    cdecl can also explain complicated declarations, help with&lt;br /&gt;    casts, and indicate which set of parentheses the arguments&lt;br /&gt;    go in (for complicated function definitions, like the one&lt;br /&gt;    above).&lt;br /&gt;    Any good book on C should explain how to read these complicated&lt;br /&gt;    C declarations "inside out" to understand them ("declaration&lt;br /&gt;    mimics use").&lt;br /&gt;    The pointer-to-function declarations in the examples above have&lt;br /&gt;    not included parameter type information. When the parameters&lt;br /&gt;    have complicated types, declarations can *really* get messy.&lt;br /&gt;    (Modern versions of cdecl can help here, too.)&lt;br /&gt;&lt;/span&gt;&lt;span style="color: black;"&gt;&lt;br /&gt;&lt;br /&gt;7. A structure pointer is defined of the type time . With 3 fields min,sec hours having pointers to intergers.&lt;br /&gt;    Write the way to initialize the 2nd element to 10.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: black;"&gt;&lt;br /&gt;8. In the above question an array of pointers is declared.&lt;br /&gt;    Write the statement to initialize the 3rd element of the 2 element to 10;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: black;"&gt;&lt;br /&gt;9.&lt;br /&gt;int f()&lt;br /&gt;void main()&lt;br /&gt;{&lt;br /&gt;f(1);&lt;br /&gt;f(1,2);&lt;br /&gt;f(1,2,3);&lt;br /&gt;}&lt;br /&gt;f(int i,int j,int k)&lt;br /&gt;{&lt;br /&gt;printf("%d %d %d",i,j,k);&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;What are the number of syntax errors in the above?&lt;br /&gt;&lt;br /&gt;&lt;/span&gt;&lt;span style="color: maroon;"&gt;Ans: None.&lt;/span&gt;&lt;span style="color: black;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: black;"&gt;&lt;br /&gt;10.&lt;br /&gt;void main()&lt;br /&gt;{&lt;br /&gt;int i=7;&lt;br /&gt;printf("%d",i++*i++);&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;/span&gt;&lt;span style="color: maroon;"&gt;Ans: 56&lt;/span&gt;&lt;span style="color: black;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: black;"&gt;&lt;br /&gt;11.&lt;br /&gt;#define one 0&lt;br /&gt;#ifdef one&lt;br /&gt;printf("one is defined ");&lt;br /&gt;#ifndef one&lt;br /&gt;printf("one is not defined ");&lt;br /&gt;&lt;br /&gt;&lt;/span&gt;&lt;span style="color: maroon;"&gt;Ans: "one is defined"&lt;/span&gt;&lt;span style="color: black;"&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;12.&lt;br /&gt;void main()&lt;br /&gt;{&lt;br /&gt;intcount=10,*temp,sum=0;&lt;br /&gt;temp=&amp;count;&lt;br /&gt;*temp=20;&lt;br /&gt;temp=&amp;sum;&lt;br /&gt;*temp=count;&lt;br /&gt;printf("%d %d %d ",count,*temp,sum);&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;/span&gt;&lt;span style="color: maroon;"&gt;Ans: 20 20 20&lt;/span&gt;&lt;span style="color: black;"&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;13. There was question in c working only on unix machine with pattern matching.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;14. what is alloca()&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: maroon;"&gt;Ans : It allocates and frees memory after use/after getting out of scope&lt;/span&gt;&lt;span style="color: black;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: black;"&gt;&lt;br /&gt;15.&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;static i=3;&lt;br /&gt;printf("%d",i--);&lt;br /&gt;return i&gt;0 ? main():0;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;/span&gt;&lt;span style="color: maroon;"&gt;Ans: 321&lt;/span&gt;&lt;span style="color: black;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: black;"&gt;&lt;br /&gt;16.&lt;br /&gt;char *foo()&lt;br /&gt;{&lt;br /&gt;char result[100]);&lt;br /&gt;strcpy(result,"anything is good");&lt;br /&gt;return(result);&lt;br /&gt;}&lt;br /&gt;void main()&lt;br /&gt;{&lt;br /&gt;char *j;&lt;br /&gt;j=foo()&lt;br /&gt;printf("%s",j);&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;/span&gt;&lt;span style="color: maroon;"&gt;Ans: anything is good.&lt;/span&gt;&lt;span style="color: black;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: black;"&gt;&lt;br /&gt;17.&lt;br /&gt;void main()&lt;br /&gt;{&lt;br /&gt;char *s[]={ "dharma","hewlett-packard","siemens","ibm"};&lt;br /&gt;char **p;&lt;br /&gt;p=s;&lt;br /&gt;printf("%s",++*p);&lt;br /&gt;printf("%s",*p++);&lt;br /&gt;printf("%s",++*p);&lt;br /&gt;}&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;p&gt;&lt;span style="color: maroon;" lang="SV"&gt;Ans: "harma" (p-&gt;add(dharma) &amp;&amp;amp; (*p)-&gt;harma)&lt;br /&gt;"harma" (after printing, p-&gt;add(hewlett-packard) &amp;&amp;amp;(*p)-&gt;harma)&lt;br /&gt;"ewlett-packard" &lt;/span&gt;&lt;span style="color: black;" lang="SV"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114422167663753340?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114422167663753340/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114422167663753340' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114422167663753340'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114422167663753340'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/dharma-systems-placement-papers.html' title='Dharma Systems :: Placement Papers'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114411698834191636</id><published>2006-04-04T07:39:00.000+05:30</published><updated>2006-04-04T07:46:28.353+05:30</updated><title type='text'>Verbal Test Questions - I</title><content type='html'>&lt;span style=""&gt;&lt;/span&gt;&lt;span style=""&gt;&lt;span style="font-size:130%;"&gt;&lt;span style="font-weight: bold;"&gt;Synonyms:-&lt;br /&gt;&lt;br /&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;    &lt;div align="right"&gt;  &lt;table class="MsoNormalTable" style="width: 100%;" border="0" cellpadding="0" width="100%"&gt;  &lt;tbody&gt;&lt;tr style=""&gt;   &lt;td style="padding: 0.75pt; width: 33%;" valign="top" width="33%"&gt;   &lt;p class="MsoNormal"&gt; CENSURE&lt;br /&gt;          a. purify&lt;br /&gt;          b. &lt;i&gt;approve&lt;/i&gt;&lt;br /&gt;          c. edit&lt;br /&gt;          d. uncertain &lt;/p&gt;   &lt;p&gt;ONUS&lt;br /&gt;           a. honest&lt;br /&gt;           b. inclination&lt;br /&gt;           c. &lt;i&gt;responsibility&lt;/i&gt;&lt;br /&gt;           d. accuse&lt;br /&gt; &lt;br /&gt;  DIVERGENT&lt;br /&gt;          a.&lt;br /&gt;          b.&lt;br /&gt;          c. &lt;i&gt;deviating&lt;/i&gt;&lt;br /&gt;          d.&lt;br /&gt; &lt;br /&gt;  FIDELITY&lt;br /&gt;          a. restlessness&lt;br /&gt;          b. &lt;i&gt;disloyalty&lt;/i&gt;&lt;br /&gt;          c. feeble&lt;br /&gt;          d. vagueness&lt;br /&gt; &lt;br /&gt;  SURVEILLANCE&lt;br /&gt;          a. inattention&lt;br /&gt;          b. visibility&lt;br /&gt;          c. census&lt;br /&gt;          d. prevention &lt;/p&gt;   &lt;p&gt;WHIMSICAL&lt;br /&gt;          a. victorious&lt;br /&gt;          b. swift&lt;br /&gt;          c. &lt;i&gt;fanciful&lt;/i&gt;&lt;br /&gt;          d. momentary&lt;br /&gt; &lt;br /&gt;  NASCENT&lt;br /&gt;          a. threat&lt;br /&gt;          b. purpose&lt;br /&gt;          c. quality&lt;br /&gt;          d. &lt;i&gt;emerging&lt;/i&gt;&lt;br /&gt; &lt;br /&gt;  BENIGN&lt;br /&gt;          a. &lt;i&gt;kindly&lt;/i&gt;&lt;br /&gt;          b. malignant&lt;br /&gt;          c. envy&lt;br /&gt;          d. tenfold &lt;/p&gt;   &lt;p&gt;ANALOGOUS&lt;br /&gt;          a. capable&lt;br /&gt;          b. culpable&lt;br /&gt;          c. &lt;i&gt;comparable&lt;/i&gt;&lt;br /&gt;          d. corporeal&lt;br /&gt; &lt;br /&gt;  ATTENUATE&lt;br /&gt;          a. appear&lt;br /&gt;          b. &lt;i&gt;weaken&lt;/i&gt;&lt;br /&gt;          c. testify&lt;br /&gt;          d. soothe&lt;/p&gt;   &lt;/td&gt;   &lt;td style="padding: 0.75pt; width: 33%;" valign="top" width="33%"&gt;   &lt;p class="MsoNormal"&gt;EFFUSIVE&lt;br /&gt;         a. wise&lt;br /&gt;         b. reserved&lt;br /&gt;         c. peaceful&lt;br /&gt;         d. &lt;i&gt;spontaneous&lt;/i&gt; &lt;/p&gt;   &lt;p&gt;GREGARIOUS&lt;br /&gt;          a. logical&lt;br /&gt;          b. &lt;i&gt;helpful&lt;/i&gt;&lt;br /&gt;          c. solitary&lt;br /&gt;          d. noisy&lt;br /&gt; &lt;br /&gt;  EMPIRICAL&lt;br /&gt;         a. theoretical&lt;br /&gt;         b. &lt;i&gt;mathematical&lt;/i&gt;&lt;br /&gt;         c. verbal&lt;br /&gt;         d. royal&lt;/p&gt;   &lt;p&gt;CITE&lt;br /&gt;         a. galvanize&lt;br /&gt;         b. &lt;i&gt;quote&lt;/i&gt;&lt;br /&gt;         c. locate&lt;br /&gt;         d. visualize&lt;/p&gt;   &lt;p&gt;TENACIOUS&lt;br /&gt;         a. intentional&lt;br /&gt;         b. obnoxious&lt;br /&gt;         c. &lt;i&gt;holding fast&lt;/i&gt;&lt;br /&gt;         d. collecting&lt;br /&gt; &lt;br /&gt;  TRANSIENT&lt;br /&gt;         a. &lt;i&gt;ephemeral&lt;/i&gt;&lt;br /&gt;         b. permanent&lt;br /&gt;         c. clear&lt;br /&gt;         d. emptiness&lt;br /&gt; &lt;br /&gt;  VOLUBLE&lt;br /&gt;         a. worthwhile&lt;br /&gt;         b. &lt;i&gt;loquacious&lt;/i&gt;&lt;br /&gt;         c. circular&lt;br /&gt;         d. serious&lt;/p&gt;   &lt;p&gt;CANDID&lt;br /&gt;         a. vague&lt;br /&gt;         b. &lt;i&gt;outspoken&lt;/i&gt;&lt;br /&gt;         c. experienced&lt;br /&gt;         d. anxious&lt;/p&gt;   &lt;p&gt;VERACITY&lt;br /&gt;           a.&lt;br /&gt;           b.&lt;br /&gt;           c. &lt;i&gt;truthfullness&lt;/i&gt;&lt;br /&gt;           d. &lt;/p&gt;   &lt;p&gt;STANDING&lt;br /&gt;           a. reputation&lt;br /&gt;           b. activity&lt;br /&gt;           c. long time&lt;br /&gt;           d. &lt;i&gt;duration&lt;/i&gt;&lt;/p&gt;   &lt;/td&gt;   &lt;td style="padding: 0.75pt; width: 34%;" valign="top" width="34%"&gt;   &lt;p class="MsoNormal"&gt;SACROSANCT&lt;br /&gt;           a. &lt;i&gt;too important&lt;/i&gt;&lt;br /&gt;           b. worship&lt;br /&gt;           c. sacrifice&lt;br /&gt;           d. best&lt;/p&gt;&lt;p class="MsoNormal"&gt;&lt;br /&gt;&lt;/p&gt;&lt;p class="MsoNormal"&gt;   AUGMENT&lt;br /&gt;          a. decrease&lt;br /&gt;          b. belittle&lt;br /&gt;          c. simplify&lt;br /&gt;          d. &lt;i&gt;magnify&lt;/i&gt;&lt;br /&gt; &lt;br /&gt;  GENERIC&lt;br /&gt;          a. external&lt;br /&gt;          b. particular&lt;br /&gt;          c. personal&lt;br /&gt;          d. subdued &lt;/p&gt;   &lt;p&gt;DIVULGE&lt;br /&gt;          a. look&lt;br /&gt;          b. refuse&lt;br /&gt;          c. deride&lt;br /&gt;          d. &lt;i&gt;reveal&lt;/i&gt;&lt;/p&gt;   &lt;p&gt;EFFIGY&lt;br /&gt;          a. &lt;i&gt;dummy&lt;/i&gt;&lt;br /&gt;          b. organ&lt;br /&gt;          c. charge&lt;br /&gt;          d. accordion&lt;br /&gt; &lt;br /&gt;  PRECARIOUS&lt;br /&gt;          a. &lt;i&gt;hazardous&lt;/i&gt;&lt;br /&gt;          b. priceless&lt;br /&gt;          c. premature&lt;br /&gt;          d. primitive&lt;br /&gt; &lt;br /&gt;  SONOROUS&lt;br /&gt;          a. reassuring&lt;br /&gt;          b. &lt;i&gt;resonant&lt;/i&gt;&lt;br /&gt;          c. repetitive&lt;br /&gt;          d. sisterly&lt;/p&gt;   &lt;p&gt;CIRCUITOUS&lt;br /&gt;          a. &lt;i&gt;indirect&lt;/i&gt;&lt;br /&gt;          b. complete&lt;br /&gt;          c. obvious&lt;br /&gt;          d. aware&lt;/p&gt;   &lt;p&gt;PEDIGREE&lt;br /&gt;           a. dogs&lt;br /&gt;           b. vast&lt;br /&gt;           c. courage&lt;br /&gt;           d. &lt;i&gt;line of ancestry&lt;/i&gt;&lt;/p&gt;   &lt;/td&gt;  &lt;/tr&gt; &lt;/tbody&gt;&lt;/table&gt;  &lt;/div&gt;  &lt;p style="text-align: center;" align="center"&gt;&lt;u&gt;&lt;span style="font-family: Arial;"&gt;ANTONYMS:&lt;/span&gt;&lt;/u&gt;&lt;/p&gt;  &lt;table class="MsoNormalTable" style="width: 100%;" border="0" cellpadding="0" width="100%"&gt;  &lt;tbody&gt;&lt;tr style=""&gt;   &lt;td style="padding: 0.75pt; width: 33%;" valign="top" width="33%"&gt;   &lt;p class="MsoNormal"&gt;EXPEDIENT&lt;br /&gt;          a. illiterate&lt;br /&gt;          b. delayed&lt;br /&gt;          c. &lt;i&gt;mistake&lt;/i&gt;&lt;br /&gt;          d. impediment &lt;/p&gt;   &lt;p&gt;IRRADIATE&lt;br /&gt;           a. agreement&lt;br /&gt;           b. distance&lt;br /&gt;           c. flight&lt;br /&gt;           d. clarity&lt;br /&gt; &lt;br /&gt;  ANOMALY&lt;br /&gt;           a. desperation&lt;br /&gt;           b. requisition&lt;br /&gt;           c. registry&lt;br /&gt;           d. &lt;i&gt;regularity&lt;/i&gt;&lt;br /&gt; &lt;br /&gt;  BENIGN&lt;br /&gt;           a. peaceful&lt;br /&gt;           b. blessed&lt;br /&gt;           c. wavering&lt;br /&gt;           d. &lt;i&gt;malignant&lt;/i&gt;&lt;br /&gt; &lt;br /&gt;  ANALOGUE&lt;br /&gt;           a. same&lt;br /&gt;           b. &lt;i&gt;digital&lt;/i&gt;&lt;br /&gt;           c. lengthy&lt;br /&gt;           d. dull&lt;br /&gt; &lt;br /&gt;  ANALOGOUS&lt;br /&gt;           a.&lt;i&gt; not comparable&lt;/i&gt;&lt;br /&gt;           b. not capable&lt;br /&gt;           c. not culpable&lt;br /&gt;          d. not congenial&lt;br /&gt; &lt;br /&gt;  CENSURE&lt;br /&gt;          a. process&lt;br /&gt;          b. enclose&lt;br /&gt;          c. &lt;i&gt;praise&lt;/i&gt;&lt;br /&gt;          d. penetrate&lt;/p&gt;   &lt;p&gt;DIVULGE&lt;br /&gt;         a. converge&lt;br /&gt;         b. intake&lt;br /&gt;         c. involve&lt;br /&gt;         d. &lt;i&gt;conceal&lt;/i&gt;&lt;/p&gt;   &lt;p&gt;SURVEILLANCE&lt;br /&gt;          a. &lt;i&gt;inattention&lt;/i&gt;&lt;br /&gt;          b. visibility&lt;br /&gt;          c. census&lt;br /&gt;          d. prevention &lt;/p&gt;   &lt;p&gt;&lt;span style="" lang="SV"&gt;HAMPER&lt;br /&gt;           a.&lt;br /&gt;           b.&lt;br /&gt;           c.&lt;br /&gt;           d.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;   &lt;/td&gt;   &lt;td style="padding: 0.75pt; width: 33%;" valign="top" width="33%"&gt;   &lt;p class="MsoNormal"&gt;DANGLE&lt;br /&gt;           a. hanging&lt;br /&gt;           b. loose&lt;br /&gt;           c. &lt;i&gt;secure&lt;/i&gt;&lt;br /&gt;           d. mingle&lt;br /&gt; &lt;br /&gt;  SPENDTHRIFT&lt;br /&gt;           a. &lt;i&gt;miser&lt;/i&gt;&lt;br /&gt;           b. savings&lt;br /&gt;           c. cautious&lt;br /&gt;           d. extravagant &lt;/p&gt;   &lt;p&gt;&lt;span style="" lang="DE"&gt;INDIGENOUS&lt;br /&gt;           a.&lt;br /&gt;           b.&lt;br /&gt;           c.&lt;br /&gt;           d. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;   &lt;p&gt;CRYPTIC&lt;br /&gt;           a. futile&lt;br /&gt;           b. famous&lt;br /&gt;           c. &lt;i&gt;candid&lt;/i&gt;&lt;br /&gt;           d. indifferent&lt;/p&gt;   &lt;p&gt;OPTIMUM&lt;br /&gt;           a. pessimistic&lt;br /&gt;           b. minimum&lt;br /&gt;           c. chosen&lt;br /&gt;           d. &lt;i&gt;worst&lt;/i&gt;&lt;br /&gt; &lt;br /&gt;  RETROGRADE&lt;br /&gt;           a. &lt;i&gt;progressing&lt;/i&gt;&lt;br /&gt;           b. inclining&lt;br /&gt;           c. evaluating&lt;br /&gt;           d. concentrating&lt;br /&gt; &lt;br /&gt;  TRANSIENT&lt;br /&gt;           a. carried&lt;br /&gt;           b. close&lt;br /&gt;           c. &lt;i&gt;permanent&lt;/i&gt;&lt;br /&gt;           d. certain&lt;br /&gt; &lt;br /&gt;  VERITY&lt;br /&gt;           a. &lt;i&gt;falsehood&lt;/i&gt;&lt;br /&gt;           b. sanctity&lt;br /&gt;           c. rarity&lt;br /&gt;           d. household&lt;br /&gt; &lt;br /&gt;  CENSURE&lt;br /&gt;           a. augment&lt;br /&gt;           b. eradicate&lt;br /&gt;           c. enthrall&lt;br /&gt;           d. &lt;i&gt;commend&lt;/i&gt;&lt;/p&gt;   &lt;p&gt;EMPIRICAL&lt;br /&gt;         a. &lt;i&gt;theoretical&lt;/i&gt;&lt;br /&gt;         b. mathematical&lt;br /&gt;         c. verbal&lt;br /&gt;         d. royal&lt;/p&gt;   &lt;/td&gt;   &lt;td style="padding: 0.75pt; width: 34%;" valign="top" width="34%"&gt;   &lt;p class="MsoNormal"&gt;AUGMENT&lt;br /&gt;           a. keep away&lt;br /&gt;           b. be disturbed&lt;br /&gt;           c. &lt;i&gt;to increase&lt;/i&gt;&lt;br /&gt;           d. dig out&lt;br /&gt; &lt;br /&gt;  BOLSTER&lt;br /&gt;           a. defeat&lt;br /&gt;           b. &lt;i&gt;to strengthen&lt;/i&gt;&lt;br /&gt;           c. be angry&lt;br /&gt;           d. depth &lt;/p&gt;   &lt;p&gt;COMPLIANCE&lt;br /&gt;           a. light&lt;br /&gt;           b. fresh&lt;br /&gt;           c. take away&lt;br /&gt;           d. energize&lt;/p&gt;   &lt;p&gt;DEBILITATE&lt;br /&gt;           a. &lt;i&gt;balmy&lt;/i&gt;&lt;br /&gt;           b. bedevil&lt;br /&gt;           c. animate&lt;br /&gt;           d. deaden&lt;/p&gt;   &lt;p&gt;DEROGATORY&lt;br /&gt;           a. roguish&lt;br /&gt;           b. immediate&lt;br /&gt;           c. conferred&lt;br /&gt;           d. &lt;i&gt;praising&lt;/i&gt;&lt;br /&gt; &lt;br /&gt;  ERRONEOUS&lt;br /&gt;           a. &lt;i&gt;accurate&lt;/i&gt;&lt;br /&gt;           b. dignified&lt;br /&gt;           c. curious&lt;br /&gt;           d. abrupt&lt;br /&gt; &lt;br /&gt;  EXONERATE&lt;br /&gt;           a. forge&lt;br /&gt;           b. &lt;i&gt;accuse&lt;/i&gt;&lt;br /&gt;           c. record&lt;br /&gt;           d. reimburse&lt;br /&gt; &lt;br /&gt;  GREGARIOUS&lt;br /&gt;           a. anticipating&lt;br /&gt;           b. glorious&lt;br /&gt;           c. &lt;i&gt;antisocial&lt;/i&gt;&lt;br /&gt;           d. similar&lt;br /&gt; &lt;br /&gt;  OBJECTIVE&lt;br /&gt;           a. indecisive&lt;br /&gt;           b. apathetic&lt;br /&gt;           c. &lt;i&gt;emotionally involved&lt;/i&gt;&lt;br /&gt;           d. authoritative&lt;/p&gt;   &lt;/td&gt;  &lt;/tr&gt; &lt;/tbody&gt;&lt;/table&gt; &lt;br /&gt;&lt;span style=""&gt;&lt;span style="font-size:130%;"&gt;&lt;span style="font-weight: bold;"&gt;Synonyms:-&lt;br /&gt;&lt;br /&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;  &lt;div align="center"&gt;  &lt;table class="MsoNormalTable" style="width: 100%;" border="0" cellpadding="0" width="100%"&gt;  &lt;tbody&gt;&lt;tr style=""&gt;   &lt;td style="padding: 0.75pt; width: 33%;" width="33%"&gt;   &lt;p class="MsoNormal"&gt;ACUMEN&lt;br /&gt;               a.   exactness&lt;br /&gt;               b.   potential&lt;br /&gt;               c. &lt;b&gt;&lt;i&gt;shrewdness&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;               d.   bluntness&lt;br /&gt;               e.   None of these &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;   &lt;p&gt;BEHEST&lt;br /&gt;              a.   behavior&lt;br /&gt;              b. &lt;b&gt;&lt;i&gt;hold   down&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;              c. hold up&lt;br /&gt;              d. relieve&lt;br /&gt;              e. condemn&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;   &lt;p&gt;DISCRETION&lt;br /&gt;               a. &lt;b&gt;&lt;i&gt;prudence&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;               b.   consistency&lt;br /&gt;               c.   precipice&lt;br /&gt;               d.   disturbance&lt;br /&gt;               e.   distemper&lt;br /&gt; &lt;br /&gt;  ORDAIN&lt;br /&gt;               a.   arrange&lt;br /&gt;               b. &lt;b&gt;&lt;i&gt;command&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;               c.   contribute&lt;br /&gt;               d.   establish&lt;br /&gt;               e.   control&lt;br /&gt; &lt;br /&gt;  FLORID&lt;br /&gt;               a. &lt;b&gt;&lt;i&gt;ornate&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;               b.   thriving&lt;br /&gt;               c.   artistic&lt;br /&gt;               d.   elegant&lt;br /&gt;               e.   None of these&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;   &lt;p&gt;PENITENCE&lt;br /&gt;               a.   liking&lt;br /&gt;               b. insightful&lt;br /&gt;               c.   attractive&lt;br /&gt;               d.   penetrable&lt;br /&gt;               e. &lt;b&gt;&lt;i&gt;compunction&lt;/i&gt;&lt;/b&gt;&lt;br /&gt; &lt;br /&gt;  WHET&lt;br /&gt;               a. &lt;b&gt;&lt;i&gt;stimulate&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;               b.   humorous&lt;br /&gt;               c.   inculate&lt;br /&gt;               d.   dampen&lt;br /&gt;               e.   None of these&lt;br /&gt; &lt;br /&gt;  INCENTIVE&lt;br /&gt;               a.   reflex&lt;br /&gt;               b.   amplitude&lt;br /&gt;               c.   inflection&lt;br /&gt;               d. &lt;b&gt;&lt;i&gt;provocation&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;               e.   escutcheon&lt;br /&gt; &lt;br /&gt;  LATITUDE&lt;br /&gt;               a. &lt;b&gt;&lt;i&gt;scope&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;               b.   segment&lt;br /&gt;               c.   globule&lt;br /&gt;               d.   legislature&lt;br /&gt;               e.   lamentation&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;   &lt;/td&gt;   &lt;td style="padding: 0.75pt; width: 33%;" width="33%"&gt;   &lt;p class="MsoNormal"&gt;MORTIFY&lt;br /&gt;             a. make a cavity&lt;br /&gt;             b. displease&lt;br /&gt;             c. &lt;b&gt;&lt;i&gt;humiliate&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;             d. relapse&lt;br /&gt;             e. murder&lt;br /&gt; &lt;br /&gt;  ADAGE&lt;br /&gt;             a. advice&lt;br /&gt;             b. &lt;b&gt;&lt;i&gt;proverb&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;             c. enlargement&lt;br /&gt;             d. advantage&lt;br /&gt;             e. usage&lt;br /&gt; &lt;br /&gt;  TO DISPEL&lt;br /&gt;             a. &lt;b&gt;&lt;i&gt;to   dissipate&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;             b. to dissent&lt;br /&gt;             c. to distort&lt;br /&gt;             d. to disfigure&lt;br /&gt;             e. to dissect &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;   &lt;p&gt;ERRATIC&lt;br /&gt;             a. unromantic&lt;br /&gt;             b. free&lt;br /&gt;             c. popular&lt;br /&gt;             d. steady&lt;br /&gt;             e. &lt;b&gt;&lt;i&gt;unknown&lt;/i&gt;&lt;/b&gt;&lt;br /&gt; &lt;br /&gt;  TO MERIT&lt;br /&gt;             a. to embrace&lt;br /&gt;             b. to devote&lt;br /&gt;             c. &lt;b&gt;&lt;i&gt;to   deserve&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;             d. to combine&lt;br /&gt;             e. to display&lt;br /&gt; &lt;br /&gt;  RAPT&lt;br /&gt;             a. lively&lt;br /&gt;             b. &lt;b&gt;&lt;i&gt;concealed&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;             c. engrossed&lt;br /&gt;             d. prototype&lt;br /&gt;             e. None of these&lt;br /&gt; &lt;br /&gt;  TO HEAP&lt;br /&gt;             a. &lt;b&gt;&lt;i&gt;to pile&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;             b. to forbid&lt;br /&gt;             c. to proceed&lt;br /&gt;             d. to share&lt;br /&gt;             e. to stoop&lt;br /&gt; &lt;br /&gt;  CAJOLE&lt;br /&gt;             a. &lt;b&gt;&lt;i&gt;coax&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;             b. motivate&lt;br /&gt;             c. profound&lt;br /&gt;             d. mollify&lt;br /&gt;             e. evade&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;   &lt;p&gt;OVULATE&lt;br /&gt;             a. penury&lt;br /&gt;             b. immunize&lt;br /&gt;             c. &lt;b&gt;&lt;i&gt;fertilize&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;             d. reproduce&lt;br /&gt;             e. incisions&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;   &lt;/td&gt;   &lt;td style="padding: 0.75pt; width: 34%;" width="34%"&gt;   &lt;p class="MsoNormal"&gt;ABODE&lt;br /&gt;               a.   clay&lt;br /&gt;               b.   obstacle&lt;br /&gt;               c. &lt;b&gt;&lt;i&gt;dwelling&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;               d.   bind&lt;br /&gt;               e.   to beguile&lt;br /&gt; &lt;br /&gt;  POTENTIAL&lt;br /&gt;               a. &lt;b&gt;&lt;i&gt;latent&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;               b.   hysterical&lt;br /&gt;               c.   conventional&lt;br /&gt;               d.   symmetrical&lt;br /&gt;               e.   conscientious&lt;br /&gt; &lt;br /&gt;  EXTRICATE&lt;br /&gt;               a.   terminate&lt;br /&gt;               b.   isolate&lt;br /&gt;               c. &lt;b&gt;&lt;i&gt;liberate&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;               d.   simplify&lt;br /&gt;               e.   frustrate&lt;br /&gt; &lt;br /&gt;  DISPARITY&lt;br /&gt;               a. &lt;b&gt;&lt;i&gt;inequality&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;               b.   impartiality&lt;br /&gt;               c.   unfairness&lt;br /&gt;               d.   twist&lt;br /&gt;               e.   None of these&lt;br /&gt; &lt;br /&gt;  TO CONFISCATE&lt;br /&gt;               a.   to harass&lt;br /&gt;               b.   to repulse&lt;br /&gt;               c.   to console&lt;br /&gt;               d. &lt;b&gt;&lt;i&gt;to   appropriate&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;               e.   to congregate &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;   &lt;p&gt;PIOUS&lt;br /&gt;               a.   historic&lt;br /&gt;               b. &lt;b&gt;&lt;i&gt;devout&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;               c.   multiple&lt;br /&gt;               d.   fortunate&lt;br /&gt;               e.   authoritative&lt;br /&gt; &lt;br /&gt;  LETHARGY&lt;br /&gt;               a.   reminiscence&lt;br /&gt;               b.   category&lt;br /&gt;               c.   fallacy&lt;br /&gt;               d.   unanimity&lt;br /&gt;               e. &lt;b&gt;&lt;i&gt;stupor&lt;/i&gt;&lt;/b&gt;&lt;br /&gt; &lt;br /&gt;  CARGO&lt;br /&gt;               a.   cabbage&lt;br /&gt;               b.   camel&lt;br /&gt;               c.   lance&lt;br /&gt;               d. &lt;b&gt;&lt;i&gt;freight&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;               e.   flax&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;   &lt;p&gt;OVATION&lt;br /&gt;               a.   oration&lt;br /&gt;               b.   gesture&lt;br /&gt;               c.   emulation&lt;br /&gt;               d. &lt;b&gt;&lt;i&gt;applause&lt;/i&gt;&lt;/b&gt;&lt;br /&gt;               e.   nourish&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;   &lt;p&gt; &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;   &lt;/td&gt;  &lt;/tr&gt; &lt;/tbody&gt;&lt;/table&gt;  &lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114411698834191636?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114411698834191636/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114411698834191636' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114411698834191636'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114411698834191636'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/verbal-test-questions-i.html' title='Verbal Test Questions - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114407463704395495</id><published>2006-04-03T19:52:00.000+05:30</published><updated>2006-04-03T20:00:37.070+05:30</updated><title type='text'>Good CS Interview Questions</title><content type='html'>&lt;ol style="text-align: justify;"&gt;&lt;li&gt; There is a village of wizards and a village of dwarves.  Once a year, the wizards go over to the village of dwarves and line all the dwarves up in increasing height order, such that each dwarf can only see the dwarves smaller than himself.  The wizards have an infinite supply of white and black hats.  They place either a white or black hat on the head of each dwarf.  Then, starting with the tallest dwarf (in the back of the line), they ask each what color hat he is wearing.  If the dwarf answers incorrectly, the wizards kill him (the other dwarves can hear his answer, but can't tell if he was killed or not).  What strategy can the dwarves use to minimize the number of dwarves that are killed?  What is the most number of dwarves that will be killed using this optimal strategy?  &lt;/li&gt;&lt;li&gt; Consider a two-player game played on a circular table of unspecified diameter.  Each player has an infinite supply of quarters, and take turns placing a quarter on the table such that it is completely on the table and does not overlap with any other quarters already played.  A player wins if he makes the last legal move.  Which player (if any) has a strategy that will guarantee a win, and what is that strategy?  &lt;/li&gt;&lt;li&gt; How do you reverse the order of the words (not the characters) in a string of length &lt;tt&gt;n&lt;/tt&gt; in with constant extra space in linear time?  &lt;/li&gt;&lt;li&gt; How do you rotate a string of length &lt;tt&gt;n&lt;/tt&gt; by &lt;tt&gt;m&lt;/tt&gt; characters with constant extra space in linear time (wrt &lt;tt&gt;n&lt;/tt&gt;)?  &lt;/li&gt;&lt;li&gt; Consider a rectangular cake with a rectangular section (of any size or orientation) removed from it.  How do you divide the cake exactly in half with only one cut? (&lt;b&gt;solution&lt;/b&gt;) &lt;/li&gt;&lt;li&gt; You have a bar of chocolate that consists of &lt;tt&gt;n x m&lt;/tt&gt; square blocks.  If you can only break one piece at a time, how many breaks are necessary to break the original &lt;tt&gt;n x m&lt;/tt&gt; piece into &lt;tt&gt;n*m 1 x 1&lt;/tt&gt; pieces?  How many are sufficient?  &lt;/li&gt;&lt;li&gt; How do you quickly count the number of set bits in a 32-bit integer in linear time (with respect to the number of set bits)?  In constant time?  &lt;/li&gt;&lt;li&gt; Given an array of size &lt;tt&gt;N&lt;/tt&gt; that contains values between 1 and &lt;tt&gt;N-1&lt;/tt&gt;, find the duplicate element (assuming there is only one).  If it contains values between 1 and &lt;tt&gt;N+1&lt;/tt&gt;, how would you find the missing element (again assuming there is only one missing)?  Do each in O(N).  &lt;/li&gt;&lt;li&gt; Give a one-line C expression to test whether an unsigned int is a power of two.  &lt;/li&gt;&lt;li&gt; How many points are there on the globe where by walking one mile south, one mile east and one mile north you reach the place where you started?  &lt;/li&gt;&lt;li&gt; Given a singly linked list, determine whether it contains a loop or not.  &lt;/li&gt;&lt;li&gt; Every day, Joe arrives at the train station from work at 6pm.  His wife leaves home in her car to meet him there at exactly 6pm, and drives him home.  One day, Joe gets to the station an hour early, and starts walking home, until his wife meets him on the road.  They get home 20 minutes earlier than usual.  How long was he walking?  Distances are unspecified.  Speeds are unspecified, but constant.  &lt;/li&gt;&lt;li&gt; How do you divide a cake among &lt;tt&gt;n&lt;/tt&gt; people, maximizing fairness?  &lt;/li&gt;&lt;li&gt; In your cellar there are three light switches in the OFF position. Each switch controls one of three light bulbs on floor above. You may move any of the switches but you may only go upstairs to inspect the bulbs one time.  How can you determine the switch for each bulb with one inspection?  &lt;/li&gt;&lt;li&gt; Alice and Bob are on separate islands.  Bob is sick, and Alice has the medicine.  Eve has a boat and a chest that can be locked.  She is willing to transport objects between Alice and Bob, but only in the chest, and if the chest is unlocked, she will steal whatever is inside.  If both Alice and Bob have a padlock and a key such that their own key only opens their own lock, how can Alice send Bob the medicine so that Eve won't steal it?  &lt;/li&gt;&lt;li&gt; Write some code to convert a positive integer into base minus 2.  That is, whereas base 2 has a 1's place, a 2's place, a 4's place, etc., base minus 2 has a 1's place, a minus 2's place, a 4's place, a minus 8's place, ... (-2)^n. &lt;/li&gt;&lt;li&gt; A couple invites &lt;tt&gt;n-1&lt;/tt&gt; other couples to dinner.  Once everyone arrives, each person shakes hands with everyone he doesn't know.  Then, the host asks everyone how many hands they shook, and each person replies with a different number. Assuming that everyone knows his or her own spouse, how many hands did the hostess shake?  &lt;/li&gt;&lt;li&gt; Two robots start at different places on the same linear track. What one program can you give to both robots to guarantee that they meet? The the program may consist only of the instructions &lt;tt&gt;move_left n, move_right n&lt;/tt&gt; (where &lt;tt&gt;n&lt;/tt&gt; is the number of spaces to move), &lt;tt&gt;if&lt;/tt&gt; statements &lt;tt&gt;while&lt;/tt&gt; loops, and the boolean values &lt;tt&gt;at_own_start&lt;/tt&gt; and &lt;tt&gt;at_other_robots_start&lt;/tt&gt; (note that you can't use other variables or counters).  &lt;/li&gt;&lt;li&gt; Which offer is better and why? &lt;ol&gt;&lt;li&gt;You are to make a statement.  If the statement is true, you get exactly $10.  If the statement is false, you get either less than or more than $10 but not exactly $10. &lt;/li&gt;&lt;li&gt;You are to make a statement.  Regardless of whether the statement is true or false, you get more than $10. &lt;/li&gt;&lt;/ol&gt; &lt;/li&gt;&lt;li&gt; You have two ropes and a box of matches.  Each rope takes exactly one hour to burn, but they may not necessarily burn evenly -- i.e., the first half might burn in the first 10 minutes and the second in the remaining 50). How can you measure out 45 minutes by just using these two ropes?  &lt;/li&gt;&lt;li&gt; Consider three identical airplanes starting at the same airport.  Each plane has a fuel tank that holds just enough fuel to allow the plane to travel half the distance around the world.  These airplanes possess the special ability to transfer fuel between their tanks in mid-flight.  Devise a scheme that will allow one airplane to travel all the way around the world, landing only at the original airport.  &lt;/li&gt;&lt;li&gt; You are at the bottom of the elevator shaft of a 100 story building.  You see 21 wires labelled 1...21.  The wires go up to the 100th floor where the ends are labelled A...U, but you don't know how they correspond to the ends at the bottom.  You have a battery, a light bulb, and many small wires.  How can you determine the pairing between the numbers and letters by only making one trip to the 100th floor and back down?  &lt;/li&gt;&lt;li&gt; A woman starts paddling upstream in a canoe, and after one mile, encounters a log floating with the current.  She continues to paddle upstream for onehour, then turns around and paddles downstream, until she returns to the dock where she started.  If the woman and the log reach the dock at exactly the same time, how fast was the current flowing?  Assume all speeds are constant.  &lt;/li&gt;&lt;li&gt; Consider a centrifuge with 12 slots for test tubes.  When you use a centrifuge, the tubes must be placed in the slots so that they are radially balanced (we can assume all tubes have the same mass).  For example, for 3 tubes, you would place them in slots 4, 8 and 12.  How can you place exactly 5 tubes in the centrifuge so that they are radially balanced?  &lt;/li&gt;&lt;li&gt; You are on a strict medical regimen that requires you to take two types of pills each day.  You must take exactly one A pill and exactly one B pill at the same time.  The pills are very expensive, and you don't want to waste any.  So you open the bottle of A pills, and tap one out into your hand.  Then you open the bottle of B pills and do the same thing -- but you make a mistake, and two B pills come out into your hand with the A pill.  But the pills are all exactly identical.  There is no way to tell A pills apart from B pills.  How can you satisfy your regimen and take exactly one of each pill at the same time, without wasting any pills?  &lt;/li&gt;&lt;li&gt; Write an algorithm to find a given element in an n by n matrix where the rows and columns are monotonically increasing.  &lt;/li&gt;&lt;li&gt; General Alice and General Bob, commanders of  the allied armies A and B, respectively, are camped in the mountains on either side of a valley.  Alice and Bob would like to attack enemy army C, camped in the valley below.  Army A by itself is unable to defeat army C, as is army B, but a coordinated attack by A and B at the same time will secure a victory for Alice and Bob.  However, the only way Alice and Bob can communicate is by sending messengers through the valley, who may or may not get captured en route by the enemy army C.  Is there an algorithm by which Alice and Bob can coordinate an attack on army C so as to secure their victory?  &lt;/li&gt;&lt;li&gt; Consider a circular race track with &lt;tt&gt;n&lt;/tt&gt; gas stations spaced along it, each containing a fixed amount of gas.  You are given an array containing the distances between consecutive gas stations and an array containing the amount of gas at each. Suppose the total amount of gas at all the gas stations is the same as the number of miles around the race track.  Your car gets one mile to the gallon, but its gas tank has an unlimited capacity.  Where do you start your car along the race track to guarantee that you get all the way around without running out of gas?  Do this in O(&lt;tt&gt;n&lt;/tt&gt;) time.  &lt;/li&gt;&lt;li&gt; Given an array of &lt;tt&gt;n&lt;/tt&gt; integers, find all Pythagorean triples in the array, that is, three elements such that a&lt;sup&gt;2&lt;/sup&gt; + b&lt;sup&gt;2&lt;/sup&gt; = c&lt;sup&gt;2&lt;/sup&gt;.  Do this in O(&lt;tt&gt;n&lt;/tt&gt;&lt;sup&gt;2&lt;/sup&gt;) time.  &lt;/li&gt;&lt;li&gt; You are on a spaceship that has a computer with &lt;tt&gt;n&lt;/tt&gt; processors.  Suddenly, the spaceship gets hit with an alien laser beam, and some of the processors are damaged.  However, you know that &lt;i&gt;more than half&lt;/i&gt; of the processors are still good.  You can ask one processor whether it thinks another processor is good or bad.  A good processor will always tell the truth, but a bad one will always lie.  A 'step' consists of asking one processor if it thinks another processor is good or bad.  Find one good processor, only using &lt;tt&gt;n&lt;/tt&gt;-2 steps.  &lt;/li&gt;&lt;li&gt; Given an array of n integers, where one element appears more than n/2 times, find that element in linear time and constant extra space.   &lt;/li&gt;&lt;li&gt; A spinning disc is painted black on one half and white on the other (&lt;i&gt;i.e.&lt;/i&gt;, the line forming the border between the black and white regions of the disc is a diameter of the disc).   The disk is spinning on a turntable in an unknown direction at an unknown speed.  You have special video cameras that can observe the color of a single point on the disc.  How many cameras do you need to determine the direction the disc is spinning?   &lt;/li&gt;&lt;li&gt; Create an equilateral triangle using three toothpicks.  Now add three more equilateral triangles of the same size as the original using only three more toothpicks.     &lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114407463704395495?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114407463704395495/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114407463704395495' title='4 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114407463704395495'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114407463704395495'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/good-cs-interview-questions.html' title='Good CS Interview Questions'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>4</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114395008516309845</id><published>2006-04-02T09:23:00.000+05:30</published><updated>2006-04-04T04:57:01.566+05:30</updated><title type='text'>Linux Admin Interview Questions</title><content type='html'>&lt;ol style="text-align: justify;"&gt;&lt;li&gt;How do you take a single line of input from the user in a shell script?&lt;/li&gt;&lt;li&gt;Write a script to convert all DOS style backslashes to UNIX style slashes in a list of files.&lt;/li&gt;&lt;li&gt;Write a regular expression (or sed script) to replace all occurrences of the letter ‘f’, followed by any number of characters, followed by the letter ‘a’, followed by one or more numeric characters, followed by the letter ‘n’, and replace what’s found with the string “UNIX”.&lt;/li&gt;&lt;li&gt;Write a script to list all the differences between two directories.&lt;/li&gt;&lt;li&gt;Write a program in any language you choose, to reverse a file.&lt;/li&gt;&lt;li&gt;What are the fields of the password file?&lt;/li&gt;&lt;li&gt;What does a plus at the beginning of a line in the password file signify?&lt;/li&gt;&lt;li&gt;Using the man pages, find the correct ioctl to send console output to an arbitrary pty.&lt;/li&gt;&lt;li&gt;What is an MX record?&lt;/li&gt;&lt;li&gt;What is the prom command on a Sun that shows the SCSI devices?&lt;/li&gt;&lt;li&gt;What is the factory default SCSI target for /dev/sd0?&lt;/li&gt;&lt;li&gt;Where is that value controlled?&lt;/li&gt;&lt;li&gt;What happens to a child process that dies and has no parent process to wait for it and what’s bad about this?&lt;/li&gt;&lt;li&gt;What’s wrong with sendmail? What would you fix?&lt;/li&gt;&lt;li&gt;What command do you run to check file system consistency?&lt;/li&gt;&lt;li&gt;What’s wrong with running shutdown on a network?&lt;/li&gt;&lt;li&gt;What can be wrong with setuid scripts?&lt;/li&gt;&lt;li&gt;What value does spawn return?&lt;/li&gt;&lt;li&gt;Write a script to send mail from three other machines on the network to root at the machine you’re on. Use a ‘here doc’, but include in the mail message the name of the machine the mail is sent from and the disk utilization statistics on each machine?&lt;/li&gt;&lt;li&gt;Why can’t root just cd to someone’s home directory and run a program called a.out sitting there by typing “a.out”, and why is this good?&lt;/li&gt;&lt;li&gt;What is the difference between UDP and TCP?&lt;/li&gt;&lt;li&gt;What is DNS?&lt;/li&gt;&lt;li&gt;What does nslookup do?&lt;/li&gt;&lt;li&gt;How do you create a swapfile?&lt;/li&gt;&lt;li&gt;How would you check the route table on a workstation/server?&lt;/li&gt;&lt;li&gt;How do you find which ypmaster you are bound to?&lt;/li&gt;&lt;li&gt;How do you fix a problem where a printer will cutoff anything over 1MB?&lt;/li&gt;&lt;li&gt;What is the largest file system size in solaris? SunOS?&lt;/li&gt;&lt;li&gt;What are the different RAID levels?&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114395008516309845?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114395008516309845/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114395008516309845' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114395008516309845'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114395008516309845'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/linux-admin-interview-questions.html' title='Linux Admin Interview Questions'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114386809774701501</id><published>2006-04-01T10:26:00.000+05:30</published><updated>2006-04-01T10:38:17.776+05:30</updated><title type='text'>Questions from Code4Bill Contest</title><content type='html'>Here's a list of good CS-like interview questions that I have got from IITKGP LAN ... (thanx to dc++ p2p network .... ). These questions are in now way easy ... but these questions are worth trying&lt;br /&gt;&lt;ol&gt;&lt;li&gt;There is a village of wizards and a village of dwarves. Once a year, the wizards go over to the village of dwarves and line all the dwarves up in increasing height order, such that each dwarf can only see the dwarves smaller than himself. The wizards have an infinite supply of white and black hats. They place either a white or black hat on the head of each dwarf. Then, starting with the tallest dwarf (in the back of the line), they ask each what color hat he is wearing. If the dwarf answers incorrectly, the wizards kill him (the other dwarves can hear his answer, but can't tell if he was killed or not). What strategy can the dwarves use to minimize the number of dwarves that are killed? What is the most number of dwarves that will be killed using this optimal strategy?&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Consider a two-player game played on a circular table of unspecified diameter. Each player has an infinite supply of quarters, and take turns placing a quarter on the table such that it is completely on the table and does not overlap with any other quarters already played. A player wins if he makes the last legal move. Which player (if any) has a strategy that will guarantee a win, and what is that strategy?&lt;br /&gt;&lt;/li&gt;&lt;li&gt;How do you reverse the order of the words (not the characters) in a string of length n in with constant extra space in linear time?&lt;br /&gt;&lt;/li&gt;&lt;li&gt; How do you rotate a string of length n by m characters with constant extra space in linear time (wrt n)?&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Consider a rectangular cake with a rectangular section (of any size or orientation) removed from it. How do you divide the cake exactly in half with only one cut?&lt;br /&gt;&lt;/li&gt;&lt;li&gt;You have a bar of chocolate that consists of n x m square blocks. If you can only break one piece at a time, how many breaks are necessary to break the original n x m piece into n*m 1 x 1 pieces? How many are sufficient?&lt;/li&gt;&lt;li&gt;How do you quickly count the number of set bits in a 32-bit integer in linear time (with respect to the number of set bits)? In constant time?&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Given an array of size N that contains values between 1 and N-1, find the duplicate element (assuming there is only one). If it contains values between 1 and N+1, how would you find the missing element (again assuming there is only one missing)? Do each in O(N).&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Give a one-line C expression to test whether an unsigned int is a power of two. (solution)&lt;/li&gt;&lt;li&gt;How many points are there on the globe where by walking one mile south, one mile east and one mile north you reach the place where you started?&lt;/li&gt;&lt;li&gt;Given a singly linked list, determine whether it contains a loop or not. (solution)&lt;/li&gt;&lt;li&gt;  Every day, Joe arrives at the train station from work at 6pm. His wife leaves home in her car to meet him there at exactly 6pm, and drives him home. One day, Joe gets to the station an hour early, and starts walking home, until his wife meets him on the road. They get home 20 minutes earlier than usual. How long was he walking? Distances are unspecified. Speeds are unspecified, but constant. (solution)&lt;/li&gt;&lt;li&gt;  How do you divide a cake among n people, maximizing fairness? (solution)&lt;/li&gt;&lt;li&gt;  In your cellar there are three light switches in the OFF position. Each switch controls one of three light bulbs on floor above. You may move any of the switches but you may only go upstairs to inspect the bulbs one time. How can you determine the switch for each bulb with one inspection? (solution)&lt;/li&gt;&lt;li&gt;  Alice and Bob are on separate islands. Bob is sick, and Alice has the medicine. Eve has a boat and a chest that can be locked. She is willing to transport objects between Alice and Bob, but only in the chest, and if the chest is unlocked, she will steal whatever is inside. If both Alice and Bob have a padlock and a key such that their own key only opens their own lock, how can Alice send Bob the medicine so that Eve won't steal it? (solution)&lt;/li&gt;&lt;li&gt;  Write some code to convert a positive integer into base minus 2. That is, whereas base 2 has a 1's place, a 2's place, a 4's place, etc., base minus 2 has a 1's place, a minus 2's place, a 4's place, a minus 8's place, ... (-2)^n. (solution)&lt;/li&gt;&lt;li&gt;  A couple invites n-1 other couples to dinner. Once everyone arrives, each person shakes hands with everyone he doesn't know. Then, the host asks everyone how many hands they shook, and each person replies with a different number. Assuming that everyone knows his or her own spouse, how many hands did the hostess shake? (solution)&lt;/li&gt;&lt;li&gt;Two robots start at different places on the same linear track. What one program can you give to both robots to guarantee that they meet? The the program may consist only of the instructions move_left n, move_right n (where n is the number of spaces to move), if statements while loops, and the boolean values at_own_start and at_other_robots_start (note that you can't use other variables or counters). (solution)&lt;/li&gt;&lt;li&gt;Which offer is better and why? 1. You are to make a statement. If the statement is true, you get exactly $10. If the statement is false, you get either less than or more than $10 but not exactly $10. 2. You are to make a statement. Regardless of whether the statement is true or false, you get more than $10.&lt;br /&gt;&lt;/li&gt;&lt;li&gt;You have two ropes and a box of matches. Each rope takes exactly one hour to burn, but they may not necessarily burn evenly -- i.e., the first half might burn in the first 10 minutes and the second in the remaining 50). How can you measure out 45 minutes by just using these two ropes? (solution)&lt;/li&gt;&lt;li&gt;Consider three identical airplanes starting at the same airport. Each plane has a fuel tank that holds just enough fuel to allow the plane to travel half the distance around the world. These airplanes possess the special ability to transfer fuel between their tanks in mid-flight. Devise a scheme that will allow one airplane to travel all the way around the world, landing only at the original airport. (solution)&lt;/li&gt;&lt;li&gt;You are at the bottom of the elevator shaft of a 100 story building. You see 21 wires labelled 1...21. The wires go up to the 100th floor where the ends are labelled A...U, but you don't know how they correspond to the ends at the bottom. You have a battery, a light bulb, and many small wires. How can you determine the pairing between the numbers and letters by only making one trip to the 100th floor and back down? (solution).&lt;/li&gt;&lt;li&gt;A woman starts paddling upstream in a canoe, and after one mile, encounters a log floating with the current. She continues to paddle upstream for onehour, then turns around and paddles downstream, until she returns to the dock where she started. If the woman and the log reach the dock at exactly the same time, how fast was the current flowing? Assume all speeds are constant. (solution)&lt;/li&gt;&lt;li&gt; Consider a centrifuge with 12 slots for test tubes. When you use a centrifuge, the tubes must be placed in the slots so that they are radially balanced (we can assume all tubes have the same mass). For example, for 3 tubes, you would place them in slots 4, 8 and 12. How can you place exactly 5 tubes in the centrifuge so that they are radially balanced? (solution)&lt;/li&gt;&lt;li&gt;  You are on a strict medical regimen that requires you to take two types of pills each day. You must take exactly one A pill and exactly one B pill at the same time. The pills are very expensive, and you don't want to waste any. So you open the bottle of A pills, and tap one out into your hand. Then you open the bottle of B pills and do the same thing -- but you make a mistake, and two B pills come out into your hand with the A pill. But the pills are all exactly identical. There is no way to tell A pills apart from B pills. How can you satisfy your regimen and take exactly one of each pill at the same time, without wasting any pills? (solution)&lt;/li&gt;&lt;li&gt;  Write an algorithm to find a given element in an n by n matrix where the rows and columns are monotonically increasing. (solution)&lt;/li&gt;&lt;li&gt;  General Alice and General Bob, commanders of the allied armies A and B, respectively, are camped in the mountains on either side of a valley. Alice and Bob would like to attack enemy army C, camped in the valley below. Army A by itself is unable to defeat army C, as is army B, but a coordinated attack by A and B at the same time will secure a victory for Alice and Bob. However, the only way Alice and Bob can communicate is by sending messengers through the valley, who may or may not get captured en route by the enemy army C. Is there an algorithm by which Alice and Bob can coordinate an attack on army C so as to secure their victory? (solution)&lt;/li&gt;&lt;li&gt;  Consider a circular race track with n gas stations spaced along it, each containing a fixed amount of gas. You are given an array containing the distances between consecutive gas stations and an array containing the amount of gas at each. Suppose the total amount of gas at all the gas stations is the same as the number of miles around the race track. Your car gets one mile to the gallon, but its gas tank has an unlimited capacity. Where do you start your car along the race track to guarantee that you get all the way around without running out of gas? Do this in O(n) time. (solution)&lt;/li&gt;&lt;li&gt;  Given an array of n integers, find all Pythagorean triples in the array, that is, three elements such that a2 + b2 = c2. Do this in O(n2) time. (solution)&lt;/li&gt;&lt;li&gt;  You are on a spaceship that has a computer with n processors. Suddenly, the spaceship gets hit with an alien laser beam, and some of the processors are damaged. However, you know that more than half of the processors are still good. You can ask one processor whether it thinks another processor is good or bad. A good processor will always tell the truth, but a bad one will always lie. A 'step' consists of asking one processor if it thinks another processor is good or bad. Find one good processor, only using n-2 steps. (solution)&lt;/li&gt;&lt;li&gt;  Given an array of n integers, where one element appears more than n/2 times, find that element in linear time and constant extra space. (solution)&lt;/li&gt;&lt;li&gt;  A spinning disc is painted black on one half and white on the other (i.e., the line forming the border between the black and white regions of the disc is a diameter of the disc). The disk is spinning on a turntable in an unknown direction at an unknown speed. You have special video cameras that can observe the color of a single point on the disc. How many cameras do you need to determine the direction the disc is spinning? (solution)&lt;/li&gt;&lt;li&gt;  Create an equilateral triangle using three toothpicks. Now add three more equilateral triangles of the same size as the original using only three more toothpicks. (solution)&lt;/li&gt;&lt;li&gt;Imagine that you have 26 constants, labelled A through Z. Each constant is assigned a value in the following way: A = 1; the rest of the values equal their position in the alphabet (B corresponds to the second position so it equals 2, C = 3, etc.) raised to the power of the preceeding constant value. So, B = 2 ^ (A's value), or B = 2^1 = 2. C = 3^2 = 9. D = 4^9, etc., etc. Find the exact numerical value to the following equation: (X - A) * (X - B) * (X - C) * ... * (X - Y) * (X - Z)&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Write a routine that prints out a 2-D array in spiral order! &lt;/li&gt;&lt;li&gt;Write an efficient algo and C code to shuffle a pack of cards.. this one was a feedback process until we came up with one with no extra storage.&lt;/li&gt;&lt;li&gt;A real life problem - A square picture is cut into 16 sqaures and they are shuffled. Write a program to rearrange the 16 squares to get the original big square.&lt;/li&gt;&lt;li&gt;Consider the base -2 representation of numbers. (-2 instead of usual +2). Give the condition for a number represented in this form to be positive? Also, if P(A, B) is a function that takes two 0-1 strings A,B in this representation, when can we say that P(A,B) returns the sum of these two numbers?&lt;/li&gt;&lt;li&gt;Given an expression tree with no parentheses in it, write the program to give equivalent infix expression with parentheses inserted where necessary.&lt;/li&gt;&lt;li&gt;Given a maze with cheese at one place and a mouse at some entrance, write a program to direct the mouse to cheese correctly. (Assume there is a path). Following primitives are given: moveforward, turnright, turnleft, iswall?, ischeese?, eatcheese. &lt;/li&gt;&lt;li&gt;There are 4 men who want to cross a bridge. They all begin on the same side. You have 17 minutes to get all of them across to the other side. It is night. There is one flashlight. A maximum of two people can cross at one time. Any party who crosses, either 1 or 2 people, must have the flashlight with them. The flashlight must be walked back and forth, it cannot be thrown, etc. Each man walks at a different speed. A pair must walk together at the rate of the slower mans pace.&lt;br /&gt;Man 1:1 minute to cross&lt;br /&gt;Man 2: 2 minutes to cross&lt;br /&gt;Man 3: 5 minutes to cross&lt;br /&gt;Man 4: 10 minutes to cross&lt;br /&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114386809774701501?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114386809774701501/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114386809774701501' title='5 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114386809774701501'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114386809774701501'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/04/questions-from-code4bill-contest.html' title='Questions from Code4Bill Contest'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>5</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114377881368059000</id><published>2006-03-31T09:49:00.000+05:30</published><updated>2006-03-31T09:50:13.696+05:30</updated><title type='text'>Miscellaneous IT Questions - I</title><content type='html'>&lt;ol&gt;&lt;li&gt;What's the difference between SQL, DDL, and DML?  &lt;/li&gt;&lt;li&gt;What's a join? An inner join? An outer join?  &lt;/li&gt;&lt;li&gt;Describe HTTP.  &lt;/li&gt;&lt;li&gt;What's a design pattern?  &lt;/li&gt;&lt;li&gt;Can you explain the singleton, vistor, facade, or handle class design pattern?  &lt;/li&gt;&lt;li&gt;When you do an ls -l, describe in detail everything that comes up on the screen.  &lt;/li&gt;&lt;li&gt;Tell me three ways to find an IP address on a Unix box.  &lt;/li&gt;&lt;li&gt;Write a bubble sort.  &lt;/li&gt;&lt;li&gt;Write a linked list.  &lt;/li&gt;&lt;li&gt;Describe an object.  &lt;/li&gt;&lt;li&gt;What does object-oriented mean to you.  &lt;/li&gt;&lt;li&gt;Can you explain what a B tree is?  &lt;/li&gt;&lt;li&gt;What's the difference between UDP and TCP?  &lt;/li&gt;&lt;li&gt;What is ICMP?  &lt;/li&gt;&lt;li&gt;What's the difference between a stack and a Queue?  &lt;/li&gt;&lt;li&gt;Do you know anything about the protection rings in the PC architecture?  &lt;/li&gt;&lt;li&gt;How much hardware/Assembler/Computer Architecture experience do you have.  &lt;/li&gt;&lt;li&gt;Explain final, finalize, and finally. When the finalize is invoked? How does GC work? etc.  &lt;/li&gt;&lt;li&gt;What is your experience with Servlet and JSP?  &lt;/li&gt;&lt;li&gt;What is the Prototype design pattern?  &lt;/li&gt;&lt;li&gt;In a system that you are designing and developing, a lot of small changes are expected to be committed at the end of a method call (persisted to the DB). If you don't want to query the database frequently. what would you do?  &lt;/li&gt;&lt;li&gt;Give an example in which you will combine several design patterns, and explain how the system can benefit from that.  &lt;/li&gt;&lt;li&gt;Why would you apply design patterns (benefits)?  &lt;/li&gt;&lt;li&gt;What is a two-phase commit?  &lt;/li&gt;&lt;li&gt;What will happen if one of your web-server or appserver crashs during its execution?  &lt;/li&gt;&lt;li&gt;What are various problems unique to distributed databases   &lt;/li&gt;&lt;li&gt;Describe the file system layout in the UNIX OS   &lt;/li&gt;&lt;li&gt;what is disk interleaving  &lt;/li&gt;&lt;li&gt;why is disk interleaving adopted  &lt;/li&gt;&lt;li&gt;given a new disk, how do you determine which interleaving is the best  &lt;/li&gt;&lt;li&gt;give 1000 read operations with each kind of interleaving determine the best interleaving from the statistics  &lt;/li&gt;&lt;li&gt;draw the graph with performace on one axis and 'n' on another, where 'n' in the 'n' in n-way disk interleaving. (a tricky question, should be answered carefully)  &lt;/li&gt;&lt;li&gt;Design a memory management scheme.  &lt;/li&gt;&lt;li&gt;What sort of technique you would use to update a set of files over a network, where a server contains the master copy.&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114377881368059000?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114377881368059000/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114377881368059000' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114377881368059000'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114377881368059000'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/03/miscellaneous-it-questions-i.html' title='Miscellaneous IT Questions - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114372499503832646</id><published>2006-03-30T18:52:00.000+05:30</published><updated>2006-03-30T18:53:15.063+05:30</updated><title type='text'>C++ syntax, semantics and simple programming questions</title><content type='html'>&lt;ol&gt;&lt;li&gt;What is an object in C++?    &lt;/li&gt;&lt;li&gt;What is a message?    &lt;/li&gt;&lt;li&gt;What is a class?    &lt;/li&gt;&lt;li&gt;What is an instance?    &lt;/li&gt;&lt;li&gt;What is a super-class?    &lt;/li&gt;&lt;li&gt;What is inheritance?    &lt;/li&gt;&lt;li&gt;To what does message protocol refer?    &lt;/li&gt;&lt;li&gt;What is polymorphism?    &lt;/li&gt;&lt;li&gt;What are instance variables?    &lt;/li&gt;&lt;li&gt;What are class variables?    &lt;/li&gt;&lt;li&gt;What is a method?    &lt;/li&gt;&lt;li&gt;In C++ what is a constructor? A destructor?    &lt;/li&gt;&lt;li&gt;Compare and contrast C and C++.    &lt;/li&gt;&lt;li&gt;What is operator overloading?    &lt;/li&gt;&lt;li&gt;What is cin and cout?    &lt;/li&gt;&lt;li&gt;Contrast procedural and object oriented programming.    &lt;/li&gt;&lt;li&gt;How do you link a C++ program to C functions?    &lt;/li&gt;&lt;li&gt;Explain the scope resolution operator.    &lt;/li&gt;&lt;li&gt;What are the differences between a C++ struct and C++ class?    &lt;/li&gt;&lt;li&gt;How many ways are there to initialize an int with a constant?    &lt;/li&gt;&lt;li&gt;How does throwing and catching exceptions differ from using setjmp and longjmp?    &lt;/li&gt;&lt;li&gt;What is your reaction to this line of code? &lt;pre&gt;delete this;&lt;/pre&gt;    &lt;/li&gt;&lt;li&gt;What is a default constructor?    &lt;/li&gt;&lt;li&gt;What is a conversion constructor?    &lt;/li&gt;&lt;li&gt;What is the difference between a copy constructor and an overloaded assignment operator?    &lt;/li&gt;&lt;li&gt;When should you use multiple inheritance?    &lt;/li&gt;&lt;li&gt;What is a virtual destructor?    &lt;/li&gt;&lt;li&gt;Explain the ISA and HASA class relationships. How would you implement each in a class design?    &lt;/li&gt;&lt;li&gt;When is a template a better solution than a base class?    &lt;/li&gt;&lt;li&gt;What is the result of compiling this program in a C compiler? in a C++ compiler? &lt;pre&gt;int __ = 0;&lt;br /&gt;main() {&lt;br /&gt;int ___ = 2;&lt;br /&gt;printf("%d\n", ___ + __);&lt;br /&gt;}&lt;br /&gt;&lt;/pre&gt;    &lt;/li&gt;&lt;li&gt;What is the difference between C and C++ ? Would you prefer to use one over the other ?    &lt;/li&gt;&lt;li&gt;What are the access privileges in C++ ? What is the default access level ?    &lt;/li&gt;&lt;li&gt;What is data encapsulation ?    &lt;/li&gt;&lt;li&gt;What is inheritance ?    &lt;/li&gt;&lt;li&gt;What is multiple inheritance ? What are it's advantages and disadvantages ?    &lt;/li&gt;&lt;li&gt;What is  polymorphism?    &lt;/li&gt;&lt;li&gt;What do the keyword static and const signify ?    &lt;/li&gt;&lt;li&gt;How is memory allocated/deallocated in C ? How about C++ ?    &lt;/li&gt;&lt;li&gt;What is UML ?    &lt;/li&gt;&lt;li&gt;What is the difference between a shallow copy and a deep copy ?   &lt;/li&gt;&lt;li&gt;What are the differences between new and malloc?  &lt;/li&gt;&lt;li&gt;What is the difference between delete and delete[]?  &lt;/li&gt;&lt;li&gt;What are the differences between a struct in C and in C++?  &lt;/li&gt;&lt;li&gt;What are the advantages/disadvantages of using #define?  &lt;/li&gt;&lt;li&gt;What are the advantages/disadvantages of using inline and const?  &lt;/li&gt;&lt;li&gt;What is the difference between a pointer and a reference?  &lt;/li&gt;&lt;li&gt;When would you use a pointer? A reference?  &lt;/li&gt;&lt;li&gt;What does it mean to take the address of a reference?  &lt;/li&gt;&lt;li&gt;What does it mean to declare a function or variable as static?  &lt;/li&gt;&lt;li&gt;What is the order of initalization for data?  &lt;/li&gt;&lt;li&gt;What is name mangling/name decoration?  &lt;/li&gt;&lt;li&gt;What kind of problems does name mangling cause?  &lt;/li&gt;&lt;li&gt;How do you work around them?  &lt;/li&gt;&lt;li&gt;What is a class?  &lt;/li&gt;&lt;li&gt;What are the differences between a struct and a class in C++?  &lt;/li&gt;&lt;li&gt;What is the difference between public, private, and protected access?  &lt;/li&gt;&lt;li&gt;For class CFoo { }; what default methods will the compiler generate for you&gt;?  &lt;/li&gt;&lt;li&gt;How can you force the compiler to not generate them?  &lt;/li&gt;&lt;li&gt;What is the purpose of a constructor? Destructor?  &lt;/li&gt;&lt;li&gt;What is a constructor initializer list?  &lt;/li&gt;&lt;li&gt;When must you use a constructor initializer list?  &lt;/li&gt;&lt;li&gt;What is a: Constructor? Destructor? Default constructor? Copy constructor? Conversion constructor?  &lt;/li&gt;&lt;li&gt;What does it mean to declare a... member function as virtual? member function as static? member varible as static? destructor as static?  &lt;/li&gt;&lt;li&gt;Can you explain the term "resource acqusition is initialization?"  &lt;/li&gt;&lt;li&gt;What is a "pure virtual" member function?  &lt;/li&gt;&lt;li&gt;What is the difference between public, private, and protected inheritance?  &lt;/li&gt;&lt;li&gt;What is virtual inheritance?  &lt;/li&gt;&lt;li&gt;What is placement new?  &lt;/li&gt;&lt;li&gt;What is the difference between operator new and the new operator?  &lt;/li&gt;&lt;li&gt;What is exception handling?  &lt;/li&gt;&lt;li&gt;Explain what happens when an exception is thrown in C++.  &lt;/li&gt;&lt;li&gt;What happens if an exception is not caught?  &lt;/li&gt;&lt;li&gt;What happens if an exception is throws from an object's constructor?  &lt;/li&gt;&lt;li&gt;What happens if an exception is throws from an object's destructor?  &lt;/li&gt;&lt;li&gt;What are the costs and benefits of using exceptions?  &lt;/li&gt;&lt;li&gt;When would you choose to return an error code rather than throw an exception?  &lt;/li&gt;&lt;li&gt;What is a template?  &lt;/li&gt;&lt;li&gt;What is partial specialization or template specialization?  &lt;/li&gt;&lt;li&gt;How can you force instantiation of a template?  &lt;/li&gt;&lt;li&gt;What is an iterator?  &lt;/li&gt;&lt;li&gt;What is an algorithm (in terms of the STL/C++ standard library)?  &lt;/li&gt;&lt;li&gt;What is std::auto_ptr?  &lt;/li&gt;&lt;li&gt;What is wrong with this statement? std::auto_ptr ptr(new char[10]);   &lt;/li&gt;&lt;li&gt;It is possible to build a C++ compiler on top of a C compiler. How would you do this?    &lt;/li&gt;&lt;li&gt;What output does the following code generate? Why? What output does it generate if you make A::Foo() a pure virtual function?    &lt;/li&gt;&lt;li&gt;What output does this program generate as shown? Why?   &lt;/li&gt;&lt;li&gt;C++ ( what is virtual function ? what happens if an error occurs in constructor or destructor. Discussion on error handling, templates, unique features of C++. What is different in C++, ( compare with unix).  &lt;/li&gt;&lt;li&gt;I was given a c++ code and was asked to find out the bug in that. The bug was that he declared an object locally in a function and tried to return the pointer to that object.  Since the object is local to the function, it no more exists after returning from the function. The pointer, therefore, is invalid outside.&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114372499503832646?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114372499503832646/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114372499503832646' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114372499503832646'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114372499503832646'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/03/c-syntax-semantics-and-simple_30.html' title='C++ syntax, semantics and simple programming questions'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114360148466234217</id><published>2006-03-29T08:32:00.000+05:30</published><updated>2006-03-29T08:34:44.670+05:30</updated><title type='text'>C syntax, semantics and simple programming questions</title><content type='html'>&lt;ol&gt;&lt;li&gt;What does the term cast refer to? Why is it used?    &lt;/li&gt;&lt;li&gt;In arithmetic expressions, to what data type will the C compiler promote a character?    &lt;/li&gt;&lt;li&gt;What is the difference between a statement and a block?    &lt;/li&gt;&lt;li&gt;Increment the variable next three different ways.    &lt;/li&gt;&lt;li&gt;How is a comment formed in C.    &lt;/li&gt;&lt;li&gt;Can comments be nested?    &lt;/li&gt;&lt;li&gt;From the standpoint of programming logic, what is the difference between a loop with the test at the top, and a loop where the test is at the bottom?    &lt;/li&gt;&lt;li&gt;Specify the skeletons of two C loops with the test at the top.    &lt;/li&gt;&lt;li&gt;Specify a C loop with the test at the bottom.    &lt;/li&gt;&lt;li&gt;What is the switch statement?    &lt;/li&gt;&lt;li&gt;What does a break statement do? Which control structures use it?    &lt;/li&gt;&lt;li&gt;In a loop, what is the difference between a break and continue statement?    &lt;/li&gt;&lt;li&gt;Where may variables be defined in C?    &lt;/li&gt;&lt;li&gt;What is the difference between a variable definition and a variable declaration?    &lt;/li&gt;&lt;li&gt;What is the purpose of a function prototype?    &lt;/li&gt;&lt;li&gt;What is type checking?    &lt;/li&gt;&lt;li&gt;To what does the term storage class refer?    &lt;/li&gt;&lt;li&gt;List C's storage classes and what they signify.    &lt;/li&gt;&lt;li&gt;State the syntax for the printf() and scanf() functions. State their one crucial difference with respect to their parameters.    &lt;/li&gt;&lt;li&gt;With respect to function parameter passing, what is the difference between call-by-value and call-by-reference? Which method does C use?    &lt;/li&gt;&lt;li&gt;What is a structure and a union in C?    &lt;/li&gt;&lt;li&gt;Define a structure for a simple name/address record.    &lt;/li&gt;&lt;li&gt;What does the typedef keyword do?    &lt;/li&gt;&lt;li&gt;Use typedef to make a short-cut way to declare a pointer to the nameAddr structure above. Call it addrPtr.    &lt;/li&gt;&lt;li&gt;Declare a variable with addrPtr called address.    &lt;/li&gt;&lt;li&gt;Assuming the variable address above, how would one refer to the city portion of the record within a C expression?    &lt;/li&gt;&lt;li&gt;What is the difference between: #include &lt;stdio.h&gt; and #include "stdio.h"  &lt;/stdio.h&gt;  &lt;/li&gt;&lt;li&gt;What is #ifdef used for?    &lt;/li&gt;&lt;li&gt;How do you define a constant in C?    &lt;/li&gt;&lt;li&gt;Why can't you nest structure definitions?    &lt;/li&gt;&lt;li&gt;Can you nest function definitions?    &lt;/li&gt;&lt;li&gt;What is a forward reference?    &lt;/li&gt;&lt;li&gt;What are the following and how do they differ: int, long, float and double?    &lt;/li&gt;&lt;li&gt;Define a macro called SQR which squares a number.    &lt;/li&gt;&lt;li&gt;Is it possible to take the square-root of a number in C. Is there a square-root operator in C?    &lt;/li&gt;&lt;li&gt;Using fprintf() print a single floating point number right-justified in a field of 20 spaces, no leading zeros, and 4 decimal places. The destination should be stderr and the variable is called num.    &lt;/li&gt;&lt;li&gt;What is the difference between the &amp; and &amp;amp;&amp; operators and the | and || operators?    &lt;/li&gt;&lt;li&gt;What is the difference between the -&gt; and . operators?    &lt;/li&gt;&lt;li&gt;What is the symbol for the modulus operator?    &lt;/li&gt;&lt;li&gt;From the standpoint of logic, what is the difference between the fragment: &lt;pre&gt;if (next &lt; max)&lt;br /&gt;next++;&lt;br /&gt;else&lt;br /&gt;next = 0;&lt;br /&gt;&lt;/pre&gt; and the fragment: &lt;pre&gt;next += (next &lt; max)? (1):(-next);&lt;br /&gt;&lt;/pre&gt;    &lt;/li&gt;&lt;li&gt;What does the following fragment do? &lt;pre&gt;while((d=c=getch(),d)!=EOF&amp;&amp;amp;(c!='\t'||c!=' '||c!='\b')) *buff++ = ++c; &lt;/pre&gt;    &lt;/li&gt;&lt;li&gt;Is C case sensitive (ie: does C differentiate between upper and lower case letters)?    &lt;/li&gt;&lt;li&gt;Specify how a filestream called inFile should be opened for random reading and writing. the file's name is in fileName.    &lt;/li&gt;&lt;li&gt;What does fopen() return if successful. If unsuccessful?    &lt;/li&gt;&lt;li&gt;What is the void data type? What is a void pointer?    &lt;/li&gt;&lt;li&gt;Declare a pointer called fnc which points to a function that returns an unsigned long.    &lt;/li&gt;&lt;li&gt;Declare a pointer called pfnc which points to a function that returns a pointer to a structure of type nameAddr.    &lt;/li&gt;&lt;li&gt;It is possible for a function to return a character, an integer, and a floating point number. Is it possible for a function to return a structure? Another function?    &lt;/li&gt;&lt;li&gt;What is the difference between an lvalue and an rvalue?    &lt;/li&gt;&lt;li&gt;Given the decimal number 27, how would one express it as a hexadecimal number in C?    &lt;/li&gt;&lt;li&gt;What is malloc()?    &lt;/li&gt;&lt;li&gt;What is the difference between malloc() and calloc()?    &lt;/li&gt;&lt;li&gt;What kind of problems was C designed to solve?   &lt;/li&gt;&lt;li&gt;write C code for deleting an  element from a linked listy traversing a linked list efficient way of elimiating duplicates from an array   &lt;/li&gt;&lt;li&gt;Declare a void pointer    &lt;/li&gt;&lt;li&gt;Make the pointer aligned to a 4 byte boundary in a efficient manner   &lt;/li&gt;&lt;li&gt;What is  a far pointer (in DOS)   &lt;/li&gt;&lt;li&gt;Write an efficient C code for 'tr' program.  'tr' has two command line arguments. They both are strings of same length. tr reads an input file, replaces each character in the first string with the corresponding character in the second string. eg. 'tr abc xyz' replaces all 'a's by 'x's, 'b's by 'y's and so on.   &lt;/li&gt;&lt;li&gt;Write C code to implement strtok() 'c' library function.  &lt;/li&gt;&lt;li&gt;Implement strstr(), strcpy(), strtok() etc  &lt;/li&gt;&lt;li&gt;Reverse a string.  &lt;/li&gt;&lt;li&gt;Given a linked list which is sorted, how will you insert in sorted way.  &lt;/li&gt;&lt;li&gt;Write a function that allocates memory for a two-dimensional array of given size (parameter x &amp;amp; y)  &lt;/li&gt;&lt;li&gt;Write source code for printHex(int i) in C/C++  &lt;/li&gt;&lt;li&gt;Write a function that finds the last instance of a character in a string.&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114360148466234217?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114360148466234217/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114360148466234217' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114360148466234217'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114360148466234217'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/03/c-syntax-semantics-and-simple.html' title='C syntax, semantics and simple programming questions'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114351480509624901</id><published>2006-03-28T08:27:00.000+05:30</published><updated>2006-03-28T08:30:05.100+05:30</updated><title type='text'>Data Structures and Algorithms - I</title><content type='html'>&lt;ol&gt;&lt;li&gt;Write a function and the node data structure to visit all of the nodes in a binary tree.  &lt;/li&gt;&lt;li&gt;You know what a queue is .... Implement a queue class with Java. What is the cost of enqueue and dequeue? Can you improve this? What if the queue is full (I was using an looping array)? What kind of mechanism would you use to increase its size?  &lt;/li&gt;&lt;li&gt;Give an algorithm that calculates the distance between two text strings (only operations you can have are: delete, add, and change, one by one).  &lt;/li&gt;&lt;li&gt;Given the definition of a sequence (5 4 7 6 is, but 1 2 4 5 is not), write an algorithm to check if an arbitrary array is a sequence or not. Once I figured out a solution, I was asked to do a space and time complexity analysis.  &lt;/li&gt;&lt;li&gt;Describe a situation where concurrent access would lead to inconsistency in your application. How would you solve this problem?  &lt;a href="file:///C:/Placement2/JOBS%20THAT%20MATTER/JOB_SABKUH/Sample%20Interview%20Questions.htm#q79"&gt; &lt;/a&gt;&lt;/li&gt;&lt;li&gt;You are given a list of n numbers from 1 to n-1, with one of the numbers repeated.  Devise a method to determine which number is repeated.    &lt;/li&gt;&lt;li&gt;Write an algorithm to detect loop in a linked list.    &lt;/li&gt;&lt;li&gt;Given the time, devise an algorithm to calculate the angle between the hour and minute hands of an analog clock.    &lt;/li&gt;&lt;li&gt;Devise an algorithm for detecting whether a given string is a palindrome (spelled the same way forwards and backwards). For example, "A man, a plan, a canal, Panama."    &lt;/li&gt;&lt;li&gt;Given an eight-bit bitmap graphics file, devise an algorithm to convert the file into a two-bit ASCII approximation.&lt;a href="file:///C:/Placement2/JOBS%20THAT%20MATTER/JOB_SABKUH/Sample%20Interview%20Questions.htm#q83"&gt;  &lt;/a&gt; &lt;/li&gt;&lt;li&gt;Reverse a linked list.  &lt;/li&gt;&lt;li&gt;Insert in a sorted list  &lt;/li&gt;&lt;li&gt;First some definitions for this problem: a) An ASCII character is one byte long and the most significant bit in the byte is always '0'. b) A Kanji character is two bytes long. The only characteristic of a Kanji character is that in its first byte the most significant bit is '1'. Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).  &lt;/li&gt;&lt;li&gt;Delete an element from a doubly linked list.  &lt;/li&gt;&lt;li&gt;Write a function to find the depth of a binary tree.  &lt;/li&gt;&lt;li&gt;Assuming that locks are the only reason due to which deadlocks can occur in a system. What would be a foolproof method of avoiding deadlocks in the system.  &lt;a href="file:///C:/Placement2/JOBS%20THAT%20MATTER/JOB_SABKUH/Sample%20Interview%20Questions.htm#q90"&gt; &lt;/a&gt;&lt;/li&gt;&lt;li&gt;Besides communication cost, what is the other source of inefficiency in RPC?&lt;a href="file:///C:/Placement2/JOBS%20THAT%20MATTER/JOB_SABKUH/Sample%20Interview%20Questions.htm#q90"&gt;  &lt;/a&gt; &lt;/li&gt;&lt;li&gt;Ways of optimizing symbol table storage in compilers.  &lt;/li&gt;&lt;li&gt;A walk-through through the symbol table functions, lookup() implementation etc - The interv. was on the Microsoft C team.  &lt;/li&gt;&lt;li&gt;Given an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).  &lt;/li&gt;&lt;li&gt;Given an array of characters. How would you reverse it. ? How would you reverse it without using indexing in the array.  &lt;/li&gt;&lt;li&gt;Given a sequence of characters. How will you convert the lower case characters to upper case characters. ( Try using bit vector - sol given in the C  lib -&gt; typec.h)  &lt;/li&gt;&lt;li&gt;Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.  &lt;/li&gt;&lt;li&gt;Do a breadth first traversal of a tree.  &lt;/li&gt;&lt;li&gt;Given a list of numbers ( fixed list) Now given any other list, how can you efficiently find out if there is any element in the second list that is an element of the first list (fixed list).  &lt;a href="file:///C:/Placement2/JOBS%20THAT%20MATTER/JOB_SABKUH/Sample%20Interview%20Questions.htm#q99"&gt; &lt;/a&gt;&lt;/li&gt;&lt;li&gt;What is  a balanced tree&lt;a href="file:///C:/Placement2/JOBS%20THAT%20MATTER/JOB_SABKUH/Sample%20Interview%20Questions.htm#q99"&gt;  &lt;/a&gt; &lt;/li&gt;&lt;li&gt;How would you find a cycle in a linked list? Try to do it in O(n) time. Try it using a constant amount of memory.  &lt;/li&gt;&lt;li&gt;Implement an algorithm to reverse a doubly linked list.  &lt;/li&gt;&lt;li&gt;A square picture is cut into 16 squares and they are shuffled. Write a program to rearrange the 16 squares to get the original big square.  &lt;/li&gt;&lt;li&gt;The Web can be modeled as a directed graph. Come up with a graph traversal algorithm. Make the algorithm non-recursive and breadth-first.  &lt;/li&gt;&lt;li&gt;How would you implement a hash table ? How do you deal with collisions?  &lt;/li&gt;&lt;li&gt;How would you find a cycle in a linked list? Try to do it in O(n) time. Try it using a constant amount of memory.  &lt;/li&gt;&lt;li&gt;Given a history of URLs, how would you determine if a particular URL had been seen before?  &lt;/li&gt;&lt;li&gt;Since pages can have multiple URLs pointing to them, how can you make sure you've never seen the same CONTENT before?  &lt;/li&gt;&lt;li&gt;Write a function to print all of the permutations of a string.  &lt;/li&gt;&lt;li&gt;Come up with the plan on how to traverse a graph, as well as to quickly determine if a given URL is one of the million or so you've previously seen.  &lt;/li&gt;&lt;li&gt;The Web can be modeled as a directed graph. Come up with a graph traversal algorithm. Make the algorithm non-recursive and breadth-first.  &lt;/li&gt;&lt;li&gt;Implement an algorithm to reverse a singly linked list. (with and without recursion)  &lt;/li&gt;&lt;li&gt;Implement an algorithm to reverse a doubly linked list.  &lt;/li&gt;&lt;li&gt;Implement an algorithm to insert in a sorted list.  &lt;/li&gt;&lt;li&gt;Delete an element from a doubly linked list.  &lt;/li&gt;&lt;li&gt;Write a function to copy two strings, A and B. The last few bytes of string A overlap the first few bytes of string B.  &lt;/li&gt;&lt;li&gt;Implement an algorithm to sort an array.  &lt;/li&gt;&lt;li&gt;Given a sequence of characters, how will you convert the lower case characters to upper case characters?  &lt;/li&gt;&lt;li&gt;Write a routine that prints out a 2-D array in spiral order.  &lt;/li&gt;&lt;li&gt;Count the number of set bits in a number without using a loop.  &lt;/li&gt;&lt;li&gt;Give me an algorithm and C code to shuffle a deck of cards, given that the cards are stored in an array of ints. Try to come up with a solution that does not require any extra space. &lt;/li&gt;&lt;li&gt;Write a function that takes in a string parameter and checks to see whether or not it is an integer, and if it is then return the integer value. &lt;/li&gt;&lt;li&gt;How would you print out the data in a binary tree, level by level, starting at the top?  &lt;/li&gt;&lt;li&gt;Given an array of characters which form a sentence of words, give an efficient algorithm to reverse the order of the words in it. &lt;/li&gt;&lt;li&gt;Write a function to find the depth of a binary tree.  &lt;/li&gt;&lt;li&gt;Given a list of numbers ( fixed list) Now given any other list, how can you efficiently find out if there is any element in the second list that is an element of the first list (fixed list).  &lt;/li&gt;&lt;li&gt;How would you implement a queue from a stack?  &lt;/li&gt;&lt;li&gt;Write a funtion that finds repeating characters in a string.  &lt;/li&gt;&lt;li&gt;Write a routine to reverse a series of numbers without using an array.  &lt;/li&gt;&lt;li&gt;Give me an algorithm for telling me the number I didn't give you in a given range of numbers. (Numbers are given at random)&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114351480509624901?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114351480509624901/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114351480509624901' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114351480509624901'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114351480509624901'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/03/data-structures-and-algorithms-i.html' title='Data Structures and Algorithms - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114348028001381505</id><published>2006-03-27T22:53:00.000+05:30</published><updated>2006-03-27T22:54:40.016+05:30</updated><title type='text'>Tougher Programming Questions - I</title><content type='html'>&lt;ol&gt;&lt;li&gt;Write a routine to draw a circle (x ** 2 + y ** 2 = r ** 2) without making use of any floating point computations at all.    &lt;/li&gt;&lt;li&gt;Given only putchar (no sprintf, itoa, etc.) write a routine putlong that prints out an unsigned long in decimal.    &lt;/li&gt;&lt;li&gt;Give a one-line C expression to test whether a number is a power of 2. [No loops allowed - it's a simple test.]   &lt;/li&gt;&lt;li&gt;Give a very good method to count the number of ones in a 32 bit number. (caution: looping through testing each bit is not a solution).   &lt;/li&gt;&lt;li&gt;What are the different ways to say, the value of x can be either a 0 or a 1.    &lt;/li&gt;&lt;li&gt;I was given two lines of assembly code which found the absolute value of a number stored in two's complement form. I had to recognize what the code was doing.    &lt;/li&gt;&lt;li&gt;Give a fast way to multiply a number by 7.   &lt;/li&gt;&lt;li&gt;Write an efficient algo and C code to shuffle a pack of cards.. this one was a feedback process until we came up with one with no extra storage.  &lt;/li&gt;&lt;li&gt;A real life problem - A square picture is cut into 16 sqaures and they are shuffled.  Write a program to rearrange the 16 squares to get the original big square.  &lt;/li&gt;&lt;li&gt;Consider the base -2 representation of numbers. (-2 instead of usual +2). Give the condition for a number represented in this form to be positive? Also, if P(A, B) is a function that takes two 0-1 strings A,B in this representation, when can we say that P(A,B) returns the sum of these two numbers?  &lt;/li&gt;&lt;li&gt;Given an expression tree with no parentheses in it, write the program to give equivalent infix expression with parentheses inserted where necessary.  &lt;/li&gt;&lt;li&gt;Given a maze with cheese at one place and a mouse at some entrance, write a program to direct the mouse to cheese correctly. (Assume there is a path). Following primitives are given: moveforward, turnright, turnleft, iswall?, ischeese?, eatcheese.  &lt;/li&gt;&lt;li&gt;Give me an algorithm and C code to find the subarray with the largest sum given an array containing both positive and negative integers.   &lt;/li&gt;&lt;li&gt;Write a function that returns the factorial of a number.    &lt;/li&gt;&lt;li&gt;Write a function that computes the nth number in the Fibonacci sequence.    &lt;/li&gt;&lt;li&gt;Write an implementation of strlen().    &lt;/li&gt;&lt;li&gt;Switch the integer values stored in two registers without using any additional memory.   &lt;/li&gt;&lt;li&gt;Given two strings S1 and S2. Delete from S2 all those characters which occur in S1 also and finally create a clean S2 with the relevant characters deleted.  &lt;/li&gt;&lt;li&gt;Write a small lexical analyzer - interviewer gave tokens. expressions like "a*b" etc.  &lt;/li&gt;&lt;li&gt;Write a routine that prints out a 2-D array in spiral order!  &lt;/li&gt;&lt;li&gt;How is the readers-writers problem solved? - using semaphores/ada .. etc.  &lt;/li&gt;&lt;li&gt;Write code for reversing a linked list.   &lt;/li&gt;&lt;li&gt;Write, efficient code for extracting unique elements from a sorted list of array.  e.g. (1, 1, 3, 3, 3, 5, 5, 5, 9, 9, 9, 9) -&gt; (1, 3, 5, 9).&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114348028001381505?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114348028001381505/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114348028001381505' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114348028001381505'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114348028001381505'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/03/tougher-programming-questions-i.html' title='Tougher Programming Questions - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114334643640109205</id><published>2006-03-26T09:42:00.000+05:30</published><updated>2006-03-26T09:43:56.423+05:30</updated><title type='text'>Logic Questions - I</title><content type='html'>&lt;ol&gt;&lt;li&gt;Given a rectangular (cuboidal for the puritans) cake with a rectangular piece removed (any size or orientation), how would you cut the remainder of the cake into two equal halves with one straight cut of a knife ?  &lt;/li&gt;&lt;li&gt;You're given an array containing both positive and negative integers and required to find the subarray with the largest sum (O(N) a la KBL). Write a routine in C for the above.   &lt;/li&gt;&lt;li&gt;Given an array of size N in which every number is between 1 and N, determine if there are any duplicates in it.  You are allowed to destroy the array if you like.   &lt;/li&gt;&lt;li&gt;Given an array of characters which form a sentence of words, give an efficient algorithm to reverse the order of the words (not characters) in it.   &lt;/li&gt;&lt;li&gt;How many points are there on the globe where by walking one mile south, one mile east and one mile north you reach the place where you started.    &lt;/li&gt;&lt;li&gt;In a X's and 0's game (i.e. TIC TAC TOE) if you write a program for this give a fast way to generate the moves by the computer. I mean this should be the fastest way possible.   &lt;/li&gt;&lt;li&gt;A version of the "There are three persons X Y Z, one of which always lies"..   &lt;/li&gt;&lt;li&gt;There are 3 ants at 3 corners of a triangle, they randomly start moving towards another corner.. what is the probability that they don't collide.   &lt;/li&gt;&lt;li&gt;If you are on a boat and you throw out a suitcase, Will the level of water increase.   &lt;/li&gt;&lt;li&gt;There are 4 men who want to cross a bridge. They all begin on the same side.  You have 17 minutes to get all of them across to the other side.  It is night.  There is one flashlight.  A maximum of two people can cross at one time.  Any party who crosses, either 1 or 2 people, must have the flashlight with them.  The flashlight must be walked back and forth, it cannot be thrown, etc.  Each man walks at a different speed.  A pair must walk together at the rate of the slower mans pace. &lt;pre&gt;Man 1:1 minute to cross&lt;br /&gt;Man 2: 2 minutes to cross&lt;br /&gt;Man 3: 5 minutes to cross&lt;br /&gt;Man 4: 10 minutes to cross&lt;br /&gt;&lt;/pre&gt;    &lt;/li&gt;&lt;li&gt;You have 5 jars of pills. Each pill weighs 10 gram, except for contaminated pills contained in one jar, where each pill weighs 9 gm. Given a scale, how could you tell which jar had the contaminated pills in just one measurement?    &lt;/li&gt;&lt;li&gt;One train leaves Los Angeles at 15 MPH heading for New York. Another train leaves from New York at 20mph heading for Los Angeles on the same track. If a bird, flying at 25mph, leaves from Los Angeles at the same time as the train and flies back and forth between the two trains until they collide, how far will the bird have traveled?    &lt;/li&gt;&lt;li&gt;Imagine that you have 26 constants, labelled A through Z. Each constant is assigned a value in the following way: A = 1; the rest of the values equal their position in the alphabet (B corresponds to the second position so it equals 2, C = 3, etc.) raised to the power of the preceeding constant value. So, B = 2 ^ (A's value), or B = 2^1 = 2. C = 3^2 = 9. D = 4^9, etc., etc. Find the exact numerical value to the following equation: &lt;pre&gt;(X - A) * (X - B) * (X - C) * ... * (X - Y) * (X - Z) &lt;/pre&gt;    &lt;/li&gt;&lt;li&gt;You have 12 balls. All of them are identical except one, which is either heavier or lighter than the rest - it is either hollow while the rest are solid, or solid while the rest are hollow. You have a simple two-armed scale, and are permitted three weighings. Can you identify the odd ball, and determine whether it is hollow or solid.&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114334643640109205?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114334643640109205/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114334643640109205' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114334643640109205'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114334643640109205'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/03/logic-questions-i.html' title='Logic Questions - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114330566897653761</id><published>2006-03-25T22:23:00.000+05:30</published><updated>2006-03-25T22:25:10.110+05:30</updated><title type='text'>Questions On Microprocessor - I</title><content type='html'>&lt;ol&gt;&lt;span style="font-family:Arial;font-size:85%;"&gt;                                          &lt;li&gt;&lt;span style="font-size:85%;"&gt;Which type of                                             architecture  8085 has?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;How many memory                                             locations can be addressed by a                                             microprocessor with 14 address                                             lines?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;8085 is how many                                             bit microprocessor?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;Why is data bus                                             bi-directional?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;What is the                                             function of accumulator?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;What is flag, bus?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;What are tri-state                                             devices and why they are essential                                             in a bus oriented system?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;Why are program                                             counter and stack pointer 16-bit                                             registers?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;What does it mean                                             by embedded system?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;What are the                                             different addressing modes in 8085?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;What is the                                             difference between MOV and MVI?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;What are the                                             functions of RIM, SIM, IN?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;What is the                                             immediate addressing mode?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;What are the                                             different flags in 8085?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;What happens during                                             DMA transfer?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;What do you mean by                                             wait state? What is its need?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;What is PSW?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;What is ALE?                                             Explain the functions of ALE in                                             8085.&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;What is a program                                             counter? What is its use?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;What is an                                             interrupt?&lt;/span&gt;                                           &lt;/li&gt;&lt;li&gt;&lt;span style="font-size:85%;"&gt;Which line will be                                             activated when an output device                                             require attention from CPU?&lt;/span&gt;&lt;/li&gt;                                         &lt;/span&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114330566897653761?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114330566897653761/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114330566897653761' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114330566897653761'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114330566897653761'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/03/questions-on-microprocessor-i.html' title='Questions On Microprocessor - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114319740031602149</id><published>2006-03-24T16:18:00.000+05:30</published><updated>2006-03-24T16:20:00.316+05:30</updated><title type='text'>Questions On Java - III (Java Certification)</title><content type='html'>&lt;a href="http://www.javaprepare.com/quests/question.html"&gt;http://www.javaprepare.com/quests/question.html&lt;/a&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114319740031602149?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114319740031602149/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114319740031602149' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114319740031602149'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114319740031602149'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/03/questions-on-java-iii-java.html' title='Questions On Java - III (Java Certification)'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114312697467690409</id><published>2006-03-23T20:33:00.000+05:30</published><updated>2006-03-23T20:46:14.726+05:30</updated><title type='text'>Microsoft :: Sample Placement Paper - I</title><content type='html'>&lt;p&gt;  &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;&lt;a name="puzzles"&gt;&lt;h3&gt;Puzzles, Riddles and Others&lt;/h3&gt;&lt;/a&gt;  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   0. Classic: If a bear walks one mile south, turns left and walks       one mile to the east and then turns left again and walks one mile       north and arrives at its original position, what is the color of       the bear. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   ANS. The color of the bear is trivial. The possible solutions to it        are interesting. In addition to the trivial north pole,        there are additional circles near south pole. Think it out.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;*  1. Given a rectangular (cuboidal for the puritans) cake with a rectangular       piece removed (any size or orientation), how would you cut the remainder      of the cake into two equal halves with one straight cut of a knife? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   ANS. Join the centers of the original and the removed rectangle. It works       for cuboids too! BTW, I have been getting many questions asking why a horizontal slice across the middle will not do. Please note the "any size or orientation" in the question! Don't get boxed in by the way you cut your birthday cake :) Think out of the box.    &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   2. There are 3 baskets. one of them have apples, one has oranges       only and the other has mixture of apples and oranges. The labels        on their baskets always lie. (i.e. if the label says oranges,        you are sure that it doesn't have oranges only,it could be a        mixture) The task is to pick one basket and pick only one fruit        from it and then correctly label all the three baskets.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;HINT. There are only two combinations of distributions in which ALL the baskets have wrong labels. By picking a fruit from the one labeled MIXTURE, it is possible to tell what the other two baskets have.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   3. You have 8 balls. One of them is defective and weighs less than        others. You have a balance to measure balls against each other.        In 2 weighings how do you find the defective one? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   4. Why is a manhole cover round?  &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;              HINT. The diagonal of a square hole is larger than the side of        a cover! &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;       Alternate answers: 1. Round covers can be transported by one        person, because they can be rolled on their edge. 2. A round        cover doesn't need to be rotated to fit over a hole.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   5. How many cars are there in the USA?  &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;          6. You've got someone working for you for seven days and a gold bar       to pay them. The gold bar is segmented into seven connected       pieces. You must give them a piece of gold at the end of every       day. If you are only allowed to make two breaks in the gold bar,       how do you pay your worker?   &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   7. One train leaves Los Angeles at 15mph heading for New York.        Another train leaves from New York at 20mph heading for Los       Angeles on the same track. If a bird, flying at 25mph, leaves       from Los Angeles at the same time as the train and flies back       and forth between the two trains until they collide, how far        will the bird have traveled?   &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;  HINT. Think relative speed of the trains. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   8. You have two jars, 50 red marbles and 50 blue marbles. A jar will       be picked at random, and then a marble will be picked from the      jar. Placing all of the marbles in the jars, how can you maximize      the chances of a red marble being picked? What are the exact odds      of getting a red marble using your scheme?   &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;  9. Imagine you are standing in front of a mirror, facing it. Raise   your left hand. Raise your right hand. Look at your reflection. When   you raise your left hand your reflection raises what appears to be   his right hand. But when you tilt your head up, your reflection does   too, and does not appear to tilt his/her head down. Why is it that   the mirror appears to reverse left and right, but not up and down?   &lt;/span&gt;&lt;/p&gt;&lt;p&gt;  &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;  10. You have 5 jars of pills. Each pill weighs 10 gram, except for        contaminated pills contained in one jar, where each pill weighs       9 gm. Given a scale, how could you tell which jar had the       contaminated pills in just one measurement?   &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;     ANS. 1. Mark the jars with numbers 1, 2, 3, 4, and 5.&lt;br /&gt;         2. Take 1 pill from jar 1, take 2 pills from jar 2, take 3              pills from jar 3, take 4 pills from jar 4 and take 5 pills              from jar 5.   &lt;br /&gt;      3. Put all of them on the scale at once and take the measurement.      &lt;br /&gt;   4. Now, subtract the measurement from 150 ( 1*10 + 2*10 + 3*10              + 4*10 + 5*10)         &lt;br /&gt;5. The result will give you the jar number which has              contaminated pill. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;  11. If you had an infinite supply of water and a 5 quart and 3 quart       pail, how would you measure exactly 4 quarts?   &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;  12. You have a bucket of jelly beans. Some are red, some are blue,       and some green. With your eyes closed, pick out 2 of a like       color. How many do you have to grab to be sure you have 2 of the       same?   &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   13. Which way should the key turn in a car door to unlock it?  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   14. If you could remove any of the 50 states, which state would it        be and why?  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   15. There are four dogs/ants/people at four corners of a square        of unit distance. At the same instant all of them start running        with unit speed towards the person on their clockwise        direction and will always run towards that target. How long        does it take for them to meet and where? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   HINT. They will meet in the center and the distance covered by them    is independent of the path they actually take (a spiral). &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;16. (from Tara Hovel) A helicopter drops two trains, each on a parachute, onto a straight infinite railway line.  There is an undefined distance between the two trains.  Each faces the same direction, and upon landing, the parachute attached to each train falls to the ground next to the train and detaches.  Each train has a microchip that controls its motion.  The chips are identical.  There is no way for the trains to know where they are.  You need to write the code in the chip to make the trains bump into each other.  Each line of code takes a single clock cycle to execute. &lt;br /&gt; You can use the following commands (and only these);&lt;br /&gt;            MF - moves the train forward&lt;br /&gt;            MB - moves the train backward&lt;br /&gt;            IF (P) - conditional that's satisfied if the train is next to a parachute.  There is no "then" to this IF statement.&lt;br /&gt;            GOTO&lt;br /&gt;&lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;ANS.&lt;br /&gt;A: MF&lt;br /&gt;IF (P)&lt;br /&gt;   GOTO B&lt;br /&gt;GOTO A&lt;br /&gt;-----&lt;br /&gt;B: MF&lt;br /&gt;    GOTO B&lt;br /&gt; Explanation: The first line simply gets them off the parachutes. You need to get the trains off their parachutes so the back train can find the front train's parachute, creating a special condition that will allow it to break out of the code they both have to follow initially.  They both loop through A: until the back train finds the front train's parachute, at which point it goes to B: and gets stuck in that loop.  The front train still hasn't found a parachute, so it keeps in the A loop.  Because each line of code takes a "clock cycle" to execute, it takes longer to execute the A loop than the B loop, therefore the back train (running in the B loop) will catch up to the front train.  &lt;/span&gt;&lt;/p&gt;&lt;h3&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;Personality&lt;/span&gt;&lt;/h3&gt;  &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;It is best to read some website or a book for questions like these.  &lt;/span&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;1. Tell me the courses you liked and why  did you like them. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;2. Give an instance in your life in which you were faced with a       problem and you tackled it successfully. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;3. What is your ideal working environment.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;4. Why do you think you are smart. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;5. Questions on the projects listed on the Resume. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;6. Do you want to know any thing about the company.( Try to ask some      relevant and interesting question). &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;7. How long do you want to stay in USA and why (I guess non-citizens get this)? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;8. What is your geographical preference? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;9. What are your expectations from the job. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;/p&gt;&lt;hr /&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;&lt;a name="programming"&gt;&lt;h3&gt;Algorithms and Programming&lt;/h3&gt;&lt;/a&gt;  &lt;/span&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 1. Given a rectangular (cuboidal for the puritans) cake with a rectangular     piece removed (any size or orientation), how would you cut the remainder     of the cake into two equal halves with one straight cut of a knife ? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 2. You're given an array containing both positive and negative integers and     required to find the sub-array with the largest sum (O(N) a la KBL).       Write a routine in C for the above. &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   3. Given an array of size N in which every number is between 1 and N,      determine if there are any duplicates in it.  You are allowed to destroy     the array if you like. [ I ended up giving about 4 or 5 different solutions      for this, each supposedly better than the others ]. &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   4. Write a routine to draw a circle (x ** 2 + y ** 2 = r ** 2) without making     use of any floating point computations at all.  [ This one had me stuck for     quite some time and I first gave a solution that did have floating point     computations ]. &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   5. Given only putchar (no sprintf, itoa, etc.) write a routine putlong that     prints out an unsigned long in decimal.  [ I gave the obvious solution of     taking % 10 and / 10, which gives us the decimal value in reverse order.       This requires an array since we need to print it out in the correct order.     The interviewer wasn't too pleased and asked me to give a solution which     didn't need the array ]. &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   6. Give a one-line C expression to test whether a number is a power of     2. [No loops allowed - it's a simple test.] &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   7. Given an array of characters which form a sentence of words, give an     efficient algorithm to reverse the order of the words (not characters)     in it. &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   8. How many points are there on the globe where by walking one mile south,     one mile east and one mile north you reach the place where you started. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 9. Give a very good method to count the number of ones in a "n" (e.g. 32) bit number. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;ANS. Given below are simple solutions, find a solution that does it in      log (n) steps.&lt;br /&gt;&lt;/span&gt;&lt;/p&gt;&lt;pre&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;Iterative&lt;br /&gt;&lt;br /&gt;function iterativecount (unsigned int n)&lt;br /&gt;begin&lt;br /&gt; int count=0;  &lt;br /&gt; while (n)&lt;br /&gt; begin&lt;br /&gt;    count += n &amp; 0x1 ;&lt;br /&gt;    n &gt;&gt;= 1;&lt;br /&gt; end&lt;br /&gt; return count;&lt;br /&gt;end&lt;br /&gt;&lt;br /&gt;Sparse Count&lt;br /&gt;&lt;br /&gt;function sparsecount (unsigned int n)&lt;br /&gt;begin&lt;br /&gt; int count=0;  &lt;br /&gt; while (n)&lt;br /&gt; begin&lt;br /&gt;    count++;&lt;br /&gt;    n &amp;= (n-1);&lt;br /&gt; end&lt;br /&gt; return count ;&lt;br /&gt;end&lt;br /&gt;&lt;/span&gt;&lt;/pre&gt; &lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 10. What are the different ways to implement a condition where the value of x can be either a 0 or a 1. Apparently the if then else solution has a jump when written out in assembly.   if (x == 0)   y=a  else    y=b       There is a logical, arithmetic and a data structure solution to the above  problem. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 11. Reverse a linked list. &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   12. Insert in a sorted list &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   13. In a X's and 0's game (i.e. TIC TAC TOE) if you write a program for      this give a fast way to generate the moves by the computer. I mean this      should be the fastest way possible.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;The answer is that you need to store      all possible configurations of the board and the move that is associated      with that. Then it boils down to just accessing the right element and      getting the corresponding move for it. Do some analysis and do some more      optimization in storage since otherwise it becomes infeasible to get      the required storage in a DOS machine. &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   14. I was given two lines of assembly code which found the absolute value      of a number stored in two's complement form. I had to recognize what the      code was doing. Pretty simple if you know some assembly and some fundaes      on number representation. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 15. Give a fast way to multiply a number by 7.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 16. How would go about finding out where to find a book in a library. (You       don't know how exactly the books are organized beforehand). &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 17. Linked list manipulation. &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   18. Tradeoff between time spent in testing a product and getting into the       market first. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 19. What to test for given that there isn't enough time to test everything      you want to. &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   20. First some definitions for this problem:     a) An ASCII character is one byte long and the most significant bit        in the byte is always '0'.     b) A Kanji character is two bytes long. The only characteristic of a        Kanji character is that in its first byte the most significant bit        is '1'.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;     Now you are given an array of a characters (both ASCII and Kanji) and,      an index into the array. The index points to the start of some character.      Now you need to write a function to do a backspace (i.e. delete the       character before the given index). &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 21. Delete an element from a doubly linked list. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 22. Write a function to find the depth of a binary tree. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 23. Given two strings S1 and S2. Delete from S2 all those characters which      occur in S1 also and finally create a clean S2 with the relevant characters      deleted. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 24. Assuming that locks are the only reason due to which deadlocks can occur      in a system. What would be a foolproof method of avoiding deadlocks in       the system. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 25. Reverse a linked list. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;     Ans: Possible answers -  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;     iterative loop  &lt;br /&gt;    curr-&gt;next = prev;     &lt;br /&gt; prev = curr;&lt;br /&gt;      curr = next;&lt;br /&gt;      next = curr-&gt;next&lt;br /&gt;    endloop&lt;br /&gt;&lt;br /&gt;    recursive reverse(ptr)&lt;br /&gt;      if (ptr-&gt;next == NULL)&lt;br /&gt;       return ptr;  &lt;br /&gt;      temp = reverse(ptr-&gt;next);&lt;br /&gt;      temp-&gt;next = ptr;&lt;br /&gt;      return ptr;&lt;br /&gt;    end&lt;br /&gt;&lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 26. Write a small lexical analyzer - interviewer gave tokens. expressions like      "a*b" etc. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 27. Besides communication cost, what is the other source of inefficiency in RPC?      (answer : context switches, excessive buffer copying).      How can you optimize the communication? (ans : communicate through shared      memory on same machine, bypassing the kernel _ A Univ. of Wash. thesis) &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 28. Write a routine that prints out a 2-D array in spiral order! &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 29. How is the readers-writers problem solved? - using semaphores/ada .. etc. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 30. Ways of optimizing symbol table storage in compilers.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 31. A walk-through through the symbol table functions, lookup() implementation      etc. - The interviewer was on the Microsoft C team. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 32. A version of the "There are three persons X Y Z, one of which      always lies"..  etc.. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 33. There are 3 ants at 3 corners of a triangle, they randomly start moving       towards another corner.. what is the probability that they don't collide. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 34. Write an efficient algorithm and C code to shuffle a pack of cards.. this one      was a feedback process until we came up with one with no extra storage. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 35. The if (x == 0) y  = 0 etc.. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 36. Some more bitwise optimization at assembly level &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 37. Some general questions on Lex, Yacc etc. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 38. Given an array t[100] which contains numbers between 1..99.      Return the duplicated value. Try both O(n) and O(n-square). &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 39. Given an array of characters. How would you reverse it. ?      How would you reverse it without using indexing in the array. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 40. Given a sequence of characters. How will you convert the lower      case characters to upper case characters. ( Try using bit vector      - solutions given in the C  lib -typec.h) &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 41. Fundamentals of RPC. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 42. Given a linked list which is sorted. How will u insert in sorted       way. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 43. Given a linked list How will you reverse it. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 44. Give a good data structure for having n queues ( n not fixed) in a      finite memory segment. You can have some data-structure separate for      each queue. Try to use at least 90% of the memory space. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 45. Do a breadth first traversal of a tree. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 46. Write code for reversing a linked list. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 47. Write, efficient code for extracting unique elements from      a sorted list of array.  e.g. (1, 1, 3, 3, 3, 5, 5, 5, 9, 9, 9, 9) -&gt;      (1, 3, 5, 9). &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 48. Given an array of integers, find the contiguous sub-array with       the largest sum.   &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   ANS. Can be done in O(n) time and O(1) extra space. Scan array from       1 to n. Remember the best sub-array seen so far and the best       sub-array ending in i.   &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 49. Given an array of length N containing integers between 1 and N,       determine if it contains any duplicates.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   ANS. [Is there an O(n) time solution that uses only O(1) extra       space and does not destroy the original array?]  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;  50. Sort an array of size n containing integers between 1 and K,       given a temporary scratch integer array of size K.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; ANS. Compute cumulative counts of integers in the auxiliary array.       Now scan the original array, rotating cycles!       [Can someone word this more nicely?]  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;*  51. An array of size k contains integers between 1 and n.       You are given an additional scratch array of size n.       Compress the original array by removing duplicates in it.       What if k &lt;&lt;&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; ANS. Can be done in O(k) time i.e. without initializing the        auxiliary array!  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   52. An array of integers. The sum of the array is known not to overflow       an integer. Compute the sum.  What if we know that integers are in 2's       complement form?  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; ANS. If numbers are in 2's complement, an ordinary looking loop       like for(i=total=0;i&lt;&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   53. An array of characters. Reverse the order of words in it.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; ANS. Write a routine to reverse a character array.       Now call it for the given array and for each word in it.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;*  54. An array of integers of size n. Generate a random permutation of the       array, given a function rand_n() that returns an integer between       1 and n, both inclusive, with equal probability. What is the       expected time of your algorithm?  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;ANS. "Expected time" should ring a bell.       To compute a random permutation, use the standard algorithm of       scanning array from n downto 1, swapping i-th element with       a uniformly random element &lt;= i-th.       To compute a uniformly random integer between 1 and k (k &lt;&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   55. An array of pointers to (very long) strings.       Find pointers to the (lexicographically) smallest and largest strings.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   ANS. Scan array in pairs. Remember largest-so-far and smallest-so-far.       Compare the larger of the two strings in the current pair with       largest-so-far to update it. And the smaller of the current pair       with the smallest-so-far to update it.    For a total of &lt;= 3n/2       strcmp() calls.   That's also the lower bound.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   56. Write a program to remove duplicates from a sorted array.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   ANS. int remove_duplicates(int * p, int size)&lt;br /&gt;     {&lt;br /&gt;        int current, insert = 1;&lt;br /&gt;        for (current=1; current &lt; size; current++)&lt;br /&gt;           if (p[current] != p[insert-1])&lt;br /&gt;           {&lt;br /&gt;             p[insert] = p[current];&lt;br /&gt;             current++;&lt;br /&gt;             insert++;&lt;br /&gt;           } else&lt;br /&gt;              current++;&lt;br /&gt;&lt;br /&gt;        return insert;&lt;br /&gt;&lt;br /&gt;     } &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 57. C++ ( what is virtual function ?      what happens if an error occurs in constructor or destructor.      Discussion on error handling, templates, unique features of C++.      What is different in C++, ( compare with unix). &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 58. Given a list of numbers ( fixed list) Now given any other list,      how can you efficiently find out if there is any element in the       second list that is an element of the first list (fixed list). &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 59. Given 3 lines of assembly code : find it is doing. IT was to find       absolute value. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 60. If you are on a boat and you throw out a suitcase, Will the level of      water increase.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 61. Print an integer using only putchar. Try doing it without using extra       storage. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 62. Write C code for      (a) deleting an  element from a linked list      (b) traversing a linked list &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 63. What are various problems unique to distributed databases  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 64. Declare a void pointer      ANS.      void    *ptr; &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 65. Make the pointer aligned to a 4 byte boundary in a efficient manner      ANS. Assign the pointer to a long number and the number with 11...1100 add 4 to the number &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 66. What is  a far pointer (in DOS) &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 67. What is  a balanced tree  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 68. Given a linked list with the following property node2 is left child of node1, if node2 &lt;&gt;&lt;/p&gt;&lt;pre&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; O P&lt;br /&gt; |&lt;br /&gt; |&lt;br /&gt; O A&lt;br /&gt; |&lt;br /&gt; |&lt;br /&gt; O B&lt;br /&gt; |&lt;br /&gt; |&lt;br /&gt; O C&lt;br /&gt;&lt;/span&gt;&lt;/pre&gt; &lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; How do you convert the above linked list to the  form without disturbing the property. Write C code  for that. &lt;/span&gt;&lt;/p&gt;&lt;pre&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   O P&lt;br /&gt;   |&lt;br /&gt;   |&lt;br /&gt;   O B&lt;br /&gt;         /         /          /           O ?     O ?&lt;br /&gt;&lt;/span&gt;&lt;/pre&gt; &lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; determine where do A and C go   &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 69. Describe the file system layout in the UNIX OS &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;     ANS.  describe boot block, super block, inodes and data layout &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 70. In UNIX, are the files allocated contiguous blocks of data &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;     ANS.  no, they might be fragmented     &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;       How is the fragmented data kept track of &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;     ANS. Describe the direct blocks and indirect blocks in UNIX     file system &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 71. Write an efficient C code for 'tr' program.  'tr' has two command      line arguments. They both are strings of same length. tr reads an      input file, replaces each character in the first string with the      corresponding character in the second string. eg. 'tr abc xyz'      replaces all 'a's by 'x's, 'b's by 'y's and so on.     ANS. &lt;br /&gt;    a)      have an array of length 26.&lt;br /&gt;      put 'x' in array element corr to 'a' &lt;br /&gt;      put 'y' in array element corr to 'b' &lt;br /&gt;      put 'z' in array element corr to 'c' &lt;br /&gt;      put 'd' in array element corr to 'd' &lt;br /&gt;      put 'e' in array element corr to 'e' &lt;br /&gt;      and so on.&lt;br /&gt;&lt;br /&gt; the code&lt;br /&gt;  while (!eof)&lt;br /&gt;  {&lt;br /&gt;   c = getc();&lt;br /&gt;   putc(array[c - 'a']);&lt;br /&gt;  } &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 72. what is disk interleaving &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 73. why is disk interleaving adopted &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 74. given a new disk, how do you determine which interleaving is the best      a)      give 1000 read operations with each kind of interleaving       determine the best interleaving from the statistics &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 75. draw the graph with performance on one axis and 'n' on another, where      'n' in the 'n' in n-way disk interleaving. (a tricky question, should      be answered carefully) &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 76. I was a c++ code and was asked to find out the bug in that. The bug      was that he declared an object locally in a function and tried to      return the pointer to that object.  Since the object is local to the      function, it no more exists after returning from the function. The      pointer, therefore, is invalid outside. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 77. A real life problem - A square picture is cut into 16 squares and      they are shuffled.  Write a program to rearrange the 16 squares to      get the original big square.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 78. &lt;br /&gt;int *a;&lt;br /&gt;    char *c;&lt;br /&gt;    *(a) = 20;&lt;br /&gt;    *c = *a;&lt;br /&gt;    printf("%c",*c);&lt;br /&gt;    &lt;br /&gt;    what is the output? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;  79. Write a program to find whether a given m/c is big-endian or       little-endian! &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;  80. What is a volatile variable?  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;  81. What is the scope of a static function in C ?  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;  82. What is the difference between "malloc" and "calloc"? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;  83. struct n { int data; struct n* next}node; &lt;br /&gt;     node *c,*t;&lt;br /&gt;     c-&gt;data = 10;&lt;br /&gt;     t-&gt;next = null;&lt;br /&gt;     *c = *t;&lt;br /&gt;     what is the effect of the last statement? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt; 84. If you're familiar with the ? operator  x ? y : z&lt;br /&gt; you want to implement that in a function: int cond(int x, int y, int z); using only ~, !, ^, &amp;, +,  |, &lt;&lt;, &gt;&gt; no if statements, or loops or anything else, just those operators, and  the function should correctly return y or z based on the value of x.   You may use constants, but only 8 bit constants.  You can cast all you  want.  You're not supposed to use extra variables, but in the end, it  won't really matter, using vars just makes things cleaner.  You should  be able to reduce your solution to a single line in the end though that  requires no extra vars. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;85. You have an abstract computer, so just forget everything you know about computers, this one only does what I'm about to tell you it does.  You can use as many variables as you need, there are no negative numbers, all numbers are integers.  You do not know the size of the integers, they could be infinitely large, so you can't count on  truncating at any point.  There are NO comparisons allowed, no if statements or anything like that.  There are only four operations you can do on a variable.  &lt;br /&gt;1)  You can set a variable to 0.  &lt;br /&gt;2)  You can set a variable = another variable.&lt;br /&gt;3)  You can increment a variable (only by 1), and it's a post increment.&lt;br /&gt;4)  You can loop.  So, if you were to say loop(v1) and v1 = 10, your loop would execute 10 times, but the value in v1 wouldn't change so the first line in the loop can change value of v1 without changing the number of times you loop. &lt;br /&gt;You need to do 3 things.&lt;br /&gt;1)  Write a function that decrements by 1.&lt;br /&gt;2)  Write a function that subtracts one variable from another.&lt;br /&gt;3)  Write a function that divides one variable by another.&lt;br /&gt;4)  See if you can implement all 3 using at most 4 variables.  Meaning, you're not making function calls now, you're making macros.  And at most you can have 4 variables.  The restriction really only applies to divide, the other 2 are easy to do with 4 vars or less.  Division on the other hand is dependent on the other 2 functions, so, if subtract requires 3 variables, then divide only has 1 variable left unchanged after a call to subtract.  Basically, just make your function calls to decrement and subtract so you pass your vars in by reference, and you can't declare any new variables in a function, what you pass in is all it gets. &lt;/span&gt;&lt;/p&gt;&lt;h4&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;Linked lists&lt;/span&gt;&lt;/h4&gt; &lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;  *  86. Under what circumstances can one delete an element from a singly       linked list in constant time? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   ANS. If the list is circular and there are no references to the nodes       in the list from anywhere else!       Just copy the contents of the next node and delete the next node.       If the list is not circular, we can delete any but the last node       using this idea. In that case, mark the last node as dummy! &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;*  87. Given a singly linked list, determine whether it contains a loop or not. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   ANS. (a) Start reversing the list. If you reach the head, gotcha! there           is a loop!&lt;br /&gt;         But this changes the list.  So, reverse the list again.&lt;br /&gt;(b) Maintain two pointers, initially pointing to the head. Advance           one of them one node at a time. And the other one, two nodes           at a time. If the latter overtakes the former at any time,           there is a loop! &lt;/span&gt;&lt;/p&gt;&lt;pre&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;          p1 = p2 = head;&lt;br /&gt;&lt;br /&gt;         do {&lt;br /&gt;              p1 = p1-&gt;next;&lt;br /&gt;              p2 = p2-&gt;next-&gt;next;&lt;br /&gt;         } while (p1 != p2);&lt;br /&gt;&lt;/span&gt;&lt;/pre&gt; &lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   88. Given a singly linked list, print out its contents in reverse order.       Can you do it without using any extra space? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   ANS. Start reversing the list. Do this again, printing the contents. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   89. Given a binary tree with &lt;value ptr="" ptr=""&gt; nodes,       print out the values in pre-order/in-order/post-order without       using any extra space. &lt;/value&gt;&lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   90. Reverse a singly linked list recursively. The function prototype is                   node * reverse (node *) ; &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;ANS. &lt;/span&gt;&lt;/p&gt;&lt;pre&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;    node * reverse (node * n)&lt;br /&gt;     {&lt;br /&gt;        node * m ;&lt;br /&gt;&lt;br /&gt;        if (! (n &amp;&amp;amp; n -&gt; next))&lt;br /&gt;          return n ;&lt;br /&gt;       &lt;br /&gt;        m = reverse (n -&gt; next) ;&lt;br /&gt;        n -&gt; next -&gt; next = n ;&lt;br /&gt;        n -&gt; next = NULL ;&lt;br /&gt;        return m ;&lt;br /&gt;     }&lt;br /&gt;&lt;/span&gt;&lt;/pre&gt; &lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   91. Given a singly linked list, find the middle of the list. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;    HINT. Use the single and double pointer jumping. Maintain two        pointers, initially pointing to the head. Advance one of them        one node at a time. And the other one, two nodes at a time. When        the double reaches the end, the single is in the middle. This        is not asymptotically faster but seems to take less steps than        going through the list twice. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;/p&gt;&lt;h4&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;Bit-manipulation&lt;/span&gt;&lt;/h4&gt; &lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;92. Reverse the bits of an unsigned integer. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;ANS. &lt;/span&gt;&lt;/p&gt;&lt;pre&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;    #define reverse(x)                                           (x=x&gt;&gt;16|(0x0000ffff&amp;x)&lt;&lt;16,                          x=(0xff00ff00&amp;amp;x)&gt;&gt;8|(0x00ff00ff&amp;x)&lt;&lt;8,               x=(0xf0f0f0f0&amp;amp;x)&gt;&gt;4|(0x0f0f0f0f&amp;x)&lt;&lt;4,               x=(0xcccccccc&amp;amp;x)&gt;&gt;2|(0x33333333&amp;x)&lt;&lt;2,               x=(0xaaaaaaaa&amp;amp;x)&gt;&gt;1|(0x55555555&amp;x)&lt;&lt;1)&lt;br /&gt;&lt;/span&gt;&lt;/pre&gt; &lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;*  93. Compute the number of ones in an unsigned integer. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;ANS. &lt;/span&gt;&lt;/p&gt;&lt;pre&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   #define count_ones(x)                                     (x=(0xaaaaaaaa&amp;amp;x)&gt;&gt;1+(0x55555555&amp;x),               x=(0xcccccccc&amp;amp;x)&gt;&gt;2+(0x33333333&amp;x),               x=(0xf0f0f0f0&amp;amp;x)&gt;&gt;4+(0x0f0f0f0f&amp;x),               x=(0xff00ff00&amp;amp;x)&gt;&gt;8+(0x00ff00ff&amp;x),               x=x&gt;&gt;16+(0x0000ffff&amp;amp;x))&lt;br /&gt;&lt;/span&gt;&lt;/pre&gt; &lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   94. Compute the discrete log of an unsigned integer. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;ANS. &lt;/span&gt;&lt;/p&gt;&lt;pre&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;#define discrete_log(h) (h=(h&gt;&gt;1)|(h&gt;&gt;2), h|=(h&gt;&gt;2), h|=(h&gt;&gt;4), h|=(h&gt;&gt;8), h|=(h&gt;&gt;16), h=(0xaaaaaaaa&amp;h)&gt;&gt;1+(0x55555555&amp;amp;h), h=(0xcccccccc&amp;h)&gt;&gt;2+(0x33333333&amp;amp;h), h=(0xf0f0f0f0&amp;h)&gt;&gt;4+(0x0f0f0f0f&amp;amp;h), h=(0xff00ff00&amp;h)&gt;&gt;8+(0x00ff00ff&amp;amp;h), h=(h&gt;&gt;16)+(0x0000ffff&amp;h))&lt;br /&gt;&lt;/span&gt;&lt;/pre&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;If I understand it right, log2(2) =1, log2(3)=1, log2(4)=2..... But this macro does not work out log2(0) which does not exist! How do you think it should be handled? &lt;/span&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;*  95. How do we test most simply if an unsigned integer is a power of two? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   ANS. #define power_of_two(x) \                ((x)&amp;amp;&amp;(~(x&amp;amp;(x-1)))) &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   96. Set the highest significant bit of an unsigned integer to zero. &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;ANS. (from Denis Zabavchik) Set the highest significant bit of an unsigned integer to zero&lt;br /&gt;#define zero_most_significant(h) (h&amp;=(h&gt;&gt;1)|(h&gt;&gt;2), h|=(h&gt;&gt;2), h|=(h&gt;&gt;4), h|=(h&gt;&gt;8), h|=(h&gt;&gt;16)) &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   97. Let f(k) = y where k is the y-th number in the increasing sequence       of non-negative integers with the same number of ones in its binary       representation as y, e.g. f(0) = 1, f(1) = 1, f(2) = 2, f(3) = 1,       f(4) = 3, f(5) = 2, f(6) = 3 and so on.       Given k &gt;= 0, compute f(k). &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;/p&gt;&lt;h4&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;Others&lt;/span&gt;&lt;/h4&gt; &lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   98. A character set has 1 and 2 byte characters. One byte characters       have 0 as the first bit. You just keep accumulating the characters       in a buffer. Suppose at some point the user types a backspace, how can       you remove the character efficiently. (Note: You cant store the last       character typed because the user can type in arbitrarily many backspaces) &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;     99. What is the simples way to check if the sum of two unsigned integers       has resulted in an overflow. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   100. How do you represent an n-ary tree? Write a program to print the       nodes of such a tree in breadth first order. &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;     101. Write the 'tr' program of UNIX.       Invoked as  &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;            tr -str1 -str2.         It reads stdin and prints it out to stdout, replacing every occurance of      str1[i] with str2[i].&lt;br /&gt;&lt;br /&gt;     e.g. tr -abc -xyz&lt;br /&gt;     to be and not to be   &lt;- input&lt;br /&gt;     to ye xnd not to ye   &lt;- output&lt;br /&gt;     &lt;eof&gt;&lt;br /&gt; &lt;/eof&gt;&lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;/p&gt;&lt;hr /&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;&lt;a name="network"&gt;&lt;h3&gt;Networks and Security&lt;/h3&gt;&lt;/a&gt; &lt;/span&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;1. How do you use RSA for both authentication and secrecy? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;2. What is ARP and how does it work? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;3. What's the difference between a switch and a router? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;4. Name some routing protocols? (RIP,OSPF etc..) &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;5. How do you do authentication with message digest(MD5)? (Usually MD    is used for finding tampering of data) &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;6. How do you implement a packet filter that distinguishes following    cases and selects first case and rejects second case. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   i) A host inside the corporate n/w makes a ftp request to outside       host and the outside host sends reply. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   ii) A host outside the network sends a ftp request to host inside.     for the packet filter in both cases the source and destination fields    will look the same. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;7. How does traceroute work?     Now how does traceroute make sure that the packet follows the same    path that a previous (with ttl - 1) probe packet went in? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;8. Explain Kerberos Protocol ?  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;9. What are digital signatures and smart cards? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;10. Difference between discretionary access control and mandatory     access control?  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;/p&gt;&lt;h4&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;Java&lt;/span&gt;&lt;/h4&gt; &lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;1. How do you find the size of a java object (not the primitive type) ?  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;ANS. type cast it to string and find its s.length() &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;2. Why is multiple inheritance not provided in Java? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;3. Thread t = new Thread();     t.start(); t = null; now what will happen to the created thread? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;4. How is garbage collection done in java? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;5. How do you write a "ping" routine in java? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;6. What are the security restrictions on applets?   &lt;/span&gt;&lt;/p&gt;&lt;h4&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;Graphics&lt;/span&gt;&lt;/h4&gt; &lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;     1. Write a function to check if two rectangles defined as below overlap       or not.          struct rect {                  int top, bot, left, right;          } r1, r2;  &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;     2. Write a SetPixel(x, y) function, given a pointer to the bitmap. Each       pixel is represented by 1 bit. There are 640 pixels per row. In each       byte, while the bits are numbered right to left, pixels are numbered       left to right. Avoid multiplications and divisions to improve       performance. &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;/p&gt;&lt;h4&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;Databases&lt;/span&gt;&lt;/h4&gt; &lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;*  1. You, a designer want to measure disk traffic i.e. get a histogram       showing the relative frequency of I/O/second for each disk block.       The buffer pool has b buffers and uses LRU replacement policy.       The disk block size and buffer pool block sizes are the same.       You are given a routine          int lru_block_in_position (int i)       which returns the block_id of the block in the i-th position in the       list of blocks managed by LRU.  Assume position 0 is the hottest.       You can repeatedly call this routine.        How would you get the histogram you desire? &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;Hints and Answers &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   1. Simply do       histogram [lru_block_in_position (b-1)] ++        at frequent intervals...  The sampling frequency should be close       to the disk I/O rate. It can be adjusted by remembering       the last block seen in position b. If same, decrease frequency;       if different, increase, with exponential decay etc.       And of course, take care of overflows in the histogram. &lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;  &lt;/span&gt;&lt;/p&gt;&lt;h4&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;Semaphores&lt;/span&gt;&lt;/h4&gt; &lt;p&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;   1. Implement a multiple-reader-single-writer lock given a       compare-and-swap instruction. Readers cannot overtake       waiting writers.  &lt;/span&gt;&lt;/p&gt;&lt;p&gt; &lt;/p&gt;&lt;hr /&gt;  &lt;hr /&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;&lt;a name="arch"&gt;&lt;/a&gt;&lt;/span&gt;&lt;h3&gt;&lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;&lt;a name="arch"&gt;Computer Architecture&lt;/a&gt;&lt;/span&gt;&lt;/h3&gt; &lt;span style="font-family:Verdana, Arial, Helvetica, sans-serif;"&gt;1. Explain what is DMA?&lt;br /&gt;2. What is pipelining?&lt;br /&gt;3. What are superscalar machines and vliw machines?&lt;br /&gt;4. What is cache?&lt;br /&gt;5. What is cache coherency and how is it eliminated?&lt;br /&gt;6. What is write back and write through caches?&lt;br /&gt;7. What are different pipelining hazards and how are they eliminated.&lt;br /&gt;8. What are different stages of a pipe?&lt;br /&gt;9. Explain more about branch prediction in controlling the control hazards&lt;br /&gt;10. Give examples of data hazards with pseudo codes. &lt;br /&gt;11. How do you calculate the number of sets given its way and size in a cache?&lt;br /&gt;12. How is a block found in a cache?&lt;br /&gt;13. Scoreboard analysis.&lt;br /&gt;14. What is miss penalty and give your own ideas to eliminate it.&lt;br /&gt;15. How do you improve the cache performance.&lt;br /&gt;16. Different addressing modes.&lt;br /&gt;17. Computer arithmetic with two's complements.&lt;br /&gt;18. About hardware and software interrupts.&lt;br /&gt;19. What is bus contention and how do you eliminate it.&lt;br /&gt;20. What is aliasing?&lt;br /&gt;21) What is the difference between a latch and a flip flop?&lt;br /&gt;22) What is the race around condition? How can it be overcome?&lt;br /&gt;23) What is the purpose of cache? How is it used?&lt;br /&gt;24) What are the types of memory management?&lt;/span&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114312697467690409?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114312697467690409/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114312697467690409' title='3 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114312697467690409'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114312697467690409'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/03/microsoft-sample-placement-paper-i.html' title='Microsoft :: Sample Placement Paper - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>3</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114304214145359051</id><published>2006-03-22T21:07:00.000+05:30</published><updated>2006-03-22T21:12:21.510+05:30</updated><title type='text'>Questions on Operating Systems - I</title><content type='html'>&lt;ol start="1" type="1"&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are the basic functions of an operating      system? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Explain briefly about, processor, assembler,      compiler, loader, linker and the functions executed by them. &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are the difference phases of software      development? Explain briefly? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Differentiate between RAM and ROM? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is DRAM? In which form does it store data? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is cache memory? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is hard disk and what is its purpose? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Differentiate between Complier and Interpreter? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are the different tasks of Lexical      analysis? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are the different functions of Syntax      phase, Scheduler? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are the main difference between      Micro-Controller and Micro- Processor? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Describe different job scheduling in operating      systems. &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is a Real-Time System ? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the difference between Hard and Soft      real-time systems ? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is a mission critical system ? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the important aspect of a real-time      system ? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt; If two processes which shares same system      memory and system clock in a distributed system, What is it called? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the state of the processor, when a      process is waiting for some event to occur? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What do you mean by deadlock? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Explain the difference between microkernel and      macro kernel. &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Give an example of microkernel. &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;When would you choose bottom up methodology? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;When would you choose top down methodology? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Write a small dc shell script to find number of      FF in the design. &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Why paging is used ? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Which is the best page replacement algorithm and      Why? How much time is spent usually in each phases and why? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Difference between Primary storage and secondary      storage? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is multi tasking, multi programming, multi      threading? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Difference between multi threading and multi      tasking? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Define Demand paging, page faults, replacement      algorithms, thrashing,. &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Explain about paged segmentation and segment      paging&lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;While running DOS on a PC, which command would      be used to duplicate the entire diskette? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is MUTEX ? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What isthe difference      between a 'thread' and a 'process'? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is INODE? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Explain the working of      Virtual Memory. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How does Windows NT      supports Multitasking? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Explain the Unix      Kernel. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is Concurrency?      Expain with example Deadlock and Starvation. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are your solution      strategies for "Dining Philosophers Problem" ? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Explain Memory      Partitioning, Paging, Segmentation. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Explain Scheduling. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Operating System      Security. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is Semaphore? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Explain the following      file systems : NTFS, Macintosh(HPFS), FAT . &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are the different      process states? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is Marshalling? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Define and explain      COM? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Difference - Loading      and Linking ?&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114304214145359051?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114304214145359051/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114304214145359051' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114304214145359051'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114304214145359051'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/03/questions-on-operating-systems-i.html' title='Questions on Operating Systems - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114294866174282807</id><published>2006-03-21T19:12:00.000+05:30</published><updated>2006-03-21T19:14:21.763+05:30</updated><title type='text'>Questions on Data Structure - I</title><content type='html'>&lt;ol start="1" type="1"&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is a data structure? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What does abstract data type means? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Evaluate the following prefix expression       " ++ 26 + - 1324" (Similar types can be asked) &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Convert the following infix expression to post      fix notation  ((a+2)*(b+4)) -1  (Similar types can be asked) &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How is it possible to insert different type of      elements in stack? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Stack can be described as a pointer. Explain. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Write a Binary Search program &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Write programs for Bubble Sort, Quick sort &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Explain about the types of linked lists &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How would you sort a linked list? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Write the programs for Linked List (Insertion      and Deletion) operations &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What data structure would you mostly likely see      in a non recursive implementation of a recursive algorithm? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What do you mean by Base case, Recursive case,      Binding Time, Run-Time Stack and Tail Recursion? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Explain quick sort and merge sort algorithms and      derive the time-constraint relation for these. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Explain binary searching, Fibinocci search. &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the maximum total number of nodes in a      tree that has N levels? Note that the root is level (zero) &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How many different binary trees and binary      search trees can be made from three nodes that contain the key values 1, 2      &amp; 3? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;A list is ordered from smaller to largest when a      sort is called. Which sort would take the longest time to execute? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;A list is ordered from smaller to largest when a      sort is called. Which sort would take the shortest time to execute? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;When will you  sort an array of pointers to      list elements, rather than sorting the elements themselves? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;The element being searched for is not found in      an array of 100 elements. What is the average number of comparisons needed      in a sequential search to determine that the element is not there, if the      elements are completely unordered? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the average number of comparisons needed      in a sequential search to determine the position of an element in an array      of 100 elements, if the elements are ordered from largest to smallest? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Which sort show the best average behavior? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the average number of comparisons in a      sequential search? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Which data structure is needed to convert infix      notations to post fix notations? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What do you mean by: &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;ul type="circle"&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Syntax Error &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Logical Error &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Runtime Error &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/ol&gt;  &lt;p class="MsoNormal" style="margin-left: 36pt;"&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How can you correct these errors? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/p&gt;  &lt;ol start="27" type="1"&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;In which data structure, elements can be added      or removed at either end, but not in the middle? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How will inorder, preorder and postorder      traversals print the elements of a tree? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Parenthesis are never needed in prefix or      postfix expressions. Why? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Which one is faster? A binary search of an      orderd set of elements in an array or a sequential search of the elements.&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114294866174282807?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114294866174282807/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114294866174282807' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114294866174282807'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/19569682/posts/default/114294866174282807'/><link rel='alternate' type='text/html' href='http://the-name-less-blog.blogspot.com/2006/03/questions-on-data-structure-i.html' title='Questions on Data Structure - I'/><author><name>Subash</name><uri>http://www.blogger.com/profile/03095917153942037871</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='24' src='http://2.bp.blogspot.com/_YoLjCsSgrqg/SwmIE__bTXI/AAAAAAAALbs/CplU1o50oRk/s1600-R/OgAAAOiuBrZLkIqh_O5EvM4sUezKGZlxEbCzuNlTa1LtyPlprTl9w3ibgmIBsG78buyn7ricZnqJW_FaR-uh-C34W1MAm1T1UNlHoAr9IvHLfzuw7YmCysp3LE_2.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-19569682.post-114285687981435398</id><published>2006-03-20T17:42:00.000+05:30</published><updated>2006-03-20T17:44:39.856+05:30</updated><title type='text'>Questions on Java - II</title><content type='html'>&lt;ol start="1" type="1"&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the difference between an Abstract class      and Interface? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is user defined exception? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What do you know about the garbage collector? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the difference between java and c++? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;In an HTML form I have a button which makes us      to open another page in 15 seconds. How will you do that? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the difference between process and      threads? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is update method called? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Have you ever used HashTable and Directory? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are statements in Java? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is a JAR file? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is JNI? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the base class for all swing components?      &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is JFC? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the difference between AWT and Swing? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Considering notepad/IE or any other thing as      process, What will happen if you start notepad or IE 3 times ? Where three      processes are started or three threads are started? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How does thread synchronization occur in a      monitor? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Is there any tag in HTML to upload and download      files? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Why do you canvas? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How can you know about drivers and database      information ? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is serialization? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Can you load the server object dynamically? If      so what are the 3 major steps involved in it? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the layout for toolbar? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the difference between Grid and      Gridbaglayout? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How will you add panel to a frame? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Where are the card layouts used? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the corresponding layout for card in      swing? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is light weight component? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Can you run the product development on all      operating systems? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are the benefits if Swing over AWT? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How can two threads be made to communicate with      each other? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are the files generated after using IDL to      java compiler? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the protocol used by server and client? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the functionability stubs and skeletons?      &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the mapping mechanism used by java to      identify IDL language? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is serializable interface? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the use of interface? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ol&gt;&lt;ol start="37" type="1"&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Why is java not fully objective oriented? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Why does java not support multiple inheritance? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the root class for all java classes? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is polymorphism? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Suppose if we have a variable 'I' in run method,      if I can create one or more thread each thread will occupy a separate copy      or same variable will be shared? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are virtual functions? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Write down how will you create a Binary tree? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are the traverses in binary tree? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Write a program for recursive traverse? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are session variable in servlets? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is client server computing? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is constructor and virtual function? Can we      call a virtual function in a constructor? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Why do we use oops concepts? What is its      advantage? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is middleware? What is the functionality of      web server?&lt;span style=""&gt;  &lt;/span&gt;&lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;When will you use an interface and abstract      class? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the exact difference in between Unicast      and Multicast object? Where will it be used? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the main functionality of the remote      reference layer? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How do you download stubs from Remote place? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;I want to store more than 10 objects in a remote      server? Which methodology will follow? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the main functionality of Prepared      Statement? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is meant by Static query and Dynamic query?      &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are Normalization Rules? Define Normalization?      &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is meant by Servelet? What are the      parameters of service method? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is meant by Session? Explain something      about HTTP Session Class? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;In a container there are 5 components. I want to      display all the component names, how will you do that? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Why there are some null interface in JAVA? What      does it mean? Give some null interface in JAVA? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Tell some latest versions in JAVA related areas?      &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is meant by class loader? How many types      are there? When will we use them? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is meant by flickering? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is meant by distributed application? Why      are we using that in our application? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the functionality of the stub? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Explain about version control? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Explain 2-tier and 3-tier architecture? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the role of Web Server? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How can we do validation of the fields in a      project? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is meant by cookies? Explain the main      features? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Why java is considered as platform independent? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are the advantages of java over C++? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;How java can be connected to a database? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is thread? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is difference between Process and Thread? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Does java support multiple inheritance? if not,      what is the solution? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are abstract classes? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is an interface? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is the difference abstract class and      interface? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are adapter classes? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;what is meant wrapper classes? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are JVM.JRE, J2EE, JNI? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are swing components? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What do you mean by light weight and heavy      weight components? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is meant by function overloading and      function overriding? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Does java support function overloading,      pointers, structures, unions or linked lists? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What do you mean by multithreading? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ol&gt;    &lt;ol start="90" type="1"&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are byte codes? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What are streams? &lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;What is user defined exception?&lt;/span&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Meaning - Abstract      classes, abstract methods &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Difference - Java,C++      . Difference : Java Beans, Servlets . Difference : AWT, Swing &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Difference between ==      and equals method Difference between "APPLET" and      "APPLICATION"&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Explain Java security      model. Explain working of Java Virtual Machine (JVM) &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Disadvantages of Java.      What gives java it's "write once and run anywhere" nature? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Does Java have      "goto"? What is the meaning of "final" keyword? Can I      create final executable from Java? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;li class="MsoNormal" style=""&gt;&lt;span style="font-size: 10pt; font-family: Arial;"&gt;Explain Garbage      collection mechanism in Java. What are interfaces?&lt;span style=""&gt;  &lt;/span&gt;How to support multiple inhertance in      Java? &lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ol&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/19569682-114285687981435398?l=the-name-less-blog.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://the-name-less-blog.blogspot.com/feeds/114285687981435398/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=19569682&amp;postID=114285687981435398' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/1956968
