<?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-2158258402527566027</id><updated>2011-04-21T21:17:10.888-07:00</updated><title type='text'>freshers guide</title><subtitle type='html'></subtitle><link rel='http://schemas.google.com/g/2005#feed' type='application/atom+xml' href='http://fresher-freshersguide.blogspot.com/feeds/posts/default'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/2158258402527566027/posts/default?max-results=100'/><link rel='alternate' type='text/html' href='http://fresher-freshersguide.blogspot.com/'/><link rel='hub' href='http://pubsubhubbub.appspot.com/'/><author><name>FRESHER</name><uri>http://www.blogger.com/profile/03154154368670178574</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><generator version='7.00' uri='http://www.blogger.com'>Blogger</generator><openSearch:totalResults>13</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>100</openSearch:itemsPerPage><entry><id>tag:blogger.com,1999:blog-2158258402527566027.post-1313808742791621343</id><published>2007-08-24T23:02:00.000-07:00</published><updated>2007-08-24T23:09:49.812-07:00</updated><title type='text'></title><content type='html'>&lt;DIV TYPE="HEADER"&gt; &lt;P align=center&gt; &lt;/P&gt;&lt;/DIV&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;H1 class=western style="TEXT-INDENT: -0.25in"&gt;&lt;FONT color=#ff0000&gt;O  operating Systems&lt;/FONT&gt; &lt;/H1&gt; &lt;P class=western align=left&gt;&lt;BR&gt;&lt;/P&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Following are a few basic questions that cover the essentials of OS:&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;Explain the concept of Reentrancy.&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;It is a useful, memory-saving technique for multiprogrammed timesharing systems. A &lt;I&gt;Reentrant Procedure&lt;/I&gt; is one in which multiple users can share a single copy of a program during the same period. Reentrancy has 2 key aspects: The program code cannot modify itself, and the local data for each user process must be stored separately. Thus, the permanent part is the code, and the temporary part is the pointer back to the calling program and local variables used by that program. Each execution instance is called &lt;I&gt;activation&lt;/I&gt;. It executes the code in the permanent part, but has its own copy of local variables/parameters. The temporary part associated with each activation is the &lt;I&gt;activation record&lt;/I&gt;. Generally, the activation record is kept on the stack.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;&lt;B&gt;Note&lt;/B&gt;: A reentrant procedure &lt;I&gt;can&lt;/I&gt; be interrupted and called by an interrupting program, and still execute correctly on returning to the procedure.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=2&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;Explain Belady's Anomaly.&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;Also called FIFO anomaly. Usually, on increasing the number of frames allocated to a process' virtual memory, the process execution is faster, because fewer page faults occur. Sometimes, the reverse happens, i.e., the execution time increases even when more frames are allocated to the process. This is Belady's Anomaly. This is true for certain page reference patterns.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=3&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is a binary semaphore? What is its use?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;A binary semaphore is one, which takes only 0 and 1 as values. They are used to implement mutual exclusion and synchronize concurrent processes.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=4&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is thrashing?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;It is a phenomenon in virtual memory schemes when the processor spends most of its time swapping pages, rather than executing instructions. This is due to an inordinate number of page faults.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=5&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;List the Coffman's conditions that lead to a deadlock.&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Mutual Exclusion: Only one process may use a critical resource at a time.&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Hold &amp;amp; Wait: A process may be allocated some resources while waiting for others.&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;No Pre-emption: No resource can be forcible removed from a process holding it.&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Circular Wait: A closed chain of processes exist such that each process holds at least one resource needed by another process in the chain.&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=6&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What are short-, long- and medium-term scheduling?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;Long term scheduler determines which programs are admitted to the system for processing. It controls the &lt;I&gt;degree of multiprogramming&lt;/I&gt;. Once admitted, a job becomes a process. &lt;/FONT&gt;&lt;/P&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;Medium term scheduling is part of the swapping function. This relates to processes that are in a blocked or suspended state. They are swapped out of real-memory until they are ready to execute. The swapping-in decision is based on memory-management criteria.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;Short term scheduler, also know as a &lt;I&gt;dispatcher&lt;/I&gt; executes most frequently, and makes the finest-grained decision of which process should execute next. This scheduler is invoked whenever an event occurs. It may lead to interruption of one process by preemption. &lt;/FONT&gt;&lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=7&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What are turnaround time and response time?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;Turnaround time is the interval between the submission of a job and its completion. Response time is the interval between submission of a request, and the first response to that request.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=8&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What are the typical elements of a process image?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;User data: Modifiable part of user space. May include program data, user stack area, and programs that may be modified. &lt;/FONT&gt;&lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;User program: The instructions to be executed.&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;System Stack: Each process has one or more LIFO stacks associated with it. Used to store parameters and calling addresses for procedure and system calls.&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Process control Block (PCB): Info needed by the OS to control processes.&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;P class=western style="MARGIN-LEFT: 0.5in" align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=9&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is the Translation Lookaside Buffer (TLB)?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;In a cached system, the base addresses of the last few referenced pages is maintained in registers called the TLB that aids in faster lookup. TLB contains those page-table entries that have been most recently used. Normally, each virtual memory reference causes 2 physical memory accesses-- one to fetch appropriate page-table entry, and one to fetch the desired data. Using TLB in-between, this is reduced to just one physical memory access in cases of TLB-hit.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=10&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is the resident set and working set of a process?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;Resident set is that portion of the process image that is actually in real-memory at a particular instant. Working set is that subset of resident set that is actually needed for execution. (Relate this to the variable-window size method for swapping techniques.)&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=11&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;When is a system in safe state?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;The set of dispatchable processes is in a safe state if there exists at least one temporal order in which all processes can be run to completion without resulting in a deadlock.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=12&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is cycle stealing?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;We encounter cycle stealing in the context of Direct Memory Access (DMA). Either the DMA controller can use the data bus when the CPU does not need it, or it may force the CPU to temporarily suspend operation. The latter technique is called cycle stealing. Note that cycle stealing can be done only at specific break points in an instruction cycle.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=13&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is meant by arm-stickiness?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;If one or a few processes have a high access rate to data on one track of a storage disk, then they may monopolize the device by repeated requests to that track. This generally happens with most common device scheduling algorithms (LIFO, SSTF, C-SCAN, etc). High-density multisurface disks are more likely to be affected by this than low density ones.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=14&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What are the stipulations of C2 level security?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;C2 level security provides for:&lt;/FONT&gt; &lt;/P&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Discretionary Access Control&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Identification and Authentication&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Auditing&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Resource reuse&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=15&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is busy waiting?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;The repeated execution of a loop of code while waiting for an event to occur is called busy-waiting. The CPU is not engaged in any real productive activity during this period, and the process does not progress toward completion.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=16&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;Explain the popular multiprocessor thread-scheduling strategies.&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;Load Sharing:&lt;/I&gt; Processes are not assigned to a particular processor. A global queue of threads is maintained. Each processor, when idle, selects a thread from this queue. Note that load &lt;I&gt;balancing&lt;/I&gt; refers to a scheme where work is allocated to processors on a more permanent basis. &lt;/FONT&gt;&lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;Gang Scheduling:&lt;/I&gt; A set of related threads is scheduled to run on a set of processors at the same time, on a 1-to-1 basis. Closely related threads / processes may be scheduled this way to reduce synchronization blocking, and minimize process switching. Group scheduling predated this strategy.&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;Dedicated processor assignment:&lt;/I&gt; Provides implicit scheduling defined by assignment of threads to processors. For the duration of program execution, each program is allocated a set of processors equal in number to the number of threads in the program. Processors are chosen from the available pool.&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;Dynamic scheduling:&lt;/I&gt; The number of thread in a program can be altered during the course of execution.&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=17&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;When does the condition 'rendezvous' arise?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;In message passing, it is the condition in which, both, the sender and receiver are blocked until the message is delivered.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=18&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is a trap and trapdoor?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;Trapdoor is a secret undocumented entry point into a program used to grant access without normal methods of access authentication. A trap is a software interrupt, usually the result of an error condition.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=19&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What are local and global page replacements?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;Local replacement means that an incoming page is brought in only to the relevant process' address space. Global replacement policy allows any page frame from any process to be replaced. The latter is applicable to variable partitions model only.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=20&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;Define latency, transfer and seek time with respect to disk I/O.&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;Seek time is the time required to move the disk arm to the required track. Rotational delay or latency is the time it takes for the beginning of the required sector to reach the head. Sum of seek time (if any) and latency is the access time. Time taken to actually transfer a span of data is transfer time. &lt;/FONT&gt;&lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=21&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;Describe the Buddy system of memory allocation.&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;Free memory is maintained in linked lists, each of equal sized blocks. Any such block is of size 2^k. When some memory is required by a process, the block size of next higher order is chosen, and broken into two. Note that the two such pieces differ in address only in their kth bit. Such pieces are called buddies. When any used block is freed, the OS checks to see if its buddy is also free. If so, it is rejoined, and put into the original free-block linked-list.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=22&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is time-stamping?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;It is a technique proposed by Lamport, used to order events in a distributed system without the use of clocks. This scheme is intended to order events consisting of the transmission of messages. Each system 'i' in the network maintains a counter Ci. Every time a system transmits a message, it increments its counter by 1 and attaches the time-stamp Ti to the message. When a message is received, the receiving system 'j' sets its counter Cj to 1 more than the maximum of its current value and the incoming time-stamp Ti. At each site, the ordering of messages is determined by the following rules: For messages x from site i and y from site j, x precedes y if one of the following conditions holds....(a) if Ti&amp;lt;Tj or (b) if Ti=Tj and i&amp;lt;j.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=23&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;How are the wait/signal operations for monitor different from those for semaphores?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;If a process in a monitor signal and no task is waiting on the condition variable, the signal is lost. So this allows easier program design. Whereas in semaphores, every operation affects the value of the semaphore, so the wait and signal operations should be perfectly balanced in the program.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=24&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;In the context of memory management, what are placement and replacement algorithms?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;Placement algorithms determine where in available real-memory to load a program. Common methods are first-fit, next-fit, best-fit. Replacement algorithms are used when memory is full, and one process (or part of a process) needs to be swapped out to accommodate a new program. The replacement algorithm determines which are the partitions to be swapped out.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=25&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;In loading programs into memory, what is the difference between load-time dynamic linking and run-time dynamic linking?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;For load-time dynamic linking: Load module to be loaded is read into memory. Any reference to a target external module causes that module to be loaded and the references are updated to a relative address from the start base address of the application module. &lt;/FONT&gt;&lt;/P&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;With run-time dynamic loading: Some of the linking is postponed until actual reference during execution. Then the correct module is loaded and linked.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=26&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What are demand- and pre-paging?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;With demand paging, a page is brought into memory only when a location on that page is actually referenced during execution. With pre-paging, pages other than the one demanded by a page fault are brought in. The selection of such pages is done based on common access patterns, especially for secondary memory devices.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=left&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=27&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;Paging a memory management function, while multiprogramming a processor management function, are the two interdependent?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;Yes.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=28&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is page cannibalizing?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;Page swapping or page replacements are called page cannibalizing.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=29&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What has triggered the need for multitasking in PCs?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Increased speed and memory capacity of microprocessors together with the support fir virtual memory and&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Growth of client server computing&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=30&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What are the four layers that Windows NT have in order to achieve independence?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Hardware abstraction layer&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Kernel&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Subsystems&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;System Services.&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;P class=western style="MARGIN-LEFT: 0.5in" align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=31&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is SMP?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;To achieve maximum efficiency and reliability a mode of operation known as symmetric multiprocessing is used. In essence, with SMP any process or threads can be assigned to any processor.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=32&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What are the key object oriented concepts used by Windows NT?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Encapsulation&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Object class and instance&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;P class=western style="TEXT-INDENT: 0.54in" align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=33&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;Is Windows NT a full blown object oriented operating system? Give reasons.&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;No Windows NT is not so, because its not implemented in object oriented language and the data structures reside within one executive component and are not represented as objects and it does not support object oriented capabilities .&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=34&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is a drawback of MVT?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;It does not have the features like &lt;/FONT&gt;&lt;/P&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;ability to support multiple processors&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;virtual storage&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;source level debugging&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;P class=western style="MARGIN-LEFT: 0.5in" align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=35&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is process spawning?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;When the OS at the explicit request of another process creates a process, this action is called process spawning.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=36&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;How many jobs can be run concurrently on MVT?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;15 jobs&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=37&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;List out some reasons for process termination.&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Normal completion&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Time limit exceeded&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Memory unavailable&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Bounds violation&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Protection error&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Arithmetic error&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Time overrun&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;I/O failure&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Invalid instruction&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Privileged instruction&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Data misuse&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Operator or OS intervention&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Parent termination.&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;P class=western style="MARGIN-LEFT: 0.5in" align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=38&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What are the reasons for process suspension?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;swapping&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;interactive user request&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;timing&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;parent process request&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;P class=western style="MARGIN-LEFT: 0.5in" align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=39&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is process migration?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;It is the transfer of sufficient amount of the state of process from one machine to the target machine&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=40&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is mutant?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;In Windows NT a mutant provides kernel mode or user mode mutual exclusion with the notion of ownership.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=41&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is an idle thread?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;The special thread a dispatcher will execute when no ready thread is found.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=42&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is FtDisk?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="MARGIN-LEFT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;It is a fault tolerance disk driver for Windows NT.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-LEFT: 0.5in" align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=43&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;What are the possible threads a thread can have?&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Ready&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Standby&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Running &lt;/FONT&gt;&lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Waiting&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Transition &lt;/FONT&gt;&lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Terminated.&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=44&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What are rings in Windows NT?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Windows NT uses protection mechanism called rings provides by the process to implement separation between the user mode and kernel mode.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=45&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What is Executive in Windows NT?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;FONT size=3&gt;In Windows NT, executive refers to the operating system code that runs in kernel mode.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="TEXT-INDENT: 0.5in" align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=46&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What are the sub-components of I/O manager in Windows NT?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;UL&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Network redirector/ Server&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Cache manager.&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;File systems &lt;/FONT&gt;&lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Network driver&lt;/FONT&gt; &lt;/P&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;Device driver&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/UL&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=47&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What are DDks? Name an operating system that includes this feature.&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;DDks are device driver kits, which are equivalent to SDKs for writing device drivers. Windows NT includes DDks.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;OL start=48&gt; &lt;LI&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;&lt;I&gt;What level of security does Windows NT meets?&lt;/I&gt;&lt;/FONT&gt; &lt;/P&gt;&lt;/LI&gt;&lt;/OL&gt; &lt;P class=western align=justify&gt;&lt;FONT size=3&gt;C2 level security.&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;P class=western align=justify&gt;&lt;BR&gt;&lt;/P&gt; &lt;P class=western style="PAGE-BREAK-BEFORE: always" align=left&gt;&lt;BR&gt;&lt;/P&gt; &lt;DIV TYPE="FOOTER"&gt; &lt;P style="MARGIN-TOP: 0.46in" align=left&gt;&lt;SPAN id=Frame1 dir=ltr style="BORDER-RIGHT: medium none; PADDING-RIGHT: 0in; BORDER-TOP: medium none; PADDING-LEFT: 0in; BACKGROUND: #ffffff; PADDING-BOTTOM: 0in; BORDER-LEFT: medium none; WIDTH: 0.31in; PADDING-TOP: 0in; BORDER-BOTTOM: medium none; HEIGHT: 0.15in"&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;SPAN id=Frame1 dir=ltr style="BORDER-RIGHT: medium none; PADDING-RIGHT: 0in; BORDER-TOP: medium none; PADDING-LEFT: 0in; BACKGROUND: #ffffff; PADDING-BOTTOM: 0in; BORDER-LEFT: medium none; WIDTH: 0.31in; PADDING-TOP: 0in; BORDER-BOTTOM: medium none; HEIGHT: 0.15in"&gt; &lt;P align=left&gt;1 &lt;/P&gt;&lt;/SPAN&gt;&lt;BR&gt; &lt;P&gt; &lt;/P&gt;&lt;/DIV&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/2158258402527566027-1313808742791621343?l=fresher-freshersguide.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://fresher-freshersguide.blogspot.com/feeds/1313808742791621343/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=2158258402527566027&amp;postID=1313808742791621343' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/2158258402527566027/posts/default/1313808742791621343'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/2158258402527566027/posts/default/1313808742791621343'/><link rel='alternate' type='text/html' href='http://fresher-freshersguide.blogspot.com/2007/08/o-operating-systems-following-are-few.html' title=''/><author><name>FRESHER</name><uri>http://www.blogger.com/profile/03154154368670178574</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-2158258402527566027.post-5481400208277842314</id><published>2007-08-24T22:56:00.000-07:00</published><updated>2007-08-24T23:09:49.819-07:00</updated><title type='text'></title><content type='html'>&lt;DIV TYPE="HEADER"&gt; &lt;P style="MARGIN-BOTTOM: 0in" align=center&gt; &lt;/P&gt; &lt;P style="MARGIN-BOTTOM: 0.46in"&gt;&lt;BR&gt;&lt;/P&gt;&lt;/DIV&gt; &lt;P style="MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#ff0000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=5&gt;Verbal &lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;1. Depreciation: deflation, depression, devaluation, fall, slump&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;2. Deprecate : feel and express disapproval, &lt;/FONT&gt;&lt;/FONT&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;3. Incentive : thing one encourages one to do (stimulus)&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;4. Echelon : level of authority or responsibility&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;5. Innovation : make changes or introduce new things&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;6. Intermittent : externally stopping and then starting&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;7. Detrimental: harmful&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&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 approach&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. Heterogeneous: 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. Cognizance : 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. Conglomeration: group, collection&lt;BR&gt;&lt;BR&gt;42. Aberration: deviation&lt;BR&gt;&lt;BR&gt;43. Augury : prediction&lt;BR&gt;&lt;BR&gt;44. Creditability : 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. Moratorium: legally or officially determined period of delay 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;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT style="FONT-SIZE: 9pt" size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;58. corroborative: refutable&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT style="FONT-SIZE: 9pt" size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;59. obnoxious : harmless&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT style="FONT-SIZE: 9pt" size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;60. sanction: hinder&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT style="FONT-SIZE: 9pt" size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;61. empirical: experimental&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT style="FONT-SIZE: 9pt" size=2&gt;62. aborigine: emigrant&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;63. corpulent : &lt;FONT color=#800000&gt;emaciated &lt;/FONT&gt;&lt;/FONT&gt;&lt;/P&gt; &lt;P style="MARGIN-BOTTOM: 0in"&gt;&lt;FONT size=2&gt;64. officious: &lt;FONT color=#800000&gt;pragmate&lt;/FONT&gt;&lt;FONT face="Verdana, sans-serif"&gt;   &lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;65. Agitator : Firebrand :: &lt;FONT color=#800040&gt;Renegade : Turncoat&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;66. Burst : Sound :: &lt;FONT color=#800040&gt;Tinder : Fire&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;67. Star : cluster :: &lt;FONT color=#800040&gt;Tree : clump&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;68. Piston : Cylinder :: &lt;FONT color=#800040&gt;elevator : shaft&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;69. Mitigate : punishment :: &lt;FONT color=#800040&gt;commute : sentence&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;70. Erudite : scholar :: &lt;FONT color=#800040&gt;illiterate : ignorant&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;71. Fire : Ashes :: &lt;FONT color=#800040&gt;explosion : debris &lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;72. mason : wall :: &lt;FONT color=#800040&gt;Author : Book &lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;73. Fire : Ashes :: &lt;FONT color=#800040&gt;Event : memories&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;/FONT&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;74. (a) cheerleaders : pompoms&lt;BR&gt;(b) audience:seats&lt;BR&gt;(c) team:goalposts&lt;BR&gt;(d) conductor:podium&lt;BR&gt;(e) referee:decision&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;75. archipelago:islands::&lt;BR&gt;&lt;BR&gt;(a) arbor:bower&lt;BR&gt;(b) garden:flower&lt;BR&gt;(c) mountain:valley&lt;BR&gt;(d) sand:dune&lt;BR&gt;(e) constellation:star&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;76. crow:boastful ::&lt;BR&gt;&lt;BR&gt;(a) smirk:witty&lt;BR&gt;(b) conceal:s;y&lt;BR&gt;(c) pout:sulky&lt;BR&gt;(d) blush:coarse&lt;BR&gt;(e) bluster:unhappy&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;77. bracket:shelf ::&lt;BR&gt;&lt;BR&gt;(a) hammer:anvil&lt;BR&gt;(b) girder:rivet&lt;BR&gt;(c) strut:rafter&lt;BR&gt;(d) valve:pipe&lt;BR&gt;(e) bucket:well&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;78. taxonomy:classification ::&lt;BR&gt;&lt;BR&gt;(a) etymology:derivation&lt;BR&gt;(b) autonomy:authorization&lt;BR&gt;(c) economy:rationalization&lt;BR&gt;(d) tautology:justification&lt;BR&gt;(e) ecology:urbanisation&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;79. moderator:debate ::&lt;BR&gt;&lt;BR&gt;(a) legislator:election&lt;BR&gt;(b) chef:banquet&lt;BR&gt;(c) auditor:lecture&lt;BR&gt;(d) conspirator:plot&lt;BR&gt;(e) umpire:game&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;80. glossary:words ::&lt;BR&gt;&lt;BR&gt;(a) catalogue:dates&lt;BR&gt;(b) atlas:maps&lt;BR&gt;(c) almanac:synonyms&lt;BR&gt;(d) thesaurus:rhymes&lt;BR&gt;(e) lexicon:numbers&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;81. lumber: bear ::&lt;BR&gt;&lt;BR&gt;(a) roost:hen&lt;BR&gt;(b) bray:donkey&lt;BR&gt;(c) waddle:goose&lt;BR&gt;(d) swoop:hawk&lt;BR&gt;(e) chirp:sparrow&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;82. celerity:snail ::&lt;BR&gt;&lt;BR&gt;(a) indolence:sloth&lt;BR&gt;(b) cunning:weasel&lt;BR&gt;(c) curiosity:cat&lt;BR&gt;(d) humility:peacock&lt;BR&gt;(e) obstinacy:mule&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;83. wood:sand ::&lt;BR&gt;&lt;BR&gt;(a) coal:burn&lt;BR&gt;(b) brick:lay&lt;BR&gt;(c) oil:polish&lt;BR&gt;(d) metal:burnish&lt;BR&gt;(e) stone:quarry&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;84. carpenter:saw :: &lt;BR&gt;&lt;BR&gt;(a) stenographer:typist&lt;BR&gt;(b) painter:brush&lt;BR&gt;(c) lawyer:brief&lt;BR&gt;(d) runner:sneakers&lt;BR&gt;(e) seamstress:scissors&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;85. horns:bull :: &lt;BR&gt;&lt;BR&gt;(a) mane:lion&lt;BR&gt;(b) wattles:turkey&lt;BR&gt;(c) antlers:stag&lt;BR&gt;(d) hooves:horse&lt;BR&gt;(e) wings:eagle&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;86. gullible:duped :: &lt;BR&gt;&lt;BR&gt;(a) credible:cheated&lt;BR&gt;(b) careful:cautioned&lt;BR&gt;(c) malleable:moulded&lt;BR&gt;(d) myopic:mislead&lt;BR&gt;(e) articulate:silenced&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;87. marathon:stamina :: &lt;BR&gt;&lt;BR&gt;(a) relay:independence&lt;BR&gt;(b) hurdle:perseverance&lt;BR&gt;(c) sprint:celerity&lt;BR&gt;(d) job:weariness&lt;BR&gt;(e) ramble:directness&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;88. Skin:man ::&lt;BR&gt;&lt;BR&gt;(a) hide:animal&lt;BR&gt;(b) jump:start&lt;BR&gt;(c) peel:potato&lt;BR&gt;(d) eat:food&lt;BR&gt;(e) wool:cloth&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;89. Bamboo:Shoot :: &lt;BR&gt;&lt;BR&gt;(a) Bean:Sprout&lt;BR&gt;(b) Peas:Pod&lt;BR&gt;(c) Potato:Eye&lt;BR&gt;(d) Carrot:Root&lt;BR&gt;(e) Leaf:Stem&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;90. Deflect:Missile :: &lt;BR&gt;&lt;BR&gt;(a) Siege:Castle&lt;BR&gt;(b) Distract:Attraction&lt;BR&gt;(c) Protect:Honour&lt;BR&gt;(d) Drop:Catch&lt;BR&gt;(e) Score:Goal&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;91. Editor:magazine :: &lt;BR&gt;&lt;BR&gt;(a) captain:ship&lt;BR&gt;(b) actor:movie&lt;BR&gt;(c) director:film&lt;BR&gt;(d) player:team&lt;BR&gt;(e) jockey:horse&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;92. Volcano : Lava :: &lt;BR&gt;&lt;BR&gt;(a) Fault:earthquate&lt;BR&gt;(b) crack:wall&lt;BR&gt;(c) tunnel:dig&lt;BR&gt;(d) water:swim&lt;BR&gt;(e) floor:polish&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT color=#800040&gt;&lt;BR&gt;93&lt;/FONT&gt;. Disregarded&lt;BR&gt;(a) heed&lt;BR&gt;(b) hopeful&lt;BR&gt;(c) evade&lt;BR&gt;(d) dense&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. (a)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;94. Obviate&lt;BR&gt;(a) becloud&lt;BR&gt;(b) necessitate&lt;BR&gt;(c) rationalize&lt;BR&gt;(d) execute&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. (b)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;&lt;BR&gt;95. Superficial&lt;BR&gt;(a)  profound&lt;BR&gt;(b) exaggerated&lt;BR&gt;(c) subjective&lt;BR&gt;(d) spirited&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. (a)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-BOTTOM: 0in"&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;96. chief : tribe :: &lt;FONT color=#800000&gt;governer : state&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-BOTTOM: 0in"&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;BR&gt;97. epaulette : shoulder :: &lt;FONT color=#800000&gt;tiara : head&lt;/FONT&gt; &lt;/FONT&gt;&lt;/FONT&gt;&lt;/P&gt; &lt;P class=western style="MARGIN-BOTTOM: 0in"&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;BR&gt;98. guttural : throat :: &lt;FONT color=#800000&gt;gastric : stomach&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-BOTTOM: 0in"&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;BR&gt;99. inept : clever :: &lt;FONT color=#800000&gt;languid : active&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-BOTTOM: 0in"&gt;&lt;BR&gt;&lt;/P&gt; &lt;P class=western style="MARGIN-BOTTOM: 0in"&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT color=#800000&gt;100. &lt;/FONT&gt;Erudite : scholar :: &lt;FONT color=#800040&gt;illiterate : ignorant&lt;/FONT&gt;&lt;BR&gt;&lt;/FONT&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;/P&gt; &lt;P class=western style="MARGIN-BOTTOM: 0in"&gt;&lt;BR&gt;&lt;/P&gt; &lt;DIV TYPE="FOOTER"&gt; &lt;P style="MARGIN-TOP: 0.46in; MARGIN-BOTTOM: 0in"&gt;&lt;SPAN id=Frame1 dir=ltr style="BORDER-RIGHT: medium none; PADDING-RIGHT: 0in; BORDER-TOP: medium none; PADDING-LEFT: 0in; BACKGROUND: #ffffff; PADDING-BOTTOM: 0in; BORDER-LEFT: medium none; WIDTH: 0.31in; PADDING-TOP: 0in; BORDER-BOTTOM: medium none; HEIGHT: 0.15in"&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;SPAN id=Frame1 dir=ltr style="BORDER-RIGHT: medium none; PADDING-RIGHT: 0in; BORDER-TOP: medium none; PADDING-LEFT: 0in; BACKGROUND: #ffffff; PADDING-BOTTOM: 0in; BORDER-LEFT: medium none; WIDTH: 0.31in; PADDING-TOP: 0in; BORDER-BOTTOM: medium none; HEIGHT: 0.15in"&gt; &lt;P style="MARGIN-BOTTOM: 0in"&gt;1 &lt;/P&gt;&lt;/SPAN&gt;&lt;BR&gt; &lt;P&gt;&lt;/P&gt;&lt;/DIV&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/2158258402527566027-5481400208277842314?l=fresher-freshersguide.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://fresher-freshersguide.blogspot.com/feeds/5481400208277842314/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=2158258402527566027&amp;postID=5481400208277842314' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/2158258402527566027/posts/default/5481400208277842314'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/2158258402527566027/posts/default/5481400208277842314'/><link rel='alternate' type='text/html' href='http://fresher-freshersguide.blogspot.com/2007/08/verbal-1.html' title=''/><author><name>FRESHER</name><uri>http://www.blogger.com/profile/03154154368670178574</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-2158258402527566027.post-7337528262305671819</id><published>2007-08-24T22:48:00.000-07:00</published><updated>2007-08-24T23:09:49.837-07:00</updated><title type='text'></title><content type='html'>&lt;DIV TYPE="HEADER"&gt; &lt;P style="MARGIN-BOTTOM: 0in" align=center&gt; &lt;/P&gt; &lt;P style="MARGIN-BOTTOM: 0.46in"&gt;&lt;BR&gt;&lt;/P&gt;&lt;/DIV&gt; &lt;P style="MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#ff0000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=5&gt;Technical Questions&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;1. A 2MB PCM(pulse code modulation) has&lt;BR&gt;&lt;BR&gt;a) 32 channels&lt;BR&gt;b) 30 voice channels &amp;amp; 1 signalling channel.&lt;BR&gt;c) 31 voice channels &amp;amp; 1 signalling channel.&lt;BR&gt;d) 32 channels out of which 30 voice channels, 1 signalling channel, &amp;amp; 1 Synchronizatio channel.&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800040&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (c)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;2. Time taken for 1 satellite hop in voice communication is&lt;BR&gt;&lt;BR&gt;a) 1/2 second&lt;BR&gt;b) 1 seconds&lt;BR&gt;c) 4 seconds&lt;BR&gt;d) 2 seconds&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT color=#800040&gt;Ans: (a&lt;/FONT&gt;&lt;FONT color=#006600&gt;)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;3. Max number of satellite hops allowed in voice communication is :&lt;BR&gt;&lt;BR&gt;a) only one&lt;BR&gt;b) more han one&lt;BR&gt;c) two hops&lt;BR&gt;d) four hops&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT color=#800040&gt;Ans: (c&lt;/FONT&gt;&lt;FONT color=#006600&gt;)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;4. What is the max. decimal number that can be accomodated in a byte.&lt;BR&gt;&lt;BR&gt;a) 128&lt;BR&gt;b) 256&lt;BR&gt;c) 255&lt;BR&gt;d) 512&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800040&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (c)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;5. Conditional results after execution of an instruction in a micro processor is stored in&lt;BR&gt;&lt;BR&gt;a) register&lt;BR&gt;b) accumulator&lt;BR&gt;c) flag register&lt;BR&gt;d) flag register part of PSW(Program Status Word)&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800040&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (d)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;6. Frequency at which VOICE is sampled is&lt;BR&gt;&lt;BR&gt;a) 4 Khz&lt;BR&gt;b) 8 Khz&lt;BR&gt;c) 16 Khz&lt;BR&gt;d) 64 Khz&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800040&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (a)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;7. Line of Sight is&lt;BR&gt;&lt;BR&gt;a) Straight Line&lt;BR&gt;b) Parabolic&lt;BR&gt;c) Tx &amp;amp; Rx should be visible to each other&lt;BR&gt;d) none&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800040&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (c)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;8. Purpose of PC(Program Counter) in a MicroProcessor is&lt;BR&gt;&lt;BR&gt;a) To store address of TOS(Top Of Stack)&lt;BR&gt;b) To store address of next instruction to be executed.&lt;BR&gt;c) count the number of instructions.&lt;BR&gt;d) to store base address of the stack.&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800040&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (b)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;9. What action is taken when the processor under execution is interrupted by a non-maskable interrupt?&lt;BR&gt;&lt;BR&gt;a) Processor serves the interrupt request after completing the execution of the current instruction.&lt;BR&gt;b) Processor serves the interupt request after completing the current task.&lt;BR&gt;c) Processor serves the interupt request immediately.&lt;BR&gt;d) Processor serving the interrupt request depends upon the priority of the current task under execution.&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800040&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (a)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;10. The status of the Kernel is&lt;BR&gt;&lt;BR&gt;a) task&lt;BR&gt;b) process&lt;BR&gt;c) not defined.&lt;BR&gt;d) none of the above.&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800040&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (b)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;11. To send a data packet using datagram , connection will be established&lt;BR&gt;&lt;BR&gt;a) before data transmission.&lt;BR&gt;b) connection is not established before data transmission.&lt;BR&gt;c) no connection is required.&lt;BR&gt;d) none of the above.&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800040&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (c)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;&lt;BR&gt;12. Word allignment is&lt;BR&gt;&lt;BR&gt;a) alligning the address to the next word boundary of the machine.&lt;BR&gt;b) alligning to even boundary.&lt;BR&gt;c) alligning to word boundary.&lt;BR&gt;d) none of the above.&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800040&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (a)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;13 When a 'C' function call is made, the order in which parameters passed to the function are pushed into the stack is&lt;BR&gt;&lt;BR&gt;a) left to right&lt;BR&gt;b) right to left&lt;BR&gt;c) bigger variables are moved first than the smaller variales.&lt;BR&gt;d) smaller variables are moved first than the bigger ones.&lt;BR&gt;e) none of the above.&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800040&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (b)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;14 What is the type of signalling used between two exchanges?&lt;BR&gt;&lt;BR&gt;a) inband&lt;BR&gt;b) common channel signalling&lt;BR&gt;c) any of the above&lt;BR&gt;d) none of the above.&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800040&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (a)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;15 Buffering is&lt;BR&gt;&lt;BR&gt;a) the process of temporarily storing the data to allow for small variation in device speeds&lt;BR&gt;b) a method to reduce cross talks&lt;BR&gt;c) storage of data within transmitting medium until the receiver is ready to receive.&lt;BR&gt;d) a method to reduce routing overhead.&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800040&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (a)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;&lt;BR&gt;16. Memory allocation of variables declared in a program is&lt;BR&gt;&lt;BR&gt;a) allocated in RAM.&lt;BR&gt;b) allocated in ROM.&lt;BR&gt;c) allocated on stack.&lt;BR&gt;d) assigned to registers.&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800040&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (c)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;&lt;BR&gt;17. A software that allows a personal computer to pretend as a computer terminal is&lt;BR&gt;&lt;BR&gt;a) terminal adapter&lt;BR&gt;b) bulletin board&lt;BR&gt;c) modem&lt;BR&gt;d) terminal emulation&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800040&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (d)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;18. Find the output of the following program&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;int *p,*q;&lt;BR&gt;p=(int *)1000;&lt;BR&gt;q=(int *)2000;&lt;BR&gt;printf("%d",(q-p)); &lt;/FONT&gt;&lt;/FONT&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: 500&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;&lt;BR&gt;19. Which addressing mode is used in the following statements:&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;(a) MVI  B,55&lt;BR&gt;(b) MOV B,A&lt;BR&gt;(c) MOV M,A&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. (a) Immediate addressing mode.&lt;BR&gt;(b) Register Addressing Mode&lt;BR&gt;(c) Direct addressing mode&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;&lt;BR&gt;20. RS-232C standard is used in _____________.&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. Serial I/O&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;&lt;BR&gt;21. Memory. Management in Operating Systems is done by&lt;BR&gt;&lt;BR&gt;a) Memory Management Unit&lt;BR&gt;b) Memory management software of the Operating System&lt;BR&gt;c) Kernel&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (b)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;&lt;BR&gt;22. What is done for a Push opertion?&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: SP is decremented and then the value is stored.&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;23. Binary equivalent of 52&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. 110100&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;24. Hexadecimal equivalent of 3452&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. 72A&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;25. Explain Just In Time Concept ?&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. Elimination of waste by purchasing manufacturing exactly when needed&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;26. A good way of unit testing s/w program is&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. User test&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;27. OOT uses&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. Encapsulated of detect methods&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;28.EDI useful in&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. Electronic Transmission&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;29. MRPII different from MRP&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. Modular version of man redundant initials&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;30. Hard disk time for R/W head to move to correct sector&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. Latency Time&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;31. The percentage of times a page number bound in associate register is called&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. Bit ratio&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;32. Expand MODEM&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. Modulator and Demodulator&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;33. RDBMS file system can be defined as&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. Interrelated&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;34. Super Key is&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. Primary key and Attribute&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;35. Windows 95 supports&lt;BR&gt;&lt;BR&gt;(a) Multiuser &lt;BR&gt;(b) n tasks &lt;BR&gt;(c) Both&lt;BR&gt;(d) None&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. (a)&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;36.In the command scanf, h is used for&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. Short int&lt;/FONT&gt;&lt;FONT color=#000000&gt;&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;37.A process is defined as&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. Program in execution&lt;/FONT&gt;&lt;FONT color=#000000&gt;&lt;BR&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;38.A thread is&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. Detachable unit of executable code)&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;39.What is the advantage of Win NT over Win 95&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. Robust and secure&lt;/FONT&gt;&lt;BR&gt;&lt;/FONT&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;BR&gt;&lt;BR&gt;40.How is memory management done in Win95&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. Through paging and segmentation&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;41.What is meant by polymorphism&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. Redfinition of a base class method in a derived class&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;42.What is the essential feature of inheritance&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. All properties of existing class are derived&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;43.What does the protocol FTP do&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. Transfer a file b/w stations with user authentification&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;44.In the transport layer ,TCP is what type of protocol&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. Connection oriented&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;45.Why is a gateway used&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. To connect incompatible networks&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;46.How is linked list implemented&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. By referential structures&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;47.What method is used in Win95 in multitasking&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. Non preemptive check&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;48.What is a semaphore&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. A method synchronization of multiple processes&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;49.What is the precedence order from high to low ,of the symbols ( ) ++ /&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans.( ) , ++, /&lt;/FONT&gt;&lt;BR&gt;&lt;/FONT&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;BR&gt;&lt;BR&gt;50.Preorder of A*(B+C)/D-G&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans.*+ABC/-DG&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;51.What is the efficiency of merge sort&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. O(n log n)&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;52.In which layer are routers used&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans.In network layer &lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;53.Which of the following sorting algorithem has average sorting behavior --&lt;BR&gt;       Bubble sort,merge sort,heap sort,exchange sort&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. Heap sort&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;54.In binary search tree which traversal is used for getting ascending order values--Inorder ,post order,preorder&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans.Inorder&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;55.What are device drivers used for&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans.To provide software for enabling the hardware&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;56.What is fork command in unix&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. System call used to create process&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;57.What is make command in unix&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. Used forcreation of more than one file&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;58.In unix .profile contains&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans. Start up program&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;59.In unix 'ls 'stores contents in&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800000&gt;Ans.inode block&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;&lt;BR&gt;60. Which of the following involves context switch,&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;(a) system call&lt;BR&gt;(b) priviliged instruction&lt;BR&gt;(c) floating poitnt exception&lt;BR&gt;(d) all the above&lt;BR&gt;(e) none of the above&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (a)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;&lt;BR&gt;61. In OST, terminal emulation is done in&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;(a) sessions layer&lt;BR&gt;(b) application layer&lt;BR&gt;(c) presentation layer&lt;BR&gt;(d) transport layer&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans: (b)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;62. For 1 MB memory, the  number of address lines required,&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;(a)11&lt;BR&gt;(b)16&lt;BR&gt;(c)22&lt;BR&gt;(d) 24&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. (b)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;63. Semaphore is used for&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;(a) synchronization&lt;BR&gt;(b) dead-lock avoidence&lt;BR&gt;(c) box&lt;BR&gt;(d) none&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. (a)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;64. Which holds true for the following statement&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;     &lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;class c: public A, public B&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;a) 2 member in class A, B should not have same name&lt;BR&gt;b) 2 member in class A, C should not have same name&lt;BR&gt;c) both&lt;BR&gt;d) none&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. (a)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;65.Preproconia.. does not do which one of the following&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;(a) macro&lt;BR&gt;(b) conditional compliclation&lt;BR&gt;(c) in type checking&lt;BR&gt;(d) including load file&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. (c)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;&lt;BR&gt;66. Piggy backing is a technique for&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;a) Flow control&lt;BR&gt;b) Sequence&lt;BR&gt;c) Acknowledgement&lt;BR&gt;d) retransmition&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. (c)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;67. Which is not a memory management scheme?&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;a) buddy system&lt;BR&gt;b) swapping&lt;BR&gt;c) monitors&lt;BR&gt;d) paging &lt;/FONT&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;&lt;FONT size=2&gt;Ans : c&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;68. There was a circuit given using three nand gates with two inputs and one output.&lt;BR&gt;    Find the output.&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;a) OR&lt;BR&gt;b) AND&lt;BR&gt;c) XOR&lt;BR&gt;d) NOT&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;&lt;FONT size=2&gt;Ans. (a)&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;69.Iintegrated check value(ICV) are used as:&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;&lt;FONT size=2&gt;Ans. The client computes the ICV and then compares it with the senders value.&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;70. When applets are downloaded from web sites , a byte verifier performs _________?&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;&lt;FONT size=2&gt;Ans. Status check.&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;71. An IP/IPX packet received by a computer using... having IP/IPX  both how the packet is handled.&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;&lt;FONT size=2&gt;Ans. Read the, field in the packet header with to send IP or IPX protocol.&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;72. The UNIX shell ....&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;a) does not come with the rest of the system&lt;BR&gt;b) forms the interface between the user and the kernal&lt;BR&gt;c) does not give any scope for programming&lt;BR&gt;d) deos not allow calling one program from with in another&lt;BR&gt;e) all of the above&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. (b)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;73. In UNIX a files i-node ......?&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. Is a data structure that defines all specifications of a file like the file size,&lt;BR&gt;        number of lines to a file, permissions etc.&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;74. The very first process created by the kernal that runs till the kernal process is halts is&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;a) init&lt;BR&gt;b) getty&lt;BR&gt;c) both (a) and (b)&lt;BR&gt;d) none of these&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. (a)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;75. In the process table entry for the kernel process, the process id value is&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;(a) 0&lt;BR&gt;(b) 1&lt;BR&gt;(c) 2&lt;BR&gt;(d) 255&lt;BR&gt;(e) it does not have a process table entry&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. (a)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;&lt;BR&gt;76. Which of the following API is used to hide a window&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;a) ShowWindow&lt;BR&gt;b) EnableWindow&lt;BR&gt;c) MoveWindow&lt;BR&gt;d) SetWindowPlacement&lt;BR&gt;e) None of the above&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. (a)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;77. Which function is the entry point for a DLL in MS Windows 3.1&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;a) Main&lt;BR&gt;b) Winmain&lt;BR&gt;c) Dllmain&lt;BR&gt;d) Libmain&lt;BR&gt;e) None&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. (b)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;78. The standard source for standard input, standard output and standard error is&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;a) the terminal&lt;BR&gt;b) /dev/null&lt;BR&gt;c) /usr/you/input, /usr/you/output/, /usr/you/error respectively&lt;BR&gt;d) None&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. (a)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;79. The redirection operators &amp;gt; and &amp;gt;&amp;gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;a) do the same function&lt;BR&gt;b) differ : &amp;gt; overwrites, while &amp;gt;&amp;gt; appends&lt;BR&gt;c) differ : &amp;gt; is used for input while &amp;gt;&amp;gt; is used for output&lt;BR&gt;d) differ : &amp;gt; write to any file while &amp;gt;&amp;gt; write only to standard output&lt;BR&gt;e) None of these&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. (b)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;80. The command grep first second third /usr/you/myfile&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;a) prints lines containing the words first, second or third from the file /usr/you/myfile&lt;BR&gt;b) searches for lines containing the pattern first in the files&lt;BR&gt;second, third, and /usr/you/myfile and prints them&lt;BR&gt;c) searches the files /usr/you/myfiel and third for lines containing the words first or second and prints them&lt;BR&gt;d) replaces the word first with the word second in the files third and /usr/you/myfile&lt;BR&gt;e) None of the above&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800000&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. (b)&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;81. You are creating a Index on EMPNO column in the EMPLOYEE table. Which statement will you use?&lt;BR&gt;a) CREATE INdEX emp_empno_idx ON employee, empno;&lt;BR&gt;b) CREATE INdEX emp_empno_idx FOR employee, empno;&lt;BR&gt;c) CREATE INdEX emp_empno_idx ON employee(empno);&lt;BR&gt;d) CREATE emp_empno_idx INdEX ON employee(empno);&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. c&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;BR&gt;82. Which program construct must return a value?&lt;BR&gt;a) Package&lt;BR&gt;b) Function&lt;BR&gt;c) Anonymous block&lt;BR&gt;d) Stored Procedure&lt;BR&gt;e) Application Procedure&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. b&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;BR&gt;83. Which Statement would you use to remove the EMPLOYEE_Id_PK PRIMARY KEY constraint and all depending constraints fromthe EMPLOYEE table?&lt;BR&gt;a) ALTER TABLE employee dROP PRIMARY KEY CASCAdE;&lt;BR&gt;b) ALTER TABLE employee dELETE PRIMARY KEY CASCAdE;&lt;BR&gt;c) MOdIFY TABLE employee dROP CONSTRAINT employee_id_pk CASCAdE;&lt;BR&gt;d) ALTER TABLE employee dROP PRIMARY KEY employee_id_pk CASCAdE;&lt;BR&gt;e) MOdIFY TABLE employee dELETE PRIMARY KEY employee_id_pk CASCAdE;&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans. a&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;&lt;BR&gt;84. Which three commands cause a transaction to end? (Chosse three)&lt;BR&gt;a) ALTER&lt;BR&gt;b) GRANT&lt;BR&gt;c) DELETE&lt;BR&gt;d) INSERT&lt;BR&gt;e) UPdATE&lt;BR&gt;f) ROLLBACK &lt;/FONT&gt;&lt;/FONT&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#800040&gt;&lt;FONT face="Verdana, sans-serif"&gt;&lt;FONT size=2&gt;Ans. a ,b ,f&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;85. Under which circumstance should you create an index on a table?&lt;BR&gt;a) The table is small.&lt;BR&gt;b) The table is updated frequently.&lt;BR&gt;c) A columns values are static and contain a narrow range of values&lt;BR&gt;d) Two columns are consistently used in the WHERE clause join condition of SELECT&lt;BR&gt;     statements.&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans.d&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt; &lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.17in"&gt;&lt;FONT size=2&gt;&lt;FONT face="Verdana, sans-serif"&gt;86. What was the first name given to Java Programming Language.&lt;BR&gt;&lt;BR&gt;a) Oak - Java&lt;BR&gt;b) Small Talk&lt;BR&gt;c) Oak&lt;BR&gt;d) None&lt;BR&gt;&lt;BR&gt;&lt;FONT color=#800040&gt;Ans.a&lt;BR&gt;&lt;/FONT&gt;&lt;/FONT&gt;&lt;/FONT&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;A name=top&gt;&lt;/A&gt;&lt;FONT color=#000000&gt;87.When a bicycle is in motion,the force of friction exerted by the ground on the two wheels is such that it acts&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;(a) In the backward direction on the front wheel and in the forward direction on the rear wheel.&lt;BR&gt;(b) In the forward direction on the front wheel and in the backward direction on the rear wheel.&lt;BR&gt;(c) In the backward direction on both the front and rear wheels.&lt;BR&gt;(d) In the backward direction on both the front and rear wheels. &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;Ans. (d)&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#000000&gt;&lt;BR&gt;88. A certain radioactive element A, has a half life = t seconds.&lt;BR&gt;    In (t/2) seconds the fraction of the initial quantity of the element so far decayed is nearly&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;(a) 29%&lt;BR&gt;(b) 15%&lt;BR&gt;(c) 10%&lt;BR&gt;(d) 45% &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;Ans. (a)&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#000000&gt;&lt;BR&gt;89. Which of the following plots would be a straight line ?&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;(a) Logarithm of decay rate against logarithm of time&lt;BR&gt;(b) Logarithm of decay rate against logarithm of number of decaying nuclei&lt;BR&gt;(c) Decay rate against time&lt;BR&gt;(d) Number of decaying nuclei against time &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;Ans. (b)&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#000000&gt;&lt;BR&gt;90. A radioactive element x has an atomic number of 100.&lt;BR&gt;    It decays directly into an element y which decays directly into element z.&lt;BR&gt;    In both processes a charged particle is emitted.&lt;BR&gt;    Which of the following statements would be true?&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;(a) y has an atomic number of 102&lt;BR&gt;(b) y has an atomic number of 101&lt;BR&gt;(c) z has an atomic number of 100&lt;BR&gt;(d) z has an atomic number of 101 &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;Ans. (b)&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#000000&gt;&lt;BR&gt;91. If the sum of the roots of the equation ax&lt;SUP&gt;2&lt;/SUP&gt; + bx + c=0 is equal to the sum of the squares of their reciprocals&lt;BR&gt;    then a/c, b/a, c/b are in &lt;/FONT&gt;&lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;(a) AP&lt;BR&gt;(b) GP&lt;BR&gt;(c) HP&lt;BR&gt;(d) None of these &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;Ans. (c)&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#000000&gt;&lt;BR&gt;92. A man speaks the truth 3 out of 4 times.&lt;BR&gt;    He throws a die and reports it to be a 6.&lt;BR&gt;    What is the probability of it being a 6?&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;(a) 3/8&lt;BR&gt;(b) 5/8&lt;BR&gt;(c) 3/4&lt;BR&gt;(d) None of the above &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;Ans. (a)&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#000000&gt;&lt;BR&gt;93. If cos&lt;SUP&gt;2&lt;/SUP&gt;A + cos&lt;SUP&gt;2&lt;/SUP&gt;B + cos&lt;SUP&gt;2&lt;/SUP&gt;C = 1 then ABC is a&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;(a) Right angle triangle&lt;BR&gt;(b) Equilateral triangle&lt;BR&gt;(c) All the angles are acute&lt;BR&gt;(d) None of these &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;Ans. (a)&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#000000&gt;&lt;BR&gt;94. Image of point (3,8) in the line  x + 3y = 7 is&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;(a) (-1,-4)&lt;BR&gt;(b) (-1,4)&lt;BR&gt;(c) (2,-4)&lt;BR&gt;(d) (-2,-4) &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;Ans. (a)&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#000000&gt;&lt;BR&gt;95. The mass number of a nucleus is &lt;/FONT&gt;&lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;(a) Always less than its atomic number&lt;BR&gt;(b) Always more than its atomic number&lt;BR&gt;(c) Sometimes more than and sometimes equal to its atomic number&lt;BR&gt;(d) None of the above &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;Ans. (c)&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#000000&gt;&lt;BR&gt;96. The maximum KE of the photoelectron emitted from a surface is dependent on &lt;/FONT&gt;&lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;(a) The intensity of incident radiation&lt;BR&gt;(b) The potential of the collector electrode&lt;BR&gt;(c) The frequency of incident radiation&lt;BR&gt;(d) The angle of incidence of radiation of the surface &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;Ans. (c)&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#000000&gt;&lt;BR&gt;97. Which of the following is not an essential condition for interference&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;(a) The two interfering waves must be propagated in almost the same direction or&lt;BR&gt;     the two interfering waves must intersect at a very small angle&lt;BR&gt;(b) The waves must have the same time period and wavelength&lt;BR&gt;(c) Amplitude of the two waves should be the same&lt;BR&gt;(d) The interfering beams of light must originate from the same source &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;Ans. (c)&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#000000&gt;&lt;BR&gt;98. When X-Ray photons collide with electrons &lt;/FONT&gt;&lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;(a) They slow down&lt;BR&gt;(b) Their mass increases&lt;BR&gt;(c) Their wave length increases&lt;BR&gt;(d) Their energy decreases &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;Ans. (c)&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#000000&gt;&lt;BR&gt;99. An electron emits energy &lt;/FONT&gt;&lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;(a) Because its in orbit&lt;BR&gt;(b) When it jumps from one energy level to another&lt;BR&gt;(c) Electrons are attracted towards the nucleus&lt;BR&gt;(d) The electrostatic force is insufficient to hold the electrons in orbits &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;Ans. (b)&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#000000&gt;&lt;BR&gt;100. How many bonds are present in CO&lt;SUB&gt;2&lt;/SUB&gt; molecule?&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;(a) 1&lt;BR&gt;(b) 2&lt;BR&gt;(c) 0&lt;BR&gt;(d) 4 &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;FONT color=#d83d41&gt;Ans. (d)&lt;/FONT&gt; &lt;/P&gt; &lt;P class=western style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.17in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P style="MARGIN-TOP: 0.19in; MARGIN-BOTTOM: 0.19in"&gt;&lt;BR&gt;&lt;BR&gt;&lt;/P&gt; &lt;P class=western style="MARGIN-BOTTOM: 0in"&gt;&lt;BR&gt;&lt;/P&gt; &lt;DIV TYPE="FOOTER"&gt; &lt;P style="MARGIN-TOP: 0.46in; MARGIN-BOTTOM: 0in"&gt;&lt;SPAN id=Frame1 dir=ltr style="BORDER-RIGHT: medium none; PADDING-RIGHT: 0in; BORDER-TOP: medium none; PADDING-LEFT: 0in; BACKGROUND: #ffffff; PADDING-BOTTOM: 0in; BORDER-LEFT: medium none; WIDTH: 0.31in; PADDING-TOP: 0in; BORDER-BOTTOM: medium none; HEIGHT: 0.15in"&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;SPAN id=Frame1 dir=ltr style="BORDER-RIGHT: medium none; PADDING-RIGHT: 0in; BORDER-TOP: medium none; PADDING-LEFT: 0in; BACKGROUND: #ffffff; PADDING-BOTTOM: 0in; BORDER-LEFT: medium none; WIDTH: 0.31in; PADDING-TOP: 0in; BORDER-BOTTOM: medium none; HEIGHT: 0.15in"&gt; &lt;P style="MARGIN-BOTTOM: 0in"&gt;1 &lt;/P&gt;&lt;/SPAN&gt;&lt;BR&gt; &lt;P&gt;&lt;/P&gt;&lt;/DIV&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/2158258402527566027-7337528262305671819?l=fresher-freshersguide.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://fresher-freshersguide.blogspot.com/feeds/7337528262305671819/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=2158258402527566027&amp;postID=7337528262305671819' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/2158258402527566027/posts/default/7337528262305671819'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/2158258402527566027/posts/default/7337528262305671819'/><link rel='alternate' type='text/html' href='http://fresher-freshersguide.blogspot.com/2007/08/technical-questions-1.html' title=''/><author><name>FRESHER</name><uri>http://www.blogger.com/profile/03154154368670178574</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-2158258402527566027.post-1679444877761914970</id><published>2007-08-19T22:39:00.000-07:00</published><updated>2007-08-19T22:40:11.152-07:00</updated><title type='text'>OPERATING SYSTEMS</title><content type='html'>1.   Explain the concept of Reentrancy.&lt;br /&gt; It is a useful, memory-saving technique for multiprogrammed timesharing systems. A Reentrant Procedure is one in which multiple users can share a single copy of a program during the same period. Reentrancy has 2 key aspects: &lt;br /&gt;i.) The program code cannot modify itself, &lt;br /&gt;ii.) The local data for each user process must be stored separately. &lt;br /&gt; Thus, the permanent part is the code, and the temporary part is the pointer back to the calling program and local variables used by that program. Each execution instance is called activation. It executes the code in the permanent part, but has its own copy of local variables/parameters. The temporary part associated with each activation is the activation record. Generally, the activation record is kept on the stack.&lt;br /&gt; Note: A reentrant procedure can be interrupted and called by an interrupting program, and still execute correctly on returning to the procedure.&lt;br /&gt;&lt;br /&gt;2.   Explain Belady's Anomaly.&lt;br /&gt; Also called FIFO anomaly. Usually, on increasing the number of frames allocated to a process' virtual memory, the process execution is faster, because fewer page faults occur. Sometimes, the reverse happens, i.e., the execution time increases even when more frames are allocated to the process. This is Belady's Anomaly. This is true for certain page reference patterns.&lt;br /&gt;&lt;br /&gt;3.   What is a binary semaphore? What is its use?&lt;br /&gt; A binary semaphore is one, which takes only 0 and 1 as values. They are used to implement mutual exclusion and synchronize concurrent processes.&lt;br /&gt;&lt;br /&gt;4.   What is thrashing?&lt;br /&gt;  It is a phenomenon in virtual memory schemes, when the processor spends most of its time swapping pages, rather than executing instructions. This is due to an inordinate number of page faults.&lt;br /&gt;&lt;br /&gt;5.   List the Coffman's conditions that lead to a deadlock.&lt;br /&gt; a) Mutual Exclusion: Only one process may use a critical resource at a time.&lt;br /&gt;      b) Hold &amp; Wait: A process may be allocated some resources while waiting for others.&lt;br /&gt; c) No Pre-emption: No resource can be forcible removed from a process holding it.&lt;br /&gt;       d) Circular Wait: A closed chain of processes exist such that each process holds at least one resource needed by another process in the chain. &lt;br /&gt;&lt;br /&gt;6.   What are short-, long- and medium-term scheduling?&lt;br /&gt;  Long term scheduler determines which programs are admitted to the system for processing. It controls the degree of multiprogramming. Once admitted, a job becomes a process. &lt;br /&gt; Medium term scheduling is part of the swapping function. This relates to processes that are in a blocked or suspended state. They are swapped out of main-memory until they are ready to execute. The swapping-in decision is based on memory-management criteria.&lt;br /&gt; Short term scheduler, also know as a dispatcher executes most frequently, and makes the finest-grained decision of which process should execute next. This scheduler is invoked whenever an event occurs. It may lead to interruption of one process by preemption. &lt;br /&gt;&lt;br /&gt;7.   What are turnaround time and response time?&lt;br /&gt; Turnaround time is the interval between the submission of a job and its completion. Response time is the interval between submission of a request, and the first response to that request.&lt;br /&gt;&lt;br /&gt;8.   What are the typical elements of a process image?&lt;br /&gt;  a)User data: Modifiable part of user space. May include program data, user stack area, and programs that may be modified. &lt;br /&gt;  b) User program: The instructions to be executed.&lt;br /&gt;     c) System Stack: Each process has one or more LIFO stacks associated with it. Used to store parameters and calling addresses for procedure and system calls.&lt;br /&gt; d) Process Control Block (PCB): Info needed by the OS to control processes.&lt;br /&gt;&lt;br /&gt;9.   What is the Translation Lookaside Buffer (TLB)?&lt;br /&gt; In a cached system, the base addresses of the last few referenced pages is maintained in registers called the TLB that aids in faster lookup. TLB contains those page-table entries that have been most recently used. Normally, each virtual memory reference causes 2 physical memory accesses-- one to fetch appropriate page-table entry, and one to fetch the desired data. Using TLB in-between, this is reduced to just one physical memory access in cases of TLB-hit.&lt;br /&gt;&lt;br /&gt;10.   What is the resident set and working set of a process? &lt;br /&gt;  Resident set is that portion of the process image that is actually in main-memory at a particular instant. Working set is that subset of resident set that is actually needed for execution. (Relate this to the variable-window size method for swapping techniques.)&lt;br /&gt;&lt;br /&gt;11.   When is a system in safe state?&lt;br /&gt; The set of dispatchable processes is in a safe state if there exist at least one temporal order in which all processes can be run to completion without resulting in a deadlock.&lt;br /&gt;&lt;br /&gt;12.   What is cycle stealing?&lt;br /&gt; We encounter cycle stealing in the context of Direct Memory Access (DMA). Either the DMA controller can use the data bus when the CPU does not need it, or it may force the CPU to temporarily suspend operation. The latter technique is called cycle stealing. Note that cycle stealing can be done only at specific break points in an instruction cycle.&lt;br /&gt;&lt;br /&gt;13.   What is meant by arm-stickiness?&lt;br /&gt; If one or a few processes have a high access rate to data on one track of a storage disk, then they may monopolize the device by repeated requests to that track. This generally happens with most common device scheduling algorithms (LIFO, SSTF, C-SCAN, etc). High-density multi-surface disks are more likely to be affected by this, than the low density ones.&lt;br /&gt;&lt;br /&gt;14.   What are the stipulations of C2 level security?&lt;br /&gt;  C2 level security provides for:&lt;br /&gt;1. Discretionary Access Control&lt;br /&gt;2. Identification and Authentication&lt;br /&gt;3. Auditing&lt;br /&gt;4. Resource Reuse&lt;br /&gt;&lt;br /&gt;15.   What is busy waiting?&lt;br /&gt; The repeated execution of a loop of code while waiting for an event to occur is called busy-waiting. The CPU is not engaged in any real productive activity during this period, and the process does not progress toward completion.&lt;br /&gt;&lt;br /&gt;16.   Explain the popular multiprocessor thread-scheduling strategies.&lt;br /&gt; Load Sharing: Processes are not assigned to a particular processor. A global queue of threads is maintained. Each processor, when idle, selects a thread from this queue. Note that load balancing refers to a scheme where work is allocated to processors on a more permanent basis. &lt;br /&gt; Gang Scheduling: A set of related threads is scheduled to run on a set of processors at the same time, on a 1-to-1 basis. Closely related threads / processes may be scheduled this way to reduce synchronization blocking, and minimize process switching. Group scheduling predated this strategy.&lt;br /&gt;        Dedicated processor assignment: Provides implicit scheduling defined by assignment of threads to processors. For the duration of program execution, each program is allocated a set of processors equal in number to the number of threads in the program. Processors are chosen from the available pool.&lt;br /&gt;        Dynamic scheduling: The number of thread in a program can be altered during the course of execution.&lt;br /&gt;&lt;br /&gt;17.   When does the condition 'rendezvous' arise?&lt;br /&gt; In message passing, it is the condition in which, both, the sender and receiver are blocked until the message is delivered.&lt;br /&gt;&lt;br /&gt;18.   What is a trap and trapdoor?&lt;br /&gt;  Trapdoor is a secret undocumented entry point into a program, used to grant access without normal methods of access authentication. A trap is a software interrupt, usually the result of an error condition.&lt;br /&gt;&lt;br /&gt;19.   What are local and global page replacements?&lt;br /&gt; Local replacement means that an incoming page is brought in only to the relevant process' address space. Global replacement policy allows any page frame from any process to be replaced. The latter is applicable to variable partitions model only.&lt;br /&gt;&lt;br /&gt;20.   Define latency, transfer and seek time with respect to disk I/O.&lt;br /&gt; Seek time is the time required to move the disk arm to the required track. Rotational delay or latency is the time to move the required sector to the disk head. Sums of seek time (if any) and the latency is the access time, for accessing a particular track in a particular sector. Time taken to actually transfer a span of data is transfer time.&lt;br /&gt;&lt;br /&gt;21.   Describe the Buddy system of memory allocation.&lt;br /&gt; Free memory is maintained in linked lists, each of equal sized blocks. Any such block is of size 2^k. When some memory is required by a process, the block size of next higher order is chosen, and broken into two. Note that the two such pieces differ in address only in their kth bit. Such pieces are called buddies. When any used block is freed, the OS checks to see if its buddy is also free. If so, it is rejoined, and put into the original free-block linked-list.&lt;br /&gt;&lt;br /&gt;22.   What is time stamping?&lt;br /&gt;It is a technique proposed by Lamport, used to order events in a distributed system without the use of clocks. This scheme is intended to order events consisting of the transmission of messages. Each system 'i' in the network maintains a counter Ci. Every time a system transmits a message, it increments its counter by 1 and attaches the time-stamp Ti to the message. When a message is received, the receiving system 'j' sets its counter Cj to 1 more than the maximum of its current value and the incoming time-stamp Ti. At each site, the ordering of messages is determined by the following rules: &lt;br /&gt; For messages x from site i and messages y from site j, x precedes y if one of the following conditions holds if Ti &lt; Tj  or if Ti = Tj and i &lt; j.&lt;br /&gt;&lt;br /&gt;23. How are the wait/signal operations for monitor different from those for semaphores?&lt;br /&gt; If a process in the monitor signals and no task is waiting on the condition variable, the signal is lost. So this allows easier program design. Whereas in semaphores, every operation affects the value of the semaphore, so the wait and signal operations should be perfectly balanced in the program.&lt;br /&gt;&lt;br /&gt;24.   In the context of memory management, what are placement and replacement algorithms?&lt;br /&gt; Placement algorithms determine where in the available main-memory to load the incoming process. Common methods are first-fit, next-fit, and best-fit. Replacement algorithms are used when memory is full, and one process (or part of a process) needs to be swapped out to accommodate the new incoming process. The replacement algorithm determines which are the partitions (memory portions occupied by the processes) to be swapped out.&lt;br /&gt;&lt;br /&gt;25.   In loading processes into memory, what is the difference between load-time dynamic linking and run-time dynamic linking?&lt;br /&gt; For load-time dynamic linking: Load module to be loaded is read into memory. Any reference to a target external module causes that module to be loaded and the references are updated to a relative address from the start base address of the application module. &lt;br /&gt; With run-time dynamic loading: Some of the linking is postponed until actual reference during execution. Then the correct module is loaded and linked.&lt;br /&gt;&lt;br /&gt;26.   What are demand- and pre-paging?&lt;br /&gt; With demand paging, a page is brought into the main-memory only when a location on that page is actually referenced during execution. With prepaging, pages other than the one demanded by a page fault are brought in. The selection of such pages is done based on common access patterns, especially for secondary memory devices.&lt;br /&gt;&lt;br /&gt;27.   What is mounting? &lt;br /&gt; Mounting is the mechanism by which two different file systems can be combined together. This is one of the services provided by the operating system, which allows the user to work with two different file systems, and some of the secondary devices. &lt;br /&gt;&lt;br /&gt;28.   What do you mean by dispatch latency?&lt;br /&gt; The time taken by the dispatcher to stop one process and start running another process is known as the dispatch latency.&lt;br /&gt;&lt;br /&gt;29.   What is multi-processing? &lt;br /&gt; The ability of an operating system to use more than one CPU in a single computer system. Symmetrical multiprocessing refers to the OS's ability to assign tasks dynamically to the next available processor, whereas asymmetrical multiprocessing requires that the original program designer choose the processor to use for a given task at the time of writing the program.&lt;br /&gt;&lt;br /&gt;30.   What is multitasking?&lt;br /&gt; Multitasking is a logical extension of multi-programming. This refers to the simultaneous execution of more than one program, by switching between them, in a single computer system.&lt;br /&gt;&lt;br /&gt;31.   Define multithreading?&lt;br /&gt; The concurrent processing of several tasks or threads inside the same program or process. Because several tasks can be processed parallely and no tasks have to wait for the another to finish its execution.&lt;br /&gt;&lt;br /&gt;32.   Define compaction.&lt;br /&gt; Compaction refers to the mechanism of shuffling the memory portions such that all the free portions of the memory can be aligned (or merged) together in a single large block. OS to overcome the problem of fragmentation, either internal or external, performs this mechanism, frequently. Compaction is possible only if relocation is dynamic and done at run-time, and if relocation is static and done at assembly or load-time compaction is not possible. &lt;br /&gt;&lt;br /&gt;33.   What do you mean by FAT (File Allocation Table)?&lt;br /&gt; A table that indicates the physical location on secondary storage of the space allocated to a file. FAT chains the clusters (group of sectors) to define the contents of the file. FAT allocates clusters to files.&lt;br /&gt;&lt;br /&gt;34.   What is a Kernel?&lt;br /&gt; Kernel is the nucleus or core of the operating system. This represents small part of the code, which is thought to be the entire operating system, it is most intensively used. Generally, the kernel is maintained permanently in main memory, and other portions of the OS are moved to and from the secondary storage (mostly hard disk).&lt;br /&gt;&lt;br /&gt;35.   What is memory-mapped I/O?&lt;br /&gt; Memory-mapped I/O, meaning that the communication between the I/O devices and the processor is done through physical memory locations in the address space. Each I/O device will occupy some locations in the I/O address space. I.e., it will respond when those addresses are placed on the bus. The processor can write those locations to send commands and information to the I/O device and read those locations to get information and status from the I/O device. Memory-mapped I/O makes it easy to write device drivers in a high-level language as long as the high-level language can load and store from arbitrary addresses.&lt;br /&gt;&lt;br /&gt;36.   What are the advantages of threads?&lt;br /&gt; Threads provide parallel processing like processes but they have one important advantage over process, they are much more efficient. &lt;br /&gt; Threads are cheaper to create and destroy because they do not require allocation and de-allocation of a new address space or other process resources. &lt;br /&gt; It is faster to switch between threads. It will be faster since the memory-mapping does not have to be setup and the memory and address translation caches do not have to be violated.&lt;br /&gt; Threads are efficient as they share memory. They do not have to use system calls (which are slower because of context switches) to communicate.&lt;br /&gt;&lt;br /&gt;37.   What are kernel threads?&lt;br /&gt;The processes that execute in the Kernel-mode that processes are called kernel threads.&lt;br /&gt;&lt;br /&gt;38.   What are the necessary conditions for deadlock to exist?&lt;br /&gt; Process claims exclusive control for the Resources allocated to them. (Mutual exclusion condition). &lt;br /&gt; Resources cannot be de-allocated until the process completes they are used for its complete execution. (No preemption condition).&lt;br /&gt; A process can hold one resource and wait for other resources to be allocated. (Wait for condition)&lt;br /&gt; Circular wait condition.&lt;br /&gt;&lt;br /&gt;39.   What are the strategies for dealing with deadlock?&lt;br /&gt; Prevention- Place restrictions on resource requests so that deadlock cannot occur.&lt;br /&gt; Avoidance- Plan ahead so that you never get in to a situation where deadlock is inevitable.&lt;br /&gt; Recovery- when deadlock is identified in the system, it recovers from it by removing some of the causes of the deadlock.&lt;br /&gt; Detection – detecting whether the deadlock actually exists and identifies the processes and resources that are involved in the deadlock.&lt;br /&gt;&lt;br /&gt;40.   Paging a memory management function, while multiprogramming a processor management function, are the two interdependent?&lt;br /&gt;Yes.&lt;br /&gt;&lt;br /&gt;41.   What is page cannibalizing?&lt;br /&gt;Page swapping or page replacements are called page cannibalizing.&lt;br /&gt;&lt;br /&gt;42.   What has triggered the need for multitasking in PCs?&lt;br /&gt; Increased speed and memory capacity of microprocessors together with the support fir virtual memory and&lt;br /&gt; Growth  of client server computing&lt;br /&gt;&lt;br /&gt;43.   What are the four layers that Windows NT have in order to achieve independence?&lt;br /&gt; Hardware abstraction layer&lt;br /&gt; Kernel&lt;br /&gt; Subsystems&lt;br /&gt; System Services.&lt;br /&gt;&lt;br /&gt;44.   What is SMP?&lt;br /&gt;To achieve maximum efficiency and reliability a mode of operation known as symmetric multiprocessing is used. In essence, with SMP any process or threads can be assigned to any processor.&lt;br /&gt;&lt;br /&gt;45.   What are the key object oriented concepts used by Windows NT?&lt;br /&gt; Encapsulation&lt;br /&gt; Object class and instance&lt;br /&gt;&lt;br /&gt;46.   Is Windows NT a full blown object oriented operating system? Give reasons.&lt;br /&gt;No Windows NT is not so, because its not implemented in object oriented language and the data structures reside within one executive component and are not represented as objects and it does not support object oriented capabilities .&lt;br /&gt;&lt;br /&gt;47.   What is a drawback of MVT?&lt;br /&gt;It does not have the features like &lt;br /&gt; ability to support multiple processors&lt;br /&gt; virtual storage&lt;br /&gt; source level debugging&lt;br /&gt;&lt;br /&gt;48.   What is process spawning?&lt;br /&gt;When the OS at the explicit request of another process creates a process, this action is called process spawning.&lt;br /&gt;&lt;br /&gt;49.   How many jobs can be run concurrently on MVT?&lt;br /&gt;15 jobs&lt;br /&gt;&lt;br /&gt;50.   List out some reasons for process termination.&lt;br /&gt; Normal completion&lt;br /&gt; Time limit exceeded&lt;br /&gt; Memory unavailable&lt;br /&gt; Bounds violation&lt;br /&gt; Protection error&lt;br /&gt; Arithmetic error&lt;br /&gt; Time overrun&lt;br /&gt; I/O failure&lt;br /&gt; Invalid instruction&lt;br /&gt; Privileged instruction&lt;br /&gt; Data misuse&lt;br /&gt; Operator or OS intervention&lt;br /&gt; Parent termination.&lt;br /&gt;&lt;br /&gt;51.   What are the reasons for process suspension?&lt;br /&gt; swapping&lt;br /&gt; interactive user request&lt;br /&gt; timing&lt;br /&gt; parent process request&lt;br /&gt;&lt;br /&gt;52.   What is process migration?&lt;br /&gt;It is the transfer of sufficient amount of the state of process from one machine to the target machine&lt;br /&gt;&lt;br /&gt;53.   What is mutant?&lt;br /&gt;In Windows NT a mutant provides kernel mode or user mode mutual exclusion with the notion of ownership.&lt;br /&gt;&lt;br /&gt;54.   What is an idle thread?&lt;br /&gt;The special thread a dispatcher will execute when no ready thread is found.&lt;br /&gt;&lt;br /&gt;55.   What is FtDisk?&lt;br /&gt;It is a fault tolerance disk driver for Windows NT.&lt;br /&gt;&lt;br /&gt;56.   What are the possible threads a thread can have?&lt;br /&gt; Ready&lt;br /&gt; Standby&lt;br /&gt; Running &lt;br /&gt; Waiting&lt;br /&gt; Transition &lt;br /&gt; Terminated.&lt;br /&gt;&lt;br /&gt;57.   What are rings in Windows NT?&lt;br /&gt;Windows NT uses protection mechanism called rings provides by the process to implement separation between the user mode and kernel mode.&lt;br /&gt;&lt;br /&gt;58.   What is Executive in Windows NT?&lt;br /&gt;In Windows NT, executive refers to the operating system code that runs in kernel mode.&lt;br /&gt;&lt;br /&gt;59.   What are the sub-components of I/O manager in Windows NT?&lt;br /&gt; Network redirector/ Server&lt;br /&gt; Cache manager.&lt;br /&gt; File systems &lt;br /&gt; Network driver&lt;br /&gt; Device driver&lt;br /&gt;&lt;br /&gt;60.   What are DDks? Name an operating system that includes this feature.&lt;br /&gt;DDks are device driver kits, which are equivalent to SDKs for writing device drivers. Windows NT includes DDks.&lt;br /&gt;&lt;br /&gt;61.   What level of security does Windows NT meets?&lt;br /&gt;C2 level security&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/2158258402527566027-1679444877761914970?l=fresher-freshersguide.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://fresher-freshersguide.blogspot.com/feeds/1679444877761914970/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=2158258402527566027&amp;postID=1679444877761914970' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/2158258402527566027/posts/default/1679444877761914970'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/2158258402527566027/posts/default/1679444877761914970'/><link rel='alternate' type='text/html' href='http://fresher-freshersguide.blogspot.com/2007/08/operating-systems.html' title='OPERATING SYSTEMS'/><author><name>FRESHER</name><uri>http://www.blogger.com/profile/03154154368670178574</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-2158258402527566027.post-6960828330420795107</id><published>2007-08-19T22:33:00.000-07:00</published><updated>2007-08-19T22:34:52.736-07:00</updated><title type='text'>UNIX</title><content type='html'>Section - I  - File Management In Unix&lt;br /&gt;&lt;br /&gt;1.    What are the logical blocks of the UNIX file system?&lt;br /&gt; Boot block&lt;br /&gt; Super block&lt;br /&gt; Inode block&lt;br /&gt; Data block&lt;br /&gt;&lt;br /&gt;2.   What is an 'inode'?&lt;br /&gt;All UNIX files have its description stored in a structure called 'inode'. The inode contains info about the file-size, its location, time of last access, time of last modification, permission and so on. Directories are also represented as files and have an associated inode. In addition to descriptions about the file, the inode contains pointers to the data blocks of the file. If the file is large, inode has indirect pointer to a block of pointers to additional data blocks (this further aggregates for larger files). A block is typically 8k.&lt;br /&gt;Inode consists of the following fields:&lt;br /&gt; File owner identifier&lt;br /&gt; File type&lt;br /&gt; File access permissions&lt;br /&gt; File access times&lt;br /&gt; Number of links&lt;br /&gt; File size&lt;br /&gt; Location of the file data&lt;br /&gt;&lt;br /&gt;3.  How does the inode map to data block of a file?&lt;br /&gt;Inode has 13 block addresses. The first 10 are direct block addresses and these addresses point to first 10 data blocks in the file. &lt;br /&gt;The 11th address points to a one-level index block. &lt;br /&gt;The 12th address points to a two-level (double in-direction) index block. The 13th address points to a three-level (triple in-direction) index block.&lt;br /&gt;This mapping scheme provides a very large maximum file size with efficient access to large files, still small files are accessed directly in one disk read.&lt;br /&gt;&lt;br /&gt;4.   Brief about the directory representation in UNIX&lt;br /&gt;A UNIX directory is a file containing a correspondence between filenames and inodes. A directory is a special file that the kernel maintains. Only kernel modifies directories, but processes can read directories. The contents of a directory are a list of filename and inode number pairs. When new directories are created, kernel makes two entries named '.' (refers to the directory itself) and '..' (refers to parent directory).&lt;br /&gt;The system call for creating a new directory is mkdir (pathname, mode).&lt;br /&gt;&lt;br /&gt;5.   How are devices represented in UNIX?&lt;br /&gt;All devices are represented by files that are called as special files.  They are are located in ‘/dev’ directory. Thus, device files and other files are named and accessed in the same way. &lt;br /&gt;There are two types of such special files: 'block special files' and 'character special files'. A 'block special file' represents a device with characteristics similar to a disk (data transfer in terms of blocks). A 'character special file' represents a device with characteristics similar to a keyboard (data transfer is by stream of bits in sequential order). &lt;br /&gt;&lt;br /&gt;6.   What are the Unix system calls for I/O?&lt;br /&gt; open(pathname,flag,mode)  - open file&lt;br /&gt; creat(pathname,mode)  - create file&lt;br /&gt; close(filedes)    - close an open file&lt;br /&gt; read(filedes,buffer,bytes)  - read data from an open file&lt;br /&gt; write(filedes,buffer,bytes)  - write data to an open file&lt;br /&gt; lseek(filedes,offset,from)  - position an open file&lt;br /&gt; dup(filedes)    - duplicate an existing file descriptor&lt;br /&gt; dup2(oldfd,newfd)   - duplicate to a desired file descriptor&lt;br /&gt; fcntl(filedes,cmd,arg)   - change properties of an open file&lt;br /&gt; ioctl(filedes,request,arg)  - change the behaviour of an open file&lt;br /&gt;The difference between fcntl anf ioctl is that the former is intended for any open file, while the latter is for device-specific operations.&lt;br /&gt;&lt;br /&gt;7.   How do you change File Access Permissions?&lt;br /&gt;Every file has following attributes:&lt;br /&gt; owner's user ID ( 16 bit integer )&lt;br /&gt; owner's group ID ( 16 bit integer )&lt;br /&gt; File access mode word &lt;br /&gt;'r w x - r w x - r w x'  &lt;br /&gt;(user permission - group  permission - others permission) &lt;br /&gt;r-read, w-write, x-execute.&lt;br /&gt;&lt;br /&gt;To change the access mode, we use chmod(filename,mode). &lt;br /&gt;Example 1: &lt;br /&gt;To change mode of myfile to 'rw-rw-r--' (ie. read, write permission for user - read,write permission for group - only read permission for others)  we give the args as:&lt;br /&gt;chmod(myfile,0664) .&lt;br /&gt;Each operation is represented by discrete values  &lt;br /&gt;'r' is 4 &lt;br /&gt;'w' is 2 &lt;br /&gt;'x' is 1&lt;br /&gt;Therefore, for 'rw' the value is 6(4+2).&lt;br /&gt;Example 2: &lt;br /&gt;To change mode of myfile to 'rwxr--r--' we give the args as:&lt;br /&gt;chmod(myfile,0744).&lt;br /&gt;&lt;br /&gt;8.   What are links and symbolic links in UNIX file system?&lt;br /&gt;A link is a second name for a file. Links can be used to assign more than one name to a file, but they cannot be used to assign a directory more than one name or to link filenames on different computers.&lt;br /&gt;Symbolic link 'is' a file that only contains the name of another file. Operation on the symbolic link is directed to the file pointed by the it. Both the limitations of links are eliminated in symbolic links. &lt;br /&gt;Commands for linking files are:&lt;br /&gt;Link   ln filename1 filename2 &lt;br /&gt;Symbolic link  ln -s filename1 filename2 &lt;br /&gt;&lt;br /&gt;9.   What is a FIFO?&lt;br /&gt;FIFO are otherwise called as 'named pipes'. FIFO (first-in-first-out) is a special file that is said to be ‘data transient’. Once data is read from named pipe, it cannot be read again. Also, data can be read only in the order written. It is used in interprocess communication where a process writes to one end of the pipe (producer) and the other reads from the other end (consumer).&lt;br /&gt;&lt;br /&gt;10.   How do you create special files like named pipes and device files?&lt;br /&gt;The system call mknod creates special files in the following sequence:&lt;br /&gt;1. kernel assigns new inode, &lt;br /&gt;2. sets the file type to indicate that the file is a pipe, directory or special file,&lt;br /&gt;3. If it is a device file, it makes the other entries like major, minor device numbers.&lt;br /&gt;For example: If the device is a disk, major device number refers to the disk controller and minor device number refers the disk.&lt;br /&gt; &lt;br /&gt;11.   Discuss the mount and unmount system calls&lt;br /&gt;The privileged mount system call is used to attach a file system to a directory of another file system; the unmount system call detaches a file system. When you mount another file system on to your directory, you are essentially splicing one directory tree onto a branch in another directory tree. The first argument to mount call is the mount point, that is, a directory in the current file naming system. The second argument is the file system to mount to that point. When you insert a cdrom to your Unix system's drive, the file system in the cdrom automatically mounts to /dev/cdrom in your system.&lt;br /&gt;&lt;br /&gt;12.     What are surrogate super blocks and surrogate inode tables?&lt;br /&gt;Whenever we use any file or change its permissions, these changes should be made on the disk; but this can be time consuming. Hence a copy of the super block and an inode table is maintained in the RAM that are called as the surrogate super blocks and inode tables respectively. &lt;br /&gt;The ‘sync’ command synchronizes the inode table in the memory with the one on the disk by simply overwriting the memory copy on to the disk.&lt;br /&gt;&lt;br /&gt;13.     Assuming the block size to be 1KB calculate the maximum size of a file in the Unix file system.&lt;br /&gt;The first 10 data block pointers can point to 10 data blocks each of size 1 KB .&lt;br /&gt;The 11 th pointer points to a table of block pointers the table has 256 pointers each pointing to data block of size 1 KB. Similarly the 12 th pointer can address &lt;br /&gt;(256 X 256KB) i.e. 64 MB and the 13 th pointer (256 X 64 MB) =&gt; 16 GB.  Hence the maximum size of the file is 10 KB + 256 KB + 64 MB + 16 GB.&lt;br /&gt;&lt;br /&gt;14.   What are the uses of these disk related commands: df, dfspace, du and ulimit?&lt;br /&gt;$ df            -  reports the free as well as used disk space,&lt;br /&gt;$ dfspace   - same as df but is more explanatory,&lt;br /&gt;$ du        - shows the disk space used by a specified file,&lt;br /&gt;$ ulimit   - avoids the user from creating files of very large size.&lt;br /&gt;&lt;br /&gt;Section – II   &lt;br /&gt;Process Management&lt;br /&gt;&lt;br /&gt;1.   Brief about the initial process sequence while the system boots up. &lt;br /&gt;While booting, special process called the 'swapper' or 'scheduler' is created with the Process-ID 0. The swapper manages memory allocation for processes and influences CPU allocation. The swapper inturn creates 3 children: &lt;br /&gt; the process dispatcher,&lt;br /&gt; vhand and &lt;br /&gt; dbflush &lt;br /&gt;with IDs 1,2 and 3 respectively. &lt;br /&gt;This is done by executing the file /etc/init. Process dispatcher gives birth to the shell. Unix keeps track of all the processes in an internal data structure called the Process Table (listing command is ps -el).&lt;br /&gt;&lt;br /&gt;2.  What are various IDs associated with a process?&lt;br /&gt;Unix identifies each process with an unique integer called ProcessID (PID). The process that executes the request for creation of a process is called the 'parent process' of the newly created process. &lt;br /&gt;Every process is associated with a particular user called the 'owner' who initiates the process and has privileges over the process. The identification for the user is 'UserID'. Process also has 'Effective User ID' that determines the access privileges for accessing resources like files. The system calls used for getting the various IDs are:&lt;br /&gt;getpid()  - process id&lt;br /&gt;getppid()  - parent process id&lt;br /&gt;getuid()  - user id&lt;br /&gt;geteuid()  - effective user id&lt;br /&gt;&lt;br /&gt;3.   What is the range of values PID can take?&lt;br /&gt;             PID can range from 0 to 32767.&lt;br /&gt;4.   What are the process states in Unix?&lt;br /&gt;As a process executes it changes state according to its circumstances. Unix processes have the following states: &lt;br /&gt;Running : The process is either running or it is ready to run . &lt;br /&gt;Waiting  : The process is waiting for an event or for a resource. &lt;br /&gt;Stopped : The process has been stopped, usually by receiving a signal. &lt;br /&gt;Zombie  : The process is dead but have not been removed from the process  table.&lt;br /&gt;&lt;br /&gt;5.   What Happens when you execute a program? &lt;br /&gt;When you execute a program on your UNIX system, the system creates a special environment for that program. This environment contains everything needed for the system to run the program as if no other program were running on the system. Each process has process context, which is everything that is unique about the state of the program you are currently running. Every time you execute a program the UNIX system does a fork, which performs a series of operations to create a process context and then execute your program in that context. The steps include the following: &lt;br /&gt; Allocate a slot in the process table, a list of currently running programs kept by UNIX. &lt;br /&gt; Assign a unique process identifier (PID) to the process.&lt;br /&gt; iCopy the context of the parent, the process that requested the spawning of the new process. &lt;br /&gt; Return the new PID to the parent process. This enables the parent process to examine or control the process directly. &lt;br /&gt;After the fork is complete, UNIX runs your program. &lt;br /&gt;&lt;br /&gt;6.   What Happens when you execute a command? &lt;br /&gt;When you enter 'ls' command to look at the contents of your current working directory, UNIX does a series of things to create an environment for ls and the run it: The shell has UNIX perform a fork. This creates a new process that the shell will use to run the ls program. The shell has UNIX perform an exec of the ls program. This replaces the shell program and data with the program and data for ls and then starts running that new program. The ls program is loaded into the new process context, replacing the text and data of the shell. The ls program performs its task, listing the contents of the current directory. &lt;br /&gt;&lt;br /&gt;7.   What is a zombie process?&lt;br /&gt;When a program forks and the child finishes before the parent, the kernel still keeps some of its information about the child in case the parent might need it - for example, the parent may need to check the child's exit status. To be able to get this information, the parent calls `wait()'; In the interval between the child terminating and the parent calling `wait()', the child is said to be a `zombie' (If you do `ps', the child will have a `Z' in its status field to indicate this.)  &lt;br /&gt;   &lt;br /&gt;8.   What is a daemon process?&lt;br /&gt;A daemon is a process that detaches itself from the terminal and runs, disconnected, in the background, waiting for requests and responding to them. It can also be defined as the background process that does not belong to a terminal session. Many system functions are commonly performed by daemons, including the sendmail daemon, which handles mail, and the NNTP daemon, which handles USENET news. Many other daemons may exist. Some of the most common daemons are:&lt;br /&gt; init: Takes over the basic running of the system when the kernel has finished the boot process. &lt;br /&gt; inetd: Responsible for starting network services that do not have their own stand-alone daemons. For example, inetd usually takes care of incoming rlogin, telnet, and ftp connections.&lt;br /&gt; cron: Responsible for running repetitive tasks on a regular schedule. &lt;br /&gt;Daemons can be roughly classified as system and user daemons. &lt;br /&gt;&lt;br /&gt;9.   What is an advantage of executing a process in background?&lt;br /&gt;The most common reason to put a process in the background is to allow you to do something else interactively without waiting for the process to complete. At the end of the command you add the special background symbol, &amp;. This symbol tells your shell to execute the given command in the background.&lt;br /&gt;Example: cp *.* ../backup&amp;                (cp is for copy) &lt;br /&gt;&lt;br /&gt;10.   How do you execute one program from within another?&lt;br /&gt;The system calls used for low-level process creation are execlp() and execvp(). The execlp call overlays the existing program with the new one , runs that and exits. The original program gets back control only when an error occurs.&lt;br /&gt;execlp(path,file_name,arguments..); &lt;br /&gt;//last argument must be NULL&lt;br /&gt;A variant of execlp called execvp is used when the number of arguments is not known in advance.&lt;br /&gt;execvp(path,argument_array);  &lt;br /&gt;//argument array should be terminated by NULL&lt;br /&gt;&lt;br /&gt;11.  List the system calls used for process management:&lt;br /&gt;System calls  Description&lt;br /&gt;fork()   To create a new process&lt;br /&gt;exec()   To execute a new program in a process&lt;br /&gt;wait() To wait until a created process completes its execution&lt;br /&gt;exit()   To exit from a process execution&lt;br /&gt;getpid()  To get a process identifier of the current process&lt;br /&gt;getppid()  To get parent process identifier&lt;br /&gt;nice()   To bias the existing priority of a process&lt;br /&gt;brk() To increase/decrease the data segment size of a process&lt;br /&gt;&lt;br /&gt;12.   Explain fork() system call.&lt;br /&gt;The `fork()'  used to create a new process from an existing process.  The new process is called the child process, and the existing process is called the parent.  We can tell which is which by checking the return value from `fork()'.  The parent gets the child's pid returned to him, but the child gets 0 returned to him.&lt;br /&gt;&lt;br /&gt;13.   Predict the output of the following program code&lt;br /&gt;main(){&lt;br /&gt;  fork();&lt;br /&gt;printf("Hello World!");&lt;br /&gt;}&lt;br /&gt;Answer: &lt;br /&gt;Hello World!Hello World!&lt;br /&gt;Explanation:&lt;br /&gt;The fork creates a child that is a duplicate of the parent process. The child begins from the fork().All the statements after the call to fork() will be executed twice.(once by the parent process and other by child). The statement before fork() is executed only by the parent process.&lt;br /&gt;&lt;br /&gt;14.   Predict the output of the following program code&lt;br /&gt;main(){&lt;br /&gt;fork(); fork(); fork();&lt;br /&gt;printf("Hello World!");&lt;br /&gt;}&lt;br /&gt;Answer: &lt;br /&gt;"Hello World" will be printed 8 times.&lt;br /&gt;Explanation:&lt;br /&gt;   2^n times where n is the number of calls to fork()&lt;br /&gt;&lt;br /&gt;15.   How can you get/set an environment variable from a program?&lt;br /&gt;Getting the value of an environment variable is done by using `getenv()'. Setting the value of an environment variable is done by using `putenv()'.&lt;br /&gt;&lt;br /&gt;16.   How can a parent and child process communicate?&lt;br /&gt;A parent and child can communicate through any of the normal inter-process communication schemes (pipes, sockets, message queues, shared memory), but also have some special ways to communicate that take advantage of their relationship as a parent and child. One of the most obvious is that the parent can get the exit status of the child.&lt;br /&gt;&lt;br /&gt;17.  What is IPC? What are the various schemes available? &lt;br /&gt;The term IPC (Inter-Process Communication) describes various ways by which different processes running on some operating system communicate between each other. Various schemes available are as follows:&lt;br /&gt;Pipes: &lt;br /&gt;One-way communication scheme through which different process can communicate. The problem is that the two processes should have a common ancestor (parent-child relationship). However this problem was fixed with the introduction of named-pipes (FIFO).&lt;br /&gt;Message Queues :&lt;br /&gt;Message queues can be used between related and unrelated processes running on a machine.&lt;br /&gt;Shared Memory:&lt;br /&gt;This is the fastest of all IPC schemes. The memory to be shared is mapped into the address space of the processes (that are sharing). The speed achieved is attributed to the fact that there is no kernel involvement. But this scheme needs synchronization.   &lt;br /&gt;Various forms of synchronisation are mutexes, condition-variables, read-write locks, record-locks, and semaphores.&lt;br /&gt;&lt;br /&gt;18.  Explain 'ps' command and its purpose.&lt;br /&gt;The ps command prints the process status for some or all of the running processes. The information given are the process identification number (PID), the amount of time that the process has taken to execute so far etc.&lt;br /&gt;The options used in this command are&lt;br /&gt; $ ps –a  :: Lists the processes running for other users.&lt;br /&gt;    $ ps –t   :: Lists the processes running in a particular terminal.&lt;br /&gt;   $ ps –f   :: Lists the processes along with PPID.&lt;br /&gt;    $ ps –e   :: Lists every process running at that instance.&lt;br /&gt;&lt;br /&gt;19.   How would you kill a process?&lt;br /&gt;The kill command takes the PID as one argument; this identifies which process to terminate. The PID of a process can be got using 'ps' command.&lt;br /&gt;&lt;br /&gt;20.       For some reason, the process with PID 6173 could not be terminated with the command ‘$ kill 6173’. What could be the reason and how can you terminate that process?&lt;br /&gt;The kill command when invoked sends a termination signal to the process being killed. Since the signal number is not specified unix assumes the default signal number which cannot kill certain high priority processes.&lt;br /&gt;In such cases we can use the signal number 9  ‘$ kill –9 6173’.&lt;br /&gt;&lt;br /&gt;19.   What is a shell?&lt;br /&gt;A shell is an interactive user interface to services of an operating system, that allows an user to enter commands as character strings or through a graphical user interface. The shell converts them to system calls to the OS or forks off a process to execute the command. Results of the system calls and other information from the OS are presented to the user through an interactive interface. Commonly used shells are sh,csh,ks etc. &lt;br /&gt;&lt;br /&gt;21.       Explain about the process priority values.&lt;br /&gt;Each process is assigned a priority value; higher the value lesser is its priority. The priority value for a process can range from 0 to 39.  The default priority value for a process is 20. A user is allowed to increase the value but he cannot decrease it.&lt;br /&gt;&lt;br /&gt;22.       What does the command ‘$ nice –15 cat emp.dat’ do?&lt;br /&gt;The priority value of the cat emp.dat command is increased form 20 to 35 This will slower the command as higher priority value means lesser priority.&lt;br /&gt;&lt;br /&gt;23.       Write a command such that at exactly 5 pm the message “time is 5 pm” appears on  the terminal named tty3c.&lt;br /&gt;$ at 17:00&lt;br /&gt;echo  “time is 5 pm” &gt; /dev/tty3c&lt;br /&gt;ctrl d&lt;br /&gt;$&lt;br /&gt;&lt;br /&gt;24.       What does the batch command do?&lt;br /&gt;The batch command lets the system decide the best time for executing our commands. It may not execute the commands immediately. The batch command  will be queued and executed when the system is free.&lt;br /&gt;&lt;br /&gt;25.      How is ‘crontab‘ command different from ‘at’ ?&lt;br /&gt;The crontab can carry out a submitted job every day for years together without any prompting form the user. The ‘at’ command is valid only for a day.&lt;br /&gt;&lt;br /&gt;Section - III &lt;br /&gt;Memory Management&lt;br /&gt;&lt;br /&gt;1.   What is the difference between Swapping and Paging?&lt;br /&gt;Swapping: &lt;br /&gt;Whole process is moved from the swap device to the main memory for execution. Process size must be less than or equal to the available main memory. It is easier to implementation and overhead to the system. Swapping systems does not handle the memory more flexibly as compared to the paging systems.&lt;br /&gt; Paging: &lt;br /&gt;Only the required memory pages are moved to main memory from the swap device for execution. Process size does not matter. Gives the concept of the virtual memory.&lt;br /&gt;It provides greater flexibility in mapping the virtual address space into the physical memory of the machine. Allows more number of processes to fit in the main memory simultaneously. Allows the greater process size than the available physical memory. Demand paging systems handle the memory more flexibly.&lt;br /&gt;&lt;br /&gt;2.   What is the major difference between the Historic Unix and the new BSD release of Unix System V in terms of Memory Management?&lt;br /&gt;Historic Unix uses Swapping – entire process is transferred to the main memory from the swap device, whereas the Unix System V uses Demand Paging – only the part of the process is moved to the main memory. Historic Unix uses one Swap Device and Unix System V allow multiple Swap Devices.&lt;br /&gt;&lt;br /&gt;3.   What is the main goal of the Memory Management?&lt;br /&gt; It decides which process should reside in the main memory,&lt;br /&gt; Manages the parts of the virtual address space of a process which is non-core resident,&lt;br /&gt; Monitors the available main memory and periodically write the processes into the swap device to provide more processes fit in the main memory simultaneously.&lt;br /&gt;&lt;br /&gt;4.   What is a Map?&lt;br /&gt;A Map is an Array, which contains the addresses of the free space in the swap device that are allocatable resources, and the number of the resource units available there. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;This allows First-Fit allocation of contiguous blocks of a resource. Initially the Map contains one entry – address (block offset from the starting of the swap are and the total number of resources.&lt;br /&gt;Kernel treats each unit of Map as a group of disk blocks. On the allocation and freeing of the resources Kernel updates the Map for accurate information.&lt;br /&gt;&lt;br /&gt;5.   What is a Region?&lt;br /&gt;A Region is a continuous area of a process’s address space (such as text, data and stack). The kernel in a ‘Region Table’ that is local to the process maintains region. Regions are sharable among the process.&lt;br /&gt;&lt;br /&gt;6.   What are the events done by the Kernel after a process is being swapped out from the main memory?&lt;br /&gt;When Kernel swaps the process out of the primary memory, it performs the following:&lt;br /&gt; Kernel decrements the Reference Count of each region of the process. If the reference count becomes zero, swaps the region out of the main memory,&lt;br /&gt; Kernel allocates the space for the swapping process in the swap device,&lt;br /&gt; Kernel locks the other swapping process while the current swapping operation is going on,&lt;br /&gt; The Kernel saves the swap address of the region in the region table.&lt;br /&gt;&lt;br /&gt;7.   Is the Process before and after the swap are the same? Give reason.&lt;br /&gt;Process before swapping is residing in the primary memory in its original form. The regions (text, data and stack) may not be occupied fully by the process, there may be few empty slots in any of the regions and while swapping Kernel do not bother about the empty slots while swapping the process out.&lt;br /&gt;After swapping the process resides in the swap (secondary memory) device. The regions swapped out will be present but only the occupied region slots but not the empty slots that were present before assigning.&lt;br /&gt;While swapping the process once again into the main memory, the Kernel referring to the Process Memory Map, it assigns the main memory accordingly taking care of the empty slots in the regions.&lt;br /&gt;&lt;br /&gt;8.   What do you mean by u-area (user area or u-block)?&lt;br /&gt;This contains the private data that is manipulated only by the Kernel. This is local to the Process, i.e. each process is allocated a u-area.&lt;br /&gt;&lt;br /&gt;9.   What are the entities that are swapped out of the main memory while swapping the process out of the main memory?&lt;br /&gt;All memory space occupied by the process, process’s u-area, and Kernel stack are swapped out, theoretically.&lt;br /&gt;Practically, if the process’s u-area contains the Address Translation Tables for the process then Kernel implementations do not swap the u-area.&lt;br /&gt;&lt;br /&gt;10.   What is Fork swap?&lt;br /&gt;fork() is a system call to create a child process. When the parent process calls fork() system call, the child process is created and if there is short of memory then the child process is sent to the read-to-run state in the swap device, and return to the user state without swapping the parent process. When the memory will be available the child process will be swapped into the main memory.&lt;br /&gt;&lt;br /&gt;11.   What is Expansion swap?&lt;br /&gt;At the time when any process requires more memory than it is currently allocated, the Kernel performs Expansion swap. To do this Kernel reserves enough space in the swap device. Then the address translation mapping is adjusted for the new virtual address space but the physical memory is not allocated. At last Kernel swaps the process into the assigned space in the swap device.  Later when the Kernel swaps the process into the main memory this assigns memory according to the new address translation mapping.&lt;br /&gt;&lt;br /&gt;12.   How the Swapper works?&lt;br /&gt;The swapper is the only process that swaps the processes. The Swapper operates only in the Kernel mode and it does not uses System calls instead it uses internal Kernel functions for swapping. It is the archetype of all kernel process.&lt;br /&gt;&lt;br /&gt;13.   What are the processes that are not bothered by the swapper? Give Reason.&lt;br /&gt; Zombie process: They do not take up any physical memory.&lt;br /&gt; Processes locked in memories that are updating the region of the process.&lt;br /&gt; Kernel swaps only the sleeping processes rather than the ‘ready-to-run’ processes, as they have the higher probability of being scheduled than the sleeping processes.&lt;br /&gt;&lt;br /&gt;14.   What are the requirements for a swapper to work?&lt;br /&gt;The swapper works on the highest scheduling priority. Firstly it will look for any sleeping process, if not found then it will look for the ready-to-run process for swapping. But the major requirement for the swapper to work the ready-to-run process must be core-resident for few seconds before swapping out. And for swapping in the process must have been resided in the swap device for few seconds. If the requirement is not satisfied then the swapper will go into the wait state on that event and it is awaken once in a second by the Kernel.&lt;br /&gt;&lt;br /&gt;15.      What are the criteria for choosing a process for swapping into memory from the                   swap device? &lt;br /&gt;The resident time of the processes in the swap device, the priority of the processes and the amount of time the processes had been swapped out.&lt;br /&gt;&lt;br /&gt;16.   What are the criteria for choosing a process for swapping out of the memory to the swap device?&lt;br /&gt; The process’s memory resident time,&lt;br /&gt; Priority of the process and &lt;br /&gt; The nice value.&lt;br /&gt;&lt;br /&gt;17.   What do you mean by nice value?&lt;br /&gt;Nice value is the value that controls {increments or decrements} the priority of the process. This value that is returned by the nice () system call. The equation for using nice value is: &lt;br /&gt;Priority = (“recent CPU usage”/constant) + (base- priority) + (nice value)&lt;br /&gt;Only the administrator can supply the nice value. The nice () system call works for the running process only. Nice value of one process cannot affect the nice value of the other process.&lt;br /&gt;&lt;br /&gt;18.   What are conditions on which deadlock can occur while swapping the processes?&lt;br /&gt; All processes in the main memory are asleep.&lt;br /&gt; All ‘ready-to-run’ processes are swapped out.&lt;br /&gt; There is no space in the swap device for the new incoming process that are swapped out of the main memory.&lt;br /&gt; There is no space in the main memory for the new incoming process.&lt;br /&gt;&lt;br /&gt;19.   What are conditions for a machine to support Demand Paging?&lt;br /&gt; Memory architecture must based on Pages, &lt;br /&gt; The machine must support the ‘restartable’ instructions.&lt;br /&gt;&lt;br /&gt;20.   What is ‘the principle of locality’?&lt;br /&gt;It’s the nature of the processes that they refer only to the small subset of the total data space of the process. i.e. the process frequently calls the same subroutines or executes the loop instructions.&lt;br /&gt;&lt;br /&gt;21.   What is the working set of a process?&lt;br /&gt;The set of pages that are referred by the process in the last ‘n’, references, where ‘n’ is called the window of the working set of the process.&lt;br /&gt;&lt;br /&gt;22.   What is the window of the working set of a process?&lt;br /&gt;The window of the working set of a process is the total number in which the process had referred the set of pages in the working set of the process.&lt;br /&gt;&lt;br /&gt;23.   What is called a page fault?&lt;br /&gt;Page fault is referred to the situation when the process addresses a page in the working set of the process but the process fails to locate the page in the working set. And on a page fault, the kernel updates the working set by reading the page from the secondary device.&lt;br /&gt;&lt;br /&gt;24.   What are data structures that are used for Demand Paging?&lt;br /&gt;  Kernel contains 4 data structures for Demand paging. They are,&lt;br /&gt; Page table entries,&lt;br /&gt; Disk block descriptors,&lt;br /&gt; Page frame data table (pfdat),&lt;br /&gt; Swap-use table.&lt;br /&gt; &lt;br /&gt;26.   What are the bits(UNIX System V) that support the demand paging?&lt;br /&gt;Valid, Reference, Modify, Copy on write, Age. These bits are the part of the page table entry, which includes physical address of the page and protection bits.&lt;br /&gt;&lt;br /&gt;Page address Age Copy on write Modify Reference Valid Protection&lt;br /&gt;&lt;br /&gt; &lt;br /&gt;&lt;br /&gt;27.   Difference between the fork() and vfork() system call?&lt;br /&gt;During the fork() system call the Kernel makes a copy of the parent process’s address space and attaches it to the child process.&lt;br /&gt;But the vfork() system call do not makes any copy of the parent’s address space, so it is faster than the fork() system call. The child process as a result of the vfork() system call executes exec() system call. The child process from vfork() system call executes in the parent’s address space (this can overwrite the parent’s data and stack ) which suspends the parent process until the child process exits.&lt;br /&gt;&lt;br /&gt;28.   What is BSS(Block Started by Symbol)?&lt;br /&gt;A data representation at the machine level, that has initial values when a program starts and tells about how much space the kernel allocates for the un-initialized data. Kernel initializes it to zero at run-time.&lt;br /&gt;&lt;br /&gt;29.   What is Page-Stealer process?&lt;br /&gt;This is the Kernel process that makes rooms for the incoming pages, by swapping the memory pages that are not the part of the working set of a process. Page-Stealer is created by the Kernel at the system initialization and invokes it throughout the lifetime of the system. Kernel locks a region when a process faults on a page in the region, so that page stealer cannot steal the page, which is being faulted in.&lt;br /&gt;&lt;br /&gt;30.   Name two paging states for a page in memory?&lt;br /&gt;The two paging states are:&lt;br /&gt; The page is aging and is not yet eligible for swapping,&lt;br /&gt; The page is eligible for swapping but not yet eligible for reassignment to other virtual address space.&lt;br /&gt;&lt;br /&gt;31.   What are the phases of swapping a page from the memory?&lt;br /&gt; Page stealer finds the page eligible for swapping and places the page number in the list of pages to be swapped.&lt;br /&gt; Kernel copies the page to a swap device when necessary and clears the valid bit in the page table entry, decrements the pfdata reference count, and places the pfdata table entry at the end of the free list if its reference count is 0.&lt;br /&gt;&lt;br /&gt;33.   What is page fault? Its types?&lt;br /&gt;Page fault refers to the situation of not having a page in the main memory when any process references it.&lt;br /&gt;There are two types of page fault :&lt;br /&gt; Validity fault,  &lt;br /&gt; Protection fault.&lt;br /&gt;&lt;br /&gt;34.   What is validity fault?&lt;br /&gt;If a process referring a page in the main memory whose valid bit is not set, it results in validity fault.&lt;br /&gt; The valid bit is not set for those pages:&lt;br /&gt; that are outside the virtual address space of a process,&lt;br /&gt; that are the part of the virtual address space of the process but no physical address is assigned to it.&lt;br /&gt;&lt;br /&gt;35.  What do you mean by the protection fault?&lt;br /&gt;Protection fault refers to the process accessing the pages, which do not have the access permission. A process also incur the protection fault when it attempts to write a page whose copy on write bit (UNIX System V) was set during the fork() system call.&lt;br /&gt;&lt;br /&gt;36.  In what way the Fault Handlers and the Interrupt handlers are different?&lt;br /&gt;Fault handlers are also an interrupt handler with an exception that the interrupt handlers cannot sleep. Fault handlers sleep in the context of the process that caused the memory fault. The fault refers to the running process and no arbitrary processes are put to sleep.&lt;br /&gt;&lt;br /&gt;37.   What does the swapping system do if it identifies the illegal page for swapping?&lt;br /&gt;If the disk block descriptor does not contain any record of the faulted page, then this causes the attempted memory reference is invalid and the kernel sends a “Segmentation violation” signal to the offending process. This happens when the swapping system identifies any invalid memory reference.&lt;br /&gt;&lt;br /&gt;38.   What are states that the page can be in, after causing a page fault?&lt;br /&gt; On a swap device and not in memory,&lt;br /&gt; On the free page list in the main memory,&lt;br /&gt; In an executable file,&lt;br /&gt; Marked “demand zero”,&lt;br /&gt; Marked “demand fill”. &lt;br /&gt;&lt;br /&gt;39.   In what way the validity fault handler concludes?&lt;br /&gt; It sets the valid bit of the page by clearing the modify bit.&lt;br /&gt; It recalculates the process priority.&lt;br /&gt;&lt;br /&gt;40.   At what mode the fault handler executes?&lt;br /&gt;  At the kernel mode.&lt;br /&gt;&lt;br /&gt;41.   How the Kernel handles the copy on write bit of a page, when the bit is set?&lt;br /&gt;In situations like, where the copy on write bit (UNIX System V) of a page is set and that page is shared by more than one process, the Kernel allocates new page and copies the content to the new page and the other processes retain their references to the old page. After copying the Kernel updates the page table entry with the new page number. Then Kernel decrements the reference count of the old pfdata table entry.&lt;br /&gt;In cases like, where the copy on write bit is set and no processes are sharing the page, the Kernel allows the physical page to be reused by the processes. By doing so, it clears the copy on write bit and disassociates the page from its disk copy (if one exists), because other process may share the disk copy. Then it removes the pfdata table entry from the page-queue as the new copy of the virtual page is not on the swap device. It decrements the swap-use count for the page and if count drops to 0, frees the swap space.&lt;br /&gt;&lt;br /&gt;42.   For which kind of fault the page is checked first?&lt;br /&gt;The page is first checked for the validity fault, as soon as it is found that the page is invalid (valid bit is clear), the validity fault handler returns immediately, and the process incur the validity page fault. Kernel handles the validity fault and the process will incur the protection fault if any one is present.&lt;br /&gt;&lt;br /&gt;43.   In what way the protection fault handler concludes?&lt;br /&gt;After finishing the execution of the fault handler, it sets the modify and protection bits and clears the copy on write bit (all bits as in UNIX System V). It recalculates the process-priority and checks for signals.&lt;br /&gt;&lt;br /&gt;44.   How the Kernel handles both the page stealer and the fault handler?&lt;br /&gt;The page stealer and the fault handler thrash pages because of the shortage of memory. If the sum of the working sets of all processes is greater that the physical memory then the fault handler will usually sleep because it cannot allocate pages for a process. This results in the reduction of the system throughput because Kernel spends too much time in overhead, rearranging the memory in a fast pace.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/2158258402527566027-6960828330420795107?l=fresher-freshersguide.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://fresher-freshersguide.blogspot.com/feeds/6960828330420795107/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=2158258402527566027&amp;postID=6960828330420795107' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/2158258402527566027/posts/default/6960828330420795107'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/2158258402527566027/posts/default/6960828330420795107'/><link rel='alternate' type='text/html' href='http://fresher-freshersguide.blogspot.com/2007/08/unix.html' title='UNIX'/><author><name>FRESHER</name><uri>http://www.blogger.com/profile/03154154368670178574</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-2158258402527566027.post-8827510364376048086</id><published>2007-08-19T08:22:00.000-07:00</published><updated>2007-08-19T08:23:50.564-07:00</updated><title type='text'>64 interview quetions</title><content type='html'>How to Answer &lt;br /&gt;The 64 Toughest &lt;br /&gt;Interview &lt;br /&gt;Questions&lt;br /&gt; &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;THIS BOOK IS DESIGNED TO PROVIDE ACCURATE INFORMATION ON THE SUBJECTS COVERED. HOWEVER, IT IS DONE WITH THE UNDERSTANDING THAT THE PUBLISHER IS NOT ENGAGED IN RENDERING LEGAL, ACCOUNTING OR PROFESSIONAL SERVICES. IF LEGAL ADVICE OR OTHER PROFESSIONAL ASSSTANCE IS REQUIRED, THE SERVICES OF A COMPETENT, PROFESSIONAL PERSON SHOUID BE SOUGHT. ANY NAMES USED IN THE TEXT ARE FICTITIOUS AND FOR ILLUSTRATIVE PURPOSES ONLY. ANY RESEMBLANCE TO ACTUAL PERSONS OR COMPANIES IS PURELY COINCIDENTAL AND UNINTENTIONAL. &lt;br /&gt; &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Dedication:&lt;br /&gt;This report is dedicated to courage and knowledge,&lt;br /&gt;the two qualities most needed &lt;br /&gt;to succeed in any human challenge,&lt;br /&gt;especially a job search.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt; &lt;br /&gt;Table of Contents&lt;br /&gt;&lt;br /&gt;General Guidelines in Answering Interview Questions 3&lt;br /&gt;Q1 Tell me about yourself. 5&lt;br /&gt;Q2 What are your greatest strengths? 6&lt;br /&gt;Q3 What are your greatest weaknesses? 6&lt;br /&gt;Q4 Tell me about something you did – or failed to do – that you now feel a little ashamed of. 7&lt;br /&gt;Q5 Why are you leaving (or did you leave) this position? 8&lt;br /&gt;Q6 The “Silent Treatment” 9&lt;br /&gt;Q7 Why should I hire you? 9&lt;br /&gt;Q8 Aren’t you overqualified for this position? 10&lt;br /&gt;Q9 Where do you see yourself five years from now? 11&lt;br /&gt;Q10 Describe your ideal company, location and job. 12&lt;br /&gt;Q11 Why do you want to work at our company? 12&lt;br /&gt;Q12 What are your career options right now? 12&lt;br /&gt;Q13 Why have you been out of work so long? 13&lt;br /&gt;Q14 Tell me honestly about the strong points and weak points of your boss (company, management team, etc.)… 13&lt;br /&gt;Q15 What good books have you read lately? 14&lt;br /&gt;Q16 Tell me about a situation when your work was criticized. 14&lt;br /&gt;Q17 What are your outside interest? 15&lt;br /&gt;Q18 The “Fatal Flaw” question 15&lt;br /&gt;Q19 How do you feel about reporting to a younger person (minority, woman, etc)? 16&lt;br /&gt;Q20 On confidential matters… 16&lt;br /&gt;Q21 Would you lie for the company? 17&lt;br /&gt;Q22 Looking back, what would you do differently in your life? 17&lt;br /&gt;Q23 Could you have done better in your last job? 18&lt;br /&gt;Q24 Can you work under pressure? 18&lt;br /&gt;Q25 What makes you angry? 18&lt;br /&gt;Q26 Why aren’t you earning more money at this stage of your career? 19&lt;br /&gt;Q27 Who has inspired you in your life and why? 19&lt;br /&gt;Q28 What was the toughest decision you ever had to make? 20&lt;br /&gt;Q29 Tell me about the most boring job you’ve ever had. 20&lt;br /&gt;Q30 Have you been absent from work more than a few days in any previous position? 20&lt;br /&gt;Q31 What changes would you make if you came on board? 21&lt;br /&gt;Q32 I’m concerned that you don’t have as much experience as we’d like in… 21&lt;br /&gt;Q33 How do you feel about working nights and weekends? 22&lt;br /&gt;Q34 Are you willing to relocate or travel? 23&lt;br /&gt;Q35 Do you have the stomach to fire people?  Have you had experience firing many people? 23&lt;br /&gt;Q36 Why have you had so many jobs? 24&lt;br /&gt;Q37 What do you see as the proper role/mission of… …a good (job title you’re seeking); …a good manager; …an executive in serving the community; …a leading company in our industry; etc. 25&lt;br /&gt;Q38 What would you say to your boss if he’s crazy about an idea, but you think it stinks? 25&lt;br /&gt;Q39 How could you have improved your career progress? 26&lt;br /&gt;Q40 What would you do if a fellow executive on your own corporate level wasn’t pulling his/her weight…and this was hurting your department? 26&lt;br /&gt;Q41 You’ve been with your firm a long time.  Won’t it be hard switching to a new company? 27&lt;br /&gt;Q42 May I contact your present employer for a reference? 27&lt;br /&gt;Q43 Give me an example of your creativity (analytical skill…managing ability, etc.) 28&lt;br /&gt;Q44 Where could you use some improvement? 28&lt;br /&gt;Q45 What do you worry about? 28&lt;br /&gt;Q46 How many hours a week do you normally work? 28&lt;br /&gt;Q47 What’s the most difficult part of being a (job title)? 29&lt;br /&gt;Q48 The “Hypothetical Problem” 29&lt;br /&gt;Q49 What was the toughest challenge you’ve ever faced? 29&lt;br /&gt;Q50 Have you consider starting your own business? 30&lt;br /&gt;Q51 What are your goals? 31&lt;br /&gt;Q52 What do you for when you hire people? 31&lt;br /&gt;Q53 Sell me this stapler…(this pencil…this clock…or some other object on interviewer’s desk). 31&lt;br /&gt;Q54 “The Salary Question” – How much money do you want? 33&lt;br /&gt;Q55 The Illegal Question 33&lt;br /&gt;Q56 The “Secret” Illegal Question 34&lt;br /&gt;Q57 What was the toughest part of your last job? 35&lt;br /&gt;Q58 How do you define success…and how do you measure up to your own definition?. 35&lt;br /&gt;Q59 “The Opinion Question” – What do you think about …Abortion…The President…The Death Penalty…(or any other controversial subject)? 36&lt;br /&gt;Q60 If you won $10 million lottery, would you still work? 36&lt;br /&gt;Q61 Looking back on your last position, have you done your best work? 37&lt;br /&gt;Q62 Why should I hire you from the outside when I could promote someone from within? 37&lt;br /&gt;Q63 Tell me something negative you’ve heard about our company… 38&lt;br /&gt;Q64 On a scale of one to ten, rate me as an interviewer. 38&lt;br /&gt;&lt;br /&gt; &lt;br /&gt;General Guidelines&lt;br /&gt;in Answering Interview Questions&lt;br /&gt;Everyone is nervous on interviews. If you simply allow yourself to feel nervous, you'll do much better. Remember also that it's difficult for the interviewer as well. &lt;br /&gt;In general, be upbeat and positive. Never be negative. &lt;br /&gt;Rehearse your answers and time them. Never talk for more than 2 minutes straight. &lt;br /&gt;Don't try to memorize answers word for word. Use the answers shown here as a guide only, and don't be afraid to include your own thoughts and words. To help you remember key concepts, jot down and review a few key words for each answer. Rehearse your answers frequently, and they will come to you naturally in interviews. &lt;br /&gt;As you will read in the accompanying report, the single most important strategy in interviewing, as in all phases of your job search, is what we call: "The Greatest Executive Job Finding Secret."  And that is... &lt;br /&gt;Find out what people want, than show them how you can help them get it. &lt;br /&gt;Find out what an employer wants most in his or her ideal candidate, then show how you meet those qualifications. &lt;br /&gt;In other words, you must match your abilities, with the needs of the employer. You must sell what the buyer is buying. To do that, before you know what to emphasize in your answers, you must find out what the buyer is buying... what he is looking for. And the best way to do that is to ask a few questions yourself. &lt;br /&gt;You will see how to bring this off skillfully as you read the first two questions of this report. But regardless of how you accomplish it, you must remember this strategy above all: before blurting out your qualifications, you must get some idea of what the employer wants most. Once you know what he wants, you can then present your qualifications as the perfect “key” that fits the “lock” of that position. &lt;br /&gt;• Other important interview strategies:&lt;br /&gt;• Turn weaknesses into strengths (You'll see how to do this in a few moments.) &lt;br /&gt;• Think before you answer. A pause to collect your thoughts is a hallmark of a thoughtful person. &lt;br /&gt;As a daily exercise, practice being more optimistic. For example, try putting a positive spin on events and situations you would normally regard as negative. This is not meant to turn you into a Pollyanna, but to sharpen your selling skills. The best salespeople, as well as the best liked interview candidates, come off as being naturally optimistic, "can do" people. You will dramatically raise your level of attractiveness by daily practicing to be more optimistic. &lt;br /&gt;Be honest...never lie. &lt;br /&gt;Keep an interview diary. Right after each interview note what you did right, what could have gone a little better, and what steps you should take next with this contact. Then take those steps. Don't be like the 95% of humanity who say they will follow up on something, but never do. &lt;br /&gt;About the 64 questions...&lt;br /&gt;You might feel that the answers to the following questions are “canned”, and that they will seldom match up with the exact way you are asked the questions in actual interviews. The questions and answers are designed to be as specific and realistic as possible. But no preparation can anticipate thousands of possible variations on these questions. What's important is that you thoroughly familiarize yourself with the main strategies behind each answer. And it will be invaluable to you if you commit to memory a few key words that let you instantly call to mind your best answer to the various questions. If you do this, and follow the principles of successful interviewing presented here, you're going to do very well. &lt;br /&gt;Good luck...and good job-hunting!&lt;br /&gt; &lt;br /&gt;Question 1 Tell me about yourself. &lt;br /&gt;TRAPS:  Beware, about 80% of all interviews begin with this “innocent” question. Many candidates, unprepared for the question, skewer themselves by rambling, recapping their life story, delving into ancient work history or personal matters.&lt;br /&gt;BEST ANSWER:  Start with the present and tell why you are well qualified for the position. Remember that the key to all successful interviewing is to match your qualifications to what the interviewer is looking for. In other words you must sell what the buyer is buying. This is the single most important strategy in job hunting. &lt;br /&gt;So, before you answer this or any question it's imperative that you try to uncover your interviewer's greatest need, want, problem or goal. &lt;br /&gt;To do so, make you take these two steps:&lt;br /&gt;1. Do all the homework you can before the interview to uncover this person's wants and needs (not the generalized needs of the industry or company)&lt;br /&gt;2. As early as you can in the interview, ask for a more complete description of what the position entails.  You might say: “I have a number of accomplishments I'd like to tell you about, but I want to make the best use of our time together and talk directly to your needs. To help me do, that, could you tell me more about the most important priorities of this position?  All I know is what I (heard from the recruiter, read in the classified ad, etc.)”&lt;br /&gt; Then, ALWAYS follow-up with a second and possibly, third question, to draw out his needs even more. Surprisingly, it's usually this second or third question that unearths what the interviewer is most looking for. &lt;br /&gt;You might ask simply, "And in addition to that?..." or, "Is there anything else you see as essential to success in this position?: &lt;br /&gt;This process will not feel easy or natural at first, because it is easier simply to answer questions, but only if you uncover the employer's wants and needs will your answers make the most sense. Practice asking these key questions before giving your answers, the process will feel more natural and you will be light years ahead of the other job candidates you're competing with. &lt;br /&gt;After uncovering what the employer is looking for, describe why the needs of this job bear striking parallels to tasks you've succeeded at before. Be sure to illustrate with specific examples of your responsibilities and especially your achievements, all of which are geared to present yourself as a perfect match for the needs he has just described. &lt;br /&gt;Question 2 What are your greatest strengths?&lt;br /&gt;TRAPS:  This question seems like a softball lob, but be prepared. You don't want to come across as egotistical or arrogant. Neither is this a time to be humble. &lt;br /&gt;BEST ANSWER:  You know that your key strategy is to first uncover your interviewer's greatest wants and needs before you answer questions. And from Question 1, you know how to do this. &lt;br /&gt;Prior to any interview, you should have a list mentally prepared of your greatest strengths. You should also have, a specific example or two, which illustrates each strength, an example chosen from your most recent and most impressive achievements.&lt;br /&gt;You should, have this list of your greatest strengths and corresponding examples from your achievements so well committed to memory that you can recite them cold after being shaken awake at 2:30AM. &lt;br /&gt;Then, once you uncover your interviewer's greatest wants and needs, you can choose those achievements from your list that best match up. &lt;br /&gt;As a general guideline, the 10 most desirable traits that all employers love to see in their employees are:&lt;br /&gt;1. A proven track record as an achiever...especially if your achievements match up with the employer's greatest wants and needs.&lt;br /&gt;2. Intelligence...management "savvy". &lt;br /&gt;3. Honesty...integrity...a decent human being. &lt;br /&gt;4. Good fit with corporate culture...someone to feel comfortable with...a team player who meshes well with interviewer's team.&lt;br /&gt;5. Likeability...positive attitude...sense of humor.&lt;br /&gt;6. Good communication skills.&lt;br /&gt;7. Dedication...willingness to walk the extra mile to achieve excellence.&lt;br /&gt;8. Definiteness of purpose...clear goals.&lt;br /&gt;9. Enthusiasm...high level of motivation.&lt;br /&gt;10. Confident...healthy...a leader. &lt;br /&gt;Question 3 What are your greatest weaknesses? &lt;br /&gt;TRAPS:  Beware - this is an eliminator question, designed to shorten the candidate list. Any admission of a weakness or fault will earn you an “A” for honesty, but an “F” for the interview. &lt;br /&gt;PASSABLE ANSWER:  Disguise a strength as a weakness. &lt;br /&gt;Example: “I sometimes push my people too hard.  I like to work with a sense of urgency and everyone is not always on the same wavelength.”&lt;br /&gt;Drawback:  This strategy is better than admitting a flaw, but it's so widely used, it is transparent to any experienced interviewer. &lt;br /&gt;BEST ANSWER:  (and another reason it's so important to get a thorough description of your interviewer's needs before you answer questions): Assure the interviewer that you can think of nothing that would stand in the way of your performing in this position with excellence. Then, quickly review you strongest qualifications. &lt;br /&gt;Example:  “Nobody's perfect, but based on what you've told me about this position, I believe I' d make an outstanding match. I know that when I hire people, I look for two things most of all. Do they have the qualifications to do the job well, and the motivation to do it well?  Everything in my background shows I have both the qualifications and a strong desire to achieve excellence in whatever I take on. So I can say in all honesty that I see nothing that would cause you even a small concern about my ability or my strong desire to perform this job with excellence.”&lt;br /&gt;Alternate strategy (if you don't yet know enough about the position to talk about such a perfect fit): &lt;br /&gt;Instead of confessing a weakness, describe what you like most and like least, making sure that what you like most matches up with the most important qualification for success in the position, and what you like least is not essential. &lt;br /&gt;Example:  Let's say you're applying for a teaching position. “If given a choice, I like to spend as much time as possible in front of my prospects selling, as opposed to shuffling paperwork back at the office.  Of course, I long ago learned the importance of filing paperwork properly, and I do it conscientiously. But what I really love to do is sell (if your interviewer were a sales manager, this should be music to his ears.)&lt;br /&gt;Question 4 Tell me about something you did – or failed to do – that you now feel a little ashamed of.&lt;br /&gt;TRAPS:  There are some questions your interviewer has no business asking, and this is one.  But while you may feel like answering, “none of your business,” naturally you can’t.  Some interviewers ask this question on the chance you admit to something, but if not, at least they’ll see how you think on your feet.&lt;br /&gt;Some unprepared candidates, flustered by this question, unburden themselves of guilt from their personal life or career, perhaps expressing regrets regarding a parent, spouse, child, etc.  All such answers can be disastrous.&lt;br /&gt;BEST ANSWER:  As with faults and weaknesses, never confess a regret.  But don’t seem as if you’re stonewalling either.&lt;br /&gt;Best strategy:  Say you harbor no regrets, then add a principle or habit you practice regularly for healthy human relations.&lt;br /&gt;Example:  Pause for reflection, as if the question never occurred to you.  Then say, “You know, I really can’t think of anything.”  (Pause again, then add): “I would add that as a general management principle, I’ve found that the best way to avoid regrets is to avoid causing them in the first place.  I practice one habit that helps me a great deal in this regard.  At the end of each day, I mentally review the day’s events and conversations to take a second look at the people and developments I’m involved with and do a doublecheck of what they’re likely to be feeling.  Sometimes I’ll see things that do need more follow-up, whether a pat on the back, or maybe a five minute chat in someone’s office to make sure we’re clear on things…whatever.”&lt;br /&gt;“I also like to make each person feel like a member of an elite team, like the Boston Celtics or LA Lakers in their prime.  I’ve found that if you let each team member know you expect excellence in their performance…if you work hard to set an example yourself…and if you let people know you appreciate and respect their feelings, you wind up with a highly motivated group, a team that’s having fun at work because they’re striving for excellence rather than brooding over slights or regrets.”&lt;br /&gt;Question 5 Why are you leaving (or did you leave) this position?&lt;br /&gt;TRAPS:  Never badmouth your previous industry, company, board, boss, staff, employees or customers.  This rule is inviolable:  never be negative.  Any mud you hurl will only soil your suit.&lt;br /&gt;Especially avoid words like “personality clash”, “didn’t get along”, or others which cast a shadow on your competence, integrity, or temperament.&lt;br /&gt;BEST ANSWER:&lt;br /&gt;(If you have a job presently)&lt;br /&gt;If you’re not yet 100% committed to leaving your present post, don’t be afraid to say so.  Since you have a job, you are in a stronger position than someone who does not.  But don’t be coy either.  State honestly what you’d be hoping to find in a new spot.  Of course, as stated often before, you answer will all the stronger if you have already uncovered what this position is all about and you match your desires to it.&lt;br /&gt;(If you do not presently have a job.)&lt;br /&gt;Never lie about having been fired.  It’s unethical – and too easily checked.  But do try to deflect the reason from you personally.  If your firing was the result of a takeover, merger, division wide layoff, etc., so much the better.&lt;br /&gt;But you should also do something totally unnatural that will demonstrate consummate professionalism.  Even if it hurts , describe your own firing – candidly, succinctly and without a trace of bitterness – from the company’s point-of-view, indicating that you could understand why it happened and you might have made the same decision yourself.&lt;br /&gt;Your stature will rise immensely and, most important of all, you will show you are healed from the wounds inflicted by the firing.  You will enhance your image as first-class management material and stand head and shoulders above the legions of firing victims who, at the slightest provocation, zip open their shirts to expose their battle scars and decry the unfairness of it all.&lt;br /&gt;For all prior positions:&lt;br /&gt;Make sure you’ve prepared a brief reason for leaving.  Best reasons:  more money, opportunity, responsibility or growth.&lt;br /&gt;Question 6 The “Silent Treatment”&lt;br /&gt;TRAPS:  Beware – if you are unprepared for this question, you will probably not handle it right and possibly blow the interview.  Thank goodness most interviewers don’t employ it.  It’s normally used by those determined to see how you respond under stress.  Here’s how it works:&lt;br /&gt;You answer an interviewer’s question and then, instead of asking another, he just stares at you in a deafening silence.&lt;br /&gt;You wait, growing a bit uneasy, and there he sits, silent as Mt. Rushmore, as if he doesn’t believe what you’ve just said, or perhaps making you feel that you’ve unwittingly violated some cardinal rule of interview etiquette.&lt;br /&gt;When you get this silent treatment after answering a particularly difficult question , such as “tell me about your weaknesses”, its intimidating effect can be most disquieting, even to polished job hunters.&lt;br /&gt;Most unprepared candidates rush in to fill the void of silence, viewing prolonged, uncomfortable silences as an invitation to clear up the previous answer which has obviously caused some problem.  And that’s what they do – ramble on, sputtering more and more information, sometimes irrelevant and often damaging, because they are suddenly playing the role of someone who’s goofed and is now trying to recoup.  But since the candidate doesn’t know where or how he goofed, he just keeps talking, showing how flustered and confused he is by the interviewer’s unmovable silence.&lt;br /&gt;BEST ANSWER:  Like a primitive tribal mask, the Silent Treatment loses all it power to frighten you once you refuse to be intimidated.  If your interviewer pulls it, keep quiet yourself for a while and then ask, with sincere politeness and not a trace of sarcasm, “Is there anything else I can fill in on that point?”  That’s all there is to it.&lt;br /&gt;Whatever you do, don’t let the Silent Treatment intimidate you into talking a blue streak, because you could easily talk yourself out of the position.&lt;br /&gt;Question 7 Why should I hire you?&lt;br /&gt;TRAPS:  Believe it or not, this is a killer question because so many candidates are unprepared for it.  If you stammer or adlib you’ve blown it.&lt;br /&gt;BEST ANSWER:  By now you can see how critical it is to apply the overall strategy of uncovering the employer’s needs before you answer questions.  If you know the employer’s greatest needs and desires, this question will give you a big leg up over other candidates because you will give him better reasons for hiring you than anyone else is likely to…reasons tied directly to his needs.&lt;br /&gt;Whether your interviewer asks you this question explicitly or not, this is the most important question of your interview because he must answer this question favorably in is own mind before you will be hired.  So help him out!  Walk through each of the position’s requirements as you understand them, and follow each with a reason why you meet that requirement so well.&lt;br /&gt;Example:  “As I understand your needs, you are first and foremost looking for someone who can manage the sales and marketing of your book publishing division.  As you’ve said you need someone with a strong background in trade book sales.  This is where I’ve spent almost all of my career, so I’ve chalked up 18 years of experience exactly in this area.  I believe that I know the right contacts, methods, principles, and successful management techniques as well as any person can in our industry.”&lt;br /&gt;“You also need someone who can expand your book distribution channels. In my prior post, my innovative promotional ideas doubled, then tripled, the number of outlets selling our books.  I’m confident I can do the same for you.”&lt;br /&gt;“You need someone to give a new shot in the arm to your mail order sales, someone who knows how to sell in space and direct mail media.  Here, too, I believe I have exactly the experience you need.  In the last five years, I’ve increased our mail order book sales from $600,000 to $2,800,000, and now we’re the country’s second leading marketer of scientific and medical books by mail.”  Etc., etc., etc.,&lt;br /&gt;Every one of these selling “couplets” (his need matched by your qualifications) is a touchdown that runs up your score.  IT is your best opportunity to outsell your competition.&lt;br /&gt;Question 8 Aren’t you overqualified for this position?&lt;br /&gt;TRAPS:  The employer may be concerned that you’ll grow dissatisfied and leave.&lt;br /&gt;BEST ANSWER:  As with any objection, don’t view this as a sign of imminent defeat.  It’s an invitation to teach the interviewer a new way to think about this situation, seeing advantages instead of drawbacks.&lt;br /&gt;Example:  “I recognize the job market for what it is – a marketplace.  Like any marketplace, it’s subject to the laws of supply and demand.  So ‘overqualified’ can be a relative term, depending on how tight the job market is.  And right now, it’s very tight.  I understand and accept that.”&lt;br /&gt;“I also believe that there could be very positive benefits for both of us in this match.”&lt;br /&gt;“Because of my unusually strong experience in ________________ , I could start to contribute right away, perhaps much faster than someone who’d have to be brought along more slowly.”&lt;br /&gt;“There’s also the value of all the training and years of experience that other companies have invested tens of thousands of dollars to give me.  You’d be getting all the value of that without having to pay an extra dime for it.  With someone who has yet to acquire that experience, he’d have to gain it on your nickel.”&lt;br /&gt;“I could also help you in many things they don’t teach at the Harvard Business School.  For example…(how to hire, train, motivate, etc.)  When it comes to knowing how to work well with people and getting the most out of them, there’s just no substitute for what you learn over many years of front-line experience.  You company would gain all this, too.”&lt;br /&gt;“From my side, there are strong benefits, as well.   Right now, I am unemployed.  I want to work, very much, and the position you have here is exactly what I love to do and am best at.  I’ll be happy doing this work and that’s what matters most to me, a lot more that money or title.”&lt;br /&gt;“Most important, I’m looking to make a long term commitment in my career now. I’ve had enough of job-hunting and want a permanent spot at this point in my career.  I also know that if I perform this job with excellence, other opportunities cannot help but open up for me right here.  In time, I’ll find many other ways to help this company and in so doing, help myself.  I really am looking to make a long-term commitment.”&lt;br /&gt;NOTE:  The main concern behind the “overqualified” question is that you will leave your new employer as soon as something better comes your way.  Anything you can say to demonstrate the sincerity of your commitment to the employer and reassure him that you’re looking to stay for the long-term will help you overcome this objection.&lt;br /&gt;Question 9 Where do you see yourself five years from now?&lt;br /&gt;TRAPS:  One reason interviewers ask this question is to see if you’re settling for this position, using it merely as a stopover until something better comes along.  Or they could be trying to gauge your level of ambition.&lt;br /&gt;If you’re too specific, i.e., naming the promotions you someday hope to win, you’ll sound presumptuous.  If you’re too vague, you’ll seem rudderless.&lt;br /&gt;BEST ANSWER:   Reassure your interviewer that you’re looking to make a long-term commitment…that this position entails exactly what you’re looking to do and what you do extremely well.  As for your future, you believe that if you perform each job at hand with excellence, future opportunities will take care of themselves.&lt;br /&gt;Example:  “I am definitely interested in making a long-term commitment to my next position.  Judging by what you’ve told me about this position, it’s exactly what I’m looking for and what I am very well qualified to do.  In terms of my future career path, I’m confident that if I do my work with excellence, opportunities will inevitable open up for me.  It’s always been that way in my career, and I’m confident I’ll have similar opportunities here.”&lt;br /&gt;Question 10 Describe your ideal company, location and job.&lt;br /&gt;TRAPS:  This is often asked by an experienced interviewer who thinks you may be overqualified, but knows better than to show his hand by posing his objection directly.  So he’ll use this question instead, which often gets a candidate to reveal that, indeed, he or she is looking for something other than the position at hand.&lt;br /&gt;BEST ANSWER:  The only right answer is to describe what this company is offering, being sure to make your answer believable with specific reasons, stated with sincerity, why each quality represented by this opportunity is attractive to you.&lt;br /&gt;Remember that if you’re coming from a company that’s the leader in its field or from a glamorous or much admired company, industry, city or position, your interviewer and his company may well have an “Avis” complex.  That is, they may feel a bit defensive about being “second best” to the place you’re coming from, worried that you may consider them bush league.&lt;br /&gt;This anxiety could well be there even though you’ve done nothing to inspire it. You must go out of your way to assuage such anxiety, even if it’s not expressed, by putting their virtues high on the list of exactly what you’re looking for, providing credible reason for wanting these qualities.&lt;br /&gt;If you do not express genuine enthusiasm for the firm, its culture, location, industry, etc., you may fail to answer this “Avis” complex objection and, as a result, leave the interviewer suspecting that a hot shot like you, coming from a Fortune 500 company in New York, just wouldn’t be happy at an unknown manufacturer based in Topeka, Kansas.&lt;br /&gt;Question 11 Why do you want to work at our company?&lt;br /&gt;TRAPS:  This question tests whether you’ve done any homework about the firm.  If you haven’t, you lose.  If you have, you win big.&lt;br /&gt;BEST ANSWER:   This question is your opportunity to hit the ball out of the park, thanks to the in-depth research you should do before any interview.&lt;br /&gt;Best sources for researching your target company:  annual reports, the corporate newsletter, contacts you know at the company or its suppliers, advertisements, articles about the company in the trade press.&lt;br /&gt;Question 12 What are your career options right now?&lt;br /&gt;TRAPS:  The interviewer is trying to find out, “How desperate are you?”&lt;br /&gt;BEST ANSWER:  Prepare for this question by thinking of how you can position yourself as a desired commodity.  If you are still working, describe the possibilities at your present firm and why, though you’re greatly appreciated there, you’re looking for something more (challenge, money, responsibility, etc.).  Also mention that you’re seriously exploring opportunities with one or two other firms.&lt;br /&gt;If you’re not working, you can talk about other employment possibilities you’re actually exploring.  But do this with a light touch, speaking only in general terms.  You don’t want to seem manipulative or coy.&lt;br /&gt;Question 13 Why have you been out of work so long?&lt;br /&gt;TRAPS:  A tough question if you’ve been on the beach a long time.  You don’t want to seem like damaged goods.&lt;br /&gt;BEST ANSWER:  You want to emphasize factors which have prolonged your job search by your own choice.&lt;br /&gt;Example: “After my job was terminated, I made a conscious decision not to jump on the first opportunities to come along.  In my life, I’ve found out that you can always turn a negative into a positive IF you try hard enough. This is what I determined to do.  I decided to take whatever time I needed to think through what I do best, what I most want to do, where I’d like to do it…and then identify those companies that could offer such an opportunity.”&lt;br /&gt;“Also, in all honesty, you have to factor in the recession (consolidation, stabilization, etc.) in the (banking, financial services, manufacturing, advertising, etc.) industry.”&lt;br /&gt;“So between my being selective and the companies in our industry downsizing, the process has taken time.  But in the end, I’m convinced that when I do find the right match, all that careful evaluation from both sides of the desk will have been well worthwhile for both the company that hires me and myself.&lt;br /&gt;Question 14 Tell me honestly about the strong points and weak points of your boss (company, management team, etc.)…&lt;br /&gt;TRAPS:  Skillfull interviewers sometimes make it almost irresistible to open up and air a little dirty laundry from your previous position.  DON’T &lt;br /&gt;BEST ANSWER:  Remember the rule:  Never be negative.  Stress only the good points, no matter how charmingly you’re invited to be critical.&lt;br /&gt;Your interviewer doesn’t care a whit about your previous boss.  He wants to find out how loyal and positive you are, and whether you’ll criticize him behind his back if pressed to do so by someone in this own company.  This question is your opportunity to demonstrate your loyalty to those you work with.&lt;br /&gt;Question 15 What good books have you read lately?&lt;br /&gt;TRAPS:  As in all matters of your interview, never fake familiarity you don’t have.  Yet you don’t want to seem like a dullard who hasn’t read a book since Tom Sawyer.&lt;br /&gt;BEST ANSWER:  Unless you’re up for a position in academia or as book critic for The New York Times, you’re not expected to be a literary lion.  But it wouldn’t hurt to have read a handful of the most recent and influential books in your profession and on management.&lt;br /&gt;Consider it part of the work of your job search to read up on a few of these leading books.  But make sure they are quality books that reflect favorably upon you, nothing that could even remotely be considered superficial.  Finally, add a recently published bestselling work of fiction by a world-class author and you’ll pass this question with flying colors.&lt;br /&gt;Question 16 Tell me about a situation when your work was criticized.&lt;br /&gt;TRAPS:  This is a tough question because it’s a more clever and subtle way to get you to admit to a weakness.  You can’t dodge it by pretending you’ve never been criticized.  Everybody has been.  Yet it can be quite damaging to start admitting potential faults and failures that you’d just as soon leave buried.&lt;br /&gt;This question is also intended to probe how well you accept criticism and direction.&lt;br /&gt;BEST ANSWERS:  Begin by emphasizing the extremely positive feedback you’ve gotten throughout your career and (if it’s true) that your performance reviews have been uniformly excellent.&lt;br /&gt;Of course, no one is perfect and you always welcome suggestions on how to improve your performance.  Then, give an example of a not-too-damaging learning experience from early in your career and relate the ways this lesson has since helped you.  This demonstrates that you learned from the experience and the lesson is now one of the strongest breastplates in your suit of armor.&lt;br /&gt;If you are pressed for a criticism from a recent position, choose something fairly trivial that in no way is essential to your successful performance.  Add that you’ve learned from this, too, and over the past several years/months, it’s no longer an area of concern because you now make it a regular practice to…etc.&lt;br /&gt;Another way to answer this question would be to describe your intention to broaden your master of an area of growing importance in your field.  For example, this might be a computer program you’ve been meaning to sit down and learn… a new management technique you’ve read about…or perhaps attending a seminar on some cutting-edge branch of your profession.&lt;br /&gt;Again, the key is to focus on something not essential to your brilliant performance but which adds yet another dimension to your already impressive knowledge base.&lt;br /&gt;Question 17 What are your outside interests?&lt;br /&gt;TRAPS:  You want to be a well-rounded, not a drone.  But your potential employer would be even more turned off if he suspects that your heavy extracurricular load will interfere with your commitment to your work duties.&lt;br /&gt;BEST ANSWERS:  Try to gauge how this company’s culture would look upon your favorite outside activities and be guided accordingly.&lt;br /&gt;You can also use this question to shatter any stereotypes that could limit your chances.  If you’re over 50, for example, describe your activities that demonstrate physical stamina.  If you’re young, mention an activity that connotes wisdom and institutional trust, such as serving on the board of a popular charity.&lt;br /&gt;But above all, remember that your employer is hiring your for what you can do for him, not your family, yourself or outside organizations, no matter how admirable those activities may be.&lt;br /&gt;Question 18 The “Fatal Flaw” question&lt;br /&gt;TRAPS:  If an interviewer has read your resume carefully, he may try to zero in on a “fatal flaw” of your candidacy, perhaps that you don’t have a college degree…you’ve been out of the job market for some time…you never earned your CPA, etc.&lt;br /&gt;A fatal flaw question can be deadly, but usually only if you respond by being overly defensive.&lt;br /&gt;BEST ANSWERS:  As every master salesperson knows, you will encounter objections (whether stated or merely thought) in every sale.  They’re part and parcel of the buyer’s anxiety.  The key is not to exacerbate the buyer’s anxiety but diminish it.  Here’s how…&lt;br /&gt;Whenever you come up against a fatal flaw question: &lt;br /&gt;1. Be completely honest, open and straightforward about admitting the shortcoming.  (Showing you have nothing to hide diminishes the buyer’s anxiety.)&lt;br /&gt;2. Do not apologize or try to explain it away.  You know that this supposed flaw is nothing to be concerned about, and this is the attitude you want your interviewer to adopt as well.&lt;br /&gt;3. Add that as desirable as such a qualification might be, its lack has made you work all the harder throughout your career and has not prevented you from compiling an outstanding tack record of achievements.  You might even give examples of how, through a relentless commitment to excellence, you have consistently outperformed those who do have this qualification. &lt;br /&gt;Of course, the ultimate way to handle “fatal flaw” questions is to prevent them from arising in the first place.  You will do that by following the master strategy described in Question 1, i.e., uncovering the employers needs and them matching your qualifications to those needs.&lt;br /&gt;Once you’ve gotten the employer to start talking about his most urgently-felt wants and goals for the position, and then help him see in step-by-step fashion how perfectly your background and achievements match up with those needs, you’re going to have one very enthusiastic interviewer on your hands, one who is no longer looking for “fatal flaws”.&lt;br /&gt;Question 19 How do you feel about reporting to a younger person (minority, woman, etc)?&lt;br /&gt;TRAPS:  It’s a shame that some interviewers feel the need to ask this question, but many understand the reality that prejudices still exist among some job candidates, and it’s better to try to flush them out beforehand.&lt;br /&gt;The trap here is that in today’s politically sensitized environment, even a well-intentioned answer can result in planting your foot neatly in your mouth.  Avoid anything which smacks of a patronizing or an insensitive attitude, such as “I think they make terrific bosses” or “Hey, some of my best friends are…”&lt;br /&gt;Of course, since almost anyone with an IQ above room temperature will at least try to steadfastly affirm the right answer here, your interviewer will be judging your sincerity most of all.  “Do you really feel that way?” is what he or she will be wondering.&lt;br /&gt;So you must make your answer believable and not just automatic.  If the firm is wise enough to have promoted peopled on the basis of ability alone, they’re likely quite proud of it, and prefer to hire others who will wholeheartedly share their strong sense of fair play. &lt;br /&gt;BEST ANSWER:  You greatly admire a company that hires and promotes on merit alone and you couldn’t agree more with that philosophy.  The age (gender, race, etc.) of the person you report to would certainly make no difference to you.&lt;br /&gt;Whoever has that position has obviously earned it and knows their job well.  Both the person and the position are fully deserving of respect.  You believe that all people in a company, from the receptionist to the Chairman, work best when their abilities, efforts and feelings are respected and rewarded fairly, and that includes you.  That’s the best type of work environment you can hope to find.&lt;br /&gt;Question 20 On confidential matters…&lt;br /&gt;TRAPS:  When an interviewer presses you to reveal confidential information about a present or former employer, you may feel it’s a no-win situation.  If you cooperate, you could be judged untrustworthy.  If you don’t, you may irritate the interviewer and seem obstinate, uncooperative or overly suspicious.&lt;br /&gt;BEST ANSWER:  Your interviewer may press you for this information for two reasons.&lt;br /&gt;First, many companies use interviews to research the competition.  It’s a perfect set-up.  Here in their own lair, is an insider from the enemy camp who can reveal prized information on the competition’s plans, research, financial condition, etc.&lt;br /&gt;Second, the company may be testing your integrity to see if you can be cajoled or bullied into revealing confidential data.&lt;br /&gt;What to do?  The answer here is easy.  Never reveal anything truly confidential about a present or former employer.  By all means, explain your reticence diplomatically.  For example, “I certainly want to be as open as I can about that.  But I also wish to respect the rights of those who have trusted me with their most sensitive information, just as you would hope to be able to trust any of your key people when talking with a competitor…”&lt;br /&gt;And certainly you can allude to your finest achievements in specific ways that don’t reveal the combination to the company safe.&lt;br /&gt;But be guided by the golden rule.  If you were the owner of your present company, would you feel it ethically wrong for the information to be given to your competitors?  If so, steadfastly refuse to reveal it.&lt;br /&gt;Remember that this question pits your desire to be cooperative against your integrity.  Faced with any such choice, always choose integrity.  It is a far more valuable commodity than whatever information the company may pry from you.  Moreover, once you surrender the information, your stock goes down.  They will surely lose respect for you.&lt;br /&gt;One President we know always presses candidates unmercifully for confidential information. If he doesn’t get it, he grows visibly annoyed, relentlessly inquisitive,  It’s all an act.  He couldn’t care less about the information. This is his way of testing the candidate’s moral fiber.  Only those who hold fast are hired.&lt;br /&gt;Question 21 Would you lie for the company?&lt;br /&gt;TRAPS:  This another question that pits two values against one another, in this case loyalty against integrity.&lt;br /&gt;BEST ANSWER:  Try to avoid choosing between two values, giving a positive statement which covers all bases instead.&lt;br /&gt;Example:  “I would never do anything to hurt the company..”&lt;br /&gt;If aggressively pressed to choose between two competing values, always choose personal integrity.  It is the most prized of all values.&lt;br /&gt;Question 22 Looking back, what would you do differently in your life?&lt;br /&gt;TRAPS:  This question is usually asked to uncover any life-influencing mistakes, regrets, disappointments or problems that may continue to affect your personality and performance.&lt;br /&gt;You do not want to give the interviewer anything negative to remember you by, such as some great personal or career disappointment, even long ago, that you wish could have been avoided.&lt;br /&gt;Nor do you wish to give any answer which may hint that your whole heart and soul will not be in your work.&lt;br /&gt;BEST ANSWER:  Indicate that you are a happy, fulfilled, optimistic person and that, in general, you wouldn’t change a thing.&lt;br /&gt;Example:  “It’s been a good life, rich in learning and experience, and the best it yet to come.  Every experience in life is a lesson it its own way.  I wouldn’t change a thing.”&lt;br /&gt;Question 23 Could you have done better in your last job?&lt;br /&gt;TRAPS:  This is no time for true confessions of major or even minor problems.&lt;br /&gt;BEST ANSWER:  Again never be negative.&lt;br /&gt;Example:  “I suppose with the benefit of hindsight you can always find things to do better, of course, but off the top of my head, I can’t think of anything of major consequence.”&lt;br /&gt;(If more explanation seems necessary) &lt;br /&gt;Describer a situation that didn’t suffer because of you but from external conditions beyond your control.&lt;br /&gt;For example, describe the disappointment you felt with a test campaign, new product launch, merger, etc., which looked promising at first, but led to underwhelming results.  “I wish we could have known at the start what we later found out (about the economy turning, the marketplace changing, etc.), but since we couldn’t, we just had to go for it.  And we did learn from it…”&lt;br /&gt;Question 24 Can you work under pressure?&lt;br /&gt;TRAPS:  An easy question, but you want to make your answer believable.&lt;br /&gt;BEST ANSWER:  Absolutely…(then prove it with a vivid example or two of a goal or project accomplished under severe pressure.)&lt;br /&gt;Question 25 What makes you angry?&lt;br /&gt;TRAPS:  You don’t want to come across either as a hothead or a wimp.&lt;br /&gt;BEST ANSWER:    Give an answer that’s suited to both your personality and the management style of the firm.  Here, the homework you’ve done about the company and its style can help in your choice of words.&lt;br /&gt;Examples:  If you are a reserved person and/or the corporate culture is coolly professional:&lt;br /&gt;“I’m an even-tempered and positive person by nature, and I believe this helps me a great deal in keeping my department running smoothly, harmoniously and with a genuine esprit de corps.  I believe in communicating clearly what’s expected, getting people’s commitment to those goals, and then following up continuously to check progress.”&lt;br /&gt;“If anyone or anything is going off track, I want to know about it early.  If, after that kind of open communication and follow up, someone isn’t getting the job done, I’ll want to know why.  If there’s no good reason, then I’ll get impatient and angry…and take appropriate steps from there.  But if you hire good people, motivate them to strive for excellence and then follow up constantly, it almost never gets to that state.”&lt;br /&gt;If you are feisty by nature and/or the position calls for a tough straw boss.&lt;br /&gt;“You know what makes me angry?  People who (the fill in the blanks with the most objectionable traits for this type of position)…people who don’t pull their own weight, who are negative, people who lie…etc.”&lt;br /&gt;Question 26 Why aren’t you earning more money at this stage of your career?&lt;br /&gt;TRAPS:  You don’t want to give the impression that money is not important to you, yet you want to explain why your salary may be a little below industry standards.&lt;br /&gt;BEST ANSWER:  You like to make money, but other factors are even more important.&lt;br /&gt;Example:  “Making money is very important to me, and one reason I’m here is because I’m looking to make more.  Throughout my career, what’s been even more important to me is doing work I really like to do at the kind of company I like and respect.&lt;br /&gt;(Then be prepared to be specific about what your ideal position and company would be like, matching them as closely as possible to the opportunity at hand.&lt;br /&gt;Question 27 Who has inspired you in your life and why?&lt;br /&gt;TRAPS:  The two traps here are unpreparedness and irrelevance.  If you grope for an answer, it seems you’ve never been inspired.  If you ramble about your high school basketball coach, you’ve wasted an opportunity to present qualities of great value to the company.&lt;br /&gt;BEST ANSWER:  Have a few heroes in mind, from your mental “Board of Directors” – Leaders in your industry, from history or anyone else who has been your mentor.&lt;br /&gt;Be prepared to give examples of how their words, actions or teachings have helped inspire your achievements.  As always, prepare an answer which highlights qualities that would be highly valuable in the position you are seeking.&lt;br /&gt;Question 28 What was the toughest decision you ever had to make?&lt;br /&gt;TRAPS:  Giving an unprepared or irrelevant answer.&lt;br /&gt;BEST ANSWER:  Be prepared with a good example, explaining why the decision was difficult…the process you followed in reaching it…the courageous or effective way you carried it out…and the beneficial results.&lt;br /&gt;Question 29 Tell me about the most boring job you’ve ever had.&lt;br /&gt;TRAPS:  You give a very memorable description of a very boring job.  Result?  You become associated with this boring job in the interviewer’s mind.&lt;br /&gt;BEST ANSWER:  You have never allowed yourself to grow bored with a job and you can’t understand it when others let themselves fall into that rut.&lt;br /&gt;Example:  “Perhaps I’ve been fortunate, but that I’ve never found myself bored with any job I have ever held.  I’ve always enjoyed hard work.  As with actors who feel there are no small parts, I also believe that in every company or department there are exciting challenges and intriguing problems crying out for energetic and enthusiastic solutions.  If you’re bored, it’s probably because you’re not challenging yourself to tackle those problems right under your nose.”&lt;br /&gt;Question 30 Have you been absent from work more than a few days in any previous position?&lt;br /&gt;TRAPS:  If you’ve had a problem, you can’t lie.  You could easily be found out.  Yet admitting an attendance problem could raise many flags.&lt;br /&gt;BEST ANSWER:  If you have had no problem, emphasize your excellent and consistent attendance record throughout your career.&lt;br /&gt;Also describe how important you believe such consistent attendance is for a key executive…why it’s up to you to set an example of dedication…and why there’s just no substitute for being there with your people to keep the operation running smoothly, answer questions and handle problems and crises as they arise.&lt;br /&gt;If you do have a past attendance problem, you want to minimize it, making it clear that it was an exceptional circumstance and that it’s cause has been corrected.&lt;br /&gt;To do this, give the same answer as above but preface it with something like, “Other that being out last year (or whenever) because of (your reason, which is now in the past), I have never had a problem and have enjoyed an excellent attendance record throughout my career.  Furthermore, I believe, consistent attendance is important because…”  (Pick up the rest of the answer as outlined above.).&lt;br /&gt;Question 31 What changes would you make if you came on board?&lt;br /&gt;TRAPS:  Watch out!  This question can derail your candidacy faster than a bomb on the tracks – and just as you are about to be hired.&lt;br /&gt;Reason:  No matter how bright you are, you cannot know the right actions to take in a position before you settle in and get to know the operation’s strengths, weaknesses key people, financial condition, methods of operation, etc.  If you lunge at this temptingly baited question, you will probably be seen as someone who shoots from the hip.&lt;br /&gt;Moreover, no matter how comfortable you may feel with your interviewer, you are still an outsider.  No one, including your interviewer, likes to think that a know-it-all outsider is going to come in, turn the place upside down and with sweeping, grand gestures, promptly demonstrate what jerks everybody’s been for years.&lt;br /&gt;BEST ANSWER:  You, of course, will want to take a good hard look at everything the company is doing before making any recommendations.&lt;br /&gt;Example:  “Well, I wouldn’t be a very good doctor if I gave my diagnosis before the examination.  Should you hire me, as I hope you will, I’d want to take a good hard look at everything you’re doing and understand why it’s being done that way.  I’d like to have in-depth meetings with you and the other key people to get a deeper grasp of what you feel you’re doing right and what could be improved.&lt;br /&gt;“From what you’ve told me so far, the areas of greatest concern to you are…” (name them.  Then do two things.  First, ask if these are in fact his major concerns.  If so then reaffirm how your experience in meeting similar needs elsewhere might prove very helpful).&lt;br /&gt;Question 32 I’m concerned that you don’t have as much experience as we’d like in…&lt;br /&gt;TRAPS:  This could be a make-or-break question.  The interviewer mostly likes what he sees, but has doubts over one key area.  If you can assure him on this point, the job may be yours.&lt;br /&gt;BEST ANSWER:   This question is related to “The Fatal Flaw” (Question 18), but here the concern is not that you are totally missing some qualifications, such as CPA certification, but rather that your experience is light in one area.&lt;br /&gt;Before going into any interview, try to identify the weakest aspects of your candidacy from this company’s point of view.  Then prepare the best answer you possible can to shore up your defenses.&lt;br /&gt;To get past this question with flying colors, you are going to rely on your master strategy of uncovering the employer’s greatest wants and needs and then matching them with your strengths.  Since you already know how to do this from Question 1, you are in a much stronger position.  &lt;br /&gt;More specifically, when the interviewer poses as objection like this, you should…&lt;br /&gt;1. Agree on the importance of this qualification.&lt;br /&gt;2. Explain that your strength may be indeed be greater than your resume indicates because…&lt;br /&gt;3. When this strength is added to your other strengths, it’s really your combination of qualifications that’s most important.&lt;br /&gt;Then review the areas of your greatest strengths that match up most favorably with the company’s most urgently-felt wants and needs.&lt;br /&gt;This is powerful way to handle this question for two reasons.  First, you’re giving your interviewer more ammunition in the area of his concern.  But more importantly, you’re shifting his focus away from this one, isolated area and putting it on the unique combination of strengths you offer, strengths which tie in perfectly with his greatest wants.&lt;br /&gt;Question 33 How do you feel about working nights and weekends?&lt;br /&gt;TRAPS:  Blurt out “no way, Jose” and you can kiss the job offer goodbye.  But what if you have a family and want to work a reasonably normal schedule?  Is there a way to get both the job and the schedule you want?&lt;br /&gt;BEST ANSWER:  First, if you’re a confirmed workaholic, this question is a softball lob.  Whack it out of the park on the first swing by saying this kind of schedule is just your style.  Add that your family understands it.  Indeed, they’re happy for you, as they know you get your greatest satisfaction from your work.&lt;br /&gt;If however, you prefer a more balanced lifestyle, answer this question with another:  “What’s the norm for your best people here?”&lt;br /&gt;If the hours still sound unrealistic for you, ask, “Do you have any top people who perform exceptionally for you, but who also have families and like to get home in time to see them at night?”  Chances are this company does, and this associates you with this other “top-performers-who-leave-not-later-than-six” group.&lt;br /&gt;Depending on the answer, be honest about how you would fit into the picture.  If all those extra hours make you uncomfortable, say so, but phrase your response positively.&lt;br /&gt;Example:  “I love my work and do it exceptionally well.  I think the results speak for themselves, especially in …(mention your two or three qualifications of greater interest to the employer.  Remember, this is what he wants most, not a workaholic with weak credentials).  Not only would I bring these qualities, but I’ve built my whole career on working not just hard, but smart.  I think you’ll find me one of the most productive people here.&lt;br /&gt;I do have a family who likes to see me after work and on weekends.  They add balance and richness to my life, which in turn helps me be happy and productive at work.  If I could handle some of the extra work at home in the evenings or on weekends, that would be ideal.  You’d be getting a person of exceptional productivity who meets your needs with strong credentials.  And I’d be able to handle some of the heavy workload at home where I can be under the same roof as my family.  Everybody would win.”&lt;br /&gt;Question 34 Are you willing to relocate or travel?&lt;br /&gt;TRAPS:  Answer with a flat “no” and you may slam the door shut on this opportunity.  But what if you’d really prefer not to relocate or travel, yet wouldn’t want to lose the job offer over it?&lt;br /&gt;BEST ANSWER:   First find out where you may have to relocate and how much travel may be involved.  Then respond to the question.&lt;br /&gt;If there’s no problem, say so enthusiastically.&lt;br /&gt;If you do have a reservation, there are two schools of thought on how to handle it.&lt;br /&gt;One advises you to keep your options open and your reservations to yourself in the early going, by saying, “no problem”.  You strategy here is to get the best offer you can, then make a judgment whether it’s worth it to you to relocate or travel.&lt;br /&gt;Also, by the time the offer comes through, you may have other offers and can make a more informed decision.  Why kill of this opportunity before it has chance to blossom into something really special?  And if you’re a little more desperate three months from now, you might wish you hadn’t slammed the door on relocating or traveling.&lt;br /&gt;The second way to handle this question is to voice a reservation, but assert that you’d be open to relocating (or traveling) for the right opportunity.&lt;br /&gt;The answering strategy you choose depends on how eager you are for the job.  If you want to take no chances, choose the first approach.&lt;br /&gt;If you want to play a little harder-to-get in hopes of generating a more enticing offer, choose the second.&lt;br /&gt;Question 35 Do you have the stomach to fire people?  Have you had experience firing many people?&lt;br /&gt;TRAPS:  This “innocent” question could be a trap door which sends you down a chute and lands you in a heap of dust outside the front door.  Why?  Because its real intent is not just to see if you’ve got the stomach to fire, but also to uncover poor judgment in hiring which has caused you to fire so many.  Also, if you fire so often, you could be a tyrant.&lt;br /&gt;So don’t rise to the bait by boasting how many you’ve fired, unless you’ve prepared to explain why it was beyond your control, and not the result of your poor hiring procedures or foul temperament.&lt;br /&gt;BEST ANSWER:    Describe the rational and sensible management process you follow in both hiring and firing.&lt;br /&gt;Example:  “My whole management approach is to hire the best people I can find, train them thoroughly and well, get them excited and proud to be part of our team, and then work with them to achieve our goals together.  If you do all of that right, especially hiring the right people, I’ve found you don’t have to fire very often.&lt;br /&gt;“So with me, firing is a last resort.  But when it’s got to be done, it’s got to be done, and the faster and cleaner, the better.  A poor employee can wreak terrible damage in undermining the morale of an entire team of good people.  When there’s no other way, I’ve found it’s better for all concerned to act decisively in getting rid of offenders who won’t change their ways.”&lt;br /&gt;Question 36 Why have you had so many jobs?&lt;br /&gt;TRAPS:  Your interviewer fears you may leave this position quickly, as you have others.  He’s concerned you may be unstable, or a “problem person” who can’t get along with others.&lt;br /&gt;BEST ANSWER:  First, before you even get to the interview stage, you should try to minimize your image as job hopper.  If there are several entries on your resume of less than one year, consider eliminating the less important ones.  Perhaps you can specify the time you spent at previous positions in rounded years not in months and years.  &lt;br /&gt;Example:   Instead of showing three positions this way:&lt;br /&gt;6/1982 – 3/1983, Position A;&lt;br /&gt;4/1983 – 12/1983, Position B;&lt;br /&gt;1/1984 – 8/1987, Position C; &lt;br /&gt;…it would be better to show simply:&lt;br /&gt;1982 – 1983, Position A;&lt;br /&gt;1984 – 1987 Position C.&lt;br /&gt;In other words, you would drop Position B altogether.  Notice what a difference this makes in reducing your image as a job hopper.&lt;br /&gt;Once in front of the interviewer and this question comes up, you must try to reassure him.  Describe each position as part of an overall pattern of growth and career destination.&lt;br /&gt;Be careful not to blame other people for your frequent changes.  But you can and should attribute certain changes to conditions beyond your control.  &lt;br /&gt;Example:  Thanks to an upcoming merger, you wanted to avoid an ensuing bloodbath, so you made a good, upward career move before your department came under the axe of the new owners.&lt;br /&gt;If possible, also show that your job changes were more frequent in your younger days, while you were establishing yourself, rounding out your skills and looking for the right career path.  At this stage in your career, you’re certainly much more interested in the best long-term opportunity.&lt;br /&gt;You might also cite the job(s) where you stayed the longest and describe that this type of situation is what you’re looking for now.&lt;br /&gt;Question 37 What do you see as the proper role/mission of…&lt;br /&gt;…a good (job title you’re seeking);&lt;br /&gt;…a good manager;&lt;br /&gt;…an executive in serving the community;&lt;br /&gt;…a leading company in our industry; etc.&lt;br /&gt;TRAPS:  These and other “proper role” questions are designed to test your understanding of your place in the bigger picture of your department, company, community and profession….as well as the proper role each of these entities should play in its bigger picture.&lt;br /&gt;The question is most frequently asked by the most thoughtful individuals and companies…or by those concerned that you’re coming from a place with a radically different corporate culture (such as from a big government bureaucracy to an aggressive small company).&lt;br /&gt;The most frequent mistake executives make in answering is simply not being prepared (seeming as if they’ve never giving any of this a though.)…or in phrasing an answer best suited to their prior organization’s culture instead of the hiring company’s.&lt;br /&gt;BEST ANSWER:    Think of the most essential ingredients of success for each category above – your job title, your role as manager, your firm’s role, etc.&lt;br /&gt;Identify at least three but no more than six qualities you feel are most important to success in each role.  Then commit your response to memory.&lt;br /&gt;Here, again, the more information you’ve already drawn out about the greatest wants and needs of the interviewer, and the more homework you’ve done to identify the culture of the firm, the more on-target your answer will be.&lt;br /&gt;Question 38 What would you say to your boss if he’s crazy about an idea, but you think it stinks?&lt;br /&gt;TRAPS:  This is another question that pits two values, in this case loyalty and honesty, against one another.&lt;br /&gt;BEST ANSWER:    Remember the rule stated earlier:  In any conflict between values, always choose integrity.&lt;br /&gt;Example:  I believe that when evaluating anything, it’s important to emphasize the positive.  What do I like about this idea?”&lt;br /&gt;“Then, if you have reservations, I certainly want to point them out, as specifically, objectively and factually as I can.”&lt;br /&gt;“After all, the most important thing I owe my boss is honesty.  If he can’t count on me for that, then everything else I may do or say could be questionable in his eyes.”&lt;br /&gt;“But I also want to express my thoughts in a constructive way.  So my goal in this case would be to see if my boss and I could make his idea even stronger and more appealing, so that it effectively overcomes any initial reservation I or others may have about it.”&lt;br /&gt;“Of course, if he overrules me and says, ‘no, let’s do it my way,’ then I owe him my full and enthusiastic support to make it work as best it can.”&lt;br /&gt;Question 39 How could you have improved your career progress?&lt;br /&gt;TRAPS:  This is another variation on the question, “If you could, how would you live your life over?”  Remember, you’re not going to fall for any such invitations to rewrite person history. You can’t win if you do.&lt;br /&gt;BEST ANSWER:  You’re generally quite happy with your career progress.  Maybe, if you had known something earlier in life (impossible to know at the time, such as the booming growth in a branch in your industry…or the corporate downsizing that would phase out your last job), you might have moved in a certain direction sooner.&lt;br /&gt;But all things considered, you take responsibility for where you are, how you’ve gotten there, where you are going…and you harbor no regrets.&lt;br /&gt;Question 40 What would you do if a fellow executive on your own corporate level wasn’t pulling his/her weight…and this was hurting your department?&lt;br /&gt;TRAPS:  This question and other hypothetical ones test your sense of human relations and how you might handle office politics.&lt;br /&gt;BEST ANSWER:  Try to gauge the political style of the firm and be guided accordingly.  In general, fall back on universal principles of effective human relations – which in the end, embody the way you would like to be treated in a similar circumstance.&lt;br /&gt;Example:  “Good human relations would call for me to go directly to the person and explain the situation, to try to enlist his help in a constructive, positive solution.  If I sensed resistance, I would be as persuasive as I know how to explain the benefits we can all gain from working together, and the problems we, the company and our customers will experience if we don’t.”&lt;br /&gt;POSSIBLE FOLLOW-UP QUESTION:  And what would you do if he still did not change his ways?&lt;br /&gt;ANSWER:  “One thing I wouldn’t do is let the problem slide, because it would only get worse and overlooking it would set a bad precedent.  I would try again and again and again, in whatever way I could, to solve the problem, involving wider and wider circles of people, both above and below the offending executive and including my own boss if necessary, so that everyone involved can see the rewards for teamwork and the drawbacks of non-cooperation.”&lt;br /&gt;“I might add that I’ve never yet come across a situation that couldn’t be resolved by harnessing others in a determined, constructive effort.”&lt;br /&gt;Question 41 You’ve been with your firm a long time.  Won’t it be hard switching to a new company?&lt;br /&gt;TRAPS:  Your interviewer is worried that this old dog will find it hard to learn new tricks.&lt;br /&gt;BEST ANSWER:  To overcome this objection, you must point to the many ways you have grown and adapted to changing conditions at your present firm.  It has not been a static situation. Highlight the different responsibilities you’ve held, the wide array of new situations you’ve faced and conquered.&lt;br /&gt;As a result, you’ve learned to adapt quickly to whatever is thrown at you, and you thrive on the stimulation of new challenges.&lt;br /&gt;To further assure the interviewer, describe the similarities between the new position and your prior one.  Explain that you should be quite comfortable working there, since their needs and your skills make a perfect match.&lt;br /&gt;Question 42 May I contact your present employer for a reference?&lt;br /&gt;TRAPS:  If you’re trying to keep your job search private, this is the last thing you want.  But if you don’t cooperate, won’t you seem as if you’re trying to hide something?&lt;br /&gt;BEST ANSWER:  Express your concern that you’d like to keep your job search private, but that in time, it will be perfectly okay.&lt;br /&gt;Example:  “My present employer is not aware of my job search and, for obvious reasons; I’d prefer to keep it that way.  I’d be most appreciative if we kept our discussion confidential right now.  Of course, when we both agree the time is right, then by all means you should contact them.  I’m very proud of my record there.&lt;br /&gt;Question 43 Give me an example of your creativity (analytical skill…managing ability, etc.)&lt;br /&gt;TRAPS:  The worst offense here is simply being unprepared.  Your hesitation may seem as if you’re having a hard time remembering the last time you were creative, analytical, etc.&lt;br /&gt;BEST ANSWER:  Remember from Question 2 that you should commit to memory a list of your greatest and most recent achievements, ever ready on the tip of your tongue.&lt;br /&gt;If you have such a list, it’s easy to present any of your achievements in light of the quality the interviewer is asking about.  For example, the smashing success you orchestrated at last year’s trade show could be used as an example of creativity, or analytical ability, or your ability to manage.&lt;br /&gt;Question 44 Where could you use some improvement?&lt;br /&gt;TRAPS:  Another tricky way to get you to admit weaknesses.  Don’t fall for it.&lt;br /&gt;BEST ANSWER:  Keep this answer, like all your answers, positive.  A good way to answer this question is to identify a cutting-edge branch of your profession (one that’s not essential to your employer’s needs) as an area you’re very excited about and want to explore more fully over the next six months.&lt;br /&gt;Question 45 What do you worry about?&lt;br /&gt;TRAPS:  Admit to worrying and you could sound like a loser.  Saying you never worry doesn’t sound credible.&lt;br /&gt;BEST ANSWER:  Redefine the word ‘worry’ so that it does not reflect negatively on you.&lt;br /&gt;Example:  “I wouldn’t call it worry, but I am a strongly goal-oriented person.  So I keep turning over in my mind anything that seems to be keeping me from achieving those goals, until I find a solution.  That’s part of my tenacity, I suppose.”&lt;br /&gt;Question 46 How many hours a week do you normally work?&lt;br /&gt;TRAPS:  You don’t want to give a specific number.  Make it to low, and you may not measure up.  Too high, and you’ll forever feel guilty about sneaking out the door at 5:15.&lt;br /&gt;BEST ANSWER:  If you are in fact a workaholic and you sense this company would like that:  Say you are a confirmed workaholic, that you often work nights and weekends.  Your family accepts this because it makes you fulfilled.&lt;br /&gt;If you are not a workaholic:  Say you have always worked hard and put in long hours.  It goes with the territory.  It one sense, it’s hard to keep track of the hours because your work is a labor of love, you enjoy nothing more than solving problems.  So you’re almost always thinking about your work, including times when you’re home, while shaving in the morning, while commuting, etc.&lt;br /&gt;Question 47 What’s the most difficult part of being a (job title)?&lt;br /&gt;TRAPS:  Unless you phrase your answer properly, your interviewer may conclude that whatever you identify as “difficult” is where you are weak.&lt;br /&gt;BEST ANSWER:  First, redefine “difficult” to be “challenging” which is more positive.  Then, identify an area everyone in your profession considers challenging and in which you excel.  Describe the process you follow that enables you to get splendid results…and be specific about those results.&lt;br /&gt;Example:  “I think every sales manager finds it challenging to motivate the troops in a recession. But that’s probably the strongest test of a top sales manager.  I feel this is one area where I excel.”  &lt;br /&gt;“When I see the first sign that sales may slip or that sales force motivation is flagging because of a downturn in the economy, here’s the plan I put into action immediately…” (followed by a description of each step in the process…and most importantly,  the exceptional results you’ve achieved.).&lt;br /&gt;Question 48 The “Hypothetical Problem”&lt;br /&gt;TRAPS:  Sometimes an interviewer will describe a difficult situation and ask, “How would you handle this?”  Since it is virtually impossible to have all the facts in front of you from such a short presentation, don’t fall into the trap of trying to solve this problem and giving your verdict on the spot. It will make your decision-making process seem woefully inadequate.&lt;br /&gt;BEST ANSWER:  Instead, describe the rational, methodical process you would follow in analyzing this problem, who you would consult with, generating possible solutions, choosing the best course of action, and monitoring the results.&lt;br /&gt;Remember, in all such, “What would you do?” questions, always describe your process or working methods, and you’ll never go wrong.&lt;br /&gt;Question 49 What was the toughest challenge you’ve ever faced?&lt;br /&gt;TRAPS:  Being unprepared or citing an example from so early in your life that it doesn’t score many points for you at this stage of your career.&lt;br /&gt;BEST ANSWER:  This is an easy question if you’re prepared. Have a recent example ready that demonstrates either:&lt;br /&gt;1. A quality most important to the job at hand; or&lt;br /&gt;2. A quality that is always in demand, such as leadership, initiative, managerial skill, persuasiveness, courage, persistence, intelligence, etc.&lt;br /&gt;Question 50 Have you consider starting your own business?&lt;br /&gt;TRAPS:  If you say “yes” and elaborate enthusiastically, you could be perceived as a loose cannon in a larger company, too entrepreneurial to make a good team player…or someone who had to settle for the corporate life because you couldn’t make a go of your own business.&lt;br /&gt;Also too much enthusiasm in answering “yes” could rouse the paranoia of a small company indicating that you may plan to go out on your own soon, perhaps taking some key accounts or trade secrets with you.&lt;br /&gt;On the other hand, if you answer “no, never” you could be perceived as a security-minded drone who never dreamed a big dream.&lt;br /&gt;BEST ANSWER:  Again it’s best to:&lt;br /&gt;1. Gauge this company’s corporate culture before answering and…&lt;br /&gt;2. Be honest (which doesn’t mean you have to vividly share your fantasy of the franchise or bed-and-breakfast you someday plan to open).&lt;br /&gt;In general, if the corporate culture is that of a large, formal, military-style structure, minimize any indication that you’d love to have your own business.  You might say, “Oh, I may have given it a thought once or twice, but my whole career has been in larger organizations.  That’s where I have excelled and where I want to be.”&lt;br /&gt;If the corporate culture is closer to the free-wheeling, everybody’s-a-deal-maker variety, then emphasize that in a firm like this, you can virtually get the best of all worlds, the excitement of seeing your own ideas and plans take shape…combined with the resources and stability of a well-established organization.   Sounds like the perfect environment to you.&lt;br /&gt;In any case, no matter what the corporate culture, be sure to indicate that any desires about running your own show are part of your past, not your present or future.&lt;br /&gt;The last thing you want to project is an image of either a dreamer who failed and is now settling for the corporate cocoon…or the restless maverick who will fly out the door with key accounts, contacts and trade secrets under his arms just as soon as his bankroll has gotten rebuilt.&lt;br /&gt;Always remember:  Match what you want with what the position offers.  The more information you’ve uncovered about the position, the more believable you can make your case.&lt;br /&gt;Question 51 What are your goals?&lt;br /&gt;TRAPS:  Not having any…or having only vague generalities, not highly specific goals.&lt;br /&gt;BEST ANSWER:  Many executives in a position to hire you are strong believers in goal-setting. (It’s one of the reason they’ve achieved so much).  They like to hire in kind.&lt;br /&gt;If you’re vague about your career and personal goals, it could be a big turnoff to may people you will encounter in your job search.&lt;br /&gt;Be ready to discuss your goals for each major area of your life:  career, personal development and learning, family, physical (health), community service and (if your interviewer is clearly a religious person) you could briefly and generally allude to your spiritual goals (showing you are a well-rounded individual with your values in the right order).&lt;br /&gt;Be prepared to describe each goal in terms of specific milestones you wish to accomplish along the way, time periods you’re allotting for accomplishment, why the goal is important to you, and the specific steps you’re taking to bring it about.  But do this concisely, as you never want to talk more than two minutes straight before letting your interviewer back into the conversation.&lt;br /&gt;Question 52 What do you for when you hire people?&lt;br /&gt;TRAPS:  Being unprepared for the question.&lt;br /&gt;BEST ANSWER:  Speak your own thoughts here, but for the best answer weave them around the three most important qualifications for any position.&lt;br /&gt;1. Can the person do the work (qualifications)?&lt;br /&gt;2. Will the person do the work (motivation)?&lt;br /&gt;3. Will the person fit in (“our kind of team player”)?&lt;br /&gt;Question 53 Sell me this stapler…(this pencil…this clock…or some other object on interviewer’s desk).&lt;br /&gt;TRAPS:  Some interviewers, especially business owners and hard-changing executives in marketing-driven companies, feel that good salesmanship is essential for any key position and ask for an instant demonstration of your skill.  Be ready.&lt;br /&gt;BEST ANSWER:  Of course, you already know the most important secret of all great salesmanship – “find out what people want, then show them how to get it.”&lt;br /&gt;If your interviewer picks up his stapler and asks, “sell this to me,” you are going to demonstrate this proven master principle.  Here’s how:  &lt;br /&gt;“Well, a good salesman must know both his product and his prospect before he sells anything.  If I were selling this, I’d first get to know everything I could about it, all its features and benefits.”&lt;br /&gt;“Then, if my goal were to sell it you, I would do some research on how you might use a fine stapler like this.  The best way to do that is by asking some questions.  May I ask you a few questions?”&lt;br /&gt;Then ask a few questions such as, “Just out of curiosity, if you didn’t already have a stapler like this, why would you want one?  And in addition to that?  Any other reason?  Anything else?”&lt;br /&gt;“And would you want such a stapler to be reliable?...Hold a good supply of staples?”  (Ask more questions that point to the features this stapler has.)&lt;br /&gt;Once you’ve asked these questions, make your presentation citing all the features and benefits of this stapler and why it’s exactly what the interviewer just told you he’s looking for.&lt;br /&gt;Then close with, “Just out of curiosity, what would you consider a reasonable price for a quality stapler like this…a stapler you could have right now and would (then repeat all the problems the stapler would solve for him)?  Whatever he says, (unless it’s zero), say, “Okay, we’ve got a deal.”&lt;br /&gt;NOTE:  If your interviewer tests you by fighting every step of the way, denying that he even wants such an item, don’t fight him.  Take the product away from him by saying, “Mr. Prospect, I’m delighted you’ve told me right upfront that there’s no way you’d ever want this stapler.  As you well know, the first rule of the most productive salespeople in any field is to meet the needs of people who really need and want our products, and it just wastes everyone’s time if we try to force it on those who don’t.  And I certainly wouldn’t want to waste your time.  But we sell many items.  Is there any product on this desk you would very much like to own…just one item?”  When he points something out, repeat the process above.  If he knows anything about selling, he may give you a standing ovation.&lt;br /&gt;Question 54 “The Salary Question” – How much money do you want?&lt;br /&gt;TRAPS:  May also be phrases as, “What salary are you worth?”…or, “How much are you making now?”  This is your most important negotiation. Handle it wrong and you can blow the job offer or go to work at far less than you might have gotten.&lt;br /&gt;BEST ANSWER:  For maximum salary negotiating power, remember these five guidelines:&lt;br /&gt;1. Never bring up salary.  Let the interviewer do it first.  Good salespeople sell their products thoroughly before talking price.  So should you.  Make the interviewer want you first, and your bargaining position will be much stronger.&lt;br /&gt;2. If your interviewer raises the salary question too early, before you’ve had a chance to create desire for your qualifications, postpone the question, saying something like, “Money is important to me, but is not my main concern.  Opportunity and growth are far more important.  What I’d rather do, if you don’t mind, is explore if I’m right for the position, and then talk about money. Would that be okay?”&lt;br /&gt;3. The #1 rule of any negotiation is:  the side with more information wins.  After you’ve done a thorough job of selling the interviewer and it’s time to talk salary, the secret is to get the employer talking about what he’s willing to pay before you reveal what you’re willing to accept.  So, when asked about salary, respond by asking, “I’m sure the company has already established a salary range for this position.  Could you tell me what that is?”  Or, “I want an income commensurate with my ability and qualifications.  I trust you’ll be fair with me.  What does the position pay?” Or, more simply, “What does this position pay?”&lt;br /&gt;4. Know beforehand what you’d accept.  To know what’s reasonable, research the job market and this position for any relevant salary information.  Remember that most executives look for a 20-25%$ pay boost when they switch jobs. If you’re grossly underpaid, you may want more.&lt;br /&gt;5. Never lie about what you currently make, but feel free to include the estimated cost of all your fringes, which could well tack on 25-50% more to your present “cash-only” salary.&lt;br /&gt;Question 55 The Illegal Question&lt;br /&gt;TRAPS:  Illegal questions include any regarding your age…number and ages of your children or other dependents…marital status…maiden name…religion…political affiliation…ancestry…national origin…birthplace…naturalization of your parents, spouse or children…diseases…disabilities…clubs…or spouse’s occupation…unless any of the above are directly related to your performance of the job.  You can’t even be asked about arrests, though you can be asked about convictions.&lt;br /&gt;BEST ANSWER:  Under the ever-present threat of lawsuits, most interviewers are well aware of these taboos.  Yet you may encounter, usually on a second or third interview, a senior executive who doesn’t interview much and forgets he can’t ask such questions.&lt;br /&gt;You can handle an illegal question in several ways. First, you can assert your legal right not to answer. But this will frighten or embarrass your interviewer and destroy any rapport you had.&lt;br /&gt;Second, you could swallow your concerns over privacy and answer the question straight forwardly if you feel the answer could help you.  For example, your interviewer, a devout Baptist, recognizes you from church and mentions it. Here, you could gain by talking about your church.&lt;br /&gt;Third, if you don’t want your privacy invaded, you can diplomatically answer the concern behind the question without answering the question itself.&lt;br /&gt;Example:  If you are over 50 and are asked, “How old are you?” you can answer with a friendly, smiling question of your own on whether there’s a concern that your age my affect your performance.  Follow this up by reassuring the interviewer that there’s nothing in this job you can’t do and, in fact, your age and experience are the most important advantages you offer the employer for the following reasons…&lt;br /&gt;Another example:  If asked, “Do you plan to have children?” you could answer, “I am wholeheartedly dedicated to my career“, perhaps adding, “I have no plans regarding children.”  (You needn’t fear you’ve pledged eternal childlessness.  You have every right to change your plans later.  Get the job first and then enjoy all your options.)&lt;br /&gt;Most importantly, remember that illegal questions arise from fear that you won’t perform well.  The best answer of all is to get the job and perform brilliantly. All concerns and fears will then varnish, replaced by respect and appreciation for your work.&lt;br /&gt;Question 56 The “Secret” Illegal Question&lt;br /&gt;TRAPS:  Much more frequent than the Illegal question (see Question 55) is the secret illegal question.  It’s secret because it’s asked only in the interviewer’s mind.  Since it’s not even expressed to you, you have no way to respond to it, and it can there be most damaging.&lt;br /&gt;Example:  You’re physically challenged, or a single mother returning to your professional career, or over 50, or a member of an ethnic minority, or fit any of a dozen other categories that do not strictly conform to the majority in a given company.&lt;br /&gt;Your interviewer wonders, “Is this person really able to handle the job?”…”Is he or she a ‘good fit’ at a place like ours?”…”Will the chemistry ever be right with someone like this?”  But the interviewer never raises such questions because they’re illegal.  So what can you do?&lt;br /&gt;BEST ANSWER:  Remember that just because the interviewer doesn’t ask an illegal question doesn’t mean he doesn’t have it.  More than likely, he is going to come up with his own answer.  So you might as well help him out.&lt;br /&gt;How?  Well, you obviously can’t respond to an illegal question if he hasn’t even asked.  This may well offend him.  And there’s always the chance he wasn’t even concerned about the issue until you brought it up, and only then begins to wonder.&lt;br /&gt;So you can’t address “secret” illegal questions head-on.  But what you can do is make sure there’s enough counterbalancing information to more than reassure him that there’s no problem in the area he may be doubtful about.&lt;br /&gt;For example, let’s say you’re a sales rep who had polio as a child and you need a cane to walk.  You know your condition has never impeded your performance, yet you’re concerned that your interviewer may secretly be wondering about your stamina or ability to travel.  Well, make sure that you hit these abilities very hard, leaving no doubt about your capacity to handle them well.&lt;br /&gt;So, too, if you’re in any different from what passes for “normal”.  Make sure, without in any way seeming defensive about yourself that you mention strengths, accomplishments, preferences and affiliations that strongly counterbalance any unspoken concern your interviewer may have.&lt;br /&gt;Question 57 What was the toughest part of your last job?&lt;br /&gt;TRAPS: This is slightly different from the question raised earlier, “What’s the most difficult part of being a (job title…)” because this asks what you personally have found most difficult in your last position.  This question is more difficult to redefine into something positive.  Your interviewer will assume that whatever you found toughest may give you a problem in your new position.&lt;br /&gt;BEST ANSWER:  State that there was nothing in your prior position that you found overly difficult, and let your answer go at that.  If pressed to expand your answer, you could describe the aspects of the position you enjoyed more than others, making sure that you express maximum enjoyment for those tasks most important to the open position, and you enjoyed least those tasks that are unimportant to the position at hand.&lt;br /&gt;Question 58 How do you define success…and how do you measure up to your own definition?&lt;br /&gt;TRAPS:  Seems like an obvious enough question.  Yet many executives, unprepared for it, fumble the ball.&lt;br /&gt;BEST ANSWER:  Give a well-accepted definition of success that leads right into your own stellar collection of achievements.&lt;br /&gt;Example:  “The best definition I’ve come across is that success is the progressive realization of a worthy goal.”&lt;br /&gt;“As to how I would measure up to that definition, I would consider myself both successful and fortunate…”(Then summarize your career goals and how your achievements have indeed represented a progressive path toward realization of your goals.)&lt;br /&gt;Question 59 “The Opinion Question” – What do you think about …Abortion…The President…The Death Penalty…(or any other controversial subject)?&lt;br /&gt;TRAPS:  Obviously, these and other “opinion” questions should never be asked.  Sometimes they come up over a combination dinner/interview when the interviewer has had a drink or two, is feeling relaxed, and is spouting off about something that bugged him in today’s news.  If you give your opinion and it’s the opposite of his, you won’t change his opinions, but you could easily lose the job offer.&lt;br /&gt;BEST ANSWER:  In all of these instances, just remember the tale about student and the wise old rabbi.  The scene is a seminary, where an overly serious student is pressing the rabbi to answer the ultimate questions of suffering, life and death.  But no matter how hard he presses, the wise old rabbi will only answer each difficult question with a question of his own.&lt;br /&gt;In exasperation, the seminary student demands, “Why, rabbi, do you always answer a question with another question?”  To which the rabbi responds, “And why not?”&lt;br /&gt;If you are ever uncomfortable with any question, asking a question in return is the greatest escape hatch ever invented.  It throws the onus back on the other person, sidetracks the discussion from going into an area of risk to you, and gives you time to think of your answer or, even better, your next question!&lt;br /&gt;In response to any of the “opinion” questions cited above, merely responding, “Why do you ask?” will usually be enough to dissipate any pressure to give your opinion.  But if your interviewer again presses you for an opinion, you can ask another question.&lt;br /&gt;Or you could assert a generality that almost everyone would agree with.  For example, if your interviewer is complaining about politicians then suddenly turns to you and asks if you’re a Republican or Democrat, you could respond by saying, “Actually, I’m finding it hard to find any politicians I like these days.”&lt;br /&gt;(Of course, your best question of all may be whether you want to work for someone opinionated.)&lt;br /&gt;Question 60 If you won $10 million lottery, would you still work?&lt;br /&gt;TRAPS:  Your totally honest response might be, “Hell, no, are you serious?”  That might be so, but any answer which shows you as fleeing work if given the chance could make you seem lazy.  On the other hand, if you answer, “Oh, I’d want to keep doing exactly what I am doing, only doing it for your firm,” you could easily inspire your interviewer to silently mutter to himself, “Yeah, sure.  Gimme a break.”&lt;br /&gt;BEST ANSWER:  This type of question is aimed at getting at your bedrock attitude about work and how you feel about what you do.  Your best answer will focus on your positive feelings.&lt;br /&gt;Example:  “After I floated down from cloud nine, I think I would still hold my basic belief that achievement and purposeful work are essential to a happy, productive life.  After all, if money alone bought happiness, then all rich people would be all happy, and that’s not true.&lt;br /&gt;“I love the work I do, and I think I’d always want to be involved in my career in some fashion.  Winning the lottery would make it more fun because it would mean having more flexibility, more options...who knows?”&lt;br /&gt;“Of course, since I can’t count on winning, I’d just as soon create my own destiny by sticking with what’s worked for me, meaning good old reliable hard work and a desire to achieve.  I think those qualities have built many more fortunes that all the lotteries put together.”&lt;br /&gt;Question 61 Looking back on your last position, have you done your best work?&lt;br /&gt;TRAPS:  Tricky question.  Answer “absolutely” and it can seem like your best work is behind you.  Answer, “no, my best work is ahead of me,” and it can seem as if you didn’t give it your all.&lt;br /&gt;BEST ANSWER:  To cover both possible paths this question can take, your answer should state that you always try to do your best, and the best of your career is right now.  Like an athlete at the top of his game, you are just hitting your career stride thanks to several factors.  Then, recap those factors, highlighting your strongest qualifications.&lt;br /&gt;Question 62 Why should I hire you from the outside when I could promote someone from within?&lt;br /&gt;TRAPS:  This question isn’t as aggressive as it sounds.  It represents the interviewer’s own dilemma over this common problem.  He’s probably leaning toward you already and for reassurance, wants to hear what you have to say on the matter.&lt;br /&gt;BEST ANSWER:  Help him see the qualifications that only you can offer.&lt;br /&gt;Example:  “In general, I think it’s a good policy to hire from within – to look outside probably means you’re not completely comfortable choosing someone from inside.&lt;br /&gt;“Naturally, you want this department to be as strong as it possibly can be, so you want the strongest candidate.  I feel that I can fill that bill because…(then recap your strongest qualifications that match up with his greatest needs).”&lt;br /&gt;Question 63 Tell me something negative you’ve heard about our company…&lt;br /&gt;TRAPS:  This is a common fishing expedition to see what the industry grapevine may be saying about the company.  But it’s also a trap because as an outsider, you never want to be the bearer of unflattering news or gossip about the firm.  It can only hurt your chances and sidetrack the interviewer from getting sold on you.&lt;br /&gt;BEST ANSWER:  Just remember the rule – never be negative – and you’ll handle this one just fine.&lt;br /&gt;Question 64 On a scale of one to ten, rate me as an interviewer.&lt;br /&gt;TRAPS:  Give a perfect “10,” and you’ll seem too easy to please.  Give anything less than a perfect 10, and he could press you as to where you’re being critical, and that road leads downhill for you.&lt;br /&gt;BEST ANSWER:  Once again, never be negative.  The interviewer will only resent criticism coming from you.  This is the time to show your positivism.&lt;br /&gt;However, don’t give a numerical rating. Simply praise whatever interview style he’s been using.&lt;br /&gt;If he’s been tough, say “You have been thorough and tough-minded, the very qualities needed to conduct a good interview.”&lt;br /&gt;If he’s been methodical, say, “You have been very methodical and analytical, and I’m sure that approach results in excellent hires for your firm.”&lt;br /&gt;In other words, pay him a sincere compliment that he can believe because it’s anchored in the behavior you’ve just seen.&lt;br /&gt;&lt;br /&gt;Good luck in your job search!&lt;br /&gt;&lt;br /&gt;The Editors&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/2158258402527566027-8827510364376048086?l=fresher-freshersguide.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://fresher-freshersguide.blogspot.com/feeds/8827510364376048086/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=2158258402527566027&amp;postID=8827510364376048086' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/2158258402527566027/posts/default/8827510364376048086'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/2158258402527566027/posts/default/8827510364376048086'/><link rel='alternate' type='text/html' href='http://fresher-freshersguide.blogspot.com/2007/08/64-interview-quetions.html' title='64 interview quetions'/><author><name>FRESHER</name><uri>http://www.blogger.com/profile/03154154368670178574</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-2158258402527566027.post-5895004884729848803</id><published>2007-08-19T08:20:00.000-07:00</published><updated>2007-08-19T08:21:17.303-07:00</updated><title type='text'>technical quetions</title><content type='html'>Technical  Questions&lt;br /&gt;1. A 2MB PCM(pulse code modulation) has&lt;br /&gt;&lt;br /&gt;a) 32 channels&lt;br /&gt;b) 30 voice channels &amp; 1 signalling channel.&lt;br /&gt;c) 31 voice channels &amp; 1 signalling channel.&lt;br /&gt;d) 32 channels out of which 30 voice channels, 1 signalling channel, &amp; 1 Synchronizatio channel.&lt;br /&gt;Ans: (c)&lt;br /&gt;2. Time taken for 1 satellite hop in voice communication is&lt;br /&gt;&lt;br /&gt;a) 1/2 second&lt;br /&gt;b) 1 seconds&lt;br /&gt;c) 4 seconds&lt;br /&gt;d) 2 seconds&lt;br /&gt;Ans: (a)&lt;br /&gt;3. Max number of satellite hops allowed in voice communication is :&lt;br /&gt;&lt;br /&gt;a) only one&lt;br /&gt;b) more han one&lt;br /&gt;c) two hops&lt;br /&gt;d) four hops&lt;br /&gt;Ans: (c)&lt;br /&gt;4. What is the max. decimal number that can be accomodated in a byte.&lt;br /&gt;&lt;br /&gt;a) 128&lt;br /&gt;b) 256&lt;br /&gt;c) 255&lt;br /&gt;d) 512&lt;br /&gt;Ans: (c)&lt;br /&gt;5. Conditional results after execution of an instruction in a micro processor is stored in&lt;br /&gt;&lt;br /&gt;a) register&lt;br /&gt;b) accumulator&lt;br /&gt;c) flag register&lt;br /&gt;d) flag register part of PSW(Program Status Word)&lt;br /&gt;Ans: (d)&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;6. Frequency at which VOICE is sampled is&lt;br /&gt;&lt;br /&gt;a) 4 Khz&lt;br /&gt;b) 8 Khz&lt;br /&gt;c) 16 Khz&lt;br /&gt;d) 64 Khz&lt;br /&gt;Ans: (a)&lt;br /&gt;7. Line of Sight is &lt;br /&gt;&lt;br /&gt;a) Straight Line&lt;br /&gt;b) Parabolic &lt;br /&gt;c) Tx &amp; Rx should be visible to each other&lt;br /&gt;d) none&lt;br /&gt;Ans: (c)&lt;br /&gt;8. Purpose of PC(Program Counter) in a MicroProcessor is&lt;br /&gt;&lt;br /&gt;a) To store address of TOS(Top Of Stack)&lt;br /&gt;b) To store address of next instruction to be executed.&lt;br /&gt;c) count the number of instructions.&lt;br /&gt;d) to store base address of the stack.&lt;br /&gt;Ans: (b)&lt;br /&gt;9. What action is taken when the processor under execution is interrupted by a non-maskable interrupt?&lt;br /&gt;&lt;br /&gt;a) Processor serves the interrupt request after completing the execution of the current instruction.&lt;br /&gt;b) Processor serves the interupt request after completing the current task.&lt;br /&gt;c) Processor serves the interupt request immediately.&lt;br /&gt;d) Processor serving the interrupt request depends upon the priority of the current task under execution.&lt;br /&gt;Ans: (a)&lt;br /&gt;10. The status of the Kernel is&lt;br /&gt;&lt;br /&gt;a) task&lt;br /&gt;b) process&lt;br /&gt;c) not defined.&lt;br /&gt;d) none of the above.&lt;br /&gt;Ans: (b)&lt;br /&gt;&lt;br /&gt;11. To send a data packet using datagram , connection will be established&lt;br /&gt;&lt;br /&gt;a) before data transmission.&lt;br /&gt;b) connection is not established before data transmission.&lt;br /&gt;c) no connection is required.&lt;br /&gt;d) none of the above.&lt;br /&gt;Ans: (c)&lt;br /&gt;&lt;br /&gt;12. Word allignment is&lt;br /&gt;&lt;br /&gt;a) alligning the address to the next word boundary of the machine.&lt;br /&gt;b) alligning to even boundary.&lt;br /&gt;c) alligning to word boundary.&lt;br /&gt;d) none of the above.&lt;br /&gt;Ans: (a)&lt;br /&gt;13 When a 'C' function call is made, the order in which parameters passed to the function are pushed into the stack is&lt;br /&gt;&lt;br /&gt;a) left to right&lt;br /&gt;b) right to left&lt;br /&gt;c) bigger variables are moved first than the smaller variales.&lt;br /&gt;d) smaller variables are moved first than the bigger ones.&lt;br /&gt;e) none of the above.&lt;br /&gt;Ans: (b)&lt;br /&gt;14 What is the type of signalling used between two exchanges?&lt;br /&gt;&lt;br /&gt;a) inband&lt;br /&gt;b) common channel signalling&lt;br /&gt;c) any of the above&lt;br /&gt;d) none of the above.&lt;br /&gt;Ans: (a)&lt;br /&gt;15 Buffering is &lt;br /&gt;&lt;br /&gt;a) the process of temporarily storing the data to allow for small variation in device speeds&lt;br /&gt;b) a method to reduce cross talks&lt;br /&gt;c) storage of data within transmitting medium until the receiver is ready to receive.&lt;br /&gt;d) a method to reduce routing overhead.&lt;br /&gt;Ans: (a)&lt;br /&gt;&lt;br /&gt;16. Memory allocation of variables declared in a program is&lt;br /&gt;&lt;br /&gt;a) allocated in RAM.&lt;br /&gt;b) allocated in ROM.&lt;br /&gt;c) allocated on stack.&lt;br /&gt;d) assigned to registers.&lt;br /&gt;Ans: (c)&lt;br /&gt;&lt;br /&gt;17. A software that allows a personal computer to pretend as a computer terminal is &lt;br /&gt;&lt;br /&gt;a) terminal adapter&lt;br /&gt;b) bulletin board&lt;br /&gt;c) modem&lt;br /&gt;d) terminal emulation&lt;br /&gt;Ans: (d)&lt;br /&gt;18. Find the output of the following program&lt;br /&gt;int *p,*q;&lt;br /&gt;p=(int *)1000;&lt;br /&gt;q=(int *)2000;&lt;br /&gt;printf("%d",(q-p)); &lt;br /&gt;Ans: 500&lt;br /&gt;&lt;br /&gt;19. Which addressing mode is used in the following statements:&lt;br /&gt;(a) MVI  B,55 &lt;br /&gt;(b) MOV B,A &lt;br /&gt;(c) MOV M,A&lt;br /&gt;Ans. (a) Immediate addressing mode.&lt;br /&gt;(b) Register Addressing Mode&lt;br /&gt;(c) Direct addressing mode&lt;br /&gt;&lt;br /&gt;20. RS-232C standard is used in _____________.&lt;br /&gt;Ans. Serial I/O&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;21. Memory. Management in Operating Systems is done by&lt;br /&gt;&lt;br /&gt;a) Memory Management Unit&lt;br /&gt;b) Memory management software of the Operating System&lt;br /&gt;c) Kernel&lt;br /&gt;Ans: (b)&lt;br /&gt;&lt;br /&gt;22. What is done for a Push opertion?&lt;br /&gt;Ans: SP is decremented and then the value is stored.&lt;br /&gt;23. Binary equivalent of 52&lt;br /&gt;&lt;br /&gt;Ans. 110100&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;24. Hexadecimal equivalent of 3452&lt;br /&gt;&lt;br /&gt;Ans. 72A&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;25. Explain Just In Time Concept ?&lt;br /&gt;&lt;br /&gt;Ans. Elimination of waste by purchasing manufacturing exactly when needed&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;26. A good way of unit testing s/w program is&lt;br /&gt;&lt;br /&gt;Ans. User test&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;27. OOT uses&lt;br /&gt;&lt;br /&gt;Ans. Encapsulated of detect methods&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;28.EDI useful in&lt;br /&gt;&lt;br /&gt;Ans. Electronic Transmission&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;29. MRPII different from MRP&lt;br /&gt;&lt;br /&gt;Ans. Modular version of man redundant initials&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;30. Hard disk time for R/W head to move to correct sector&lt;br /&gt;&lt;br /&gt;Ans. Latency Time&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;31. The percentage of times a page number bound in associate register is called&lt;br /&gt;&lt;br /&gt;Ans. Bit ratio&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;32. Expand MODEM&lt;br /&gt;&lt;br /&gt;Ans. Modulator and Demodulator&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;33. RDBMS file system can be defined as&lt;br /&gt;&lt;br /&gt;Ans. Interrelated&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;34. Super Key is&lt;br /&gt;&lt;br /&gt;Ans. Primary key and Attribute&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;35. Windows 95 supports&lt;br /&gt;&lt;br /&gt;(a) Multiuser &lt;br /&gt;(b) n tasks &lt;br /&gt;(c) Both&lt;br /&gt;(d) None&lt;br /&gt;&lt;br /&gt;Ans. (a)&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;36.In the command scanf, h is used for &lt;br /&gt;&lt;br /&gt;Ans. Short int&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;37.A process is defined as&lt;br /&gt;&lt;br /&gt;Ans. Program in execution&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;38.A thread is&lt;br /&gt;&lt;br /&gt;Ans. Detachable unit of executable code)&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;39.What is the advantage of Win NT over Win 95 &lt;br /&gt;&lt;br /&gt;Ans. Robust and secure&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;40.How is memory management done in Win95 &lt;br /&gt;&lt;br /&gt;Ans. Through paging and segmentation&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;41.What is meant by polymorphism&lt;br /&gt;&lt;br /&gt;Ans. Redfinition of a base class method in a derived class&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;42.What is the essential feature of inheritance &lt;br /&gt;&lt;br /&gt;Ans. All properties of existing class are derived&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;43.What does the protocol FTP do&lt;br /&gt;&lt;br /&gt;Ans. Transfer a file b/w stations with user authentification&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;44.In the transport layer ,TCP is what type of protocol&lt;br /&gt;&lt;br /&gt;Ans. Connection oriented&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;45.Why is a gateway used &lt;br /&gt;&lt;br /&gt;Ans. To connect incompatible networks&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;46.How is linked list implemented&lt;br /&gt;&lt;br /&gt;Ans. By referential structures&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;47.What method is used in Win95 in multitasking&lt;br /&gt;&lt;br /&gt;Ans. Non preemptive check&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;48.What is a semaphore &lt;br /&gt;&lt;br /&gt;Ans. A method synchronization of multiple processes&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;49.What is the precedence order from high to low ,of the symbols ( ) ++ / &lt;br /&gt;&lt;br /&gt;Ans.( ) , ++, /&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;50.Preorder of A*(B+C)/D-G&lt;br /&gt;&lt;br /&gt;Ans.*+ABC/-DG&lt;br /&gt;&lt;br /&gt;51.What is the efficiency of merge sort &lt;br /&gt;&lt;br /&gt;Ans. O(n log n)&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;52.In which layer are routers used &lt;br /&gt;&lt;br /&gt;Ans.In network layer &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;53.Which of the following sorting algorithem has average sorting behavior --&lt;br /&gt;       Bubble sort,merge sort,heap sort,exchange sort&lt;br /&gt;&lt;br /&gt;Ans. Heap sort&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;54.In binary search tree which traversal is used for getting ascending order values--Inorder ,post order,preorder&lt;br /&gt;&lt;br /&gt;Ans.Inorder&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;55.What are device drivers used for &lt;br /&gt;&lt;br /&gt;Ans.To provide software for enabling the hardware&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;56.What is fork command in unix &lt;br /&gt;&lt;br /&gt;Ans. System call used to create process&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;57.What is make command in unix&lt;br /&gt;&lt;br /&gt;Ans. Used forcreation of more than one file&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;58.In unix .profile contains &lt;br /&gt;&lt;br /&gt;Ans. Start up program&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;59.In unix 'ls 'stores contents in&lt;br /&gt;&lt;br /&gt;Ans.inode block&lt;br /&gt;&lt;br /&gt;60. Which of the following involves context switch,&lt;br /&gt;(a) system call &lt;br /&gt;(b) priviliged instruction&lt;br /&gt;(c) floating poitnt exception&lt;br /&gt;(d) all the above&lt;br /&gt;(e) none of the above&lt;br /&gt;Ans: (a)&lt;br /&gt;&lt;br /&gt;61. In OST, terminal emulation is done in&lt;br /&gt;(a) sessions layer &lt;br /&gt;(b) application layer &lt;br /&gt;(c) presentation layer &lt;br /&gt;(d) transport layer&lt;br /&gt;Ans: (b)&lt;br /&gt;62. For 1 MB memory, the  number of address lines required,&lt;br /&gt;(a)11 &lt;br /&gt;(b)16 &lt;br /&gt;(c)22 &lt;br /&gt;(d) 24&lt;br /&gt;Ans. (b)&lt;br /&gt;63. Semaphore is used for&lt;br /&gt;(a) synchronization &lt;br /&gt;(b) dead-lock avoidence&lt;br /&gt;(c) box &lt;br /&gt;(d) none&lt;br /&gt;Ans. (a)&lt;br /&gt;64. Which holds true for the following statement&lt;br /&gt;     class c: public A, public B&lt;br /&gt;a) 2 member in class A, B should not have same name&lt;br /&gt;b) 2 member in class A, C should not have same name&lt;br /&gt;c) both &lt;br /&gt;d) none&lt;br /&gt;Ans. (a)&lt;br /&gt;65.Preproconia.. does not do which one of the following&lt;br /&gt;(a) macro&lt;br /&gt;(b) conditional compliclation&lt;br /&gt;(c) in type checking &lt;br /&gt;(d) including load file&lt;br /&gt;Ans. (c)&lt;br /&gt;&lt;br /&gt;66. Piggy backing is a technique for&lt;br /&gt;a) Flow control &lt;br /&gt;b) Sequence &lt;br /&gt;c) Acknowledgement &lt;br /&gt;d) retransmition&lt;br /&gt;Ans. (c)&lt;br /&gt;&lt;br /&gt;67. Which is not a memory management scheme?&lt;br /&gt;a) buddy system&lt;br /&gt;b) swapping&lt;br /&gt;c) monitors&lt;br /&gt;d) paging &lt;br /&gt;Ans : c&lt;br /&gt;68. There was a circuit given using three nand gates with two inputs and one output.&lt;br /&gt;    Find the output.&lt;br /&gt;a) OR&lt;br /&gt;b) AND&lt;br /&gt;c) XOR&lt;br /&gt;d) NOT&lt;br /&gt;Ans. (a)&lt;br /&gt;&lt;br /&gt;69.Iintegrated check value(ICV) are used as:&lt;br /&gt;Ans. The client computes the ICV and then compares it with the senders value.&lt;br /&gt;70. When applets are downloaded from web sites , a byte verifier performs _________?&lt;br /&gt;Ans. Status check.&lt;br /&gt;&lt;br /&gt;71. An IP/IPX packet received by a computer using... having IP/IPX  both how the packet is handled.&lt;br /&gt;Ans. Read the, field in the packet header with to send IP or IPX protocol.&lt;br /&gt;72. The UNIX shell ....&lt;br /&gt;a) does not come with the rest of the system&lt;br /&gt;b) forms the interface between the user and the kernal&lt;br /&gt;c) does not give any scope for programming&lt;br /&gt;d) deos not allow calling one program from with in another&lt;br /&gt;e) all of the above&lt;br /&gt;Ans. (b)&lt;br /&gt;73. In UNIX a files i-node ......?&lt;br /&gt;Ans. Is a data structure that defines all specifications of a file like the file size, &lt;br /&gt;        number of lines to a file, permissions etc.&lt;br /&gt;74. The very first process created by the kernal that runs till the kernal process is halts is&lt;br /&gt;a) init&lt;br /&gt;b) getty&lt;br /&gt;c) both (a) and (b)&lt;br /&gt;d) none of these&lt;br /&gt;Ans. (a)&lt;br /&gt;75. In the process table entry for the kernel process, the process id value is&lt;br /&gt;(a) 0 &lt;br /&gt;(b) 1 &lt;br /&gt;(c) 2 &lt;br /&gt;(d) 255 &lt;br /&gt;(e) it does not have a process table entry&lt;br /&gt;Ans. (a)&lt;br /&gt;&lt;br /&gt;76. Which of the following API is used to hide a window&lt;br /&gt;a) ShowWindow&lt;br /&gt;b) EnableWindow&lt;br /&gt;c) MoveWindow&lt;br /&gt;d) SetWindowPlacement&lt;br /&gt;e) None of the above&lt;br /&gt;Ans. (a)&lt;br /&gt;77. Which function is the entry point for a DLL in MS Windows 3.1&lt;br /&gt;a) Main&lt;br /&gt;b) Winmain&lt;br /&gt;c) Dllmain&lt;br /&gt;d) Libmain&lt;br /&gt;e) None&lt;br /&gt;Ans. (b)&lt;br /&gt;78. The standard source for standard input, standard output and standard error is&lt;br /&gt;a) the terminal&lt;br /&gt;b) /dev/null&lt;br /&gt;c) /usr/you/input, /usr/you/output/, /usr/you/error respectively&lt;br /&gt;d) None&lt;br /&gt;Ans. (a)&lt;br /&gt;79. The redirection operators &gt; and &gt;&gt;&lt;br /&gt;a) do the same function&lt;br /&gt;b) differ : &gt; overwrites, while &gt;&gt; appends&lt;br /&gt;c) differ : &gt; is used for input while &gt;&gt; is used for output&lt;br /&gt;d) differ : &gt; write to any file while &gt;&gt; write only to standard output&lt;br /&gt;e) None of these&lt;br /&gt;Ans. (b)&lt;br /&gt;80. The command grep first second third /usr/you/myfile&lt;br /&gt;a) prints lines containing the words first, second or third from the file /usr/you/myfile&lt;br /&gt;b) searches for lines containing the pattern first in the files&lt;br /&gt;second, third, and /usr/you/myfile and prints them&lt;br /&gt;c) searches the files /usr/you/myfiel and third for lines containing the words first or second and prints them&lt;br /&gt;d) replaces the word first with the word second in the files third and /usr/you/myfile&lt;br /&gt;e) None of the above&lt;br /&gt;Ans. (b)&lt;br /&gt;81. You are creating a Index on EMPNO column in the EMPLOYEE table. Which statement will you use?&lt;br /&gt;a) CREATE INdEX emp_empno_idx ON employee, empno;&lt;br /&gt;b) CREATE INdEX emp_empno_idx FOR employee, empno;&lt;br /&gt;c) CREATE INdEX emp_empno_idx ON employee(empno); &lt;br /&gt;d) CREATE emp_empno_idx INdEX ON employee(empno);&lt;br /&gt;&lt;br /&gt;Ans. c&lt;br /&gt;&lt;br /&gt;82. Which program construct must return a value?&lt;br /&gt;a) Package&lt;br /&gt;b) Function &lt;br /&gt;c) Anonymous block&lt;br /&gt;d) Stored Procedure&lt;br /&gt;e) Application Procedure&lt;br /&gt;&lt;br /&gt;Ans. b&lt;br /&gt;&lt;br /&gt;83. Which Statement would you use to remove the EMPLOYEE_Id_PK PRIMARY KEY constraint and all depending constraints fromthe EMPLOYEE table?&lt;br /&gt;a) ALTER TABLE employee dROP PRIMARY KEY CASCAdE; &lt;br /&gt;b) ALTER TABLE employee dELETE PRIMARY KEY CASCAdE;&lt;br /&gt;c) MOdIFY TABLE employee dROP CONSTRAINT employee_id_pk CASCAdE;&lt;br /&gt;d) ALTER TABLE employee dROP PRIMARY KEY employee_id_pk CASCAdE;&lt;br /&gt;e) MOdIFY TABLE employee dELETE PRIMARY KEY employee_id_pk CASCAdE;&lt;br /&gt;&lt;br /&gt;Ans. a&lt;br /&gt;&lt;br /&gt;84. Which three commands cause a transaction to end? (Chosse three)&lt;br /&gt;a) ALTER&lt;br /&gt;b) GRANT &lt;br /&gt;c) DELETE&lt;br /&gt;d) INSERT&lt;br /&gt;e) UPdATE&lt;br /&gt;f) ROLLBACK &lt;br /&gt;Ans. a ,b ,f&lt;br /&gt;85. Under which circumstance should you create an index on a table?&lt;br /&gt;a) The table is small.&lt;br /&gt;b) The table is updated frequently.&lt;br /&gt;c) A columns values are static and contain a narrow range of values&lt;br /&gt;d) Two columns are consistently used in the WHERE clause join condition of SELECT &lt;br /&gt;     statements.&lt;br /&gt;&lt;br /&gt;Ans.d&lt;br /&gt;86. What was the first name given to Java Programming Language. &lt;br /&gt;&lt;br /&gt;a) Oak - Java&lt;br /&gt;b) Small Talk&lt;br /&gt;c) Oak&lt;br /&gt;d) None&lt;br /&gt;&lt;br /&gt;Ans.a&lt;br /&gt;&lt;br /&gt;87.When a bicycle is in motion,the force of friction exerted by the ground on the two wheels is such that it acts&lt;br /&gt;(a) In the backward direction on the front wheel and in the forward direction on the rear wheel.&lt;br /&gt;(b) In the forward direction on the front wheel and in the backward direction on the rear wheel.&lt;br /&gt;(c) In the backward direction on both the front and rear wheels.&lt;br /&gt;(d) In the backward direction on both the front and rear wheels.&lt;br /&gt;Ans. (d)&lt;br /&gt;&lt;br /&gt;88. A certain radioactive element A, has a half life = t seconds.&lt;br /&gt;    In (t/2) seconds the fraction of the initial quantity of the element so far decayed is nearly&lt;br /&gt;(a) 29%&lt;br /&gt;(b) 15%&lt;br /&gt;(c) 10%&lt;br /&gt;(d) 45%&lt;br /&gt;Ans. (a)&lt;br /&gt;&lt;br /&gt;89. Which of the following plots would be a straight line ?&lt;br /&gt;(a) Logarithm of decay rate against logarithm of time&lt;br /&gt;(b) Logarithm of decay rate against logarithm of number of decaying nuclei&lt;br /&gt;(c) Decay rate against time&lt;br /&gt;(d) Number of decaying nuclei against time&lt;br /&gt;Ans. (b)&lt;br /&gt;&lt;br /&gt;90. A radioactive element x has an atomic number of 100.&lt;br /&gt;    It decays directly into an element y which decays directly into element z.&lt;br /&gt;    In both processes a charged particle is emitted.&lt;br /&gt;    Which of the following statements would be true?&lt;br /&gt;(a) y has an atomic number of 102&lt;br /&gt;(b) y has an atomic number of 101&lt;br /&gt;(c) z has an atomic number of 100&lt;br /&gt;(d) z has an atomic number of 101&lt;br /&gt;Ans. (b)&lt;br /&gt;&lt;br /&gt;91. If the sum of the roots of the equation ax2 + bx + c=0 is equal to the sum of the squares of their reciprocals &lt;br /&gt;    then a/c, b/a, c/b are in &lt;br /&gt;(a) AP&lt;br /&gt;(b) GP&lt;br /&gt;(c) HP&lt;br /&gt;(d) None of these&lt;br /&gt;Ans. (c)&lt;br /&gt;&lt;br /&gt;92. A man speaks the truth 3 out of 4 times.&lt;br /&gt;    He throws a die and reports it to be a 6.&lt;br /&gt;    What is the probability of it being a 6?&lt;br /&gt;(a) 3/8&lt;br /&gt;(b) 5/8&lt;br /&gt;(c) 3/4&lt;br /&gt;(d) None of the above&lt;br /&gt;Ans. (a)&lt;br /&gt;&lt;br /&gt;93. If cos2A + cos2B + cos2C = 1 then ABC is a&lt;br /&gt;(a) Right angle triangle&lt;br /&gt;(b) Equilateral triangle&lt;br /&gt;(c) All the angles are acute&lt;br /&gt;(d) None of these&lt;br /&gt;Ans. (a)&lt;br /&gt;&lt;br /&gt;94. Image of point (3,8) in the line  x + 3y = 7 is&lt;br /&gt;(a) (-1,-4)&lt;br /&gt;(b) (-1,4)&lt;br /&gt;(c) (2,-4)&lt;br /&gt;(d) (-2,-4)&lt;br /&gt;Ans. (a)&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;95. The mass number of a nucleus is &lt;br /&gt;(a) Always less than its atomic number&lt;br /&gt;(b) Always more than its atomic number&lt;br /&gt;(c) Sometimes more than and sometimes equal to its atomic number&lt;br /&gt;(d) None of the above&lt;br /&gt;Ans. (c)&lt;br /&gt;&lt;br /&gt;96. The maximum KE of the photoelectron emitted from a surface is dependent on &lt;br /&gt;(a) The intensity of incident radiation&lt;br /&gt;(b) The potential of the collector electrode&lt;br /&gt;(c) The frequency of incident radiation&lt;br /&gt;(d) The angle of incidence of radiation of the surface&lt;br /&gt;Ans. (c)&lt;br /&gt;&lt;br /&gt;97. Which of the following is not an essential condition for interference&lt;br /&gt;(a) The two interfering waves must be propagated in almost the same direction or &lt;br /&gt;     the two interfering waves must intersect at a very small angle&lt;br /&gt;(b) The waves must have the same time period and wavelength&lt;br /&gt;(c) Amplitude of the two waves should be the same&lt;br /&gt;(d) The interfering beams of light must originate from the same source&lt;br /&gt;Ans. (c)&lt;br /&gt;&lt;br /&gt;98. When X-Ray photons collide with electrons &lt;br /&gt;(a) They slow down&lt;br /&gt;(b) Their mass increases&lt;br /&gt;(c) Their wave length increases&lt;br /&gt;(d) Their energy decreases&lt;br /&gt;Ans. (c)&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;99. An electron emits energy &lt;br /&gt;(a) Because its in orbit&lt;br /&gt;(b) When it jumps from one energy level to another&lt;br /&gt;(c) Electrons are attracted towards the nucleus&lt;br /&gt;(d) The electrostatic force is insufficient to hold the electrons in orbits&lt;br /&gt;Ans. (b)&lt;br /&gt;&lt;br /&gt;100. How many bonds are present in CO2 molecule?&lt;br /&gt;(a) 1&lt;br /&gt;(b) 2&lt;br /&gt;(c) 0&lt;br /&gt;(d) 4&lt;br /&gt;Ans. (d)&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/2158258402527566027-5895004884729848803?l=fresher-freshersguide.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://fresher-freshersguide.blogspot.com/feeds/5895004884729848803/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=2158258402527566027&amp;postID=5895004884729848803' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/2158258402527566027/posts/default/5895004884729848803'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/2158258402527566027/posts/default/5895004884729848803'/><link rel='alternate' type='text/html' href='http://fresher-freshersguide.blogspot.com/2007/08/technical-quetions.html' title='technical quetions'/><author><name>FRESHER</name><uri>http://www.blogger.com/profile/03154154368670178574</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-2158258402527566027.post-2918397315563370126</id><published>2007-08-19T08:18:00.000-07:00</published><updated>2007-08-19T08:20:57.774-07:00</updated><title type='text'>400 puzzles</title><content type='html'>Three friends divided some bullets equally. After all of them shot 4 bullets the total number of bullets remaining is equal to the bullets each had after division. Find the original number divided. &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;18 &lt;br /&gt;&lt;br /&gt;Assume that initial there were 3*X bullets. &lt;br /&gt;&lt;br /&gt;So they got X bullets each after division. &lt;br /&gt;&lt;br /&gt;All of them shot 4 bullets. So now they have (X - 4) bullets each. &lt;br /&gt;&lt;br /&gt;But it is given that,after they shot 4 bullets each, total number of bullets remaining is equal to the bullets each had after division i.e. X &lt;br /&gt;&lt;br /&gt;Therefore, the equation is &lt;br /&gt;3 * (X - 4) = X &lt;br /&gt;3 * X - 12 = X &lt;br /&gt;2 * X = 12 &lt;br /&gt;X = 6 &lt;br /&gt;&lt;br /&gt;Therefore the total bullets before division is = 3 * X = 18&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Find sum of digits of D. &lt;br /&gt;&lt;br /&gt;Let &lt;br /&gt;A= 19991999 &lt;br /&gt;B = sum of digits of A &lt;br /&gt;C = sum of digits of B &lt;br /&gt;D = sum of digits of C &lt;br /&gt;&lt;br /&gt;(HINT : A = B = C = D (mod 9)) &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The sum of the digits od D is 1. &lt;br /&gt;&lt;br /&gt;Let E = sum of digits of D. &lt;br /&gt;&lt;br /&gt;It follows from the hint that A = E (mod 9)&lt;br /&gt;Consider,&lt;br /&gt;&lt;br /&gt;        A = 19991999&lt;br /&gt;&lt;br /&gt;          &lt; 20002000&lt;br /&gt;&lt;br /&gt;          = 22000 * 10002000&lt;br /&gt;&lt;br /&gt;          = 1024200 * 106000&lt;br /&gt;&lt;br /&gt;          &lt; 10800 * 106000&lt;br /&gt;&lt;br /&gt;          = 106800&lt;br /&gt;&lt;br /&gt;        &lt;br /&gt;&lt;br /&gt;        i.e. A &lt; 106800&lt;br /&gt;&lt;br /&gt;        i.e. B &lt; 6800 * 9 = 61200&lt;br /&gt;&lt;br /&gt;        i.e. C &lt; 5 * 9 = 45&lt;br /&gt;&lt;br /&gt;        i.e. D &lt; 2 * 9 = 18&lt;br /&gt;&lt;br /&gt;        i.e. E &lt;= 9&lt;br /&gt;&lt;br /&gt;        i.e. E is a single digit number.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;        Also,&lt;br /&gt;&lt;br /&gt;        1999 = 1 (mod 9)&lt;br /&gt;&lt;br /&gt;        so 19991999 = 1 (mod 9)&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Therefore we conclude that E=1.&lt;br /&gt;There is a 50m long army platoon marching ahead. The last person in the platoon wants to give a letter to the first person leading the platoon. So while the platoon is marching he runs ahead, reaches the first person and hands over the letter to him and without stopping he runs and comes back to his original position. &lt;br /&gt;&lt;br /&gt;In the mean time the whole platoon has moved ahead by 50m. &lt;br /&gt;&lt;br /&gt;The question is how much distance did the last person cover in that time. Assuming that he ran the whole distance with uniform speed.&lt;br /&gt;Submitted&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The last person covered 120.71 meters. &lt;br /&gt;&lt;br /&gt;It is given that the platoon and the last person moved with uniform speed. Also, they both moved for the identical amount of time. Hence, the ratio of the distance they covered - while person moving forward and backword - are equal. &lt;br /&gt;&lt;br /&gt;Let's assume that when the last person reached the first person, the platoon moved X meters forward. &lt;br /&gt;&lt;br /&gt;Thus, while moving forward the last person moved (50+X) meters whereas the platoon moved X meters. &lt;br /&gt;&lt;br /&gt;Similarly, while moving back the last person moved [50-(50-X)] X meters whereas the platoon moved (50-X) meters. &lt;br /&gt;&lt;br /&gt;Now, as the ratios are equal, &lt;br /&gt;(50+X)/X = X/(50-X) &lt;br /&gt;(50+X)*(50-X) = X*X &lt;br /&gt;&lt;br /&gt;Solving, X=35.355 meters &lt;br /&gt;&lt;br /&gt;Thus, total distance covered by the last person &lt;br /&gt;= (50+X) + X &lt;br /&gt;= 2*X + 50 &lt;br /&gt;= 2*(35.355) + 50 &lt;br /&gt;= 120.71 meters &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Note that at first glance, one might think that the total distance covered by the last person is 100 meters, as he ran the total lenght of the platoon (50 meters) twice. TRUE, but that's the relative distance covered by the last person i.e. assuming that the platoon is stationary.&lt;br /&gt;&lt;br /&gt;If you take a marker &amp; start from a corner on a cube, what is the maximum number of edges you can trace across if you never trace across the same edge twice, never remove the marker from the cube, &amp; never trace anywhere on the cube, except for the corners &amp; edges? &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;9 &lt;br /&gt;&lt;br /&gt;To verify this, you can make a drawing of a cube, &amp; number each of its 12 edges. Then, always starting from 1 corner &amp; 1 edge, you can determine all of the possible combinations for tracing along the edges of a cube. &lt;br /&gt;&lt;br /&gt;There is no need to start from other corners or edges of the cube, as you will only be repeating the same combinations. The process is a little more involved than this, but is useful for solving many types of spatial puzzles.&lt;br /&gt;One of Mr. Bajaj, his wife, their son and Mr. Bajaj's mother is an Engineer and another is a Doctor. &lt;br /&gt;• If the Doctor is a male, then the Engineer is a male. &lt;br /&gt;• If the Engineer is younger than the Doctor, then the Engineer and the Doctor are not blood relatives. &lt;br /&gt;• If the Engineer is a female, then she and the Doctor are blood relatives. &lt;br /&gt;Can you tell who is the Doctor and the Engineer?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Mr. Bajaj is the Engineer and either his wife or his son is the Doctor. &lt;br /&gt;&lt;br /&gt;Mr. Bajaj's wife and mother are not blood relatives. So from 3, if the Engineer is a female, the Doctor is a male. But from 1, if the Doctor is a male, then the Engineer is a male. Thus, there is a contradiction, if the Engineer is a female. Hence, either Mr. Bajaj or his son is the Engineer. &lt;br /&gt;&lt;br /&gt;Mr. Bajaj's son is the youngest of all four and is blood relative of each of them. So from 2, Mr. Bajaj's son is not the Engineer. Hence, Mr. Bajaj is the Engineer. &lt;br /&gt;&lt;br /&gt;Now from 2, Mr. Bajaj's mother can not be the Doctor. So the Doctor is either his wife or his son . It is not possible to determine anything further.&lt;br /&gt;&lt;br /&gt;Three men - Sam, Cam and Laurie - are married to Carrie, Billy and Tina, but not necessarily in the same order. &lt;br /&gt;&lt;br /&gt;Sam's wife and Billy's Husband play Carrie and Tina's husband at bridge. No wife partners her husband and Cam does not play bridge. &lt;br /&gt;&lt;br /&gt;Who is married to Cam? &lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Carrie is married to Cam. &lt;br /&gt;&lt;br /&gt;"Sam's wife and Billy's Husband play Carrie and Tina's husband at bridge." &lt;br /&gt;&lt;br /&gt;It means that Sam is not married to either Billy or Carrie. Thus, Sam is married to Tina. &lt;br /&gt;&lt;br /&gt;As Cam does not play bridge, Billy's husband must be Laurie. &lt;br /&gt;&lt;br /&gt;Hence, Carrie is married to Cam.&lt;br /&gt;&lt;br /&gt;There are 3 persons X, Y and Z. On some day, X lent tractors to Y and Z as many as they had. After a month Y gave as many tractors to X and Z as many as they have. After a month Z did the same thing. At the end of this transaction each one of them had 24. &lt;br /&gt;&lt;br /&gt;Find the tractors each originally had? &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;One way to solve it is by making 3 equations and solve them simultaneously. But there is rather easier way to solve it using Backtracing. &lt;br /&gt;&lt;br /&gt;It's given that at the end, each had 24 tractors (24, 24, 24) i.e. after Z gave tractors to X &amp; Y as many as they had. It means that after getting tractors from Z their tractors got doubled. So before Z gave them tractors, they had 12 tractors each and Z had 48 tractors. (12, 12, 48) &lt;br /&gt;&lt;br /&gt;Similarly, before Y gave tractors to X &amp; Z, they had 6 &amp; 24 tractors respectively and Y had 42 tractors i.e. (6, 42, 24) &lt;br /&gt;&lt;br /&gt;Again, before X gave tractors to Y &amp; Z, they had 21 &amp; 12 tractors respectively and X had 39 tractors i.e. (39, 21, 12) &lt;br /&gt;&lt;br /&gt;Hence, initially X had 39 tractors, Y had 21 tractors and Z had 12 tractors.&lt;br /&gt;A certain street has 1000 buildings. A sign-maker is contracted to number the houses from 1 to 1000. How many zeroes will he need? &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The sign-maker will need 192 zeroes. &lt;br /&gt;&lt;br /&gt;Divide 1000 building numbers into groups of 100 each as follow: &lt;br /&gt;(1..100), (101..200), (201..300), ....... (901..1000) &lt;br /&gt;&lt;br /&gt;For the first group, sign-maker will need 11 zeroes. &lt;br /&gt;For group numbers 2 to 9, he will require 20 zeroes each. &lt;br /&gt;And for group number 10, he will require 21 zeroes. &lt;br /&gt;&lt;br /&gt;The total numbers of zeroes required are &lt;br /&gt;= 11 + 8*20 + 21 &lt;br /&gt;= 11 + 160 + 21 &lt;br /&gt;= 192&lt;br /&gt;&lt;br /&gt;There are 9 coins. Out of which one is odd one i.e weight is less or more. How many iterations of weighing are required to find odd coin? &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;It is always possible to find odd coin in 3 weighings and to tell whether the odd coin is heavier or lighter. &lt;br /&gt;1. Take 8 coins and weigh 4 against 4. &lt;br /&gt;o If both are not equal, goto step 2 &lt;br /&gt;o If both are equal, goto step 3 &lt;br /&gt;&lt;br /&gt;2. One of these 8 coins is the odd one. Name the coins on heavier side of the scale as H1, H2, H3 and H4. Similarly, name the coins on the lighter side of the scale as L1, L2, L3 and L4. Either one of H's is heavier or one of L's is lighter. Weigh (H1, H2, L1) against (H3, H4, X) where X is one coin remaining in intial weighing. &lt;br /&gt;o If both are equal, one of L2, L3, L4 is lighter. Weigh L2 against L3. &lt;br /&gt; If both are equal, L4 is the odd coin and is lighter. &lt;br /&gt; If L2 is light, L2 is the odd coin and is lighter. &lt;br /&gt; If L3 is light, L3 is the odd coin and is lighter. &lt;br /&gt;&lt;br /&gt;o If (H1, H2, L1) is heavier side on the scale, either H1 or H2 is heavier. Weight H1 against H2 &lt;br /&gt; If both are equal, there is some error. &lt;br /&gt; If H1 is heavy, H1 is the odd coin and is heavier. &lt;br /&gt; If H2 is heavy, H2 is the odd coin and is heavier. &lt;br /&gt;&lt;br /&gt;o If (H3, H4, X) is heavier side on the scale, either H3 or H4 is heavier or L1 is lighter. Weight H3 against H4 &lt;br /&gt; If both are equal, L1 is the odd coin and is lighter. &lt;br /&gt; If H3 is heavy, H3 is the odd coin and is heavier. &lt;br /&gt; If H4 is heavy, H4 is the odd coin and is heavier. &lt;br /&gt;&lt;br /&gt;3. The remaining coin X is the odd one. Weigh X against the anyone coin used in initial weighing. &lt;br /&gt;o If both are equal, there is some error. &lt;br /&gt;o If X is heavy, X is the odd coin and is heavier. &lt;br /&gt;o If X is light, X is the odd coin and is lighter. &lt;br /&gt;In a sports contest there were m medals awarded on n successive days (n &gt; 1). &lt;br /&gt;1. On the first day 1 medal and 1/7 of the remaining m - 1 medals were awarded. &lt;br /&gt;2. On the second day 2 medals and 1/7 of the now remaining medals was awarded; and so on. &lt;br /&gt;3. On the nth and last day, the remaining n medals were awarded.&lt;br /&gt;How many days did the contest last, and how many medals were awarded altogether?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Total 36 medals were awarded and the contest was for 6 days. &lt;br /&gt;&lt;br /&gt;On day 1: Medals awarded = (1 + 35/7) = 6 : Remaining 30 medals &lt;br /&gt;On day 2: Medals awarded = (2 + 28/7) = 6 : Remaining 24 medals &lt;br /&gt;On day 3: Medals awarded = (3 + 21/7) = 6 : Remaining 18 medals &lt;br /&gt;On day 4: Medals awarded = (4 + 14/7) = 6 : Remaining 12 medals &lt;br /&gt;On day 5: Medals awarded = (5 +7/7) = 6 : Remaining 6 medals &lt;br /&gt;On day 6: Medals awarded 6 &lt;br /&gt;&lt;br /&gt;I got this answer by writing small program. If anyone know any other simpler method, do submit it.&lt;br /&gt;A number of 9 digits has the following properties: &lt;br /&gt;• The number comprising the leftmost two digits is divisible by 2, that comprising the leftmost three digits is divisible by 3, the leftmost four by 4, the leftmost five by 5, and so on for the nine digits of the number i.e. the number formed from the first n digits is divisible by n, 2&lt;=n&lt;=9. &lt;br /&gt;• Each digit in the number is different i.e. no digits are repeated. &lt;br /&gt;• The digit 0 does not occur in the number i.e. it is comprised only of the digits 1-9 in some order.&lt;br /&gt;Find the number.&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The answer is 381654729 &lt;br /&gt;&lt;br /&gt;One way to solve it is Trial-&amp;-Error. You can make it bit easier as odd positions will always occupy ODD numbers and even positions will always occupy EVEN numbers. Further 5th position will contain 5 as 0 does not occur. &lt;br /&gt;&lt;br /&gt;The other way to solve this problem is by writing a computer program that systematically tries all possibilities&lt;br /&gt;&lt;br /&gt;1/3 rd of the contents of a container evaporated on the 1st day. 3/4th of the remaining contents of the container evaporated on the second day. &lt;br /&gt;&lt;br /&gt;What part of the contents of the container is left at the end of the second day? &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Assume that contents of the container is X &lt;br /&gt;&lt;br /&gt;On the first day 1/3rd is evaporated. &lt;br /&gt;(1 - 1/3) of X is remaining i.e. (2/3)X &lt;br /&gt;&lt;br /&gt;On the Second day 3/4th is evaporated. Hence, &lt;br /&gt;(1- 3/4) of (2/3)X is remaining &lt;br /&gt;i.e. (1/4)(2/3)X = (1/6) X &lt;br /&gt;&lt;br /&gt;Hence 1/6th of the contents of the container is remaining&lt;br /&gt;&lt;br /&gt;Vipul was studying for his examinations and the lights went off. It was around 1:00 AM. He lighted two uniform candles of equal length but one thicker than the other. The thick candle is supposed to last six hours and the thin one two hours less. When he finally went to sleep, the thick candle was twice as long as the thin one. &lt;br /&gt;&lt;br /&gt;For how long did Vipul study in candle light? &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Vipul studied for 3 hours in candle light. &lt;br /&gt;&lt;br /&gt;Assume that the initial lenght of both the candle was L and Vipul studied for X hours. &lt;br /&gt;&lt;br /&gt;In X hours, total thick candle burnt = XL/6 &lt;br /&gt;In X hours, total thin candle burnt = XL/4 &lt;br /&gt;&lt;br /&gt;After X hours, total thick candle remaining = L - XL/6 &lt;br /&gt;After X hours, total thin candle remaining = L - XL/4 &lt;br /&gt;&lt;br /&gt;Also, it is given that the thick candle was twice as long as the thin one when he finally went to sleep. &lt;br /&gt;(L - XL/6) = 2(L - XL/4) &lt;br /&gt;(6 - X)/6 = (4 - X)/2 &lt;br /&gt;(6 - X) = 3*(4 - X) &lt;br /&gt;6 - X = 12 - 3X &lt;br /&gt;2X = 6 &lt;br /&gt;X = 3 &lt;br /&gt;&lt;br /&gt;Hence, Vipul studied for 3 hours i.e. 180 minutes in candle light.&lt;br /&gt;&lt;br /&gt;If you started a business in which you earned Rs.1 on the first day, Rs.3 on the second day, Rs.5 on the third day, Rs.7 on the fourth day, &amp; so on. &lt;br /&gt;&lt;br /&gt;How much would you have earned with this business after 50 years (assuming there are exactly 365 days in every year)? &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Rs.333,062,500 &lt;br /&gt;&lt;br /&gt;To begin with, you want to know the total number of days: 365 x 50 = 18250. &lt;br /&gt;&lt;br /&gt;By experimentation, the following formula can be discovered, &amp; used to determine the amount earned for any particular day: 1 + 2(x-1), with x being the number of the day. Take half of the 18250 days, &amp; pair them up with the other half in the following way: day 1 with day 18250, day 2 with day 18249, &amp; so on, &amp; you will see that if you add these pairs together, they always equal Rs.36500. &lt;br /&gt;&lt;br /&gt;Multiply this number by the total number of pairs (9125), &amp; you have the amount you would have earned in 50 years. &lt;br /&gt;&lt;br /&gt;Math gurus may use series formula to solve it.(series: 1,3,5,7,9,11.....upto 18250 terms)&lt;br /&gt;A worker earns a 5% raise. A year later, the worker receives a 2.5% cut in pay, &amp; now his salary is Rs. 22702.68 &lt;br /&gt;&lt;br /&gt;What was his salary to begin with?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Rs.22176 &lt;br /&gt;&lt;br /&gt;Assume his salary was Rs. X &lt;br /&gt;&lt;br /&gt;He earns 5% raise. So his salary is (105*X)/100 &lt;br /&gt;&lt;br /&gt;A year later he receives 2.5% cut. So his salary is ((105*X)/100)*(97.5/100) which is Rs. 22702.68 &lt;br /&gt;&lt;br /&gt;Hence, solving equation ((105*X)/100)*(97.5/100) = 22702.68 &lt;br /&gt;X = 22176&lt;br /&gt;At 6'o a clock ticks 6 times. The time between first and last ticks is 30 seconds. How long does it tick at 12'o. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;66 seconds &lt;br /&gt;&lt;br /&gt;It is given that the time between first and last ticks at 6'o is 30 seconds. &lt;br /&gt;Total time gaps between first and last ticks at 6'o = 5 &lt;br /&gt;(i.e. between 1 &amp; 2, 2 &amp; 3, 3 &amp; 4, 4 &amp; 5 and 5 &amp; 6) &lt;br /&gt;&lt;br /&gt;So time gap between two ticks = 30/5 = 6 seconds. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Now, total time gaps between first and last ticks at 12'o = 11 &lt;br /&gt;Therefore time taken for 12 ticks = 11 * 6 = 66 seconds (and not 60 seconds)&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;500 men are arranged in an array of 10 rows and 50 columns according to their heights. &lt;br /&gt;&lt;br /&gt;Tallest among each row of all are asked to come out. And the shortest among them is A. &lt;br /&gt;&lt;br /&gt;Similarly after resuming them to their original positions, the shortest among each column are asked to come out. And the tallest among them is B. &lt;br /&gt;&lt;br /&gt;Now who is taller A or B ?&lt;br /&gt;Answer&lt;br /&gt; &lt;br /&gt;&lt;br /&gt;No one is taller, both are same as A and B are the same person. &lt;br /&gt;&lt;br /&gt;As it is mentioned that 500 men are arranged in an array of 10 rows and 50 columns according to their heights. Let's assume that position numbers represent their heights. Hence, the shortest among the 50, 100, 150, ... 450, 500 is person with height 50 i.e. A. Similarly the tallest among 1, 2, 3, 4, 5, ..... 48, 48, 50 is person with height 50 i.e. B &lt;br /&gt;&lt;br /&gt;Now, both A and B are the person with height 50. Hence both are same.&lt;br /&gt;&lt;br /&gt;In Mr. Mehta's family, there are one grandfather, one grandmother, two fathers, two mothers, one father-in-law, one mother-in-law, four children, three grandchildren, one brother, two sisters, two sons, two daughters and one daughter-in-law. &lt;br /&gt;&lt;br /&gt;How many members are there in Mr. Mehta's family? Give minimal possible answer.&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;There are 7 members in Mr. Mehta's family. Mother &amp; Father of Mr. Mehta, Mr. &amp; Mrs. Mehta, his son and two daughters. &lt;br /&gt;&lt;br /&gt;Mother &amp; Father of Mr. Mehta &lt;br /&gt;| &lt;br /&gt;| &lt;br /&gt;Mr. &amp; Mrs. Mehta &lt;br /&gt;| &lt;br /&gt;| &lt;br /&gt;One Son &amp; Two Daughters&lt;br /&gt;When Alexander the Great attacked the forces of Porus, an Indian soldier was captured by the Greeks. He had displayed such bravery in battle, however, that the enemy offered to let him choose how he wanted to be killed. They told him, "If you tell a lie, you will put to the sword, and if you tell the truth you will be hanged." &lt;br /&gt;&lt;br /&gt;The soldier could make only one statement. He made that statement and went free. What did he say?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The soldier said, "You will put me to the sword." &lt;br /&gt;&lt;br /&gt;The soldier has to say a Paradox to save himself. If his statement is true, he will be hanged, which is not the sword and hence false. If his statement is false, he will be put to the sword, which will make it true. A Paradox !!!&lt;br /&gt;&lt;br /&gt;A person wanted to withdraw X rupees and Y paise from the bank. But cashier made a mistake and gave him Y rupees and X paise. Neither the person nor the cashier noticed that. &lt;br /&gt;&lt;br /&gt;After spending 20 paise, the person counts the money. And to his surprise, he has double the amount he wanted to withdraw. &lt;br /&gt;&lt;br /&gt;Find X and Y. (1 Rupee = 100 Paise)&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;As given, the person wanted to withdraw 100X + Y paise. &lt;br /&gt;&lt;br /&gt;But he got 100Y + X paise. &lt;br /&gt;&lt;br /&gt;After spending 20 paise, he has double the amount he wanted to withdraw. Hence, the equation is&lt;br /&gt;&lt;br /&gt;        2 * (100X + Y) = 100Y + X - 20&lt;br /&gt;&lt;br /&gt;        200X + 2Y = 100Y +X - 20&lt;br /&gt;&lt;br /&gt;        199X - 98Y = -20&lt;br /&gt;&lt;br /&gt;        98Y - 199X = 20&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Now, we got one equation; but there are 2 variables. We have to apply little bit of logic over here. We know that if we interchange X &amp; Y, amount gets double. So Y should be twice of X or one more than twice of X i.e. Y = 2X or Y = 2X+1 &lt;br /&gt;&lt;br /&gt;Case I : Y=2X &lt;br /&gt;Solving two equations simultaneously &lt;br /&gt;98Y - 199X = 20 &lt;br /&gt;Y - 2X = 0 &lt;br /&gt;We get X = - 20/3 &amp; Y = - 40/2 &lt;br /&gt;&lt;br /&gt;Case II : Y=2X+1 &lt;br /&gt;Solving two equations simultaneously &lt;br /&gt;98Y - 199X = 20 &lt;br /&gt;Y - 2X = 1 &lt;br /&gt;We get X = 26 &amp; Y = 53 &lt;br /&gt;&lt;br /&gt;Now, its obvious that he wanted to withdraw Rs. 26.53&lt;br /&gt;&lt;br /&gt;Submit&lt;br /&gt;Answer&lt;br /&gt; &lt;br /&gt;Users&lt;br /&gt;Answer (2)&lt;br /&gt; &lt;br /&gt;BrainVista&lt;br /&gt;Answer&lt;br /&gt; &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;The game of Tic-Tac-Toe is being played between two players. Only the last mark to be placed in the game as shown. &lt;br /&gt;&lt;br /&gt;Who will win the game, O or X? Can you tell which was the sixth mark and at which position? Do explain your answer. &lt;br /&gt;At the Party: &lt;br /&gt;1. There were 9 men and children. &lt;br /&gt;2. There were 2 more women than children. &lt;br /&gt;3. The number of different man-woman couples possible was 24. Note that if there were 7 men and 5 women, then there would have been 35 man-woman couples possible. &lt;br /&gt;&lt;br /&gt;Also, of the three groups - men, women and children - at the party: &lt;br /&gt;4. There were 4 of one group. &lt;br /&gt;5. There were 6 of one group. &lt;br /&gt;6. There were 8 of one group.&lt;br /&gt;Exactly one of the above 6 statements is false. &lt;br /&gt;&lt;br /&gt;Can you tell which one is false? Also, how many men, women and children are there at the party&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Assume that both the players are intelligent enough.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;O will win the game. The sixth mark was X in square 9. &lt;br /&gt;&lt;br /&gt;The 7th mark must be placed in square 5 which is the win situation for both X and O. Hence, the 6th mark must be placed in a line already containing two of the opponents marks. There are two such possibilities - the 6th mark would have been either O in square 7 or X in square 9. &lt;br /&gt;&lt;br /&gt;As we know both the players are intelligent enough, the 6th mark could not be O in square 7. Instead, he would have placed O in square 5 and would have won. &lt;br /&gt;&lt;br /&gt;Hence, the sixth mark must be X placed in square 9. And the seventh mark will be O. Thus O will win the game.&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Statement (4) is false. There are 3 men, 8 women and 6 children. &lt;br /&gt;&lt;br /&gt;Assume that Statements (4), (5) and (6) are all true. Then, Statement (1) is false. But then Statement (2) and (3) both can not be true. Thus, contradictory to the fact that exactly one statement is false. &lt;br /&gt;&lt;br /&gt;So Statement (4) or Statement (5) or Statement (6) is false. Also, Statements (1), (2) and (3) all are true. &lt;br /&gt;&lt;br /&gt;From (1) and (2), there are 11 men and women. Then from (3), there are 2 possible cases - either there are 8 men and 3 women or there are 3 men and 8 women. &lt;br /&gt;&lt;br /&gt;If there are 8 men and 3 women, then there is 1 child. Then Statements (4) and (5) both are false, which is not possible. &lt;br /&gt;&lt;br /&gt;Hence, there are 3 men, 8 women and 6 children. Statement (4) is false.&lt;br /&gt;&lt;br /&gt;There is a shortage of tubelights, bulbs and fans in a village - Kharghar. It is found that &lt;br /&gt;• All houses do not have either tubelight or bulb or fan. &lt;br /&gt;• exactly 19% of houses do not have just one of these. &lt;br /&gt;• atleast 67% of houses do not have tubelights. &lt;br /&gt;• atleast 83% of houses do not have bulbs. &lt;br /&gt;• atleast 73% of houses do not have fans.&lt;br /&gt;What percentage of houses do not have tubelight, bulb and fan?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;42% houses do not have tubelight, bulb and fan. &lt;br /&gt;&lt;br /&gt;Let's assume that there are 100 houses. Hence, there should be total 300 items i.e. 100 tubelights, 100 bulbs and 100 fans. &lt;br /&gt;&lt;br /&gt;From the given data, we know that there is shortage of atleast (67+83+73) 223 items in every 100 houses. &lt;br /&gt;&lt;br /&gt;Also, exactly 19 houses do not have just one item. It means that remaining 81 houses should account for the shortage of remaining (223-19) 204 items. If those remaining 81 houses do not have 2 items each, there would be a shortage of 162 items. But total of 204 items are short. Hence, atleast (204-162) 42 houses do not have all 3 items - tubelight, bulb and fan. &lt;br /&gt;&lt;br /&gt;Thus, 42% houses do not have tubelight, bulb and fan.&lt;br /&gt;Mr. Subramaniam rents a private car for Andheri-Colaba-Andheri trip. It costs him Rs. 300 everyday. &lt;br /&gt;&lt;br /&gt;One day the car driver informed Mr. Subramaniam that there were two students from Bandra who wished to go from Bandra to Colaba and back to Bandra. Bandra is halfway between Andheri and Colaba. Mr. Subramaniam asked the driver to let the students travel with him. &lt;br /&gt;&lt;br /&gt;On the first day when they came, Mr. Subramaniam said, "If you tell me the mathematically correct price you should pay individually for your portion of the trip, I will let you travel for free." &lt;br /&gt;&lt;br /&gt;How much should the individual student pay for their journey?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The individual student should pay Rs. 50 for their journey. &lt;br /&gt;&lt;br /&gt;Note that 3 persons are travelling between Bandra and Colaba. &lt;br /&gt;&lt;br /&gt;The entire trip costs Rs. 300 to Mr. Subramanian. Hence, half of the trip costs Rs. 150. &lt;br /&gt;&lt;br /&gt;For Andheri-Bandra-Andheri, only one person i.e. Mr. Subramaniam is travelling. Hence, he would pay Rs. 150. &lt;br /&gt;&lt;br /&gt;For Bandra-Colaba-Bandra, three persons i.e Mr. Subramaniam and two students, are travelling. Hence, each student would pay Rs. 50.&lt;br /&gt;&lt;br /&gt;Substitute digits for the letters to make the following Division true&lt;br /&gt;                   O U T&lt;br /&gt;&lt;br /&gt;           -------------&lt;br /&gt;&lt;br /&gt;   S T E M | D E M I S E&lt;br /&gt;&lt;br /&gt;           | D M O C&lt;br /&gt;&lt;br /&gt;           -------------&lt;br /&gt;&lt;br /&gt;               T U I S&lt;br /&gt;&lt;br /&gt;               S T E M&lt;br /&gt;&lt;br /&gt;              ----------&lt;br /&gt;&lt;br /&gt;                 Z Z Z E&lt;br /&gt;&lt;br /&gt;                 Z U M M&lt;br /&gt;&lt;br /&gt;                --------&lt;br /&gt;&lt;br /&gt;                   I S T&lt;br /&gt;Note that the leftmost letter can't be zero in any word. Also, there must be a one-to-one mapping between digits and letters. e.g. if you substitute 3 for the letter M, no other letter can be 3 and all other M in the puzzle must be&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;C=0, U=1, S=2, T=3, O=4, M=5, I=6, Z=7, E=8, D=9 &lt;br /&gt;&lt;br /&gt;It is obvious that U=1 (as U*STEM=STEM) and C=0 (as I-C=I). &lt;br /&gt;&lt;br /&gt;S*O is a single digit and also S*T is a single digit. Hence, their values (O, S, T) must be 2, 3 or 4 (as they can not be 0 or 1 or greater than 4). &lt;br /&gt;&lt;br /&gt;Consider, STEM*O=DMOC, where C=0. It means that M must be 5. Now, its simple. O=4, S=2, T=3, E=8, Z=7, I=6 and D=9.&lt;br /&gt;                   O U T                        4 1 3&lt;br /&gt;&lt;br /&gt;           -------------                -------------&lt;br /&gt;&lt;br /&gt;   S T E M | D E M I S E        2 3 8 5 | 9 8 5 6 2 8&lt;br /&gt;&lt;br /&gt;           | D M O C                    | 9 5 4 0&lt;br /&gt;&lt;br /&gt;           -------------                -------------&lt;br /&gt;&lt;br /&gt;               T U I S                      3 1 6 2&lt;br /&gt;&lt;br /&gt;               S T E M                      2 3 8 5&lt;br /&gt;&lt;br /&gt;              ----------                   ----------&lt;br /&gt;&lt;br /&gt;                 Z Z Z E                      7 7 7 8&lt;br /&gt;&lt;br /&gt;                 Z U M M                      7 1 5 5&lt;br /&gt;&lt;br /&gt;                --------                     --------&lt;br /&gt;&lt;br /&gt;                   I S T                        6 2 3&lt;br /&gt;Also, when arranged from 0 to 9, it spells CUSTOMIZED.&lt;br /&gt;At what time after 4.00 p.m. is the minutes hand of a clock exactly aligned with the hour hand?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;4:21:49.5 &lt;br /&gt;&lt;br /&gt;Assume that X minutes after 4.00 PM minute hand exactly aligns with and hour hand. &lt;br /&gt;&lt;br /&gt;For every minute, minute hand travels 6 degrees. &lt;br /&gt;Hence, for X minutes it will travel 6 * X degrees. &lt;br /&gt;&lt;br /&gt;For every minute, hour hand travels 1/2 degrees. &lt;br /&gt;Hence, for X minutes it will travel X/2 degrees. &lt;br /&gt;&lt;br /&gt;At 4.00 PM, the angle between minute hand and hour hand is 120 degrees. Also, after X minutes, minute hand and hour hand are exactly aligned. So the angle with respect to 12 i.e. Vertical Plane will be same. Therefore, &lt;br /&gt;&lt;br /&gt;6 * X = 120 + X/2 &lt;br /&gt;12 * X = 240 + X &lt;br /&gt;11 * X = 240 &lt;br /&gt;X = 21.8182 &lt;br /&gt;X = 21 minutes 49.5 seconds &lt;br /&gt;&lt;br /&gt;Hence, at 4:21:49.5 minute hand is exactly aligned with the hour hand.&lt;br /&gt;&lt;br /&gt;A soldier looses his way in a thick jungle. At random he walks from his camp but mathematically in an interesting fashion. &lt;br /&gt;&lt;br /&gt;First he walks one mile East then half mile to North. Then 1/4 mile to West, then 1/8 mile to South and so on making a loop. &lt;br /&gt;&lt;br /&gt;Finally how far he is from his camp and in which direction?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The soldier is 0.8944 miles away from his camp towards East-North. &lt;br /&gt;&lt;br /&gt;It is obvious that he is in East-North direction. &lt;br /&gt;&lt;br /&gt;Distance travelled in North and South directions &lt;br /&gt;= 1/2 - 1/8 + 1/32 - 1/128 + 1/512 - 1/2048 + and so on... (a geometric series with r = (-1/4) ) &lt;br /&gt;&lt;br /&gt;   (1/2) * ( 1 - (-1/4)n ) &lt;br /&gt;= --------------------------- &lt;br /&gt;         ( 1 - (-1/4) ) &lt;br /&gt;&lt;br /&gt;= 1 / ( 2 * ( 1 - (-1/4) ) ) &lt;br /&gt;= 2/5 &lt;br /&gt;&lt;br /&gt;Similarly in East and West directions &lt;br /&gt;= 1 - 1/4 + 1/16 - 1/64 + 1/256 - and so on... (a geometric series with r = (-1/4) ) &lt;br /&gt;&lt;br /&gt;   (1) * ( 1 - (-1/4)n ) &lt;br /&gt;= --------------------------- &lt;br /&gt;         ( 1 - (-1/4) ) &lt;br /&gt;&lt;br /&gt;= 1 / ( ( 1- (-1/4) ) &lt;br /&gt;= 4/5 &lt;br /&gt;&lt;br /&gt;So the soldier is 4/5 miles away towards East and 2/5 miles away towards North. So using right angled triangle, soldier is 0.8944 miles away from his camp.&lt;br /&gt;&lt;br /&gt;Raj has a jewel chest containing Rings, Pins and Ear-rings. The chest contains 26 pieces. Raj has 2 1/2 times as many rings as pins, and the number of pairs of earrings is 4 less than the number of rings. &lt;br /&gt;&lt;br /&gt;How many earrings does Raj have?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;12 earrings &lt;br /&gt;&lt;br /&gt;Assume that there are R rings, P pins and E pair of ear-rings. &lt;br /&gt;&lt;br /&gt;It is given that, he has 2 1/2 times as many rings as pins. &lt;br /&gt;R = (5/2) * P or P = (2*R)/5 &lt;br /&gt;&lt;br /&gt;And, the number of pairs of earrings is 4 less than the number of rings. &lt;br /&gt;E = R - 4 or R = E + 4 &lt;br /&gt;&lt;br /&gt;Also, there are total 26 pieces. &lt;br /&gt;R + P + 2*E = 26 &lt;br /&gt;R + (2*R)/5 + 2*E = 26 &lt;br /&gt;5*R + 2*R + 10*E = 130 &lt;br /&gt;7*R + 10*E = 130 &lt;br /&gt;7*(E + 4) + 10*E = 130 &lt;br /&gt;7*E + 28 + 10*E = 130 &lt;br /&gt;17*E = 102 &lt;br /&gt;E = 6 &lt;br /&gt;&lt;br /&gt;Hence, there are 6 pairs of Ear-rings i.e. total 12 Ear-rings&lt;br /&gt;How many ways are there of arranging the sixteen black or white pieces of a standard international chess set on the first two rows of the board? &lt;br /&gt;&lt;br /&gt;Given that each pawn is identical and each rook, knight and bishop is identical to its pair.&lt;br /&gt;Submitted&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;6,48,64,800 ways &lt;br /&gt;&lt;br /&gt;There are total 16 pieces which can be arranged on 16 places in 16P16 = 16! ways. &lt;br /&gt;(16! = 16 * 15 * 14 * 13 * 12 * ..... * 3 * 2 * 1) &lt;br /&gt;&lt;br /&gt;But, there are some duplicate combinations because of identical pieces. &lt;br /&gt;• There are 8 identical pawn, which can be arranged in 8P8 = 8! ways. &lt;br /&gt;• Similarly there are 2 identical rooks, 2 identical knights and 2 identical bishops. Each can be arranged in 2P2 = 2! ways.&lt;br /&gt;Hence, the require answer is &lt;br /&gt;= (16!) / (8! * 2! * 2! * 2!) &lt;br /&gt;= 6,48,64,800&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;A person with some money spends 1/3 for cloths, 1/5 of the remaining for food and 1/4 of the remaining for travel. He is left with Rs 100/- &lt;br /&gt;&lt;br /&gt;How much did he have with him in the begining?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Rs. 250/- &lt;br /&gt;&lt;br /&gt;Assume that initially he had Rs. X &lt;br /&gt;He spent 1/3 for cloths =. (1/3) * X &lt;br /&gt;Remaining money = (2/3) * X &lt;br /&gt;&lt;br /&gt;He spent 1/5 of remaining money for food = (1/5) * (2/3) * X = (2/15) * X &lt;br /&gt;Remaining money = (2/3) * X - (2/15) * X = (8/15) * X &lt;br /&gt;&lt;br /&gt;Again, he spent 1/4 of remaining maoney for travel = (1/4) * (8/15) * X = (2/15) * X &lt;br /&gt;Remaining money = (8/15) * X - (2/15) * X = (6/15) * X &lt;br /&gt;&lt;br /&gt;But after spending for travel he is left with Rs. 100/- So &lt;br /&gt;(6/15) * X = 100 &lt;br /&gt;X = 250&lt;br /&gt;&lt;br /&gt;Grass in lawn grows equally thick and in a uniform rate. It takes 24 days for 70 cows and 60 days for 30 cows to eat the whole of the grass. &lt;br /&gt;&lt;br /&gt;How many cows are needed to eat the grass in 96 days?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;20 cows &lt;br /&gt;&lt;br /&gt;g - grass at the beginning &lt;br /&gt;r - rate at which grass grows, per day &lt;br /&gt;y - rate at which one cow eats grass, per day &lt;br /&gt;n - no of cows to eat the grass in 96 days &lt;br /&gt;&lt;br /&gt;From given data, &lt;br /&gt;g + 24*r = 70 * 24 * y ---------- A &lt;br /&gt;g + 60*r = 30 * 60 * y ---------- B &lt;br /&gt;g + 96*r = n * 96 * y ---------- C &lt;br /&gt;&lt;br /&gt;Solving for (B-A), &lt;br /&gt;(60 * r) - (24 * r) = (30 * 60 * y) - (70 * 24 * y) &lt;br /&gt;36 * r = 120 * y ---------- D &lt;br /&gt;&lt;br /&gt;Solving for (C-B), &lt;br /&gt;(96 * r) - (60 * r) = (n * 96 * y) - (30 * 60 * y) &lt;br /&gt;36 * r = (n * 96 - 30 * 60) * y &lt;br /&gt;120 * y = (n * 96 - 30 * 60) * y [From D] &lt;br /&gt;120 = (n * 96 - 1800) &lt;br /&gt;n = 20 &lt;br /&gt;&lt;br /&gt;Hence, 20 cows are needed to eat the grass in 96 days.&lt;br /&gt;There is a safe with a 5 digit number as the key. The 4th digit is 4 greater than the second digit, while the 3rd digit is 3 less than the 2nd digit. The 1st digit is thrice the last digit. There are 3 pairs whose sum is 11. &lt;br /&gt;&lt;br /&gt;Find the number.&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;65292 &lt;br /&gt;&lt;br /&gt;As per given conditions, there are three possible combinations for 2nd, 3rd and 4th digits. They are (3, 0, 7) or (4, 1, 8) or (5, 2, 9) &lt;br /&gt;&lt;br /&gt;It is given that there are 3 pairs whose sum is 11. All possible pairs are (2, 9), (3, 8), (4, 7), (5, 6). Now required number is 5 digit number and it contains 3 pairs of 11. So it must not be having 0 and 1 in it. Hence, the only possible combination for 2nd, 3rd and 4th digits is (5, 2, 9) &lt;br /&gt;&lt;br /&gt;Also, 1st digit is thrice the last digit. The possible combinations are (3, 1), (6, 2) and (9, 3), out of which only (6, 2) with (5, 2, 9) gives 3 pairs of 11. Hence, the answer is 65292.&lt;br /&gt;Four friends - Arjan, Bhuvan, Guran and Lakha were comparing the number of sheep that they owned. &lt;br /&gt;&lt;br /&gt;It was found that Guran had ten more sheep than Lakha. &lt;br /&gt;&lt;br /&gt;If Arjan gave one-third to Bhuvan, and Bhuvan gave a quarter of what he then held to Guran, who then passed on a fifth of his holding to Lakha, they would all have an equal number of sheep. &lt;br /&gt;&lt;br /&gt;How many sheep did each of them possess? Give the minimal possible answer&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt; &lt;br /&gt;&lt;br /&gt;Arjan, Bhuvan, Guran and Lakha had 90, 50, 55 and 45 sheep respectively. &lt;br /&gt;&lt;br /&gt;Assume that Arjan, Bhuvan, Guran and Lakha had A, B, G and L sheep respectively. As it is given that at the end each would have an equal number of sheep, comparing the final numbers from the above table. &lt;br /&gt;&lt;br /&gt;Arjan's sheep = Bhuvan's sheep &lt;br /&gt;2A/3 = A/4 + 3B/4 &lt;br /&gt;8A = 3A + 9B &lt;br /&gt;5A = 9B &lt;br /&gt;&lt;br /&gt;Arjan's sheep = Guran's sheep &lt;br /&gt;2A/3 = A/15 + B/5 + 4G/5 &lt;br /&gt;2A/3 = A/15 + A/9 + 4G/5 (as B=5A/9) &lt;br /&gt;30A = 3A + 5A + 36G &lt;br /&gt;22A = 36G &lt;br /&gt;11A = 18G &lt;br /&gt;&lt;br /&gt;Arjan's sheep = Lakha's sheep &lt;br /&gt;2A/3 = A/60 + B/20 + G/5 + L &lt;br /&gt;2A/3 = A/60 + A/36 + 11A/90 + L (as B=5A/9 and G=11A/18) &lt;br /&gt;2A/3 = A/6 + L &lt;br /&gt;A/2 = L &lt;br /&gt;A = 2L &lt;br /&gt;&lt;br /&gt;Also, it is given that Guran had ten more sheep than Lakha. &lt;br /&gt;G = L + 10 &lt;br /&gt;11A/18 = A/2 + 10 &lt;br /&gt;A/9 = 10 &lt;br /&gt;A = 90 sheep &lt;br /&gt;&lt;br /&gt;Thus, Arjan had 90 sheep, Bhuvan had 5A/9 i.e. 50 sheep, Guran had 11A/18 i.e. 55 sheep and Lakha had A/2 i.e. 45 sheep.&lt;br /&gt;Consider a number 235, where last digit is the sum of first two digits i.e. 2 + 3 = 5. &lt;br /&gt;&lt;br /&gt;How many such 3-digit numbers are there?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;There are 45 different 3-digit numbers. &lt;br /&gt;&lt;br /&gt;The last digit can not be 0. &lt;br /&gt;&lt;br /&gt;If the last digit is 1, the only possible number is 101. (Note that 011 is not a 3-digit number) &lt;br /&gt;&lt;br /&gt;If the last digit is 2, the possible numbers are 202 and 112. &lt;br /&gt;&lt;br /&gt;If the last digit is 3, the possible numbers are 303, 213 and 123. &lt;br /&gt;&lt;br /&gt;If the last digit is 4, the possible numbers are 404, 314, 224 and 134. &lt;br /&gt;&lt;br /&gt;If the last digit is 5, the possible numbers are 505, 415, 325, 235 and 145. &lt;br /&gt;&lt;br /&gt;Note the pattern here - If the last digit is 1, there is only one number. If the last digit is 2, there are two numbers. If the last digit is 3, there are three numbers. If the last digit is 4, there are four numbers. If the last digit is 5, there are five numbers. And so on..... &lt;br /&gt;&lt;br /&gt;Thus, total numbers are &lt;br /&gt;1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 = 45 &lt;br /&gt;&lt;br /&gt;Altogether then, there are 45 different 3-digit numbers, where last digit is the sum of first two digits.&lt;br /&gt;&lt;br /&gt;Find the smallest number such that if its rightmost digit is placed at its left end, the new number so formed is precisely 50% larger than the original number.&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The answer is 285714. &lt;br /&gt;&lt;br /&gt;If its rightmost digit is placed at its left end, then new number is 428571 which is 50% larger than the original number 285714. &lt;br /&gt;&lt;br /&gt;The simplest way is to write a small program. And the other way is trial and error !!!&lt;br /&gt;Two identical pack of cards A and B are shuffled throughly. One card is picked from A and shuffled with B. The top card from pack A is turned up. If this is the Queen of Hearts, what are the chances that the top card in B will be the King of Hearts?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;52 / 2703 &lt;br /&gt;&lt;br /&gt;There are two cases to be considered. &lt;br /&gt;&lt;br /&gt;CASE 1 : King of Hearts is drawn from Pack A and shuffled with Pack B &lt;br /&gt;&lt;br /&gt;Probability of drawing King of Hearts from Pack A = 1/51 (as Queen of Hearts is not to be drawn) &lt;br /&gt;Probability of having King of Hearts on the top of the Pack B = 2/53 &lt;br /&gt;&lt;br /&gt;So total probability of case 1 = (1/51) * (2/53) = 2 / (51 * 53) &lt;br /&gt;&lt;br /&gt;CASE 2 : King of Hearts is not drawn from Pack A &lt;br /&gt;&lt;br /&gt;Probability of not drawing King of Hearts from Pack A = 50/51 (as Queen of Hearts is not to be drawn) &lt;br /&gt;Probability of having King of Hearts on the top of the Pack B = 1/53 &lt;br /&gt;&lt;br /&gt;So total probability of case 2 = (50/51) * (1/53) = 50 / (51 * 53) &lt;br /&gt;&lt;br /&gt;Now adding both the probability, the required probability is &lt;br /&gt;= 2 / (51 * 53) + 50 / (51 * 53) &lt;br /&gt;= 52 / (51 * 53) &lt;br /&gt;= 52 / 2703 &lt;br /&gt;= 0.0192378&lt;br /&gt;There are 3 ants at 3 corners of a triangle, they randomly start moving towards another corner. &lt;br /&gt;&lt;br /&gt;What is the probability that they don't collide?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Let's mark the corners of the triangle as A,B,C. There are total 8 ways in which ants can move. &lt;br /&gt;1. A-&gt;B, B-&gt;C, C-&gt;A &lt;br /&gt;2. A-&gt;B, B-&gt;C, C-&gt;B &lt;br /&gt;3. A-&gt;B, B-&gt;A, C-&gt;A &lt;br /&gt;4. A-&gt;B, B-&gt;A, C-&gt;B &lt;br /&gt;5. A-&gt;C, C-&gt;B, B-&gt;A &lt;br /&gt;6. A-&gt;C, C-&gt;B, B-&gt;C &lt;br /&gt;7. A-&gt;C, C-&gt;A, B-&gt;A &lt;br /&gt;8. A-&gt;C, C-&gt;A, B-&gt;C&lt;br /&gt;&lt;br /&gt;Out of which, there are only two cases under which the ants won't collide : &lt;br /&gt;• A-&gt;B, B-&gt;C, C-&gt;A &lt;br /&gt;• A-&gt;C, C-&gt;B, B-&gt;A &lt;br /&gt;&lt;br /&gt;Find all sets of consecutive integers that add up to 1000.&lt;br /&gt;Submitted by : James Barberousse &lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;There are total 8 such series: &lt;br /&gt;1. Sum of 2000 numbers starting from -999 i.e. summation of numbers from -999 to 1000. &lt;br /&gt;(-999) + (-998) + (-997) + ..... + (-1) + 0 + 1 + 2 + ..... + 997 + 998 + 999 + 1000 = 1000 &lt;br /&gt;2. Sum of 400 numbers starting from -197 i.e. summation of numbers from -197 to 202. &lt;br /&gt;(-197) + (-196) + (-195) + ..... + (-1) + 0 + 1 + 2 + ..... + 199 + 200 + 201 + 202 = 1000 &lt;br /&gt;3. Sum of 125 numbers starting from -54 i.e. summation of numbers from -54 to 70. &lt;br /&gt;(-54) + (-53) + (-52) + ..... + (-1) + 0 + 1 + 2 + ..... + 68 + 69 + 70 = 1000 &lt;br /&gt;4. Sum of 80 numbers starting from -27 i.e. summation of numbers from -27 to 52. &lt;br /&gt;(-27) + (-26) + (-25) + ..... + (-1) + 0 + 1 + 2 + ..... + 50 + 51 + 52 = 1000 &lt;br /&gt;5. Sum of 25 numbers starting from 28 i.e. summation of numbers from 28 to 52. &lt;br /&gt;28 + 29 + 30 + 31 + 32 + 33 + 34 + 35 + 36 + 37 + 38 + 39 + 40 + 41 + 42 + 43 + 44 + 45 + 46 + 47 + 48 + 49 + 50 + 51 + 52 = 1000 &lt;br /&gt;6. Sum of 16 numbers starting from 55 i.e. summation of numbers from 55 to 70. &lt;br /&gt;55 + 56 + 57 + 58 + 59 +60 + 61 + 62 + 63 + 64 + 65 + 66 + 67 + 68 + 69 + 70 = 1000 &lt;br /&gt;7. Sum of 5 numbers starting from 198 i.e. summation of numbers from 198 to 202. &lt;br /&gt;198 + 199 + 200 +201 + 202 = 1000 &lt;br /&gt;8. Sum of 1 number starting from 1000. &lt;br /&gt;1000 = 1000 &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;There is a 4-character code, with 2 of them being letters and the other 2 being numbers. &lt;br /&gt;&lt;br /&gt;How many maximum attempts would be necessary to find the correct code? Note that the code is case-sensitive.&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The maximum number of attempts required are 16,22,400 &lt;br /&gt;&lt;br /&gt;There are 52 possible letters - a to z and A to Z, and 10 possible numbers - 0 to 9. Now, 4 characters - 2 letters and 2 numbers, can be selected in 52*52*10*10 ways. These 4 characters can be arranged in 4C2 i.e. 6 different ways - the number of unique patterns that can be formed by lining up 4 objects of which 2 are distinguished one way (i.e. they must be letters) and the other 2 are distinguished another way (i.e. they must be numbers). &lt;br /&gt;&lt;br /&gt;Consider an example : Let's assume that @ represents letter and # represents number. the 6 possible ways of arranging them are : @@##, @#@#, @##@, #@@#, #@#@, ##@@ &lt;br /&gt;&lt;br /&gt;Hence, the required answer is &lt;br /&gt;= 52*52*10*10*6 &lt;br /&gt;= 16,22,400 attempts &lt;br /&gt;= 1.6 million approx. &lt;br /&gt;&lt;br /&gt;Thanks to Tim Sanders for opening BrainVista's brain !!!&lt;br /&gt;How many possible combinations are there in a 3x3x3 rubics cube? &lt;br /&gt;&lt;br /&gt;In other words, if you wanted to solve the rubics cube by trying different combinations, how many might it take you (worst case senerio)? &lt;br /&gt;&lt;br /&gt;How many for a 4x4x4 cube?&lt;br /&gt;Submitted&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;There are 4.3252 * 10^19 possible combinations for 3x3x3 Rubics and 7.4012 * 10^45 possible combinations for 4x4x4 Rubics. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Let's consider 3x3x3 Rubics first. &lt;br /&gt;&lt;br /&gt;There are 8 corner cubes, which can be arranged in 8! ways. &lt;br /&gt;Each of these 8 cubes can be turned in 3 different directions, so there are 3^8 orientations altogether. But if you get all but one of the corner cube into chosen positions and orientations, only one of 3 orientations of the final corner cube is possible. Thus, total ways corner cubes can be placed = (8!) * (3^8)/8 = (8!) * (3^7) &lt;br /&gt;&lt;br /&gt;Similarly, 12 edge cubes can be arranged in 12! ways. &lt;br /&gt;Each of these 12 cubes can be turned in 2 different directions, so there are 2^12 orientations altogether. But if you get all but one of the edge cube into chosen positions and orientations, only one of 2 orientations of the final edge cube is possible. Thus, total ways edge cubes can be placed = (12!) * (2^12)/2 = (12!) * (2^11) &lt;br /&gt;&lt;br /&gt;Here, we have essentially pulled the cubes apart and stuck cubes back in place wherever we please. In reality, we can only move cubes around by turning the faces of the cubes. It turns out that you can't turn the faces in such a way as to switch the positions of two cubes while returning all the others to their original positions. Thus if you get all but two cubes in place, there is only one attainable choice for them (not 2!). Hence, we must divide by 2. &lt;br /&gt;&lt;br /&gt;Total different possible combinations are &lt;br /&gt;= [(8!) * (3^7)] * [(12!) * (2^11)] / 2 &lt;br /&gt;= (8!) * (3^7) * (12!) * (2^10) &lt;br /&gt;= 4.3252 * 10^19 &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Similarly, for 4x4x4 Rubics total different possible combinations are &lt;br /&gt;= [(8!) * (3^7)] * [(24!)] * [(24!) / (4!^6)] / 24 &lt;br /&gt;= 7.4011968 * 10^45 &lt;br /&gt;&lt;br /&gt;Note that there are 24 edge cubes, which you can not turn in 2 orientations (hence no 2^24 / 2). Also, there are 4 center cubes per face i.e. (24!) / (4!^6). You can switch 2 cubes without affecting the rest of the combination as 4*4*4 has even dimensions (hence no division by 2). But pattern on one side is rotated in 4 directions over 6 faces, hence divide by 24.&lt;br /&gt;Substitute digits for the letters to make the following relation true.&lt;br /&gt;               N  E  V  E  R&lt;br /&gt;&lt;br /&gt;               L  E  A  V  E&lt;br /&gt;&lt;br /&gt;            +           M  E&lt;br /&gt;&lt;br /&gt;            -----------------&lt;br /&gt;&lt;br /&gt;               A  L  O  N  E&lt;br /&gt;Note that the leftmost letter can't be zero in any word. Also, there must be a one-to-one mapping between digits and letters. e.g. if you substitute 3 for the letter M, no other letter can be 3 and all other M in the puzzle must be 3.&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;A tough one!!! &lt;br /&gt;&lt;br /&gt;Since R + E + E = 10 + E, it is clear that R + E = 10 and neither R nor E is equal to 0 or 5. This is the only entry point to &lt;br /&gt;&lt;br /&gt;solve it. Now use trial-n-error method.&lt;br /&gt;&lt;br /&gt;     N  E  V  E  R               2  1  4  1  9&lt;br /&gt;&lt;br /&gt;     L  E  A  V  E               3  1  5  4  1&lt;br /&gt;&lt;br /&gt;  +           M  E            +           6  1&lt;br /&gt;&lt;br /&gt;  -----------------           -----------------&lt;br /&gt;&lt;br /&gt;     A  L  O  N  E               5  3  0  2  1&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;One of the four people - Mr. Clinton, his wife Monika, their son Mandy and their daughter Cindy - is a singer and another is a dancer. Mr. Clinton is older than his wife and Mady is older than his sister. &lt;br /&gt;1. If the singer and the dancer are the same sex, then the dancer is older than the singer. &lt;br /&gt;2. If neither the singer nor the dancer is the parent of the other, then the singer is older than the dancer. &lt;br /&gt;3. If the singer is a man, then the singer and the dancer are the same age. &lt;br /&gt;4. If the singer and the dancer are of opposite sex then the man is older than the woman. &lt;br /&gt;5. If the dancer is a woman, then the dancer is older than the singer.&lt;br /&gt;Whose occupation do you know? And what is his/her occupation?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Cindy is the Singer. Mr. Clinton or Monika is the Dancer. &lt;br /&gt;&lt;br /&gt;From (1) and (3), the singer and the dancer, both can not be a man. From (3) and (4), if the singer is a man, then the dancer must be a man. Hence, the singer must be a woman. &lt;br /&gt;&lt;br /&gt;CASE I : Singer is a woman and Dancer is also a woman &lt;br /&gt;Then, the dancer is Monika and the singer is Cindy. &lt;br /&gt;&lt;br /&gt;CASE II : Singer is a woman and Dancer is also a man &lt;br /&gt;Then, the dancer is Mr. Clinton and the singer is Cindy. &lt;br /&gt;&lt;br /&gt;In both the cases, we know that Cindy is the Singer. And either Mr. Clinton or Monika is the Dancer.&lt;br /&gt;There are 20 people in your applicant pool, including 5 pairs of identical twins. &lt;br /&gt;&lt;br /&gt;If you hire 5 people randomly, what are the chances you will hire at least 1 pair of identical twins? (Needless to say, this could cause trouble ;))&lt;br /&gt;Submitted&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The probability to hire 5 people with at least 1 pair of identical twins is 25.28% &lt;br /&gt;&lt;br /&gt;5 people from the 20 people can be hired in 20C5 = 15504 ways. &lt;br /&gt;&lt;br /&gt;Now, divide 20 people into two groups of 10 people each : &lt;br /&gt;G1 - with all twins &lt;br /&gt;G2 - with all people other than twins &lt;br /&gt;&lt;br /&gt;Let's find out all possible ways to hire 5 people without a single pair of indentical twins. &lt;br /&gt;People from G1 People from G2 No of ways to hire G1 without a single pair of indentical twins No of ways to hire G2 Total ways&lt;br /&gt;0 5 10C0 10C5 252&lt;br /&gt;1 4 10C1 10C4 2100&lt;br /&gt;2 3 10C2 * 8/9 10C3 4800&lt;br /&gt;3 2 10C3 * 8/9 * 6/8 10C2 3600&lt;br /&gt;4 1 10C4 * 8/9 * 6/8 * 4/7 10C1 800&lt;br /&gt;5 0 10C5 * 8/9 * 6/8 * 4/7 * 2/6 10C0 32&lt;br /&gt;Total 11584&lt;br /&gt;&lt;br /&gt;Thus, total possible ways to hire 5 people without a single pair of indentical twins = 11584 ways &lt;br /&gt;&lt;br /&gt;So, total possible ways to hire 5 people with at least a single pair of indentical twins = 15504 - 11584 = 3920 ways &lt;br /&gt;&lt;br /&gt;Hence, the probability to hire 5 people with at least a single pair of indentical twins &lt;br /&gt;= 3920/15504 &lt;br /&gt;= 245/969 &lt;br /&gt;= 0.2528 &lt;br /&gt;= 25.28%&lt;br /&gt;In a hotel, rooms are numbered from 101 to 550. A room is chosen at random. What is the probability that room number starts with 1, 2 or 3 and ends with 4, 5 or 6?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;There are total 450 rooms. &lt;br /&gt;&lt;br /&gt;Out of which 299 room number starts with either 1, 2 or 3. (as room number 100 is not there) Now out of those 299 rooms only 90 room numbers end with 4, 5 or 6 &lt;br /&gt;&lt;br /&gt;So the probability is 90/450 i.e. 1/5 or 0.20&lt;br /&gt;Draw 9 dots on a page, in the shape of three rows of three dots to form a square. Now place your pen on the page, draw 4 straight lines and try and cover all the dots. &lt;br /&gt;&lt;br /&gt;You're not allowed to lift your pen. &lt;br /&gt;&lt;br /&gt;Note: Don't be confined by the dimensions of the square.&lt;br /&gt;Submitted&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;There are 3 persons X, Y and Z. On some day, X lent tractors to Y and Z as many as they had. After a month Y gave as many tractors to X and Z as many as they have. After a month Z did the same thing. At the end of this transaction each one of them had 24. &lt;br /&gt;&lt;br /&gt;Find the tractors each originally had? &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;One way to solve it is by making 3 equations and solve them simultaneously. But there is rather easier way to solve it using Backtracing. &lt;br /&gt;&lt;br /&gt;It's given that at the end, each had 24 tractors (24, 24, 24) i.e. after Z gave tractors to X &amp; Y as many as they had. It means that after getting tractors from Z their tractors got doubled. So before Z gave them tractors, they had 12 tractors each and Z had 48 tractors. (12, 12, 48) &lt;br /&gt;&lt;br /&gt;Similarly, before Y gave tractors to X &amp; Z, they had 6 &amp; 24 tractors respectively and Y had 42 tractors i.e. (6, 42, 24) &lt;br /&gt;&lt;br /&gt;Again, before X gave tractors to Y &amp; Z, they had 21 &amp; 12 tractors respectively and X had 39 tractors i.e. (39, 21, 12) &lt;br /&gt;&lt;br /&gt;Hence, initially X had 39 tractors, Y had 21 tractors and Z had 12 tractors.&lt;br /&gt;&lt;br /&gt;There is a 50m long army platoon marching ahead. The last person in the platoon wants to give a letter to the first person leading the platoon. So while the platoon is marching he runs ahead, reaches the first person and hands over the letter to him and without stopping he runs and comes back to his original position. &lt;br /&gt;&lt;br /&gt;In the mean time the whole platoon has moved ahead by 50m. &lt;br /&gt;&lt;br /&gt;The question is how much distance did the last person cover in that time. Assuming that he ran the whole distance with uniform speed.&lt;br /&gt;Submitted&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The last person covered 120.71 meters. &lt;br /&gt;&lt;br /&gt;It is given that the platoon and the last person moved with uniform speed. Also, they both moved for the identical amount of time. Hence, the ratio of the distance they covered - while person moving forward and backword - are equal. &lt;br /&gt;&lt;br /&gt;Let's assume that when the last person reached the first person, the platoon moved X meters forward. &lt;br /&gt;&lt;br /&gt;Thus, while moving forward the last person moved (50+X) meters whereas the platoon moved X meters. &lt;br /&gt;&lt;br /&gt;Similarly, while moving back the last person moved [50-(50-X)] X meters whereas the platoon moved (50-X) meters. &lt;br /&gt;&lt;br /&gt;Now, as the ratios are equal, &lt;br /&gt;(50+X)/X = X/(50-X) &lt;br /&gt;(50+X)*(50-X) = X*X &lt;br /&gt;&lt;br /&gt;Solving, X=35.355 meters &lt;br /&gt;&lt;br /&gt;Thus, total distance covered by the last person &lt;br /&gt;= (50+X) + X &lt;br /&gt;= 2*X + 50 &lt;br /&gt;= 2*(35.355) + 50 &lt;br /&gt;= 120.71 meters &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Note that at first glance, one might think that the total distance covered by the last person is 100 meters, as he ran the total lenght of the platoon (50 meters) twice. TRUE, but that's the relative distance covered by the last person i.e. assuming that the platoon is stationary.&lt;br /&gt;Assume that you have enough coins of 1, 5, 10, 25 and 50 cents. &lt;br /&gt;&lt;br /&gt;How many ways are there to make change for a dollar? Do explain your answer.&lt;br /&gt;&lt;br /&gt; &lt;br /&gt;&lt;br /&gt;There are 292 ways to make change for a dollar using coins of 1, 5, 10, 25 and 50 cents. &lt;br /&gt;&lt;br /&gt;Let's generalised the teaser and make a table as shown above. &lt;br /&gt;&lt;br /&gt;If you wish to make change for 75 cents using only 1, 5, 10 and 25 cent coins, go to the .25 row and the 75 column to obtain 121 ways to do this. &lt;br /&gt;&lt;br /&gt;The table can be created from left-to-right and top-to-bottom. Start with the top left i.e. 1 cent row. There is exactly one way to make change for every amount. Then calculate the 5 cents row by adding the number of ways to make change for the amount using 1 cent coins plus the number of ways to make change for 5 cents less using 1 and 5 cent coins. &lt;br /&gt;&lt;br /&gt;Let's take an example: &lt;br /&gt;To get change for 50 cents using 1, 5 and 10 cent coins. &lt;br /&gt;* 50 cents change using 1 and 5 cent coins = 11 ways &lt;br /&gt;* (50-10) 40 cents change using 1, 5 and 10 cent coins = 25 ways &lt;br /&gt;* 50 cents change using 1, 5 and 10 cent coins = 11+25 = 36 ways &lt;br /&gt;&lt;br /&gt;Let's take another example: &lt;br /&gt;To get change for 75 cents using all coins up to 50 cent i.e. 1, 5, 10, 25 and 50 cents coins. &lt;br /&gt;* 75 cents change using coins upto 25 cent = 121 ways &lt;br /&gt;* (75-50) 25 cents change using coins upto 50 cent = 13 ways &lt;br /&gt;* 75 cents change using coins upto 50 cent = 121+13 = 134 ways &lt;br /&gt;&lt;br /&gt;For people who don't want to tease their brain and love to do computer programming, there is a simple way. Write a small multi-loop program to solve the equation: A + 5B + 10C + 25D + 50E = 100 &lt;br /&gt;where, &lt;br /&gt;A = 0 to 100 &lt;br /&gt;B = 0 to 20 &lt;br /&gt;C = 0 to 10 &lt;br /&gt;D = 0 to 4 &lt;br /&gt;E = 0 to 2 &lt;br /&gt;&lt;br /&gt;The program should output all the possible values of A, B, C, D and E for which the equation is satisfied.&lt;br /&gt;&lt;br /&gt;In a Road Race, one of the three bikers was doing 15km less than the first and 3km more than the third. He also finished the race 12 minutes after the first and 3 minutes before the third. &lt;br /&gt;&lt;br /&gt;Can you find out the speed of each biker, the time taken by each biker to finish the race and the length of the course? &lt;br /&gt;&lt;br /&gt;Assume that there were no stops in the race and also they were driving with constant speeds through out the&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt; &lt;br /&gt;&lt;br /&gt;Let us assume that &lt;br /&gt;Speed of First biker = V1 km/min &lt;br /&gt;Speed of Second biker = V2 km/min &lt;br /&gt;Speed of Third biker = V3 km/min &lt;br /&gt;Total time take by first biker = T1 min &lt;br /&gt;Total distance = S km &lt;br /&gt;&lt;br /&gt;Now as per the data given in the teaser, at a time T min&lt;br /&gt;   X1 = V1 * T         ----&gt; 1&lt;br /&gt;&lt;br /&gt;   X1 - 15 = V2 * T    ----&gt; 2&lt;br /&gt;&lt;br /&gt;   X1 - 18 = V3 * T    ----&gt; 3&lt;br /&gt;&lt;br /&gt;At a Distance S Km.&lt;br /&gt;   S = V1 * T1         ----&gt; 4&lt;br /&gt;&lt;br /&gt;   S = V2 * (T1 + 12)  ----&gt; 5&lt;br /&gt;&lt;br /&gt;   S = V3 * (T1 + 15)  ----&gt; 6&lt;br /&gt;&lt;br /&gt;Thus there are 6 equations and 7 unknown data that means it has infinite number of solutions. &lt;br /&gt;&lt;br /&gt;By solving above 6 equations we get, &lt;br /&gt;Time taken by first biker, T1 = 60 Min. &lt;br /&gt;Time taken by Second biker, T2 = 72 Min. &lt;br /&gt;Time taken by first biker, T3 = 75 Min. &lt;br /&gt;&lt;br /&gt;Also, we get &lt;br /&gt;Speed of first biker, V1 = 90/T km/min &lt;br /&gt;Speed of second biker, V2 = (5/6)V1 = 75/T km/min &lt;br /&gt;Speed of third biker, V3 = (4/5)V1 = 72/T km/min &lt;br /&gt;&lt;br /&gt;Also, the length of the course, S = 5400/T km &lt;br /&gt;&lt;br /&gt;Thus, for the data given, only the time taken by each biker can be found i.e. 60, 72 and 75 minutes. For other quantities, one more independent datum is required i.e. either T or V1 or V2 or V3 &lt;br /&gt;&lt;br /&gt;Thanks to Theertham Srinivas for the answer !!!&lt;br /&gt;What is the four-digit number in which the first digit is 1/3 of the second, the third is the sum of the first and second, and the last is three times the second?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The 4 digit number is 1349. &lt;br /&gt;&lt;br /&gt;It is given that the first digit is 1/3 of the second. There are 3 such possibilities. &lt;br /&gt;1. 1 and 3 &lt;br /&gt;2. 2 and 6 &lt;br /&gt;3. 3 and 9 &lt;br /&gt;Now, the third digit is the sum of the first and second digits. &lt;br /&gt;1. 1 + 3 = 4 &lt;br /&gt;2. 2 + 6 = 8 &lt;br /&gt;3. 3 + 9 = 12 &lt;br /&gt;It is clear that option 3 is not possible. So we are left with only two options. Also, the last digit is three times the second, which rules out the second option. Hence, the answer is 1349.&lt;br /&gt;&lt;br /&gt;Difference between Bholu's and Molu's age is 2 years and the difference between Molu's and Kolu's age is 5 years. &lt;br /&gt;&lt;br /&gt;What is the maximum possible value of the sum of the difference in their ages, taken two at a time?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The maximum possible value of the sum of the difference in their ages - taken two at a time - is 14 years. &lt;br /&gt;&lt;br /&gt;It is given that - &lt;br /&gt;"Difference between Bholu's and Molu's age is 2 years" &lt;br /&gt;"Difference between Molu's and Kolu's age is 5 years" &lt;br /&gt;&lt;br /&gt;Now, to get the maximum possible value, the difference between Bholu's and Kolu's age should be maximum i.e. Molu's age should be in between Bholu's and Kolu's age. Then, the difference between Bholu's and Kolu's age is 7 years. &lt;br /&gt;&lt;br /&gt;Hence, the maximum possible value of the sum of the difference in their ages - taken two at a time - is (2 + 5 + 7) 14 years.&lt;br /&gt;If it is given that: &lt;br /&gt;25 - 2 = 3 &lt;br /&gt;100 x 2 = 20 &lt;br /&gt;36 / 3 = 2 &lt;br /&gt;&lt;br /&gt;What is 144 - 3 = ?&lt;br /&gt;Submitted&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;There are 3 possible answers to it. &lt;br /&gt;&lt;br /&gt;Answer 1 : 9 &lt;br /&gt;Simply replace the first number by its square root. &lt;br /&gt;(25) 5 - 2 = 3 &lt;br /&gt;(100) 10 x 2 = 20 &lt;br /&gt;(36) 6 / 3 = 2 &lt;br /&gt;(144) 12 - 3 = 9 &lt;br /&gt;&lt;br /&gt;Answer 2 : 11 &lt;br /&gt;Drop the digit in the tens position from the first number. &lt;br /&gt;(2) 5 - 2 = 3 &lt;br /&gt;1 (0) 0 x 2 = 20 &lt;br /&gt;(3) 6 / 3 = 2 &lt;br /&gt;1 (4) 4 - 3 = 11 &lt;br /&gt;&lt;br /&gt;You will get the same answer on removing left and right digit alternatively from the first number i.e remove left digit from first (2), right digit from second (0), left digit from third (3) and right digit from forth (4). &lt;br /&gt;(2) 5 - 2 = 3 &lt;br /&gt;10 (0) x 2 = 20 &lt;br /&gt;(3) 6 / 3 = 2 &lt;br /&gt;14 (4) - 3 = 11 &lt;br /&gt;&lt;br /&gt;Answer 3 : 14 &lt;br /&gt;Drop left and right digit alternatively from the actual answer. &lt;br /&gt;25 - 2 = (2) 3 (drop left digit i.e. 2) &lt;br /&gt;100 * 2 = 20 (0) (drop right digit i.e. 0) &lt;br /&gt;36 / 3 = (1) 2 (drop left digit i.e. 1) &lt;br /&gt;144 - 3 = 14 (1) (drop right digit i.e. 1)&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;A 3 digit number is such that it's unit digit is equal to the product of the other two digits which are prime. Also, the difference between it's reverse and itself is 396. &lt;br /&gt;&lt;br /&gt;What is the sum of the three digits?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The required number is 236 and the sum is 11. &lt;br /&gt;&lt;br /&gt;It is given that the first two digits of the required number are prime numbers i.e. 2, 3, 5 or 7. Note that 1 is neither prime nor composite. Also, the third digit is the multiplication of the first two digits. Thus, first two digits must be either 2 or 3 i.e. 22, 23, 32 or 33 which means that there are four possible numbers - 224, 236, 326 and 339. &lt;br /&gt;&lt;br /&gt;Now, it is also given that - the difference between it's reverse and itself is 396. Only 236 satisfies this condition. Hence, the sum of the three digits is 11.&lt;br /&gt;&lt;br /&gt;There are 4 mugs placed upturned on the table. Each mug have the same number of marbles and a statement about the number of marbles in it. The statements are: Two or Three, One or Four, Three or One, One or Two. &lt;br /&gt;&lt;br /&gt;Only one of the statement is correct. How many marbles are there under each mug?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;A simple one. &lt;br /&gt;&lt;br /&gt;As it is given that only one of the four statement is correct, the correct number can not appear in more than one statement. If it appears in more than one statement, then more than one statement will be correct. &lt;br /&gt;&lt;br /&gt;Hence, there are 4 marbles under each mug.&lt;br /&gt;At University of Probability, there are 375 freshmen, 293 sophomores, 187 juniors, &amp; 126 seniors. One student will randomly be chosen to receive an award. &lt;br /&gt;&lt;br /&gt;What percent chance is there that it will be a junior? Round to the nearest whole percent&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;19% &lt;br /&gt;&lt;br /&gt;This puzzle is easy. Divide the number of juniors (187) by the total number of students (981), &amp; then multiply the number by 100 to convert to a percentage. &lt;br /&gt;&lt;br /&gt;Hence the answer is (187/981)*100 = 19%&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;If you were to dial any 7 digits on a telephone in random order, what is the probability that you will dial your own phone number? &lt;br /&gt;&lt;br /&gt;Assume that your telephone number is 7-digits.&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;1 in 10,000,000 &lt;br /&gt;&lt;br /&gt;There are 10 digits i.e. 0-9. First digit can be dialed in 10 ways. Second digit can be dialed in 10 ways. Third digit can be dialed in 10 ways. And so on..... &lt;br /&gt;&lt;br /&gt;Thus, 7-digit can be dialed in 10*10*10*10*10*10*10 (=10,000,000) ways. And, you have just one telephone number. Hence, the possibility that you will dial your own number is 1 in 10,000,000. &lt;br /&gt;&lt;br /&gt;Note that 0123456 may not be a valid 7-digit telephone number. But while dialing in random order, that is one of the possible 7-digit number which you may dial.&lt;br /&gt;An anthropologist discovers an isolated tribe whose written alphabet contains only six letters (call the letters A, B, C, D, E and F). The tribe has a taboo against using the same letter twice in the same word. It's never done. &lt;br /&gt;&lt;br /&gt;If each different sequence of letters constitues a different word in the language, what is the maximum number of six-letter words that the language can employ?&lt;br /&gt;Submitted&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The language can employ maximum of 720 six-letter words. &lt;br /&gt;&lt;br /&gt;It is a simple permutation problem of arranging 6 letters to get different six-letter words. And it can be done in in 6! ways i.e. 720 ways. &lt;br /&gt;&lt;br /&gt;In otherwords, the first letter can be any of the given 6 letters (A through F). Then, whatever the first letter is, the second letter will always be from the remaining 5 letters (as same letter can not be used twice), and the third letter always be from the remaining 4 letters, and so on. Thus, the different possible six-letter words are 6*5*4*3*2*1 = 720&lt;br /&gt;&lt;br /&gt;Kate, Demi, Madona, Sharon, Britney and Nicole decided to lunch together in a restaurant. The waiter led them to a round table with six chairs. &lt;br /&gt;&lt;br /&gt;How many different ways can they seat?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;There are 120 different possible seating arrangments. &lt;br /&gt;&lt;br /&gt;Note that on a round table ABCDEF and BCDEFA is the same. &lt;br /&gt;&lt;br /&gt;The first person can sit on any one of the seats. Now, for the second person there are 5 options, for the third person there are 4 options, for the forth person there are 3 options, for the fifth person there are 2 options and for the last person there is just one option. &lt;br /&gt;&lt;br /&gt;Thus, total different possible seating arrangements are &lt;br /&gt;= 5 * 4 * 3 * 2 * 1 &lt;br /&gt;= 120&lt;br /&gt;3 blocks are chosen randomly on a chessboard. What is the probability that they are in the same diagonal? &lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;There are total of 64 blocks on a chessboard. So 3 blocks can be chosen out of 64 in 64C3 ways. &lt;br /&gt;So the sample space is = 41664 &lt;br /&gt;&lt;br /&gt;There are 2 diagonal on chessboard each one having 8 blocks. Consider one of them. &lt;br /&gt;3 blocks out of 8 blocks in diagonal can be chosen in 8C3 ways. &lt;br /&gt;But there are 2 such diagonals, hence favourables = 2 * 8C3 = 2 * 56 = 112 &lt;br /&gt;&lt;br /&gt;The require probability is &lt;br /&gt;= 112 / 41664 &lt;br /&gt;= 1 / 372 &lt;br /&gt;= 0.002688&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;What is the area of the triangle ABC with A(e,p) B(2e,3p) and C(3e,5p)? &lt;br /&gt;&lt;br /&gt;where p = PI (3.141592654) &lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;A tricky ONE. &lt;br /&gt;&lt;br /&gt;Given 3 points are colinear. Hence, it is a straight line. &lt;br /&gt;&lt;br /&gt;Hence area of triangle is 0.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Silu and Meenu were walking on the road. &lt;br /&gt;&lt;br /&gt;Silu said, "I weigh 51 Kgs. How much do you weigh?" &lt;br /&gt;&lt;br /&gt;Meenu replied that she wouldn't reveal her weight directly as she is overweight. But she said, "I weigh 29 Kgs plus half of my weight." &lt;br /&gt;&lt;br /&gt;How much does Meenu weigh?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Meenu weighs 58 Kgs. &lt;br /&gt;&lt;br /&gt;It is given that Meenu weighs 29 Kgs plus half of her own weight. It means that 29 Kgs is the other half. So she weighs 58 Kgs. &lt;br /&gt;&lt;br /&gt;Solving mathematically, let's assume that her weight is X Kgs. &lt;br /&gt;X = 29 + X/2 &lt;br /&gt;2*X = 58 + X &lt;br /&gt;X = 58 Kgs&lt;br /&gt;Consider the sum: ABC + DEF + GHI = JJJ &lt;br /&gt;&lt;br /&gt;If different letters represent different digits, and there are no leading zeros, what does J represent? &lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The value of J must be 9. &lt;br /&gt;&lt;br /&gt;Since there are no leading zeros, J must be 7, 8, or 9. (JJJ = ABC + DEF + GHI = 14? + 25? + 36? = 7??) &lt;br /&gt;&lt;br /&gt;Now, the remainder left after dividing any number by 9 is the same as the remainder left after dividing the sum of the digits of that number by 9. Also, note that 0 + 1 + ... + 9 has a remainder of 0 after dividing by 9 and JJJ has a remainder of 0, 3, or 6. &lt;br /&gt;&lt;br /&gt;The number 9 is the only number from 7, 8 and 9 that leaves a remainder of 0, 3, or 6 if you remove it from the sum 0 + 1 + ... + 9. Hence, it follows that J must be 9.&lt;br /&gt;A man has Ten Horses and nine stables as shown here.&lt;br /&gt;  [] [] [] [] [] [] [] [] []&lt;br /&gt;The man wants to fit Ten Horses into nine stables. How can he fit Ten horses into nine stables?&lt;br /&gt;Submitted&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The answer is simple. It says the man wants to fit "Ten Horses" into nine stables. There are nine letters in the phrase "Ten Horses". So you can put one letter each in all nine stables.&lt;br /&gt;  [T] [E] [N] [H] [O] [R] [S] [E] [S]&lt;br /&gt;&lt;br /&gt;A man is at a river with a 9 gallon bucket and a 4 gallon bucket. He needs exactly 6 gallons of water. &lt;br /&gt;&lt;br /&gt;How can he use both buckets to get exactly 6 gallons of water? &lt;br /&gt;&lt;br /&gt;Note that he cannot estimate by dumping some of the water out of the 9 gallon bucket or the 4 gallon bucket&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;For the sack of explanation, let's identify 4 gallon bucket as Bucket P and 9 gallon bucket as Bucket Q. &lt;br /&gt;&lt;br /&gt;Operation 4 gallon bucket&lt;br /&gt;(Bucket P) 9 gallon bucket&lt;br /&gt;(Bucket Q)&lt;br /&gt;Initially 0 0&lt;br /&gt;Fill the bucket Q with 9 gallon water 0 9&lt;br /&gt;Pour 4 gallon water from bucket Q to bucket P 4 5&lt;br /&gt;Empty bucket P 0 5&lt;br /&gt;Pour 4 gallon water from bucket Q to bucket P 4 1&lt;br /&gt;Empty bucket P 0 1&lt;br /&gt;Pour 1 gallon water from bucket Q to bucket P 1 0&lt;br /&gt;Fill the bucket Q with 9 gallon water 1 9&lt;br /&gt;Pour 3 gallon water from bucket Q to bucket P 4 6&lt;br /&gt;&lt;br /&gt;9 gallon bucket contains 6 gallon of water, as required.&lt;br /&gt;&lt;br /&gt;Each of the five characters in the word BRAIN has a different value between 0 and 9. Using the given grid, can you find out the value of each character?&lt;br /&gt;        B   R   A   I   N   31&lt;br /&gt;&lt;br /&gt;        B   B   R   B   A   31&lt;br /&gt;&lt;br /&gt;        N   I   A   B   B   32&lt;br /&gt;&lt;br /&gt;        N   I   B   A   I   30&lt;br /&gt;&lt;br /&gt;        I   R   A   A   A   23&lt;br /&gt;&lt;br /&gt;       37  29  25  27  29&lt;br /&gt;The numbers on the extreme right represent the sum of the values represented by the characters in that row. Also, the numbers on the last raw represent the sum of the values represented by the characters in that column. e.g. B + R + A + I + N = 31 (from first row)&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;B=7, R=6, A=4, I=5 and N=9 &lt;br /&gt;&lt;br /&gt;Make total 10 equations - 5 for rows and 5 for columns - and sovle them. &lt;br /&gt;&lt;br /&gt;From Row3 and Row4, &lt;br /&gt;N + I + A + B + B = N + I + B + A + I + 2 &lt;br /&gt;B = I + 2 &lt;br /&gt;&lt;br /&gt;From Row1 and Row3, &lt;br /&gt;B + R + A + I + N = N + I + A + B + B - 1 &lt;br /&gt;R = B - 1 &lt;br /&gt;&lt;br /&gt;From Column2, &lt;br /&gt;R + B + I + I + R = 29 &lt;br /&gt;B + 2R + 2I = 29 &lt;br /&gt;B + 2(B - 1) + 2I = 29 &lt;br /&gt;3B + 2I = 31 &lt;br /&gt;3(I + 2) + 2I = 31 &lt;br /&gt;5I = 25 &lt;br /&gt;I = 5 &lt;br /&gt;&lt;br /&gt;Hence, B=7 and R=6 &lt;br /&gt;&lt;br /&gt;From Row2, &lt;br /&gt;B + B + R + B + A = 31 &lt;br /&gt;3B + R + A = 31 &lt;br /&gt;3(7) + 6 + A = 31 &lt;br /&gt;A = 4 &lt;br /&gt;&lt;br /&gt;From Row1, &lt;br /&gt;B + R + A + I + N = 31 &lt;br /&gt;7 + 6 + 4 + 5 + N = 31 &lt;br /&gt;N = 9 &lt;br /&gt;&lt;br /&gt;Thus, B=7, R=6, A=4, I=5 and N=9&lt;br /&gt;&lt;br /&gt;Submit&lt;br /&gt;Answer&lt;br /&gt; &lt;br /&gt;Users&lt;br /&gt;Answer (24)&lt;br /&gt; &lt;br /&gt;BrainV&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;There are 9 coins. Out of which one is odd one i.e weight is less or more. How many iterations of weighing are required to find odd coin?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;It is always possible to find odd coin in 3 weighings and to tell whether the odd coin is heavier or lighter. &lt;br /&gt;1. Take 8 coins and weigh 4 against 4. &lt;br /&gt;o If both are not equal, goto step 2 &lt;br /&gt;o If both are equal, goto step 3 &lt;br /&gt;&lt;br /&gt;2. One of these 8 coins is the odd one. Name the coins on heavier side of the scale as H1, H2, H3 and H4. Similarly, name the coins on the lighter side of the scale as L1, L2, L3 and L4. Either one of H's is heavier or one of L's is lighter. Weigh (H1, H2, L1) against (H3, H4, X) where X is one coin remaining in intial weighing. &lt;br /&gt;o If both are equal, one of L2, L3, L4 is lighter. Weigh L2 against L3. &lt;br /&gt; If both are equal, L4 is the odd coin and is lighter. &lt;br /&gt; If L2 is light, L2 is the odd coin and is lighter. &lt;br /&gt; If L3 is light, L3 is the odd coin and is lighter. &lt;br /&gt;&lt;br /&gt;o If (H1, H2, L1) is heavier side on the scale, either H1 or H2 is heavier. Weight H1 against H2 &lt;br /&gt; If both are equal, there is some error. &lt;br /&gt; If H1 is heavy, H1 is the odd coin and is heavier. &lt;br /&gt; If H2 is heavy, H2 is the odd coin and is heavier. &lt;br /&gt;&lt;br /&gt;o If (H3, H4, X) is heavier side on the scale, either H3 or H4 is heavier or L1 is lighter. Weight H3 against H4 &lt;br /&gt; If both are equal, L1 is the odd coin and is lighter. &lt;br /&gt; If H3 is heavy, H3 is the odd coin and is heavier. &lt;br /&gt; If H4 is heavy, H4 is the odd coin and is heavier. &lt;br /&gt;&lt;br /&gt;3. The remaining coin X is the odd one. Weigh X against the anyone coin used in initial weighing. &lt;br /&gt;o If both are equal, there is some error. &lt;br /&gt;o If X is heavy, X is the odd coin and is heavier. &lt;br /&gt;o If X is light, X is the odd coin and is lighter. &lt;br /&gt;In a sports contest there were m medals awarded on n successive days (n &gt; 1). &lt;br /&gt;1. On the first day 1 medal and 1/7 of the remaining m - 1 medals were awarded. &lt;br /&gt;2. On the second day 2 medals and 1/7 of the now remaining medals was awarded; and so on. &lt;br /&gt;3. On the nth and last day, the remaining n medals were awarded.&lt;br /&gt;How many days did the contest last, and how many medals were awarded altogether?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Total 36 medals were awarded and the contest was for 6 days. &lt;br /&gt;&lt;br /&gt;On day 1: Medals awarded = (1 + 35/7) = 6 : Remaining 30 medals &lt;br /&gt;On day 2: Medals awarded = (2 + 28/7) = 6 : Remaining 24 medals &lt;br /&gt;On day 3: Medals awarded = (3 + 21/7) = 6 : Remaining 18 medals &lt;br /&gt;On day 4: Medals awarded = (4 + 14/7) = 6 : Remaining 12 medals &lt;br /&gt;On day 5: Medals awarded = (5 +7/7) = 6 : Remaining 6 medals &lt;br /&gt;On day 6: Medals awarded 6 &lt;br /&gt;&lt;br /&gt;I got this answer by writing small program. If anyone know any other simpler method, do submit it.&lt;br /&gt;&lt;br /&gt;A number of 9 digits has the following properties: &lt;br /&gt;• The number comprising the leftmost two digits is divisible by 2, that comprising the leftmost three digits is divisible by 3, the leftmost four by 4, the leftmost five by 5, and so on for the nine digits of the number i.e. the number formed from the first n digits is divisible by n, 2&lt;=n&lt;=9. &lt;br /&gt;• Each digit in the number is different i.e. no digits are repeated. &lt;br /&gt;• The digit 0 does not occur in the number i.e. it is comprised only of the digits 1-9 in some order.&lt;br /&gt;Find the number.&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The answer is 381654729 &lt;br /&gt;&lt;br /&gt;One way to solve it is Trial-&amp;-Error. You can make it bit easier as odd positions will always occupy ODD numbers and even positions will always occupy EVEN numbers. Further 5th position will contain 5 as 0 does not occur. &lt;br /&gt;&lt;br /&gt;The other way to solve this problem is by writing a computer program that systematically tries all possibilities.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;1/3 rd of the contents of a container evaporated on the 1st day. 3/4th of the remaining contents of the container evaporated on the second day. &lt;br /&gt;&lt;br /&gt;What part of the contents of the container is left at the end of the second day?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Assume that contents of the container is X &lt;br /&gt;&lt;br /&gt;On the first day 1/3rd is evaporated. &lt;br /&gt;(1 - 1/3) of X is remaining i.e. (2/3)X &lt;br /&gt;&lt;br /&gt;On the Second day 3/4th is evaporated. Hence, &lt;br /&gt;(1- 3/4) of (2/3)X is remaining &lt;br /&gt;i.e. (1/4)(2/3)X = (1/6) X &lt;br /&gt;&lt;br /&gt;Hence 1/6th of the contents of the container is remaining&lt;br /&gt;&lt;br /&gt;There are four people in a room (not including you). Exactly two of these four always tell the truth. The other two always lie. &lt;br /&gt;&lt;br /&gt;You have to figure out who is who IN ONLY 2 QUESTIONS. Your questions have to be YES or NO questions and can only be answered by one person. (If you ask the same question to two different people then that counts as two questions). Keep in mind that all four know each other's characteristics whether they lie or not. &lt;br /&gt;&lt;br /&gt;What questions would you ask to figure out who is who? Remember that you can ask only 2 questions.&lt;br /&gt;Submitted&lt;br /&gt;You have 3 baskets, &amp; each one contains exactly 4 balls, each of which is of the same size. Each ball is either red, black, white, or purple, &amp; there is one of each color in each basket. &lt;br /&gt;&lt;br /&gt;If you were blindfolded, &amp; lightly shook each basket so that the balls would be randomly distributed, &amp; then took 1 ball from each basket, what chance is there that you would have exactly 2 red balls?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;There are 64 different possible outcomes, &amp; in 9 of these, exactly 2 of the balls will be red. There is thus a slightly better than 14% chance [(9/64)*100] that exactly 2 balls will be red. &lt;br /&gt;&lt;br /&gt;A much faster way to solve the problem is to look at it this way. There are 3 scenarios where exactly 3 balls are red: &lt;br /&gt;&lt;br /&gt;  1   2   3 &lt;br /&gt;&lt;br /&gt; -----------&lt;br /&gt;&lt;br /&gt;  R   R   X &lt;br /&gt;&lt;br /&gt;  R   X   R &lt;br /&gt;&lt;br /&gt;  X   R   R &lt;br /&gt;&lt;br /&gt;X is any ball that is not red.&lt;br /&gt;There is a 4.6875% chance that each of these situations will occur. &lt;br /&gt;&lt;br /&gt;Take the first one, for example: 25% chance the first ball is red, multiplied by a 25% chance the second ball is red, multiplied by a 75% chance the third ball is not red. &lt;br /&gt;&lt;br /&gt;Because there are 3 scenarios where this outcome occurs, you multiply the 4.6875% chance of any one occurring by 3, &amp; you get 14.0625%&lt;br /&gt;&lt;br /&gt;Consider a state lottery where you get to choose 8 numbers from 1 to 80, no repetiton allowed. The Lottery Commission chooses 11 from those 80 numbers, again no repetition. You win the lottery if atleast 7 of your numbers are there in the 11 chosen by the Lottery Commission. &lt;br /&gt;&lt;br /&gt;What is the probablity of winning the lottery?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The probability of winning the lottery is two in one billion i.e. only two person can win from one billion !!! &lt;br /&gt;&lt;br /&gt;Let's find out sample space first. The Lottery Commission chooses 11 numbers from the 80. Hence, the 11 numbers from the 80 can be selected in 80C11 ways which is very very high and is equal to 1.04776 * 1013 &lt;br /&gt;&lt;br /&gt;Now, you have to select 8 numbers from 80 which can be selected in 80C8 ways. But we are interested in only those numbers which are in 11 numbers selected by the Lottery Commision. There are 2 cases. &lt;br /&gt;• You might select 8 numbers which all are there in 11 numbers choosen by the Lottery Commission. So there are 11C8 ways. &lt;br /&gt;• Another case is you might select 7 lucky numbers and 1 non-lucky number from the remaining 69 numbers. There are ( 11C7 ) * ( 69C1 ) ways to do that. &lt;br /&gt;So total lucky ways are &lt;br /&gt;= ( 11C8 ) + ( 11C7 ) * ( 69C1 ) &lt;br /&gt;= (165) + (330) * (69) &lt;br /&gt;= 165 + 22770 &lt;br /&gt;= 22935 &lt;br /&gt;&lt;br /&gt;Hence, the probability of the winning lottery is &lt;br /&gt;= (Total lucky ways) / (Total Sample space) &lt;br /&gt;= (22935) / ( 1.04776 * 1013) &lt;br /&gt;= 2.1889 * 10-9 &lt;br /&gt;i.e. 2 in a billion.&lt;br /&gt;&lt;br /&gt;Submit&lt;br /&gt;Answer&lt;br /&gt; &lt;br /&gt;Users&lt;br /&gt;Answer (4)&lt;br /&gt; &lt;br /&gt;BrainVista&lt;br /&gt;Answer&lt;br /&gt; &lt;br /&gt;Puzzle &lt;br /&gt;&lt;br /&gt;To move a Safe, two cylindrical steel bars 7 inches in diameter are used as rollers. &lt;br /&gt;&lt;br /&gt;How far will the safe have moved forward when the rollers have made one revolution?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The safe must have moved 22 inches forward. &lt;br /&gt;&lt;br /&gt;If the rollers make one revolution, the safe will move the distance equal to the circumference of the roller. Hence, the distance covered by the safe is &lt;br /&gt;= PI * Diameter (or 2 * PI * Radius) &lt;br /&gt;= PI * 7 &lt;br /&gt;= 3.14159265 * 7 &lt;br /&gt;= 21.99115 &lt;br /&gt;= 22 inches approx.&lt;br /&gt;SubmittIf a rook and a bishop of a standard chess set are randomly placed on a chessboard, what is the probability that one is attacking the other? &lt;br /&gt;&lt;br /&gt;Note that both are different colored pieces.&lt;br /&gt;SubmAnswer&lt;br /&gt;&lt;br /&gt;The probability of either the Rook or the Bishop attacking the other is 0.3611 &lt;br /&gt;&lt;br /&gt;A Rook and a Bishop on a standard chess-board can be arranged in 64P2 = 64*63 = 4032 ways &lt;br /&gt;&lt;br /&gt;Now, there are 2 cases - Rook attacking Bishop and Bishop attacking Rook. Note that the Rook and the Bishop never attack each other simultaneously. Let's consider both the cases one by one. &lt;br /&gt;&lt;br /&gt;Case I - Rook attacking Bishop &lt;br /&gt;The Rook can be placed in any of the given 64 positions and it always attacks 14 positions. Hence, total possible ways of the Rook attacking the Bishop = 64*14 = 896 ways &lt;br /&gt;&lt;br /&gt;Case II - Bishop attacking Rook &lt;br /&gt;View the chess-board as a 4 co-centric hollow squares with the outermost square with side 8 units and the innermost square with side 2 units. &lt;br /&gt;&lt;br /&gt;If the bishop is in one of the outer 28 squares, then it can attack 7 positions. If the bishop is in one of the 20 squares at next inner-level, then it can attack 9 positions. Similarly if the bishop is in one of the 12 squares at next inner-level, then it can attack 11 positions. And if the bishop is in one of the 4 squares at next inner-level (the innermost level), then it can attack 13 positions. &lt;br /&gt;&lt;br /&gt;Hence, total possible ways of the Bishop attacking the Rook &lt;br /&gt;= 28*7 + 20*9 + 12*11 + 4*13 &lt;br /&gt;= 560 ways &lt;br /&gt;&lt;br /&gt;Thus, the required probability is &lt;br /&gt;= (896 + 560) / 4032 &lt;br /&gt;= 13/36 &lt;br /&gt;= 0.3611&lt;br /&gt;itted ed&lt;br /&gt;Here in England McDonald's has just launched a new advertising campaign. The poster shows 8 McDonald's products and underneath claims there are 40312 combinations of the above items. &lt;br /&gt;&lt;br /&gt;Given that the maximum number of items allowed is 8, and you are allowed to have less than 8 items, and that the order of purchase does not matter (i.e. buying a burger and fries is the same as buying fries and a burger) &lt;br /&gt;&lt;br /&gt;How many possible combinations are there? Are McDonald's correct in claiming there are 40312 combinations?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Total possible combinations are 12869. &lt;br /&gt;&lt;br /&gt;It is given that you can order maximum of 8 items and you are allowed to have less than 8 items. Also, the order of purchase does not matter. Let's create a table for ordering total N items using X products. &lt;br /&gt;Items&lt;br /&gt;Ordered&lt;br /&gt;(N) Products Used (X)&lt;br /&gt; 1 2 3 4 5 6 7 8&lt;br /&gt;1 1 - - - - - - -&lt;br /&gt;2 1 1 - - - - - -&lt;br /&gt;3 1 2 1 - - - - -&lt;br /&gt;4 1 3 3 1 - - - -&lt;br /&gt;5 1 4 6 4 1 - - -&lt;br /&gt;6 1 5 10 10 5 1 - -&lt;br /&gt;7 1 6 15 20 15 6 1 -&lt;br /&gt;8 1 7 21 35 35 21 7 1&lt;br /&gt;Total (T) 8 28 56 70 56 28 8 1&lt;br /&gt;Ways to choose&lt;br /&gt;X products from&lt;br /&gt;8 products (W) 8C1 8C2 8C3 8C4 8C5 8C6 8C7 8C8&lt;br /&gt;Total combinations&lt;br /&gt;(T*W) 64 784 3136 4900 3136 784 64 1&lt;br /&gt;&lt;br /&gt;Thus, total possible combinations are &lt;br /&gt;= 64 + 784 + 3136 + 4900 + 3136 + 784 + 64 + 1 &lt;br /&gt;= 12869&lt;br /&gt;What are the chances that at least two out of a group of fifty people share the same birthday?&lt;br /&gt;SubmittedAnswer&lt;br /&gt;&lt;br /&gt;The probability of atleast two out of a group of 50 people share the same birthday is 97% &lt;br /&gt;&lt;br /&gt;Probability of atleast two share the same birthday = 1 - probability of all 50 have different birthdays &lt;br /&gt;&lt;br /&gt;Probability of all 50 have different birthday &lt;br /&gt;= 365/365 * 364/365 * 363/365 * ... * 317/365 * 316/365 &lt;br /&gt;= (365 * 364 * 363 * 362 * ... * 317 * 316)/36550 &lt;br /&gt;= 0.0296264 &lt;br /&gt;&lt;br /&gt;Probability of atleast two share the same birthday &lt;br /&gt;= 1 - 0.0296264 &lt;br /&gt;= 0.9703735 &lt;br /&gt;= 97% approx. &lt;br /&gt;&lt;br /&gt;Thus, the probability of atleast two out of a group of 50 people share the same birthday is 97% &lt;br /&gt;&lt;br /&gt;This explains why in a school/college with classrooms of 50 students, there are at least two students with a birthday on the same day of the year. Also, if there are 23 people in the room, then there are 50% chances that atleast two of them have a birthday on the same day of the year!!!&lt;br /&gt;&lt;br /&gt;A tank can be filled by pipe A in 30 minutes and by pipe B in 24 minutes. Outlet pipe C can empty the full tank in X minutes. &lt;br /&gt;&lt;br /&gt;If the tank is empty initially and if all the three pipes A, B and C are opened simultaneously, the tank will NEVER be full. Give the maximal possible value of X.&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The maximum possible value of X is 13 minutes 20 seconds. &lt;br /&gt;&lt;br /&gt;In one minute, &lt;br /&gt;pipe A can fill 1/30 part of the tank. &lt;br /&gt;pipe B can fill 1/24 part of the tank. &lt;br /&gt;&lt;br /&gt;Thus, the net water level increase in one minute is &lt;br /&gt;= 1/30 + 1/24 &lt;br /&gt;= 3/40 part of the tank &lt;br /&gt;&lt;br /&gt;In order to keep the tank always empty, outlet pipe C should empty at least 3/40 part of the tank in one minute. Thus, pipe C can empty the full tank in 40/3 i.e. 13 minutes 20 seconds.&lt;br /&gt;A worker earns a 5% raise. A year later, the worker receives a 2.5% cut in pay, &amp; now his salary is Rs. 22702.68 &lt;br /&gt;&lt;br /&gt;What was his salary to begin with?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Rs.22176 &lt;br /&gt;&lt;br /&gt;Assume his salary was Rs. X &lt;br /&gt;&lt;br /&gt;He earns 5% raise. So his salary is (105*X)/100 &lt;br /&gt;&lt;br /&gt;A year later he receives 2.5% cut. So his salary is ((105*X)/100)*(97.5/100) which is Rs. 22702.68 &lt;br /&gt;&lt;br /&gt;Hence, solving equation ((105*X)/100)*(97.5/100) = 22702.68 &lt;br /&gt;X = 22176&lt;br /&gt;&lt;br /&gt;500 men are arranged in an array of 10 rows and 50 columns according to their heights. &lt;br /&gt;&lt;br /&gt;Tallest among each row of all are asked to come out. And the shortest among them is A. &lt;br /&gt;&lt;br /&gt;Similarly after resuming them to their original positions, the shortest among each column are asked to come out. And the tallest among them is B. &lt;br /&gt;&lt;br /&gt;Now who is taller A or B ?&lt;br /&gt;A person wanted to withdraw X rupees and Y paise from the bank. But cashier made a mistake and gave him Y rupees and X paise. Neither the person nor the cashier noticed that. &lt;br /&gt;&lt;br /&gt;After spending 20 paise, the person counts the money. And to his surprise, he has double the amount he wanted to withdraw. &lt;br /&gt;&lt;br /&gt;Find X and Y. (1 Rupee = 100 Paise)&lt;br /&gt;&lt;br /&gt;As given, the person wanted to withdraw 100X + Y paise. &lt;br /&gt;&lt;br /&gt;But he got 100Y + X paise. &lt;br /&gt;&lt;br /&gt;After spending 20 paise, he has double the amount he wanted to withdraw. Hence, the equation is&lt;br /&gt;&lt;br /&gt;        2 * (100X + Y) = 100Y + X - 20&lt;br /&gt;&lt;br /&gt;        200X + 2Y = 100Y +X - 20&lt;br /&gt;&lt;br /&gt;        199X - 98Y = -20&lt;br /&gt;&lt;br /&gt;        98Y - 199X = 20&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Now, we got one equation; but there are 2 variables. We have to apply little bit of logic over here. We know that if we interchange X &amp; Y, amount gets double. So Y should be twice of X or one more than twice of X i.e. Y = 2X or Y = 2X+1 &lt;br /&gt;&lt;br /&gt;Case I : Y=2X &lt;br /&gt;Solving two equations simultaneously &lt;br /&gt;98Y - 199X = 20 &lt;br /&gt;Y - 2X = 0 &lt;br /&gt;We get X = - 20/3 &amp; Y = - 40/2 &lt;br /&gt;&lt;br /&gt;Case II : Y=2X+1 &lt;br /&gt;Solving two equations simultaneously &lt;br /&gt;98Y - 199X = 20 &lt;br /&gt;Y - 2X = 1 &lt;br /&gt;We get X = 26 &amp; Y = 53 &lt;br /&gt;&lt;br /&gt;Now, its obvious that he wanted to withdraw Rs. 26.53&lt;br /&gt;&lt;br /&gt;Submit&lt;br /&gt;Answer&lt;br /&gt; &lt;br /&gt;Users&lt;br /&gt;Answer (2)&lt;br /&gt; &lt;br /&gt;BrainVista&lt;br /&gt;Answer&lt;br /&gt; &lt;br /&gt;Puzzle &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;At the Party: &lt;br /&gt;1. There were 9 men and children. &lt;br /&gt;2. There were 2 more women than children. &lt;br /&gt;3. The number of different man-woman couples possible was 24. Note that if there were 7 men and 5 women, then there would have been 35 man-woman couples possible. &lt;br /&gt;&lt;br /&gt;Also, of the three groups - men, women and children - at the party: &lt;br /&gt;4. There were 4 of one group. &lt;br /&gt;5. There were 6 of one group. &lt;br /&gt;6. There were 8 of one group.&lt;br /&gt;Exactly one of the above 6 statements is false. &lt;br /&gt;&lt;br /&gt;Can you tell which one is false? Also, how many men, women and children are there at the party?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Statement (4) is false. There are 3 men, 8 women and 6 children. &lt;br /&gt;&lt;br /&gt;Assume that Statements (4), (5) and (6) are all true. Then, Statement (1) is false. But then Statement (2) and (3) both can not be true. Thus, contradictory to the fact that exactly one statement is false. &lt;br /&gt;&lt;br /&gt;So Statement (4) or Statement (5) or Statement (6) is false. Also, Statements (1), (2) and (3) all are true. &lt;br /&gt;&lt;br /&gt;From (1) and (2), there are 11 men and women. Then from (3), there are 2 possible cases - either there are 8 men and 3 women or there are 3 men and 8 women. &lt;br /&gt;&lt;br /&gt;If there are 8 men and 3 women, then there is 1 child. Then Statements (4) and (5) both are false, which is not possible. &lt;br /&gt;&lt;br /&gt;Hence, there are 3 men, 8 women and 6 children. Statement (4) is false.&lt;br /&gt; Brain Teaser No : 00242&lt;br /&gt;&lt;br /&gt;There is a shortage of tubelights, bulbs and fans in a village - Kharghar. It is found that &lt;br /&gt;• All houses do not have either tubelight or bulb or fan. &lt;br /&gt;• exactly 19% of houses do not have just one of these. &lt;br /&gt;• atleast 67% of houses do not have tubelights. &lt;br /&gt;• atleast 83% of houses do not have bulbs. &lt;br /&gt;• atleast 73% of houses do not have fans.&lt;br /&gt;What percentage of houses do not have tubelight, bulb and fan? &lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;42% houses do not have tubelight, bulb and fan. &lt;br /&gt;&lt;br /&gt;Let's assume that there are 100 houses. Hence, there should be total 300 items i.e. 100 tubelights, 100 bulbs and 100 fans. &lt;br /&gt;&lt;br /&gt;From the given data, we know that there is shortage of atleast (67+83+73) 223 items in every 100 houses. &lt;br /&gt;&lt;br /&gt;Also, exactly 19 houses do not have just one item. It means that remaining 81 houses should account for the shortage of remaining (223-19) 204 items. If those remaining 81 houses do not have 2 items each, there would be a shortage of 162 items. But total of 204 items are short. Hence, atleast (204-162) 42 houses do not have all 3 items - tubelight, bulb and fan. &lt;br /&gt;&lt;br /&gt;Thus, 42% houses do not have tubelight, bulb and fan.&lt;br /&gt;What is the remainder left after dividing 1! + 2! + 3! + … + 100! By 7? &lt;br /&gt;&lt;br /&gt;Think carefully !!!&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;A tricky one. &lt;br /&gt;&lt;br /&gt;7! onwards all terms are divisible by 7 as 7 is one of the factor. So there is no remainder left for those terms i.e. remainder left after dividing 7! + 8! + 9! + ... + 100! is 0. &lt;br /&gt;&lt;br /&gt;The only part to be consider is &lt;br /&gt;= 1! + 2! + 3! + 4! + 5! + 6! &lt;br /&gt;= 1 + 2 + 6 + 24 + 120 + 720 &lt;br /&gt;= 873 &lt;br /&gt;&lt;br /&gt;The remainder left after dividing 873 by 7 is 5 &lt;br /&gt;&lt;br /&gt;Hence, the remainder is 5.&lt;br /&gt;&lt;br /&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. &lt;br /&gt;&lt;br /&gt;Find the exact numerical value to the following equation: (X - A) * (X - B) * (X - C) * ... * (X - Y) * (X - Z)&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;(X - A) * (X - B) * (X - C) * ... * (X - Y) * (X - Z) equals 0 since (X - X) is zero&lt;br /&gt;If three babies are born every second of the day, then how many babies will be born in the year 2001?&lt;br /&gt;SuAnswer&lt;br /&gt;&lt;br /&gt;9,46,08,000 babies &lt;br /&gt;&lt;br /&gt;The total seconds in year 2001 &lt;br /&gt;= 365 days/year * 24 hours/day * 60 minutes/hours * 60 seconds/minute &lt;br /&gt;= 365 * 24 * 60 * 60 seconds &lt;br /&gt;= 3,15,36,000 seconds &lt;br /&gt;&lt;br /&gt;Thus, there are 3,15,36,000 seconds in the year 2001. Also, three babies born are every second. Hence, total babies born &lt;br /&gt;= 3 * 3,15,36,000 seconds &lt;br /&gt;= 9,46,08,000bmitted&lt;br /&gt;&lt;br /&gt;Replace the letters with the correct numbers.&lt;br /&gt;     T W O&lt;br /&gt;&lt;br /&gt; X   T W O &lt;br /&gt;&lt;br /&gt; ---------&lt;br /&gt;&lt;br /&gt; T H R E E&lt;br /&gt;&lt;br /&gt;Submitted by : Timmy Chan&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;T=1, W=3, O=8, H=9, R=2, E=4&lt;br /&gt;      1 3 8 &lt;br /&gt;&lt;br /&gt; x    1 3 8 &lt;br /&gt;&lt;br /&gt;------------ &lt;br /&gt;&lt;br /&gt;  1 9 0 4 4&lt;br /&gt;You can reduce the number of trials. T must be 1 as there is multiplication of T with T in hundred's position. Also, O can not be 0 or 1. Now, you have to find three digit number whose square satisfies above conditions and square of that has same last two digits. Hence, it must be between 102 and 139.&lt;br /&gt; Brain Teaser No : 00052&lt;br /&gt;&lt;br /&gt;Four words add up to a fifth word numerically:&lt;br /&gt;&lt;br /&gt;     mars&lt;br /&gt;&lt;br /&gt;    venus&lt;br /&gt;&lt;br /&gt;   uranus&lt;br /&gt;&lt;br /&gt;   saturn&lt;br /&gt;&lt;br /&gt; -------- +&lt;br /&gt;&lt;br /&gt;  neptune &lt;br /&gt;&lt;br /&gt;Each of the ten letters (m, a, r, s, v, e, n, u, t, and p) represent a unique number from the range 0 .. 9. &lt;br /&gt;&lt;br /&gt;Furthermore, numbers 1 and 6 are being used most frequently. &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The easiest way to solve this problem is by writing a computer program that systematically tries all possible mappings from the numbers onto the letters. This will give you only one solution which meets the condition that numbers 1 and 6 are most frequently used. &lt;br /&gt;&lt;br /&gt;     mars         m = 4&lt;br /&gt;&lt;br /&gt;    venus         a = 5&lt;br /&gt;&lt;br /&gt;   uranus         r = 9&lt;br /&gt;&lt;br /&gt;   saturn         s = 3&lt;br /&gt;&lt;br /&gt; -------- +       v = 2            4593&lt;br /&gt;&lt;br /&gt;  neptune         e = 0           20163&lt;br /&gt;&lt;br /&gt;                  n = 1          695163&lt;br /&gt;&lt;br /&gt;                  u = 6          358691&lt;br /&gt;&lt;br /&gt;                  t = 8        -------- +&lt;br /&gt;&lt;br /&gt;                  p = 7         1078610    &lt;br /&gt;&lt;br /&gt;There are 4 army men. They have been captured by a rebel group and have been held at ransom. An army intelligent officer orders them to be burried deep in dirt up to their necks. The format of their burrial are as shown in the figure. &lt;br /&gt;&lt;br /&gt;Conditions &lt;br /&gt;• They each have hats on their heads. either black(b) or white (w) look at diagram above. There are total 2 white hats and 2 black hats. &lt;br /&gt;• They only look in front of them not behind. They are not allowed to communicate by talking. &lt;br /&gt;• Between army man 1 and 2, there is a wall. &lt;br /&gt;• Captive man 4 can see the colour of hats on 2 and 3 &lt;br /&gt;• 3 can only see 2's hat &lt;br /&gt;• 2 can only see a wall and 1 can see a wall too, but is on the other side&lt;br /&gt;The officer speaks up, "If one of you can correctly tell me the colour of your hat, you will all go scott free back to your contries. If you are wrong, you will all be killed. &lt;br /&gt;&lt;br /&gt;How can one of them be certain about the hat they are wearing and not risk the lives of their fellow souldiers by taking a 50/50 guess!&lt;br /&gt;Submitted&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Either soldier 3 or soldier 4 can save the life as soldier 1 and soldier 2 can not see colour of any hat, even not their own.. In our case soldier 3 will tell the colour of his hat. &lt;br /&gt;&lt;br /&gt;Soldier 4 can see the hat on soldier 2 and soldier 3. If both are white, then he can be sure about colour of his hat which will be black and vice-versa. But if one of them is white and one is black, then soldier 4 can not say anything as he can have either of them. So he will keep mum. &lt;br /&gt;&lt;br /&gt;If soldier 4 won't say anyhing for a while, then soldier 3 will know that soldier 4 is not in position to tell the colour of hat on his hat. It means that colour of soldier 3's hat is opposite of colour of soldier 2's hat. So soldier 3 can tell correctly the colour of hat on his head which is Black. &lt;br /&gt;&lt;br /&gt;Here, we are assuming that all the soldiers are intelligent enough. Also, this solution will work for any combination of 2 Black hats and 2 White hats.&lt;br /&gt;One side of the bottom layer of a triangular pyramid has 12 balls. How many are there in the whole pyramid? &lt;br /&gt;&lt;br /&gt;Note that the pyramid is equilateral and solid.&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;There are total 364 balls. &lt;br /&gt;&lt;br /&gt;As there are 12 balls along one side, it means that there are 12 layers of balls. The top most layer has 1 ball. The second layer has 3 (1+2) balls. The third layer has 6 (1+2+3) balls. The fourth layer has 10 (1+2+3+4) balls. The fifth layer has 15 (1+2+3+4+5) balls. Similarly, there are 21, 28, 36, 45, 55, 66 and 78 balls in the remaining layers. &lt;br /&gt;&lt;br /&gt;Hence, the total number of balls are &lt;br /&gt;= 1 + 3 + 6 + 10 + 15 + 21 + 28 + 36 + 45 + 55 + 66 + 78 &lt;br /&gt;= 364 balls&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;A blindfolded man is asked to sit in the front of a carrom board. The holes of the board are shut with lids in random order, i.e. any number of all the four holes can be shut or open. &lt;br /&gt;&lt;br /&gt;Now the man is supposed to touch any two holes at a time and can do the following. &lt;br /&gt;• Open the closed hole. &lt;br /&gt;• Close the open hole. &lt;br /&gt;• Let the hole be as it is. &lt;br /&gt;After he has done it, the carrom board is rotated and again brought to some position. The man is again not aware of what are the holes which are open or closed. &lt;br /&gt;&lt;br /&gt;How many minimum number of turns does the blindfolded man require to either open all the holes or close all the holes? &lt;br /&gt;&lt;br /&gt;Note that whenever all the holes are either open or close, there will be an alarm so that the blindfolded man will know that he has won.&lt;br /&gt;Submitted&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The blindfolded man requires 5 turns. &lt;br /&gt;1. Open two adjacent holes. &lt;br /&gt;2. Open two diagonal holes. Now atleast 3 holes are open. If 4th hole is also open, then you are done. If not, the 4th hole is close. &lt;br /&gt;3. Check two diagonal holes. &lt;br /&gt;o If one is close, open it and all the holes are open. &lt;br /&gt;o If both are close, open any one hole. Now, two holes are open and two are close. The diagonal holes are in the opposite status i.e. in both the diagonals, one hole is open and one is close.&lt;br /&gt;&lt;br /&gt;4. Check any two adjacent holes. &lt;br /&gt;o If both are open, close both of them. Now, all holes are close. &lt;br /&gt;o If both are close, open both of them. Now, all holes are open. &lt;br /&gt;o If one is open and one is close, invert them i.e. close the open hole and open the close hole. Now, the diagonal holes are in the same status i.e. two holes in one diagonal are open and in other are close.&lt;br /&gt;&lt;br /&gt;5. Check any two diagonal holes. &lt;br /&gt;o If both are open, close both of them. Now, all holes are close. &lt;br /&gt;o If both are close, open both of them. Now, all holes are open.&lt;br /&gt;&lt;br /&gt;In the middle of the confounded desert, there is the lost city of "Ash". To reach it, I will have to travel overland by foot from the coast. On a trek like this, each person can only carry enough rations for five days and the farthest we can travel in one day is 30 miles. Also, the city is 120 miles from the starting point. &lt;br /&gt;&lt;br /&gt;What I am trying to figure out is the fewest number of persons, including myself, that I will need in our Group so that I can reach the city, stay overnight, and then return to the coast without running out of supplies. &lt;br /&gt;&lt;br /&gt;How many persons (including myself) will I need to accomplish this mission?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Total 4 persons (including you) required. &lt;br /&gt;&lt;br /&gt;It is given that each person can only carry enough rations for five days. And there are 4 persons. Hence, total of 20 days rations is available. &lt;br /&gt;1. First Day : 4 days of rations are used up. One person goes back using one day of rations for the return trip. The rations remaining for the further trek is for 15 days. &lt;br /&gt;2. Second Day : The remaining three people use up 3 days of rations. One person goes back using 2 days of rations for the return trip. The rations remaining for the further trek is for 10 days. &lt;br /&gt;3. Third Day : The remaining two people use up 2 days of rations. One person goes back using 3 days of rations for the return trip. The rations remaining for the further trek is for 5 days. &lt;br /&gt;4. Fourth Day : The remaining person uses up one day of rations. He stays overnight. The next day he returns to the coast using 4 days of rations.&lt;br /&gt;&lt;br /&gt;Thus, total 4 persons, including you are required.&lt;br /&gt;At what time after 4.00 p.m. is the minutes hand of a clock exactly aligned with the hour hand?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;4:21:49.5 &lt;br /&gt;&lt;br /&gt;Assume that X minutes after 4.00 PM minute hand exactly aligns with and hour hand. &lt;br /&gt;&lt;br /&gt;For every minute, minute hand travels 6 degrees. &lt;br /&gt;Hence, for X minutes it will travel 6 * X degrees. &lt;br /&gt;&lt;br /&gt;For every minute, hour hand travels 1/2 degrees. &lt;br /&gt;Hence, for X minutes it will travel X/2 degrees. &lt;br /&gt;&lt;br /&gt;At 4.00 PM, the angle between minute hand and hour hand is 120 degrees. Also, after X minutes, minute hand and hour hand are exactly aligned. So the angle with respect to 12 i.e. Vertical Plane will be same. Therefore, &lt;br /&gt;&lt;br /&gt;6 * X = 120 + X/2 &lt;br /&gt;12 * X = 240 + X &lt;br /&gt;11 * X = 240 &lt;br /&gt;X = 21.8182 &lt;br /&gt;X = 21 minutes 49.5 seconds &lt;br /&gt;&lt;br /&gt;Hence, at 4:21:49.5 minute hand is exactly aligned with the hour hand.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Substitute digits for the letters to make the following Division true&lt;br /&gt;                   O U T&lt;br /&gt;&lt;br /&gt;           -------------&lt;br /&gt;&lt;br /&gt;   S T E M | D E M I S E&lt;br /&gt;&lt;br /&gt;           | D M O C&lt;br /&gt;&lt;br /&gt;           -------------&lt;br /&gt;&lt;br /&gt;               T U I S&lt;br /&gt;&lt;br /&gt;               S T E M&lt;br /&gt;&lt;br /&gt;              ----------&lt;br /&gt;&lt;br /&gt;                 Z Z Z E&lt;br /&gt;&lt;br /&gt;                 Z U M M&lt;br /&gt;&lt;br /&gt;                --------&lt;br /&gt;&lt;br /&gt;                   I S T&lt;br /&gt;Note that the leftmost letter can't be zero in any word. Also, there must be a one-to-one mapping between digits and letters. e.g. if you substitute 3 for the letter M, no other letter can be 3 and all other M in the puzzle must be 3.&lt;br /&gt;Submitted by : Calon&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;C=0, U=1, S=2, T=3, O=4, M=5, I=6, Z=7, E=8, D=9 &lt;br /&gt;&lt;br /&gt;It is obvious that U=1 (as U*STEM=STEM) and C=0 (as I-C=I). &lt;br /&gt;&lt;br /&gt;S*O is a single digit and also S*T is a single digit. Hence, their values (O, S, T) must be 2, 3 or 4 (as they can not be 0 or 1 or greater than 4). &lt;br /&gt;&lt;br /&gt;Consider, STEM*O=DMOC, where C=0. It means that M must be 5. Now, its simple. O=4, S=2, T=3, E=8, Z=7, I=6 and D=9.&lt;br /&gt;                   O U T                        4 1 3&lt;br /&gt;&lt;br /&gt;           -------------                -------------&lt;br /&gt;&lt;br /&gt;   S T E M | D E M I S E        2 3 8 5 | 9 8 5 6 2 8&lt;br /&gt;&lt;br /&gt;           | D M O C                    | 9 5 4 0&lt;br /&gt;&lt;br /&gt;           -------------                -------------&lt;br /&gt;&lt;br /&gt;               T U I S                      3 1 6 2&lt;br /&gt;&lt;br /&gt;               S T E M                      2 3 8 5&lt;br /&gt;&lt;br /&gt;              ----------                   ----------&lt;br /&gt;&lt;br /&gt;                 Z Z Z E                      7 7 7 8&lt;br /&gt;&lt;br /&gt;                 Z U M M                      7 1 5 5&lt;br /&gt;&lt;br /&gt;                --------                     --------&lt;br /&gt;&lt;br /&gt;                   I S T                        6 2 3&lt;br /&gt;Also, when arranged from 0 to 9, it spells CUSTOMIZED.&lt;br /&gt; Brain Teaser No : 00015&lt;br /&gt;&lt;br /&gt;In the town called Alibaug, the following facts are true: &lt;br /&gt;• No two inhabitants have exactly the same number of hairs. &lt;br /&gt;• No inhabitants has exactly 2025 hairs. &lt;br /&gt;• There are more inhabitants than there are hairs on the head of any one inhabitants. &lt;br /&gt;What is the largest possible number of the inhabitants of Alibaug? &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;2025 &lt;br /&gt;&lt;br /&gt;It is given that no inhabitants have exactly 2025 hairs. Hence there are 2025 inhabitants with 0 to 2024 hairs in the head. &lt;br /&gt;&lt;br /&gt;Suppose there are more than 2025 inhabitants. But these will violate the condition that "There are more inhabitants than there are hairs on the head of any one inhabitants." As for any number more than 2025, there will be same number of inhabitants as the maximum number of hairs on the head of any inhabitant.&lt;br /&gt;There are four groups of Mangoes, Apples and Bananas as follows: &lt;br /&gt;Group I : 1 Mango, 1 Apples and 1 Banana &lt;br /&gt;Group II : 1 Mango, 5 Apples and 7 Bananas &lt;br /&gt;Group III : 1 Mango, 7 Apples and 10 Bananas &lt;br /&gt;Group IV : 9 Mango, 23 Apples and 30 Bananas &lt;br /&gt;&lt;br /&gt;Group II costs Rs 300 and Group III costs Rs 390. &lt;br /&gt;&lt;br /&gt;Can you tell how much does Group I and Group IV cost?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Group I costs Rs 120 and Group IV costs Rs 1710 &lt;br /&gt;&lt;br /&gt;Assume that the values of one mango, one apple and one banana are M, A and B respectively. &lt;br /&gt;&lt;br /&gt;From Group II : M + 5A + 7B = 300 &lt;br /&gt;From Group III : M + 7A + 10B = 390 &lt;br /&gt;&lt;br /&gt;Subtracting above to equations : 2A + 3B = 90 &lt;br /&gt;&lt;br /&gt;For Group I : &lt;br /&gt;= M + A + B &lt;br /&gt;= (M + 5A + 7B) - (4A + 6B) &lt;br /&gt;= (M + 5A + 7B) - 2(2A + 3B) &lt;br /&gt;= 300 - 2(90) &lt;br /&gt;= 300 - 180 &lt;br /&gt;= 120 &lt;br /&gt;&lt;br /&gt;Similarly, for Group IV : &lt;br /&gt;= 9M + 23A + 30B &lt;br /&gt;= 9(M + 5A + 7B) - (22A + 33B) &lt;br /&gt;= 9(M + 5A + 7B) - 11(2A + 3B) &lt;br /&gt;= 9(300) - 11(90) &lt;br /&gt;= 2700 - 990 &lt;br /&gt;= 1710 &lt;br /&gt;&lt;br /&gt;Thus, Group I costs Rs 120 and Group IV costs Rs 1710.&lt;br /&gt;Tic-Tac-Toe is being played. One 'X' has been placed in one of the corners. No 'O' has been placed yet. &lt;br /&gt;&lt;br /&gt;Where does the player that is playing 'O' has to put his first 'O' so that 'X' doesn't win? &lt;br /&gt;&lt;br /&gt;Assume that both players are very intelligent. Explain your answer&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;"O" should be placed in the center. &lt;br /&gt;&lt;br /&gt;Let's number the positions as:&lt;br /&gt;                  1 | 2 | 3&lt;br /&gt;&lt;br /&gt;                  ---------&lt;br /&gt;&lt;br /&gt;                  4 | 5 | 6&lt;br /&gt;&lt;br /&gt;                  ---------&lt;br /&gt;&lt;br /&gt;                  7 | 8 | 9&lt;br /&gt;It is given that "X" is placed in one of the corner position. Let's assume that its at position 1. &lt;br /&gt;&lt;br /&gt;Now, let's take each position one by one. &lt;br /&gt;• If "O" is placed in position 2, "X" can always win by choosing position 4, 5 or 7. &lt;br /&gt;• If "O" is placed in position 3, "X" can always win by choosing position 4, 7 or 9. &lt;br /&gt;• If "O" is placed in position 4, "X" can always win by choosing position 2, 3 or 5. &lt;br /&gt;• If "O" is placed in position 6, "X" can always win by choosing position 3, 5 or 7. &lt;br /&gt;• If "O" is placed in position 7, "X" can always win by choosing position 2, 3 or 9. &lt;br /&gt;• If "O" is placed in position 8, "X" can always win by choosing position 3, 5 or 7. &lt;br /&gt;• If "O" is placed in position 9, "X" can always win by choosing position 3, or 7.&lt;br /&gt;If "O" is placed in position 5 i.e. center position, "X" can't win unless "O" does something foolish ;)) &lt;br /&gt;&lt;br /&gt;Hence, "O" should be placed in the center.&lt;br /&gt;&lt;br /&gt;Amit, Bhavin, Himanshu and Rakesh are sitting around a table. &lt;br /&gt;• The Electonics Engineer is sitting to the left of the Mechanical Engineer. &lt;br /&gt;• Amit is sitting opposite to Computer Engineer. &lt;br /&gt;• Himanshu likes to play Computer Games. &lt;br /&gt;• Bhavin is sitting to the right of the Chemical Engineer.&lt;br /&gt;Can you figure out everyone's profession?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Amit is the Mechanical Engineer. Bhavin is the Computer Engineer. Himanshu and Rakesh are either Chemical Engineer or Elecronics Engineer. &lt;br /&gt;&lt;br /&gt;Amit and Bhavin are sitting opposite to each other. Whereas Chemical Engineer and Elecronics Engineer are sitting opposite to each other. &lt;br /&gt;&lt;br /&gt;We cannot find out who is Chemical Engineer and Elecronics Engineer as data provided is not sufficient&lt;br /&gt;&lt;br /&gt;Five friends with surname Batliwala, Pocketwala, Talawala, Chunawala and Natakwala have their first name and middle name as follow. &lt;br /&gt;1. Four of them have a first and middle name of Paresh. &lt;br /&gt;2. Three of them have a first and middle name of Kamlesh. &lt;br /&gt;3. Two of them have a first and middle name of Naresh. &lt;br /&gt;4. One of them have a first and middle name of Elesh. &lt;br /&gt;5. Pocketwala and Talawala, either both are named Kamlesh or neither is named Kamlesh. &lt;br /&gt;6. Either Batliwala and Pocketwala both are named Naresh or Talawala and Chunawala both are named Naresh. &lt;br /&gt;7. Chunawala and Natakwala are not both named Paresh.&lt;br /&gt;Who is named Elesh?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Pocketwala is named Elesh. &lt;br /&gt;&lt;br /&gt;From (1) and (7), it is clear that Batliwala, Pocketwala and Talawala are named Paresh. &lt;br /&gt;&lt;br /&gt;From (6) and (5), if Pocketwala or Talawala both are named Kamlesh, then either of them will have three names i.e. Paresh, Kamlesh and Naresh. Hence, Pocketwala and Talawala both are not named Kamlesh. It means that Batliwala, Chunawala and Natakwala are named Kamlesh. &lt;br /&gt;&lt;br /&gt;Now it is clear that Talawala and Chunawala are named Naresh. Also, Pocketwala is named Elesh.&lt;br /&gt;&lt;br /&gt;Mr. Wagle goes to work by a bus. One day he falls asleep when the bus still has twice as far to go as it has already gone. &lt;br /&gt;&lt;br /&gt;Halfway through the trip he wakes up as the bus bounces over some bad potholes. When he finally falls asleep again, the bus still has half the distance to go that it has already travelled. Fortunately, Mr. Wagle wakes up at the end of his trip. &lt;br /&gt;&lt;br /&gt;What portion of the total trip did Mr. Wagle sleep?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Mr. wagle slept through half his trip. &lt;br /&gt;&lt;br /&gt;Let's draw a timeline. Picture the bus route on a line showen below: &lt;br /&gt;&lt;br /&gt;    ---------------- ________ -------- ________________&lt;br /&gt;&lt;br /&gt;  Start            1/3      1/2      2/3             End&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt; ----- shows time for which Mr. Wagle was not sleeping&lt;br /&gt;&lt;br /&gt; _____ shows time for which Mr. Wagle was sleeping&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;When Mr. Wagle fell asleep the first time, the bus sill had twice as far to go as it had already gone, that marks the first third of his trip. &lt;br /&gt;&lt;br /&gt;He wake up halfway through the trip i.e slept from 1/3 mark to the 1/2 mark. He fell sleep again when the bus still had half the distance to go that it had already traveled i.e 2/3 mark. &lt;br /&gt;&lt;br /&gt;Adding up, all sleeping times, &lt;br /&gt;= (1/2 - 1/3) + (1 - 2/3) &lt;br /&gt;= 1/6 + 1/3 &lt;br /&gt;= 1/2 &lt;br /&gt;&lt;br /&gt;Hence, Mr. wagle slept through half his trip.&lt;br /&gt; Brain Teaser No : 00068&lt;br /&gt;&lt;br /&gt;In your sock drawer, you have a ratio of 5 pairs of blue socks, 4 pairs of brown socks, and 6 pairs of black socks. &lt;br /&gt;&lt;br /&gt;In complete darkness, how many socks would you need to pull out to get a matching pair of the same color? &lt;br /&gt;4 If you don't agree, try it yourself!&lt;br /&gt;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. &lt;br /&gt;&lt;br /&gt;How many do you have to grab to be sure you have 2 of the same?&lt;br /&gt;&lt;br /&gt;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. &lt;br /&gt;&lt;br /&gt;How many do you have to grab to be sure you have 2 of the same?&lt;br /&gt;If you select 4 Jelly beans you are guarenteed that you will have 2 that are the same color.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;There are 70 employees working with BrainVista of which 30 are females. Also, &lt;br /&gt;• 30 employees are married &lt;br /&gt;• 24 employees are above 25 years of age &lt;br /&gt;• 19 married employees are above 25 years, of which 7 are males &lt;br /&gt;• 12 males are above 25 years of age &lt;br /&gt;• 15 males are married.&lt;br /&gt;How many unmarried females are there and how many of them are above 25?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;15 unmarried females &amp; none are above 25 years of age. &lt;br /&gt;&lt;br /&gt;Simply put all given information into the table structure and you will get the answer. &lt;br /&gt;  Married Unmarried&lt;br /&gt; Below 25 Above 25 Below 25 Above 25&lt;br /&gt;Female 3 12 15 0&lt;br /&gt;Male 8 7 20 5&lt;br /&gt;&lt;br /&gt;There is a safe with a 5 digit number as the key. The 4th digit is 4 greater than the second digit, while the 3rd digit is 3 less than the 2nd digit. The 1st digit is thrice the last digit. There are 3 pairs whose sum is 11. &lt;br /&gt;&lt;br /&gt;Find the number.&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;65292 &lt;br /&gt;&lt;br /&gt;As per given conditions, there are three possible combinations for 2nd, 3rd and 4th digits. They are (3, 0, 7) or (4, 1, 8) or (5, 2, 9) &lt;br /&gt;&lt;br /&gt;It is given that there are 3 pairs whose sum is 11. All possible pairs are (2, 9), (3, 8), (4, 7), (5, 6). Now required number is 5 digit number and it contains 3 pairs of 11. So it must not be having 0 and 1 in it. Hence, the only possible combination for 2nd, 3rd and 4th digits is (5, 2, 9) &lt;br /&gt;&lt;br /&gt;Also, 1st digit is thrice the last digit. The possible combinations are (3, 1), (6, 2) and (9, 3), out of which only (6, 2) with (5, 2, 9) gives 3 pairs of 11. Hence, the answer is 65292.&lt;br /&gt;My friend collects antique stamps. She purchased two, but found that she needed to raise money urgently. So she sold them for Rs. 8000 each. On one she made 20% and on the other she lost 20%. &lt;br /&gt;&lt;br /&gt;How much did she gain or lose in the entire transaction?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;She lost Rs 666.67 &lt;br /&gt;&lt;br /&gt;Consider the first stamp. She mades 20% on it after selling it for Rs 8000. &lt;br /&gt;&lt;br /&gt;So the original price of first stamp is &lt;br /&gt;= (8000 * 100) / 80 &lt;br /&gt;= Rs 6666.67 &lt;br /&gt;&lt;br /&gt;Similarly, consider second stamp. She lost 20% on it after selling it for Rs 8000 &lt;br /&gt;&lt;br /&gt;So the original price of second stamp is &lt;br /&gt;= (8000 * 100) / 80 &lt;br /&gt;= Rs 10000 &lt;br /&gt;&lt;br /&gt;Total buying price of two stamps &lt;br /&gt;= Rs 6666.67 + Rs 10000 &lt;br /&gt;= Rs 16666.67 &lt;br /&gt;&lt;br /&gt;Total selling price of two stamps &lt;br /&gt;= Rs 8000 + Rs 8000 &lt;br /&gt;= Rs 16000 &lt;br /&gt;&lt;br /&gt;Hence, she lost Rs 666.67&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Assume for a moment that the earth is a perfectly uniform sphere of radius 6400 km. Suppose a thread equal to the length of the circumference of the earth was placed along the equator, and drawn to a tight fit. &lt;br /&gt;&lt;br /&gt;Now suppose that the length of the thread is increased by 12 cm, and that it is pulled away uniformly in all directions. &lt;br /&gt;&lt;br /&gt;By how many cm. will the thread be separated from the earth's surface?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The cicumference of the earth is &lt;br /&gt;= 2 * PI * r &lt;br /&gt;= 2 * PI * 6400 km &lt;br /&gt;= 2 * PI * 6400 * 1000 m &lt;br /&gt;= 2 * PI * 6400 * 1000 * 100 cm &lt;br /&gt;= 1280000000 * PI cm &lt;br /&gt;&lt;br /&gt;where r = radius of the earth, PI = 3.141592654 &lt;br /&gt;&lt;br /&gt;Hence, the length of the thread is = 1280000000 * PI cm &lt;br /&gt;&lt;br /&gt;Now length of the thread is increasd by 12 cm. So the new length is = (1280000000 * PI) + 12 cm &lt;br /&gt;&lt;br /&gt;This thread will make one concentric circle with the earth which is slightly away from the earth. The circumfernce of that circle is nothing but (1280000000 * PI) + 12 cm &lt;br /&gt;&lt;br /&gt;Assume that radius of the outer circle is R cm &lt;br /&gt;Therefore, &lt;br /&gt;2 * PI * R = (1280000000 * PI) + 12 cm &lt;br /&gt;&lt;br /&gt;Solving above equation, R = 640000001.908 cm &lt;br /&gt;Radius of the earth is r = 640000000 cm &lt;br /&gt;&lt;br /&gt;Hence, the thread will be separatedfrom the earth by &lt;br /&gt;= R - r cm &lt;br /&gt;= 640000001.908 - 640000000 &lt;br /&gt;= 1.908 cm&lt;br /&gt;Scientist decided to do a study on the population growth of rabbits. Inside a controlled environment, 1000 rabbits were placed. &lt;br /&gt;&lt;br /&gt;Six months later, there were 1000Z rabbits. At the beginning of the 3rd year, there were roughly 2828Z rabbits, which was 4 times what the scientists placed in there at the beginning of the 1st year. &lt;br /&gt;&lt;br /&gt;If Z is a positive variable, how many rabbits would be there at the beginning of the 11th year?&lt;br /&gt;SubmiAnswer&lt;br /&gt;&lt;br /&gt;At the beginning of the 11th year, there would be 1,024,000 rabbits. &lt;br /&gt;&lt;br /&gt;At the beginning, there were 1000 rabbits. Also, there were 4000 rabbits at the beginning of third year which is equal to 2828Z. Thus, Z = 4000/2828 i.e. 1.414 (the square root of 2) &lt;br /&gt;&lt;br /&gt;Note that 2828Z can be represented as 2000*Z*Z (Z=1.414), which can be further simplified as 1000*Z*Z*Z*Z &lt;br /&gt;&lt;br /&gt;Also, it is given that at the end of 6 months, there were 1000Z rabbits. &lt;br /&gt;&lt;br /&gt;It is clear that the population growth is 1.414 times every six months i.e. 2 times every year. After N years, the population would be 1000*(Z^(2N)) i.e. 1000*(2^N) &lt;br /&gt;&lt;br /&gt;Thus, at the beginning of the 11th year (i.e. after 10 years), there would be 1000*(2^10) i.e. 1,024,000 rabbits.&lt;br /&gt;tted&lt;br /&gt;A class of 100 students. 24 of them are girls and 32 are not. Which base am I using? &lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Let the base be X. &lt;br /&gt;&lt;br /&gt;Therefore &lt;br /&gt;(X*X + X*0 + 0) = (2*X +4) + (3*X + 2) &lt;br /&gt;X*X = 5*X + 6 &lt;br /&gt;X*X - 5*X -6 = 0 &lt;br /&gt;(X-6)(X+1) = 0 &lt;br /&gt;&lt;br /&gt;Therefore base is 6&lt;br /&gt;&lt;br /&gt;A man is stranded on a desert island. All he has to drink is a 20oz bottle of sprite. &lt;br /&gt;&lt;br /&gt;To conserve his drink he decides that on the first day he will drink one oz and the refill the bottle back up with water. On the 2nd day he will drink 2oz and refill the bottle. On the 3rd day he will drink 3oz and so on... &lt;br /&gt;&lt;br /&gt;By the time all the sprite is gone, how much water has he drunk?&lt;br /&gt;SubmittAnswer&lt;br /&gt;&lt;br /&gt;The man drunk 190oz of water. &lt;br /&gt;&lt;br /&gt;It is given that the man has 20oz bottle of sprite. Also, he will drink 1oz on the first day and refill the bottle with water, will drink 2oz on the second day and refill the bottle, will drink 3oz on the third day and refill the bottle, and so on till 20th day. Thus at the end of 20 days, he must have drunk (1 + 2 + 3 + 4 + ..... +18 + 19 + 20) = 210oz of liquid. &lt;br /&gt;&lt;br /&gt;Out of that 210oz, 20oz is the sprite which he had initially. Hence, he must have drunk 190oz of water.ed&lt;br /&gt;You have four 9's and you may use any of the (+, -, /, *) as many times as you like. I want to see a mathematical expression which uses the four 9's to = 100 &lt;br /&gt;&lt;br /&gt;How many such expressions can you make?&lt;br /&gt;Submitted&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;There are 5 such expressions. &lt;br /&gt;&lt;br /&gt;99 + (9/9) = 100 &lt;br /&gt;&lt;br /&gt;(99/.99) = 100 &lt;br /&gt;&lt;br /&gt;(9/.9) * (9/.9) = 100 &lt;br /&gt;&lt;br /&gt;((9*9) + 9)/.9 = 100 &lt;br /&gt;&lt;br /&gt;(99-9)/.9 = 100&lt;br /&gt;Two planes take off at the same exact moment. They are flying across the Atlantic. One leaves New York and is flying to Paris at 500 miles per hour. The other leaves Paris and is flying to New York at only 450 miles per hour ( because of a strong head wind ). &lt;br /&gt;&lt;br /&gt;Which one will be closer to Paris when they meet?&lt;br /&gt;They will both be the same distance from Paris when they meet!!!&lt;br /&gt;&lt;br /&gt;12 members were present at a board meeting. Each member shook hands with all of the other members before &amp; after the meeting. &lt;br /&gt;&lt;br /&gt;How many hand shakes were there?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;132 &lt;br /&gt;&lt;br /&gt;Think of it this way: the first person shakes hands with 11 people, the second person also shakes hands with 11 people, but you only count 10, because the hand shake with the first person was already counted. Then add 9 for the third person, 8 for the fourth, &amp; so on. &lt;br /&gt;&lt;br /&gt;66 hand shakes took place before &amp; 66 after the meeting, for a total of 132.&lt;br /&gt;Arrange five planets such that 4 of them add up to 5th planet numerically. Each of the letters of the planet should represent a unique number from the range 0 - 9. You have to use all ten digits. &lt;br /&gt;&lt;br /&gt;There is an amazing mathematical relationship exists among the names of the planet.&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The tought process is initially to find planets such that the total number of alphabets in them is 10. &lt;br /&gt;&lt;br /&gt;The only possible combination of planets is Saturn, Uranus, Venus, Mars and Neptune because for other combinations there will be more than 10 alphabets. Among these five, Neptune is the lenghtiest, so it must be the sum of the other four.&lt;br /&gt;&lt;br /&gt;        S A T U R N &lt;br /&gt;&lt;br /&gt;        U R A N U S&lt;br /&gt;&lt;br /&gt;          V E N U S&lt;br /&gt;&lt;br /&gt;     +      M A R S&lt;br /&gt;&lt;br /&gt;      --------------&lt;br /&gt;&lt;br /&gt;      N E P T U N E&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Now the only possible value for N is 1. By finding the value for S, we can reach the result:&lt;br /&gt;&lt;br /&gt;        3 5 8 6 9 1 &lt;br /&gt;&lt;br /&gt;        6 9 5 1 6 3&lt;br /&gt;&lt;br /&gt;          2 0 1 6 3&lt;br /&gt;&lt;br /&gt;     +      4 5 9 3&lt;br /&gt;&lt;br /&gt;      --------------&lt;br /&gt;&lt;br /&gt;      1 0 7 8 6 1 0&lt;br /&gt;&lt;br /&gt;You have 14 apples. Your Friend Marge takes away 3 and gives you 2. You drop 7 but pick up 4. Bret takes 4 and gives 5. You take one from Marge and give it to Bret in exchange for 3 more. You give those 3 to Marge and she gives you an apple and an orange. Frank comes and takes the apple Marge gave you and gives you a pear. You give the pear to Bret in exchange for an apple. Frank then takes an apple from Marge, gives it to Bret for an orange, gives you the orange for an apple. &lt;br /&gt;&lt;br /&gt;How many pears do you have?&lt;br /&gt;Submitted&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;None &lt;br /&gt;&lt;br /&gt;Frank gave you a pear in exchange of the apple which Marge gave you. And you gave that pear to Bret in exchange for an apple. All the others exchanges involved apples and/or organges.&lt;br /&gt;Four couples are going to the movie. Each row holds eight seats. Betty and Jim don't want to sit next to Alice and Tom. Alice and Tom don't want to sit next to Gertrude and Bill. On the otherhand, Sally and Bob don't want to sit next to Betty and Jim. &lt;br /&gt;&lt;br /&gt;How can the couples arrange themselves in a row so that they all sit where they would like?&lt;br /&gt;Submitted by : Tara Smith&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;From the given data, it can be inferred that: &lt;br /&gt;(Sally &amp; Bob) NOT (Betty &amp; Jim) NOT (Alice &amp; Tom) NOT (Gertrude &amp; Bill) &lt;br /&gt;&lt;br /&gt;(A) NOT (B) means A and B can not seat next to each other. &lt;br /&gt;&lt;br /&gt;Now, it is obvious that (Betty &amp; Jim) and (Alice &amp; Tom) will occupy the corner seats as both of them can have only one neighbour. Therefore, &lt;br /&gt;(Gertrude &amp; Bill) will seat next to (Betty &amp; Jim) &lt;br /&gt;(Sally &amp; Bob) will seat next to (Gertrude &amp; Bill) &lt;br /&gt;(Alice &amp; Tom) will seat next to (Sally &amp; Bob) &lt;br /&gt;&lt;br /&gt;Thus, there are two possible arrangements - a mirror images of each other. &lt;br /&gt;&lt;br /&gt;1. (Betty &amp; Jim) - (Gertrude &amp; Bill) - (Sally &amp; Bob) - (Alice &amp; Tom) &lt;br /&gt;2. (Alice &amp; Tom) - (Sally &amp; Bob) - (Gertrude &amp; Bill) - (Betty &amp; Jim)&lt;br /&gt;Substitute digits for the letters to make the following addition problem true.&lt;br /&gt;               W  H  O  S  E&lt;br /&gt;&lt;br /&gt;               T  E  E  T  H&lt;br /&gt;&lt;br /&gt;                     A  R  E&lt;br /&gt;&lt;br /&gt;          +             A  S&lt;br /&gt;&lt;br /&gt;          -------------------&lt;br /&gt;&lt;br /&gt;            S  W  O  R  D  S&lt;br /&gt;Note that the leftmost letter can't be zero in any word. Also, there must be a one-to-one mapping between digits and letters. e.g. if you substitute 3 for the letter H, no other letter can be 3 and all other H in the puzzle must be 3.&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;It is obvious that S=1 and T=9. &lt;br /&gt;&lt;br /&gt;Also, (H + E) should be greater than 10 and hence, (E + H + E) must 20. Thus, there are 3 possible values for (E, H) pair: (6, 8) or (7, 6) or (8, 4). Use trial-n-error and everything will fit-in.&lt;br /&gt;&lt;br /&gt;       W  H  O  S  E                2  8  5  1  6&lt;br /&gt;&lt;br /&gt;       T  E  E  T  H                9  6  6  9  8&lt;br /&gt;&lt;br /&gt;             A  R  E                      4  7  6&lt;br /&gt;&lt;br /&gt;  +             A  S           +             4  1&lt;br /&gt;&lt;br /&gt;  -------------------          -------------------&lt;br /&gt;&lt;br /&gt;    S  W  O  R  D  S             1  2  5  7  3  1&lt;br /&gt;&lt;br /&gt;When Socrates was imprisoned for being a disturbing influence, he was held in high esteem by his guards. All four of them hoped that something would occur that would facilitate his escape. One evening, the guard who was on duty intentionally left the cell door open so that Socrates could leave for distant parts. &lt;br /&gt;&lt;br /&gt;Socrates did not attempt to escape, as it was his philosophy that if you accept society's rules, you must also accept it's punishments. However, the open door was considered by the authorities to be a serious matter. It was not clear which guard was on that evening. The four guards make the following statements in their defense: &lt;br /&gt;&lt;br /&gt;Aaron: &lt;br /&gt;A) I did not leave the door open. &lt;br /&gt;B) Clement was the one who did it. &lt;br /&gt;&lt;br /&gt;Bob: &lt;br /&gt;A) I was not the one who was on duty that evening. &lt;br /&gt;B) Aaron was on duty. &lt;br /&gt;&lt;br /&gt;Clement: &lt;br /&gt;A) Bob was the one on duty that evening. &lt;br /&gt;B) I hoped Socrates would escape. &lt;br /&gt;&lt;br /&gt;David: &lt;br /&gt;A) I did not leave the door open. &lt;br /&gt;B) I was not surprised that Socrates did not attempt to escape. &lt;br /&gt;&lt;br /&gt;Considering that, in total, three statements are true, and five statements are false, which guard is guiltyAnswer&lt;br /&gt;&lt;br /&gt;David is the guilty. &lt;br /&gt;&lt;br /&gt;Note that "All four of them hoped that something would occur that would facilitate his escape". It makes Clement's statement B True and David's statement B False. &lt;br /&gt;&lt;br /&gt;Now consider each of them as a guilty, one at a time. &lt;br /&gt;  Aaron Bob Clement David True&lt;br /&gt;Stmts&lt;br /&gt;  A B A B A B A B &lt;br /&gt;If Aaron is guilty False False True True False True True False 4&lt;br /&gt;If Bob is guilty True False False False True True True False 4&lt;br /&gt;If Clement is guilty True True True False False True True False 5&lt;br /&gt;If David is guilty True False True False False True False False 3&lt;br /&gt;&lt;br /&gt;Since in total, three statements are true and five statements are false. It is clear from the above table that David is?&lt;br /&gt; Brain Teaser No : 00474&lt;br /&gt;&lt;br /&gt;Given any whole number take the sum of the digits, and the product of the digits, and multiply these together to get a new whole number. &lt;br /&gt;&lt;br /&gt;For example, starting with 6712, the sum of the digits is (6+7+1+2) = 16, and the product of the digits is (6*7*1*2) = 84. The answer in this case is then 84 x 16 = 1344. &lt;br /&gt;&lt;br /&gt;If we do this again starting from 1344, we get (1+3+4+4) * (1*3*4*4) = 576 &lt;br /&gt;&lt;br /&gt;And yet again (5+7+6) * (5*7*6) = 3780 &lt;br /&gt;&lt;br /&gt;At this stage we know what the next answer will be (without working it out) because, as one digit is 0, the product of the digits will be 0, and hence the answer will also be 0. &lt;br /&gt;&lt;br /&gt;Can you find any numbers to which when we apply the above mentioned rule repeatedly, we never end up at 0? &lt;br /&gt; Brain Teaser No : 00474&lt;br /&gt;&lt;br /&gt;Given any whole number take the sum of the digits, and the product of the digits, and multiply these together to get a new whole number. &lt;br /&gt;&lt;br /&gt;For example, starting with 6712, the sum of the digits is (6+7+1+2) = 16, and the product of the digits is (6*7*1*2) = 84. The answer in this case is then 84 x 16 = 1344. &lt;br /&gt;&lt;br /&gt;If we do this again starting from 1344, we get (1+3+4+4) * (1*3*4*4) = 576 &lt;br /&gt;&lt;br /&gt;And yet again (5+7+6) * (5*7*6) = 3780 &lt;br /&gt;&lt;br /&gt;At this stage we know what the next answer will be (without working it out) because, as one digit is 0, the product of the digits will be 0, and hence the answer will also be 0. &lt;br /&gt;&lt;br /&gt;Can you find any numbers to which when we apply the above mentioned rule repeatedly, we never end up at 0? &lt;br /&gt;&lt;br /&gt;There were N stations on a railroad. After adding X stations 46 additional tickets have to be printed. &lt;br /&gt;&lt;br /&gt;Find N and X.&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Let before adding X stations, total number of tickets &lt;br /&gt;t = N(N-1) &lt;br /&gt;&lt;br /&gt;After adding X stations total number of tickets are &lt;br /&gt;t + 46 = (N+X)(N+X-1) &lt;br /&gt;&lt;br /&gt;Subtracting 1st from 2nd &lt;br /&gt;46 = (N+X)(N+X-1) - N(N-1) &lt;br /&gt;46 = N2 + NX - N + NX + X2 - X - N2 + N &lt;br /&gt;46 = 2NX + X2 - X &lt;br /&gt;46 = (2N - 1)X + X2 &lt;br /&gt;X2 + (2N - 1)X - 46 = 0 &lt;br /&gt;&lt;br /&gt;Now there are only two possible factors of 46. They are (46,1) and (23,2) &lt;br /&gt;&lt;br /&gt;Case I: (46,1) &lt;br /&gt;2N - 1 = 45 &lt;br /&gt;2N = 46 &lt;br /&gt;N = 23 &lt;br /&gt;And X = 1 &lt;br /&gt;&lt;br /&gt;Case II: (23,2) &lt;br /&gt;2N - 1 = 21 &lt;br /&gt;2N = 22 &lt;br /&gt;N = 11 &lt;br /&gt;And X = 2 &lt;br /&gt;&lt;br /&gt;Hence, there are 2 possible answers.&lt;br /&gt;&lt;br /&gt;An emergency vehicle travels 10 miles at a speed of 50 miles per hour. &lt;br /&gt;&lt;br /&gt;How fast must the vehicle travel on the return trip if the round-trip travel time is to be 20 minutes?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;75 miles per hour &lt;br /&gt;&lt;br /&gt;While going to the destination, the vehicle travels 10 mils at the speed of 50 miles per hour. So the time taken to travel 10 miles is &lt;br /&gt;= (60 * 10) / 50 &lt;br /&gt;= 12 minutes &lt;br /&gt;&lt;br /&gt;Now it's given that round-trip travel time is 20 minutes. So the vehicle should complete its return trip of 10 miles in 8 minutes. So the speed of the vehicle must &lt;br /&gt;= (60 * 10) / 8 &lt;br /&gt;= 75 miles per hour&lt;br /&gt;All of the students at a college are majoring in psychology, business, or both. 73% of the students are psychology majors, &amp; 62% are business majors. &lt;br /&gt;&lt;br /&gt;If there are 200 students, how many of them are majoring in both psychology &amp; business?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;70 students are majoring in both, psychology &amp; business &lt;br /&gt;&lt;br /&gt;If 73% of the students are psychology majors, we know that 27% are not psychology majors. By the same reasoning, 38% are not business majors, because 62% of the students do major in business. So: 27 + 38 = 65 &lt;br /&gt;&lt;br /&gt;65% of the students are not majoring in both psychology &amp; business, so 35% are double majors, a total of 70 students.&lt;br /&gt;Two trains starting at same time, one from Bangalore to Mysore and other in opposite direction arrive at their destination 1hr and 4hrs respectively after passing each other. &lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt; &lt;br /&gt;&lt;br /&gt;The speed of Bangalore-Mysore train is TWICE the speed of Mysore-Bangalore train. &lt;br /&gt;&lt;br /&gt;Let the distance between Bangalore and Mysore is D kms. &lt;br /&gt;Also, let speed of the train from Bangalore to Mysore is X km/hr and speed of the tain from Mysore to Bangalore is Y km/hr. &lt;br /&gt;&lt;br /&gt;Now, assume that both the trains met each other at T kms from the Bangalore (point P in figure) &lt;br /&gt;Time taken by Bangalore-Mysore train to reach P = Time taken by Mysore-Bangalore train to reach P &lt;br /&gt;( T / X ) = ( D - T ) / Y -----equ(I) &lt;br /&gt;&lt;br /&gt;Also, Bangalore-Mysore train and Mysore-Bangalore train arrive destination 1 hr and 4 hrs respectively after passing each other. It means that Bangalore-Mysore train travels (D - T) kms in 1 hr at X km/hr and Mysore-Bangalore train travels T kms in 4 hrs at Y km/hr. Hence, &lt;br /&gt;( D - T ) = X and &lt;br /&gt;T = 4 * Y &lt;br /&gt;&lt;br /&gt;Substituting these values in equation I, we get &lt;br /&gt;( 4 * Y ) / X = X / Y &lt;br /&gt;4 * Y * Y = X * X &lt;br /&gt;2 * Y = X &lt;br /&gt;&lt;br /&gt;Hence, the speed of Bangalore-Mysore train is TWICE the speed of Mysore-Bangalore train.How much faster is one train from other?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;49 times &lt;br /&gt;&lt;br /&gt;Let's assume that everyone clinked their mug with friend to his left only. It means that there are total 49 clinks. Now the right clink of each person is left clink of the person on right which is already happened. Hence, there are only 49 clinks.&lt;br /&gt;&lt;br /&gt;Mrs. Watsherface had a garage sale. A custmer named Gina bought an old lamp and a rug. She paid a total of $5.25 for everything. The rug cost 25 cents more than the lamp. &lt;br /&gt;&lt;br /&gt;How much did each cost?&lt;br /&gt;Submitted by : Kimi&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The lamp cost $ 2.50 and the rug cost $ 2.75 &lt;br /&gt;&lt;br /&gt;A simple one. &lt;br /&gt;&lt;br /&gt;Assume that the lamp cost $ L. &lt;br /&gt;Hence the rug must have cost $ (L + 0.25) &lt;br /&gt;Also, total cost is $ 5.25, Hence the equation : &lt;br /&gt;L + L + 0.25 = 5.25 &lt;br /&gt;2 * L = 5 &lt;br /&gt;L = 2.50 &lt;br /&gt;&lt;br /&gt;Hence, the lamp cost $ 2.50 and the rug cost $ 2.75&lt;br /&gt;&lt;br /&gt;Brain Teaser No : 00518&lt;br /&gt;&lt;br /&gt;Write 1111......(243 times) i.e. a 243 digit number with all 1s. &lt;br /&gt;&lt;br /&gt;Prove that it is divisible by 243.&lt;br /&gt;SubmittAnswer&lt;br /&gt;&lt;br /&gt;Prove it using the mathematical induction. &lt;br /&gt;&lt;br /&gt;First here are a couple of things to note: &lt;br /&gt;&lt;br /&gt;[1] A number whose digits add up to a multiple of three is divisable by 3. &lt;br /&gt;e.g. 369: 3+6+9=18: 1+8=9 which is a multiple of 3 hence 369 is divisable by 3. &lt;br /&gt;&lt;br /&gt;[2] Whenever a number (X) is multiplied with another number (Y) then the product (X*Y) will have all the factors of X as well as all the factors of Y in its set of factors. &lt;br /&gt;e.g. if X has factors of (1,P,Q,X) and Y has factors of (1,Q,R,Y) then X*Y has factors of (1,P,Q,Q,R,X,Y). &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Let &lt;br /&gt;N = any series of digits (e.g. N=369) &lt;br /&gt;D = the number of digits in N (e.g. if N=369 then D=3) &lt;br /&gt;P = is a number constructed in the following way : a 1, followed by (D-1) 0s, followed by another 1, followed by (D-1) 0s, followed by another 1. (e.g. if N=369 then D=3 and P would be 1001001) Note that P will always be divisible by 3. &lt;br /&gt;&lt;br /&gt;Also, if we multiply N with P we are essentially repeating N for (D-1) times. &lt;br /&gt;e.g. if N=369 then D=3, P=1001001 and N*P=369369369 &lt;br /&gt;&lt;br /&gt;Let's start with N=111. It is clear that N is divisible by 3. (From [1]) &lt;br /&gt;Also, D=3 and P=1001001 &lt;br /&gt;N*P=111111111 (9 times) &lt;br /&gt;The resulting number 111111111 must be divisible by 9 as N and P both are divisible by 3. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Now, let's start with N=111111111. It is clear that N is divisible by 9. &lt;br /&gt;Also, D=9 and P=1000000001000000001 &lt;br /&gt;N*P=111111111... (27 times) &lt;br /&gt;The resulting number 1111111... (27 times) must be divisible by 27 as N is divisible by 9 and P is divisible by 3. &lt;br /&gt;&lt;br /&gt;Repeat the same procedure for N=1111111... (27 times) The resulting number 1111111... (81 times) must be divisible by 81 as N is divisible by 27 and P is divisible by 3. &lt;br /&gt;&lt;br /&gt;Similarly, for N=1111111... (81 times) The resulting number 1111111... (243 times) must be divisible by 243 as N is divisible by 81 and P is divisible by 3. &lt;br /&gt;&lt;br /&gt;Thus, 1111111... (243 times) is divisible by 243. &lt;br /&gt;&lt;br /&gt;Thanks to Ryan Hutcherson for solution !!!&lt;br /&gt;edKaran bought a little box of midget matches, each one inch in length. He found that he could arrange them all in the form of a triangle whose area was just as many square inches as there were matches. &lt;br /&gt;&lt;br /&gt;He then used up six of the matches, and found that with the remainder he could again construct another triangle whose area was just as many square inches as there were matches. &lt;br /&gt;&lt;br /&gt;And using another six matches he could again do precisely the same. &lt;br /&gt;&lt;br /&gt;How many matches were there in the box originally? &lt;br /&gt;&lt;br /&gt;Note that the match-box can hold maximum of 50 matches.&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Initially, there were 42 or 36 matches in the match-box. &lt;br /&gt;&lt;br /&gt;There are 42 matches in the box with which he could form a triangle 20, 15, 7, with an area of 42 square inches. After 6 matches had been used, the remaining 36 matches would form a triangle 17, 10, 9, with an area of 36 square inches. After using another 6 matches, the remaining 30 matches would form a triangle 13, 12, 5, with an area of 30 square inches. After using another 6, the 24 remaining would form a triangle 10, 8, 6, with an area of 24 square inches. &lt;br /&gt;&lt;br /&gt;Thus, there are two possible answers. There were either 42 or 36 matches in the match-box. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Also it is interesting to know that there are just 5 such triangles for which the perimeter and the area is the same (assuming all sides are integers) and they are : &lt;br /&gt;1. 24 (10, 8, 6) &lt;br /&gt;2. 30 (13, 12, 5) &lt;br /&gt;3. 36 (17, 10, 9) &lt;br /&gt;4. 42 (20, 15, 7) &lt;br /&gt;5. 60 (29, 25, 6)&lt;br /&gt;&lt;br /&gt;Find the values of each of the alphabets.&lt;br /&gt;&lt;br /&gt;            N O O N&lt;br /&gt;&lt;br /&gt;            S O O N&lt;br /&gt;&lt;br /&gt;         +  M O O N&lt;br /&gt;&lt;br /&gt;         ----------&lt;br /&gt;&lt;br /&gt;            J U N E&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Using trial and error. There are 2 solutions to it and may be more.&lt;br /&gt;&lt;br /&gt;            2 4 4 2&lt;br /&gt;&lt;br /&gt;            1 4 4 2&lt;br /&gt;&lt;br /&gt;         +  5 4 4 2&lt;br /&gt;&lt;br /&gt;         ----------&lt;br /&gt;&lt;br /&gt;            9 3 2 6&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;            4 1 1 4&lt;br /&gt;&lt;br /&gt;            5 1 1 4&lt;br /&gt;&lt;br /&gt;         +  0 1 1 4&lt;br /&gt;&lt;br /&gt;         ----------&lt;br /&gt;&lt;br /&gt;            9 3 4 2&lt;br /&gt;&lt;br /&gt;We have to fill number from 1 to 12 at the intersection point of two or more lines. We have to construct a star using two triangle. The sum of all number lying in straight lines should be same. This can be easilty understood by the fig. and hence solved.&lt;br /&gt;Submitted by : Vaibhav Gupta &lt;br /&gt;Submit&lt;br /&gt;Answer&lt;br /&gt; &lt;br /&gt;Users&lt;br /&gt;Answer (3)&lt;br /&gt; &lt;br /&gt;BrainVista&lt;br /&gt;Answer&lt;br /&gt; &lt;br /&gt;Puzzle A&lt;br /&gt;Friend&lt;br /&gt; &lt;br /&gt;Add to&lt;br /&gt;Favourite&lt;br /&gt;&lt;br /&gt;&lt;br /&gt; &lt;br /&gt;&lt;br /&gt;We have one answer where sum of all the numbers lying in straight lines is 26. &lt;br /&gt;&lt;br /&gt;If you have others, do submit them.&lt;br /&gt; Brain Teaser No : 00355&lt;br /&gt;&lt;br /&gt;Montu, Bantu, Chantu and Pintu have pets. &lt;br /&gt;&lt;br /&gt;Montu says, "If Pintu and I each have a dog, then exactly one of Bantu and Chantu has a dog." &lt;br /&gt;&lt;br /&gt;Bantu says, "If Chantu and I each have a cat, then exactly one of Montu and Pintu has a dog." &lt;br /&gt;&lt;br /&gt;Chantu says, "If Montu and I each have a dog, then exactly one of Bantu and Pintu has a cat." &lt;br /&gt;&lt;br /&gt;Pintu says, "If Bantu and I each have a cat, then exactly one of Bantu and I has a dog." &lt;br /&gt;&lt;br /&gt;Only one of the four is telling the truth. Who is telling the truth? &lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Bantu is telling the truth. &lt;br /&gt;&lt;br /&gt;For a IF-THEN statement to be false, IF part has to be true and THEN part has to be false. &lt;br /&gt;&lt;br /&gt;Since only one statement is true and remaining three are false, IF part of three statements are true &amp; THEN part of one statement is true. Let's put the given information in table. The pet-name in the normal text represents the IF part and the pet-name in round brackets represents the THEN part. &lt;br /&gt;  Montu Bantu Chantu Pintu&lt;br /&gt;Montu says Dog (Dog) (Dog) Dog&lt;br /&gt;Bantu says (Dog) Cat Cat (Dog)&lt;br /&gt;Chantu says Dog (Cat) Dog (Cat)&lt;br /&gt;Pintu says   Cat&lt;br /&gt;(Dog)   Cat&lt;br /&gt;(Dog)&lt;br /&gt;&lt;br /&gt;It is clear that the IF part of the statements made by Montu, Chantu and Pintu are true as they do not contradict each other. And the IF part of the statement made by Bantu is false. &lt;br /&gt;&lt;br /&gt;Thus, Bantu is telling the truth. &lt;br /&gt;&lt;br /&gt;Montu have a Dog and may or may not have a Cat. &lt;br /&gt;Bantu have a Cat. &lt;br /&gt;Chantu have a Dog. &lt;br /&gt;Pintu have a Dog and a Cat.&lt;br /&gt; Brain Teaser No : 00520&lt;br /&gt;&lt;br /&gt;Somebody marked the six faces of a die with the numbers 1, 2 and 3 - each number twice. The die was put on a table. Four people - Abu, Babu, Calu and Dabu - sat around the table so that each one was able to see only three sides of the die at a glance. &lt;br /&gt;• Abu sees the number 1 and two even numbers. &lt;br /&gt;• Babu and Calu can see three different numbers each. &lt;br /&gt;• Dabu sees number 2 twice and he can't remember the third number.&lt;br /&gt;What number is face down on the table? &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Number 3 is face down on the table. &lt;br /&gt;&lt;br /&gt;If Abu can see two even numbers i.e. number 2 twice, and if Dabu can see number 2 twice, then number 2 must be facing up. &lt;br /&gt;&lt;br /&gt;Now everything else is simple. (see the following diagram)&lt;br /&gt;&lt;br /&gt;       Dabu            Abu&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;                1&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;            3   2   2&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;                1&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;       Calu            Babu&lt;br /&gt;Thus, the number hidden from the view is number 3 and hence the answer.&lt;br /&gt;Two identical pack of cards A and B are shuffled throughly. One card is picked from A and shuffled with B. The top card from pack A is turned up. If this is the Queen of Hearts, what are the chances that the top card in B will be the King of Hearts?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;52 / 2703 &lt;br /&gt;&lt;br /&gt;There are two cases to be considered. &lt;br /&gt;&lt;br /&gt;CASE 1 : King of Hearts is drawn from Pack A and shuffled with Pack B &lt;br /&gt;&lt;br /&gt;Probability of drawing King of Hearts from Pack A = 1/51 (as Queen of Hearts is not to be drawn) &lt;br /&gt;Probability of having King of Hearts on the top of the Pack B = 2/53 &lt;br /&gt;&lt;br /&gt;So total probability of case 1 = (1/51) * (2/53) = 2 / (51 * 53) &lt;br /&gt;&lt;br /&gt;CASE 2 : King of Hearts is not drawn from Pack A &lt;br /&gt;&lt;br /&gt;Probability of not drawing King of Hearts from Pack A = 50/51 (as Queen of Hearts is not to be drawn) &lt;br /&gt;Probability of having King of Hearts on the top of the Pack B = 1/53 &lt;br /&gt;&lt;br /&gt;So total probability of case 2 = (50/51) * (1/53) = 50 / (51 * 53) &lt;br /&gt;&lt;br /&gt;Now adding both the probability, the required probability is &lt;br /&gt;= 2 / (51 * 53) + 50 / (51 * 53) &lt;br /&gt;= 52 / (51 * 53) &lt;br /&gt;= 52 / 2703 &lt;br /&gt;= 0.0192378&lt;br /&gt;How many possible combinations are there in a 3x3x3 rubics cube? &lt;br /&gt;&lt;br /&gt;In other words, if you wanted to solve the rubics cube by trying different combinations, how many might it take you (worst case senerio)? &lt;br /&gt;&lt;br /&gt;How many for a 4x4x4 cube?&lt;br /&gt;Submitted&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;There are 4.3252 * 10^19 possible combinations for 3x3x3 Rubics and 7.4012 * 10^45 possible combinations for 4x4x4 Rubics. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Let's consider 3x3x3 Rubics first. &lt;br /&gt;&lt;br /&gt;There are 8 corner cubes, which can be arranged in 8! ways. &lt;br /&gt;Each of these 8 cubes can be turned in 3 different directions, so there are 3^8 orientations altogether. But if you get all but one of the corner cube into chosen positions and orientations, only one of 3 orientations of the final corner cube is possible. Thus, total ways corner cubes can be placed = (8!) * (3^8)/8 = (8!) * (3^7) &lt;br /&gt;&lt;br /&gt;Similarly, 12 edge cubes can be arranged in 12! ways. &lt;br /&gt;Each of these 12 cubes can be turned in 2 different directions, so there are 2^12 orientations altogether. But if you get all but one of the edge cube into chosen positions and orientations, only one of 2 orientations of the final edge cube is possible. Thus, total ways edge cubes can be placed = (12!) * (2^12)/2 = (12!) * (2^11) &lt;br /&gt;&lt;br /&gt;Here, we have essentially pulled the cubes apart and stuck cubes back in place wherever we please. In reality, we can only move cubes around by turning the faces of the cubes. It turns out that you can't turn the faces in such a way as to switch the positions of two cubes while returning all the others to their original positions. Thus if you get all but two cubes in place, there is only one attainable choice for them (not 2!). Hence, we must divide by 2. &lt;br /&gt;&lt;br /&gt;Total different possible combinations are &lt;br /&gt;= [(8!) * (3^7)] * [(12!) * (2^11)] / 2 &lt;br /&gt;= (8!) * (3^7) * (12!) * (2^10) &lt;br /&gt;= 4.3252 * 10^19 &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Similarly, for 4x4x4 Rubics total different possible combinations are &lt;br /&gt;= [(8!) * (3^7)] * [(24!)] * [(24!) / (4!^6)] / 24 &lt;br /&gt;= 7.4011968 * 10^45 &lt;br /&gt;&lt;br /&gt;Note that there are 24 edge cubes, which you can not turn in 2 orientations (hence no 2^24 / 2). Also, there are 4 center cubes per face i.e. (24!) / (4!^6). You can switch 2 cubes without affecting the rest of the combination as 4*4*4 has even dimensions (hence no division by 2). But pattern on one side is rotated in 4 directions over 6 faces, hence divide by 24.&lt;br /&gt;&lt;br /&gt; Brain Teaser No : 00528&lt;br /&gt;&lt;br /&gt;Substitute digits for the letters to make the following relation true.&lt;br /&gt;               N  E  V  E  R&lt;br /&gt;&lt;br /&gt;               L  E  A  V  E&lt;br /&gt;&lt;br /&gt;            +           M  E&lt;br /&gt;&lt;br /&gt;            -----------------&lt;br /&gt;&lt;br /&gt;               A  L  O  N  E&lt;br /&gt;Note that the leftmost letter can't be zero in any word. Also, there must be a one-to-one mapping between digits and letters. e.g. if you substitute 3 for the letter M, no other letter can be 3 and all other M in the puzzle must be 3. &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;A tough one!!! &lt;br /&gt;&lt;br /&gt;Since R + E + E = 10 + E, it is clear that R + E = 10 and neither R nor E is equal to 0 or 5. This is the only entry point to &lt;br /&gt;&lt;br /&gt;solve it. Now use trial-n-error method.&lt;br /&gt;&lt;br /&gt;     N  E  V  E  R               2  1  4  1  9&lt;br /&gt;&lt;br /&gt;     L  E  A  V  E               3  1  5  4  1&lt;br /&gt;&lt;br /&gt;  +           M  E            +           6  1&lt;br /&gt;&lt;br /&gt;  -----------------           -----------------&lt;br /&gt;&lt;br /&gt;     A  L  O  N  E               5  3  0  2  1&lt;br /&gt;There are 20 people in your applicant pool, including 5 pairs of identical twins. &lt;br /&gt;&lt;br /&gt;If you hire 5 people randomly, what are the chances you will hire at least 1 pair of identical twins? (Needless to say, this could cause trouble ;))&lt;br /&gt;SubmAnswer&lt;br /&gt;&lt;br /&gt;The probability to hire 5 people with at least 1 pair of identical twins is 25.28% &lt;br /&gt;&lt;br /&gt;5 people from the 20 people can be hired in 20C5 = 15504 ways. &lt;br /&gt;&lt;br /&gt;Now, divide 20 people into two groups of 10 people each : &lt;br /&gt;G1 - with all twins &lt;br /&gt;G2 - with all people other than twins &lt;br /&gt;&lt;br /&gt;Let's find out all possible ways to hire 5 people without a single pair of indentical twins. &lt;br /&gt;People from G1 People from G2 No of ways to hire G1 without a single pair of indentical twins No of ways to hire G2 Total ways&lt;br /&gt;0 5 10C0 10C5 252&lt;br /&gt;1 4 10C1 10C4 2100&lt;br /&gt;2 3 10C2 * 8/9 10C3 4800&lt;br /&gt;3 2 10C3 * 8/9 * 6/8 10C2 3600&lt;br /&gt;4 1 10C4 * 8/9 * 6/8 * 4/7 10C1 800&lt;br /&gt;5 0 10C5 * 8/9 * 6/8 * 4/7 * 2/6 10C0 32&lt;br /&gt;Total 11584&lt;br /&gt;&lt;br /&gt;Thus, total possible ways to hire 5 people without a single pair of indentical twins = 11584 ways &lt;br /&gt;&lt;br /&gt;So, total possible ways to hire 5 people with at least a single pair of indentical twins = 15504 - 11584 = 3920 ways &lt;br /&gt;&lt;br /&gt;Hence, the probability to hire 5 people with at least a single pair of indentical twins &lt;br /&gt;= 3920/15504 &lt;br /&gt;= 245/969 &lt;br /&gt;= 0.2528 &lt;br /&gt;= 25.28%itted&lt;br /&gt;Veeru says to Jay, "Can you figure out how many Eggs I have in my bucket?" He gives 3 clues to Jay: If the number of Eggs I have &lt;br /&gt;1. is a multiple of 5, it is a number between 1 and 19 &lt;br /&gt;2. is not a multiple of 8, it is a number between 20 and 29 &lt;br /&gt;3. is not a multiple of 10, it is a number between 30 and 39&lt;br /&gt;How many Eggs does Veeru have in his bucket?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;32 eggs &lt;br /&gt;&lt;br /&gt;Let's apply all 3 condition separately and put all possible numbers together. &lt;br /&gt;&lt;br /&gt;First condition says that if multiple of 5, then the number is between 1 and 19. Hence, the possible numbers are (5, 10, 15, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39) &lt;br /&gt;&lt;br /&gt;Second condition says that if not a multiple of 8, then the number is between 20 and 29. Hence, the possible numbers are (8, 16, 20, 21, 22, 23, 25, 26, 27, 28, 29, 32) &lt;br /&gt;&lt;br /&gt;Third condition says that if not a multiple of 10, then the number is between 30 and 39. Hence, the possible numbers are (10, 20, 31, 32, 33, 34, 35, 36, 37, 38, 39) &lt;br /&gt;&lt;br /&gt;Only number 32 is there in all 3 result sets. That means that only number 32 satisfies all three conditions. Hence, Veeru have 32 eggs in his bucket.&lt;br /&gt;&lt;br /&gt;Submit&lt;br /&gt;Answer&lt;br /&gt; &lt;br /&gt;Users&lt;br /&gt;Answer (14)&lt;br /&gt; &lt;br /&gt;BrainV&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Mr. Black, Mr. White and Mr. Grey were chatting in the Yahoo conference. They were wearing a black suit, a white suit and a grey suit, not necessarily in the same order. &lt;br /&gt;&lt;br /&gt;Mr. Grey sent message, "We all are wearing suit that are of the same color as our names but none of us is wearing a suit that is the same color as his name." &lt;br /&gt;&lt;br /&gt;On that a person wearing the white suit replied, "What difference does that make?" &lt;br /&gt;&lt;br /&gt;Can you tell what color suit each of the three persons had on?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Mr. Grey is wearing Black suit. &lt;br /&gt;Mr. White is wearing Grey suit. &lt;br /&gt;Mr. Black is wearing White suit. &lt;br /&gt;&lt;br /&gt;Mr. Grey must not be wearing grey suit as that is the same colour as his name. Also, he was not wearing white suit as the person wearing white suit responded to his comment. So Mr Grey must be wearing a black suit. &lt;br /&gt;&lt;br /&gt;Similarly, Mr. White must be wearing either black suit or grey suit. But Mr. Grey is wearing a black suit. Hence, Mr. White must be wearing a grey suit. &lt;br /&gt;&lt;br /&gt;And, Mr. Black must be wearing white suit.&lt;br /&gt;Substitute numbers for the letters so that the following mathematical expressions are correct.&lt;br /&gt;   ABC           DEF           GHI&lt;br /&gt;&lt;br /&gt;   --- = IE      --- = IE      --- = IE&lt;br /&gt;&lt;br /&gt;    3             6             9&lt;br /&gt;Note that the same number must be used for the same letter whenever it appears.&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;A=2, B=1, C=9, D=4, E=3, F=8, G=6, H=5, I=7 &lt;br /&gt;&lt;br /&gt;Let's start with GHI = 9 * IE. Note that I appears on both the side. Also, after multiplying IE by 9 the answer should have I at the unit's place. The possible values of IE are 19, 28, 37, 46, 55, 64, 73, 82 and 91; out of which only 64, 73 and 82 satisfies the condition. (as all alphabet should represent different digits) &lt;br /&gt;&lt;br /&gt;Now, consider DEF = 6 * IE. Out of three short-listed values, only 73 satisfies the equation. Also, ABC = 3 * IE is satisfied by 73. &lt;br /&gt;&lt;br /&gt;Hence, A=2, B=1, C=9, D=4, E=3, F=8, G=6, H=5, I=7&lt;br /&gt;     219           438           657&lt;br /&gt;&lt;br /&gt;     --- = 73      --- = 73      --- = 73&lt;br /&gt;&lt;br /&gt;      3             6             9&lt;br /&gt;&lt;br /&gt;Brain Teaser No : 00374&lt;br /&gt;&lt;br /&gt;A, B, C and D are related to each other. &lt;br /&gt;• One of the four is the opposite sex from each of the other three. &lt;br /&gt;• D is A's brother or only daughter. &lt;br /&gt;• A or B is C's only son. &lt;br /&gt;• B or C is D's sister.&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;A, B &amp; D are males; C is female. B is C's only son. A &amp; D are C's brothers.&lt;br /&gt;       A(male) --- C(female) --- D(male)&lt;br /&gt;&lt;br /&gt;                       |&lt;br /&gt;&lt;br /&gt;                       |&lt;br /&gt;&lt;br /&gt;                    B(male)&lt;br /&gt;Work out which relation can hold and discard the contradictory options. &lt;br /&gt;&lt;br /&gt;From (2) and (4), D can not be a only daughter and have a sister (B or C). Hence, D is A's brother i.e. D is a Male. &lt;br /&gt;&lt;br /&gt;From (4), let's say that B is D's sister i.e. B is Female. &lt;br /&gt;From (3), A is C's only son i.e. A is Male. &lt;br /&gt;But D is A's brother which means that A is not C's only son. Hence, our assumption was wrong. &lt;br /&gt;&lt;br /&gt;Thus, C is D's sister i.e. C is Female. And B must be C's only son. &lt;br /&gt;&lt;br /&gt;Now it is clear that D &amp; B are Males and C is Female. A must be a Male as only one of them is of opposite sex from each of the other three. And he is C &amp; D's brother.How are they related to each other?&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Dr. DoLittle always goes walking to the clinic and takes the same time while going and while coming back. One day he noticed something. &lt;br /&gt;&lt;br /&gt;When he left the home, the hour hand and the minute hand were exactly opposite to each other and when he reached the clinic, they were together. &lt;br /&gt;&lt;br /&gt;Similarly, when he left the clinic, the hour hand and the minute hand were together and when he reached the home, they were exactly opposite to each other. &lt;br /&gt;&lt;br /&gt;How much time does Dr. DoLittle take to reach home from the clinic? Give the minimal possible answer.&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;32 minutes 43.6 seconds &lt;br /&gt;&lt;br /&gt;In twelve hours, the minute hand and the hour hand are together for 11 times. It means that after every 12/11 hours, both the hands are together. &lt;br /&gt;&lt;br /&gt;Similarly in twelve hours, the minute hand and the hour hand are exactly opposite to each other for 11 times. It means that after every 12/11 hours, both the hands are opposite. &lt;br /&gt;&lt;br /&gt;Now, let's take an example. We know that at 12 both the hands are together and at 6 both the hands are exactly opposite to each other. &lt;br /&gt;&lt;br /&gt;After 6, both the hands are in opposition at [6+(12/11)] hours, [6+2*(12/11)] hours, [6+3*(12/11)] hours and so on. The sixth such time is [6+6*(12/11)] hours which is the first time after 12. Thus after 12, both the hands are opposite to each other at 12:32:43.6 &lt;br /&gt;&lt;br /&gt;Hence, Dr. DoLittle takes 32 minutes and 43.6 seconds to reach home from the clinic.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;SlowRun Express runs between Bangalore and Mumbai, For the up as well as the down journey, the train leaves the starting station at 10:00 PM everyday and reaches the destination at 11:30 PM after three days. &lt;br /&gt;&lt;br /&gt;Mr. Haani once travelled by SlowRun Express from Mumbai to Bangalore. How many SlowRun Express did he cross during his journey?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Mr. Haani crossed 7 SlowRun Expresses during his journey. &lt;br /&gt;&lt;br /&gt;Let's say that Mr. Haani travelled by SlowRun Express on Wednesday 10:00PM from Mumbai. The first train he would have crossed is the one scheduled to arrive at Mumbai at 11:30 PM the same day i.e. the one that left Bangalore at 10:00 PM on last Sunday. &lt;br /&gt;&lt;br /&gt;Also, he would have crossed the last train just before reaching Bangalore on Saturday. &lt;br /&gt;&lt;br /&gt;Thus, Mr. Haani must have crossed 7 SlowRun Expresses during his journey.&lt;br /&gt;Six cabins numbered 1-6 consecutively, are arranged in a row and are separated by thin dividers. These cabins must be assigned to six staff members based on following facts. &lt;br /&gt;1. Miss Shalaka's work requires her to speak on the phone frequently throughout the day. &lt;br /&gt;2. Miss Shudha prefers cabin number 5 as 5 is her lucky number. &lt;br /&gt;3. Mr. Shaan and Mr. Sharma often talk to each other during their work and prefers to have adjacent cabins. &lt;br /&gt;4. Mr. Sinha, Mr. Shaan and Mr. Solanki all smoke. Miss Shudha is allergic to smoke and must have non-smokers adjacent to her. &lt;br /&gt;5. Mr. Solanki needs silence during work.&lt;br /&gt;Can you tell the cabin numbers of each of them?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The cabins from left to right (1-6) are of Mr. Solanki, Mr. Sinha, Mr. Shaan, Mr. Sharma, Miss Shudha and Miss Shalaka. &lt;br /&gt;&lt;br /&gt;From (2), cabin number 5 is assigned to Miss Shudha. &lt;br /&gt;&lt;br /&gt;As Miss Shudha is allergic to smoke and Mr. Sinha, Mr. Shaan &amp; Mr. Solanki all smoke, they must be in cabin numbers 1, 2 and 3 not necessarily in the same order. Also, Miss Shalaka and Mr. Sharma must be in cabin 4 and 6. &lt;br /&gt;&lt;br /&gt;From (3), Mr. Shaan must be in cabin 3 and Mr. Sharma must be in cabin 4. Thus, Miss Shalaka is in cabin 6. &lt;br /&gt;&lt;br /&gt;As Mr. Solanki needs silence during work and Mr. Shaan is in cabin 3 who often talks to Mr. Sharma during work, Mr. Solanki must be in cabin 1. Hence, Mr. Sinha is in cabin 2. &lt;br /&gt;&lt;br /&gt;Thus, the cabins numbers are &lt;br /&gt;1# Mr. Solanki, &lt;br /&gt;2# Mr. Sinha, &lt;br /&gt;3# Mr. Shaan, &lt;br /&gt;4# Mr. Sharma, &lt;br /&gt;5# Miss Shudha, &lt;br /&gt;6# Miss Shalaka&lt;br /&gt;SkyFi city is served by 6 subway lines - A, E, I, O, U and Z. &lt;br /&gt;• When it snows, morning service on line E is delayed. &lt;br /&gt;• When it rains or snows, service on the lines A, U and Z is delayed both morning and afternoon. &lt;br /&gt;• When the temperature drops below 20 C, afternoon service is cancelled on either line A or line O, but not both. &lt;br /&gt;• When the temperature rises above 40 C, afternoon service is cancelled on either line I or line Z, but not both. &lt;br /&gt;• When service on line A is delayed or cancelled, service on line I is also delayed. &lt;br /&gt;• When service on line Z is delayed or cancelled, service on line E is also delayed.&lt;br /&gt;On February 10, it snows all day with the temperature at 18C. On how many lines service will be delayed or cancelled, including both morning and afternoon?&lt;br /&gt;SkyFi city is served by 6 subway lines - A, E, I, O, U and Z. &lt;br /&gt;• When it snows, morning service on line E is delayed. &lt;br /&gt;• When it rains or snows, service on the lines A, U and Z is delayed both morning and afternoon. &lt;br /&gt;• When the temperature drops below 20 C, afternoon service is cancelled on either line A or line O, but not both. &lt;br /&gt;• When the temperature rises above 40 C, afternoon service is cancelled on either line I or line Z, but not both. &lt;br /&gt;• When service on line A is delayed or cancelled, service on line I is also delayed. &lt;br /&gt;• When service on line Z is delayed or cancelled, service on line E is also delayed.&lt;br /&gt;On February 10, it snows all day with the temperature at 18C. On how many lines service will be delayed or cancelled, including both morning and afternoon?&lt;br /&gt;In a certain game, if 2 wixsomes are worth 3 changs, and 4 changs are worth 1 plut, then 6 plutes are worth how many wixsomes?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;It is given that &lt;br /&gt;2 wixsomes = 3 changs &lt;br /&gt;8 wixsomes = 12 changs ----- (I) &lt;br /&gt;&lt;br /&gt;Also, given that &lt;br /&gt;4 changs = 1 plut &lt;br /&gt;12 changs = 3 plutes &lt;br /&gt;8 wixsomes = 3 plutes ----- From (I) &lt;br /&gt;&lt;br /&gt;Therefore, &lt;br /&gt;6 plutes = 16 wixsomes&lt;br /&gt;&lt;br /&gt;In a certain year, the number of girls who graduated from City High School was twice the number of boys. If 3/4 of the girls and 5/6 of the boys went to college immediately after graduation, what fraction of the graduates that year went to college immediately after graduation?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Assume that number of boys graduated from City High School = B &lt;br /&gt;Therefore, number of girls graduated from City High School = 2*B &lt;br /&gt;&lt;br /&gt;It is given that 3/4 of the girls and 5/6 of the boys went to college immediately after graduation. &lt;br /&gt;Hence, total students went to college &lt;br /&gt;= (3/4)(2*B) + (5/6)(B) &lt;br /&gt;= B * (3/2 + 5/6) &lt;br /&gt;= (7/3)B &lt;br /&gt;&lt;br /&gt;Fraction of the graduates that year went to college immediately after graduation &lt;br /&gt;= [(7/3)B] / [3*B] &lt;br /&gt;= 7/9 &lt;br /&gt;&lt;br /&gt;Therefore, the answer is 7/9&lt;br /&gt;&lt;br /&gt;A mule and a donkey were carrying full sacks on their backs. &lt;br /&gt;&lt;br /&gt;The mule started complaining that his load was too heavy. The donkey said to him "Why are you complaining? If you gave me one of your sacks I'd have double what you have and if I give you one of my sacks we'd have an even amount." &lt;br /&gt;&lt;br /&gt;How many sacks were each of them carrying? Give the minimal possible answer.&lt;br /&gt;SubmittAnswer&lt;br /&gt;&lt;br /&gt;The mule was carrying 5 sacks and the donkey was carrying 7 sacks. &lt;br /&gt;&lt;br /&gt;Let's assume that the mule was carrying M sacks and the donkey was carrying D sacks. &lt;br /&gt;&lt;br /&gt;As the donkey told the mule, "If you gave me one of your sacks I'd have double what you have." &lt;br /&gt;D + 1 = 2 * (M-1) &lt;br /&gt;D + 1 = 2M - 2 &lt;br /&gt;D = 2M - 3 &lt;br /&gt;&lt;br /&gt;The donkey also said, "If I give you one of my sacks we'd have an even amount." &lt;br /&gt;D - 1 = M + 1 &lt;br /&gt;D = M + 2 &lt;br /&gt;&lt;br /&gt;Comparing both the equations, &lt;br /&gt;2M - 3 = M + 2 &lt;br /&gt;M = 5 &lt;br /&gt;&lt;br /&gt;Substituting M=5 in any of above equation, we get D=7 &lt;br /&gt;&lt;br /&gt;Hence, the mule was carrying 5 sacks and the donkey was carrying 7 sacks.&lt;br /&gt;edTwo people enter a race in whick you run to a point and back. Person A runs 20 mph to and from the point. Person B runs to the point going 10 mph and 30 mph going back. &lt;br /&gt;&lt;br /&gt;Who came in first?&lt;br /&gt;Submitted&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Person A came in first. &lt;br /&gt;&lt;br /&gt;Let's assume that the distance between start and the point is D miles. &lt;br /&gt;&lt;br /&gt;Total time taken by Person A to finish &lt;br /&gt;= (D/20) + (D/20) &lt;br /&gt;= D/10 &lt;br /&gt;= 0.1D &lt;br /&gt;&lt;br /&gt;Total time taken by Person B to finish &lt;br /&gt;= (D/10) + (D/30) &lt;br /&gt;= 2D/15 &lt;br /&gt;= 0.1333D &lt;br /&gt;&lt;br /&gt;Thus, Person A is the Winner. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Alternatively (if you don't like mathematics ;)), analyse the situation as follow: &lt;br /&gt;&lt;br /&gt;Note that initially speed of Person A (20 mph) was twice the speed of Person B (10 mph). Hence, when Person A (20 mph forward) reached the point, Person B (10 mph forward) was halfway. When Person A (20 mph back) finished, Person B (still 10 mph forward) reached the point. &lt;br /&gt;&lt;br /&gt;Thus, Person A wins the race and by that time Person B covers only half the distance, no matter how far the point is!!!&lt;br /&gt;Mark ate half of a pizza on Monday. He ate half of what was left on Tuesday and so on. He followed this pattern for one week. &lt;br /&gt;&lt;br /&gt;How much of the pizza would he have eaten during the week?&lt;br /&gt;Submitted&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Mark would have ate 127/128 (99.22%) of the pizza during the week. &lt;br /&gt;&lt;br /&gt;Mark ate half the pizza on Monday. On Tuesday, he would have ate half of the remaining pizza i.e. 1/4 of the original pizza. Similarly, he would have ate 1/8 of the original pizza on Wednesday and so on for the seven days. &lt;br /&gt;&lt;br /&gt;Total pizza Mark ate during the week is &lt;br /&gt;= 1/2 + 1/4 + 1/8 + 1/16 + 1/32 + 1/64 + 1/128 &lt;br /&gt;= 127/128 &lt;br /&gt;= 99.22% of the original pizza&lt;br /&gt;In the General meeting of "Friends Club", Sameer said, "The repairs to the Club will come to a total of Rs 3120 and I propose that this amount should be met by the members, each paying an equal amount." &lt;br /&gt;&lt;br /&gt;The proposal was immediately agreed. However, four members of the Club chose to resign, leaving the remaining members to pay an extra Rs 26 each. &lt;br /&gt;&lt;br /&gt;How many members did the Club originally have?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The Club originally had 24 members. &lt;br /&gt;&lt;br /&gt;Assume that there were initially N members. &lt;br /&gt;&lt;br /&gt;As 4 members resigned and remaining members paid Rs 26 each, it means that total amount of 4 members is equal to Rs 26 each from remaining (N-4) members. Thus, &lt;br /&gt;&lt;br /&gt;4 * (3120 / N) = 26 * (N - 4) &lt;br /&gt;12480 = 26N2 - 104N &lt;br /&gt;26N2 - 104N - 12480 = 0 &lt;br /&gt;&lt;br /&gt;Solving the quadratic equation we get N=24. &lt;br /&gt;&lt;br /&gt;Hence, the Club originally had 24 members.&lt;br /&gt; Brain Teaser No : 00206&lt;br /&gt;&lt;br /&gt;A tank can be filled by pipe A in 30 minutes and by pipe B in 24 minutes. Outlet pipe C can empty the full tank in one hour and twenty minutes. &lt;br /&gt;&lt;br /&gt;If the tank is empty initially and if all the three pipes A, B and C are opened simultaneously, in how much time will the tank be full? &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The tank will be full in 16 minutes. &lt;br /&gt;&lt;br /&gt;In one minute, &lt;br /&gt;pipe A can fill 1/30 part of the tank. &lt;br /&gt;pipe B can fill 1/24 part of the tank. &lt;br /&gt;pipe C can empty 1/80 part of the tank. &lt;br /&gt;&lt;br /&gt;Thus, the net water level in one minute is &lt;br /&gt;= 1/30 + 1/24 - 1/80 &lt;br /&gt;= 15/240 part of the tank &lt;br /&gt;&lt;br /&gt;Hence, the tank will be full in 240/15 i.e. 16 minutes.&lt;br /&gt;&lt;br /&gt;A rich old Arab has three sons. When he died, he willed his 17 camels to the sons, to be divided as follows: &lt;br /&gt;&lt;br /&gt;First Son to get 1/2 of the camels Second Son to get 1/3rd of the camels Third Son to get 1/9th of the camels. &lt;br /&gt;&lt;br /&gt;The sons are sitting there trying to figure out how this can possibly be done, when a very old wise man goes riding by. They stop him and ask him to help them solve their problem. Without hesitation he divides the camels properly and continues riding on his way. &lt;br /&gt;&lt;br /&gt;How did he do it?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The old man temporarily added his camel to the 17, making a total of 18 camels. &lt;br /&gt;&lt;br /&gt;First son got 1/2 of it = 9 &lt;br /&gt;&lt;br /&gt;Second son got 1/3 of it = 6 &lt;br /&gt;&lt;br /&gt;Third son got 1/9 of it = 2 &lt;br /&gt;&lt;br /&gt;For a total of 17. He then takes his camel back and rides away......&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;There were two men standing on a street. The one says to the other, "I have 3 daughters, the product of their ages is 36. What is the age of the OLDEST daughter?" &lt;br /&gt;&lt;br /&gt;The second guy says, "I need more information." So, the first guy says, "The sum of their ages is equal to the address of the house across the street." &lt;br /&gt;&lt;br /&gt;The second guy looks at the address and says, "I still need more information." So, the first guy says, "My oldest daughter wears a red dress."&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The answer is 9 years. &lt;br /&gt;&lt;br /&gt;First you need to find all the possible sets of three numbers that when multiplied equals 36: &lt;br /&gt;&lt;br /&gt;1 1 36 &lt;br /&gt;1 2 18 &lt;br /&gt;1 3 12 &lt;br /&gt;1 4 9 &lt;br /&gt;1 6 6 &lt;br /&gt;2 2 9 &lt;br /&gt;2 3 6 &lt;br /&gt;3 3 4 &lt;br /&gt;&lt;br /&gt;Then you add the numbers together to find the sum &lt;br /&gt;1 1 36 = 38 &lt;br /&gt;1 2 18 = 21 &lt;br /&gt;1 3 12 = 16 &lt;br /&gt;1 4 9 = 14 &lt;br /&gt;1 6 6 = 13 &lt;br /&gt;2 2 9 = 13 &lt;br /&gt;2 3 6 = 11 &lt;br /&gt;3 3 4 = 10 &lt;br /&gt;&lt;br /&gt;Even though we don't know the address the guy knows it. For him to need more information that means that at least two of the sets of numbers has the same sum. Two of them do, 1 6 6 and 2 2 9. &lt;br /&gt;&lt;br /&gt;When the first guy said that his OLDEST daugher wears a red dress that meant that there had to be the oldest. So 1 6 6 can't possibly be the answer. So the possible possiblity is 2 2 9 and the OLDEST daughter is 9 years old. &lt;br /&gt;&lt;br /&gt;Therefore, the answer is 9.&lt;br /&gt;&lt;br /&gt;Submit&lt;br /&gt;Answer&lt;br /&gt; &lt;br /&gt;User&lt;br /&gt;&lt;br /&gt;There are 3 colored boxes - Red, Green and Blue. Each box contains 2 envelopes. Each envelope contains money - two of them contain Rs. 25000 each, two of them contain Rs. 15000 each and remaining two contain Rs. 10000 each. &lt;br /&gt;&lt;br /&gt;There is one statement written on the cover of each box. &lt;br /&gt;* Red Box: Both, a red box and a blue box contain Rs. 10000 each. &lt;br /&gt;* Green Box: Both, a green box and a red box contain Rs. 25000 each. &lt;br /&gt;* Blue Box: Both, a blue box and a green box contain Rs. 15000 each. &lt;br /&gt;&lt;br /&gt;Only one of the above 3 statements is true and the corresponding box contains the maximum amount. &lt;br /&gt;&lt;br /&gt;Can you tell which box contains the maximum amount and how much?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Blue box contains the maximum amount Rs. 40000 &lt;br /&gt;&lt;br /&gt;As it is given that only one of the given 3 statements is true; assume in turn, each statement to be true &amp; the other 2 false and check whether the corresponding box contains the maximum amount. &lt;br /&gt;&lt;br /&gt;Let's assume that the statement on the Blue box is true. Thus, the given 3 statements can be interpreted as &lt;br /&gt;* Atmost one, a red box or a blue box contains Rs. 10000. &lt;br /&gt;* Atmost one, a green box or a red box contains Rs. 25000. &lt;br /&gt;* Both, a blue box and a green box contain Rs. 15000 each. &lt;br /&gt;&lt;br /&gt;Going through all possible combinations, we can conclude that &lt;br /&gt;Red Box : Rs. 10000 + Rs. 25000 = Rs. 35000 &lt;br /&gt;Green Box : Rs. 10000 + Rs. 15000 = Rs. 25000 &lt;br /&gt;Blue Box : Rs. 15000 + Rs. 25000 = Rs. 40000 &lt;br /&gt;&lt;br /&gt;You can test out for other two statements i.e. assuming Red box statement true and then Green box statement true. In both the cases, other statements will contradict the true statement.&lt;br /&gt;&lt;br /&gt;Sachin, Dravid and Ganguly played in a Cricket match between India and England. &lt;br /&gt;• None of them scored more than 99 runs. &lt;br /&gt;• If you add the digits of the runs scored by Sachin to his own score, you will get the runs scored by Dravid. &lt;br /&gt;• If you reverse the digits of the runs scored by Dravid, you will get the runs scored by Ganguly. &lt;br /&gt;• The total runs scored by them is 240.&lt;br /&gt;Can you figure out their individual scores?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Sachin, Dravid and Ganguly scored 75, 87 and 78 respectively. &lt;br /&gt;&lt;br /&gt;Sachin's score must be less than 86, otherwise Dravid's score would be more than 99. Also, he must have scored atleast 42 - incase Dravid and Ganguly scored 99 each. &lt;br /&gt;&lt;br /&gt;Also, as none of them scored more than 99 and the total runs scored by them is 240; their individual scores must be around 80. &lt;br /&gt;&lt;br /&gt;Now, use trial-n-error method to solve the teaser.&lt;br /&gt;Three men, including Gianni and three woman, including Sachi are in line at the BrentWood post office. Each has two different pieces of business to conduct. &lt;br /&gt;1. The first person is a woman. &lt;br /&gt;2. Carlos wants to send an overnight package. &lt;br /&gt;3. Lau is just ahead of Pimentelli who is the same sex as Lau. &lt;br /&gt;4. Gianni is two places ahead of the person who wants to buy stamps. &lt;br /&gt;5. Knutson - who is the opposite sex than Rendler - isn't the person who wanted to complain about a mail carrier. &lt;br /&gt;6. The six people, not necessarily in the same order are - Anthony, Donna, the person who wants to fill out a change-of-address form, the one who wants to buy a money order, the one who wants to send Airmail to Tibet and the second person in the line. &lt;br /&gt;7. The four tasks of the last two people in line, not necessarily in the same order are - sending books fourth class, buying a money order, picking up a package and complaining about a mail carrier. &lt;br /&gt;8. The person who wants to send books fourth class is just behind a person of the same sex. &lt;br /&gt;9. Mary is just behind a person who wants to send an insured package. &lt;br /&gt;10. The person who wants to send Airmail to Tibet is either two places ahead of or two places behind the one who wants to add postage to his or her meter. &lt;br /&gt;11. Anthony isn't two places behind the who wants to pickup a registered letter. &lt;br /&gt;12. Toriseza is two places ahead of the person who wants to pick up a package. &lt;br /&gt;13. Knutson isn't just ahead of the person who wants to send an item parcel post.&lt;br /&gt;Can you figure out where each customer is in the line, his or her full name (one surname is Loti) and the two things he or she wants to accomplish? Provide your answer is POSITION - FIRST NAME - LAST NAME - BUSINESS format. &lt;br /&gt;Submit&lt;br /&gt;Answer&lt;br /&gt; &lt;br /&gt;Users&lt;br /&gt;Answer (8)&lt;br /&gt; &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;A very TOUGH puzzle !!! &lt;br /&gt;POS FIRST NAME  LAST NAME  BUSINESS&lt;br /&gt;1 Sachi Loti • Fill Out a Change-of-Address Form&lt;br /&gt;• Add Postage to Meter&lt;br /&gt;2 Gianni Lau • Pick Up a Registered Letter&lt;br /&gt;• Send an Item Parcel Post&lt;br /&gt;3 Carlos Pimentelli • Overnight Package&lt;br /&gt;• Send Airmail to Tibet&lt;br /&gt;4 Donna Toriseza • Buy Stamps&lt;br /&gt;• Send an Insured Package&lt;br /&gt;5 Mary Knutson • Buy a Money Order&lt;br /&gt;• Send Books fourth Class&lt;br /&gt;6 Anthony Rendler • Complain About a Mail Carrier&lt;br /&gt;• Pick Up a Package&lt;br /&gt;&lt;br /&gt; Brain Teaser No : 00164&lt;br /&gt;&lt;br /&gt;Substitute digits for the letters to make the following relation true.&lt;br /&gt;                  W O R L D&lt;br /&gt;&lt;br /&gt;               +  T R A D E&lt;br /&gt;&lt;br /&gt;               -------------&lt;br /&gt;&lt;br /&gt;                C E N T E R&lt;br /&gt;Note that the leftmost letter can't be zero in any word. Also, there must be a one-to-one mapping between digits and letters. e.g. if you substitute 3 for the letter W, no other letter can be 3 and all other W in the puzzle must be 3. &lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;A tough one. &lt;br /&gt;&lt;br /&gt;It is obvious that C=1. Also, the maximum possible value of E is 7. Now, start putting possible values of D, E and R as they occure frequently and use trial-n-error.&lt;br /&gt;&lt;br /&gt;     W O R L D          5 3 6 8 4&lt;br /&gt;&lt;br /&gt;  +  T R A D E       +  7 6 0 4 2&lt;br /&gt;&lt;br /&gt;  ------------       ------------&lt;br /&gt;&lt;br /&gt;   C E N T E R        1 2 9 7 2 6 &lt;br /&gt; Brain Teaser No : 00107&lt;br /&gt;&lt;br /&gt;If you look at a clock and the time is 3:15. &lt;br /&gt;&lt;br /&gt;What is the angle between the hour and the minute hands? ( The answer to this is not zero!) &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;7.5 degrees &lt;br /&gt;&lt;br /&gt;At 3:15 minute hand will be perfactly horizontal pointing towards 3. Whereas hour hand will be towards 4. Also, hour hand must have covered 1/4 of angle between 3 and 4. &lt;br /&gt;&lt;br /&gt;The angle between two adjacent digits is 360/12 = 30 degrees. &lt;br /&gt;&lt;br /&gt;Hence 1/4 of it is 7.5 degrees.&lt;br /&gt;An apple vendor has 1000 apples and 10 empty boxes. He asks his son to place all the 1000 apples in all the 10 boxes in such a manner that if he asks for any number of apples from 1 to 1000, his son should be able to pick them in terms of boxes. &lt;br /&gt;&lt;br /&gt;How did the son place all the apples among the 10 boxes, given that any number of apples can be put in one box.&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;1, 2, 4, 8, 16, 32, 64, 128, 256, 489 &lt;br /&gt;&lt;br /&gt;Let's start from scratch. &lt;br /&gt;• The apple vandor can ask for only 1 apple, so one box must contain 1 apple. &lt;br /&gt;• He can ask for 2 apples, so one box must contain 2 apples. &lt;br /&gt;He can ask for 3 apples, in that case box one and box two will add up to 3. &lt;br /&gt;• He can ask for 4 apples, so one box i.e. third box must contain 4 apples. &lt;br /&gt;• Now using box number one, two and three containing 1, 2 and 4 apples respectively, his son can give upto 7 apples. Hence, forth box must contain 8 apples. &lt;br /&gt;• Similarly, using first four boxes containing 1, 2, 4 and 8 apples, his son can give upto 15 apples. Hence fifth box must contain 16 apples. &lt;br /&gt;• You must have noticed one thing till now that each box till now contains power of 2 apples. Hence the answer is 1, 2, 4, 8, 16, 32, 64, 128, 256, 489. This is true for any number of apples, here in our case only upto 1000.&lt;br /&gt;&lt;br /&gt; Brain Teaser No : 00261&lt;br /&gt;&lt;br /&gt;The letters P, Q, R, S, T, U and V, not necessarily in that order represents seven consecutive integers from 22 to 33. &lt;br /&gt;• U is as much less than Q as R is greater than S. &lt;br /&gt;• V is greater than U. &lt;br /&gt;• Q is the middle term. &lt;br /&gt;• P is 3 greater than S.&lt;br /&gt;Can you find the sequence of letters from the lowest value to the highest value? &lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The sequence of letters from the lowest value to the highest value is TUSQRPV. &lt;br /&gt;&lt;br /&gt;From (3), Q is the middle term. &lt;br /&gt;___ ___ ___ _Q_ ___ ___ ___ &lt;br /&gt;&lt;br /&gt;From (4), there must be exactly 2 numbers between P and S which gives two possible positions. &lt;br /&gt;&lt;br /&gt;[1] ___ _S_ ___ _Q_ _P_ ___ ___ &lt;br /&gt;&lt;br /&gt;[2] ___ ___ _S_ _Q_ ___ _P_ ___ &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;From (1), the number of letters between U and Q must be same as the number of letters between S and R. Also, the number of letters between them can be 1, 2 or 3. &lt;br /&gt;&lt;br /&gt;Using trial and error, it can be found that there must be 2 letters between them. Also, it is possible only in option [2] above. &lt;br /&gt;&lt;br /&gt;[2] ___ _U_ _S_ _Q_ _R_ _P_ ___ &lt;br /&gt;&lt;br /&gt;From (2) V must be the highest and the remaining T must be the lowest number. &lt;br /&gt;&lt;br /&gt;_T_ _U_ _S_ _Q_ _R_ _P_ _V_ &lt;br /&gt;&lt;br /&gt;Thus, the sequence of letters from the lowest value to the highest value is TUSQRPV.&lt;br /&gt;A contractor had employed 100 labourers for a flyover construction task. He did not allow any woman to work without her husband. Also, atleast half the men working came with their wives. &lt;br /&gt;&lt;br /&gt;He paid five rupees per day to each man, four ruppes to each woman and one rupee to each child. He gave out 200 rupees every evening. &lt;br /&gt;&lt;br /&gt;How many men, women and children were working with the constructor?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;16 men, 12 women and 72 children were working with the constructor. &lt;br /&gt;&lt;br /&gt;Let's assume that there were X men, Y women and Z children working with the constructor. Hence, &lt;br /&gt;&lt;br /&gt;X + Y + Z = 100 &lt;br /&gt;5X + 4Y + Z = 200 &lt;br /&gt;&lt;br /&gt;Eliminating X and Y in turn from these equations, we get &lt;br /&gt;X = 3Z - 200 &lt;br /&gt;Y = 300 - 4Z &lt;br /&gt;&lt;br /&gt;As if woman works, her husband also works and atleast half the men working came with their wives; the value of Y lies between X and X/2. Substituting these limiting values in equations, we get &lt;br /&gt;&lt;br /&gt;if Y = X, &lt;br /&gt;300 - 4Z = 3Z - 200 &lt;br /&gt;7Z = 500 &lt;br /&gt;Z = 500/7 i.e. 71.428 &lt;br /&gt;&lt;br /&gt;if Y = X/2, &lt;br /&gt;300 - 4Z = (3Z - 200)/2 &lt;br /&gt;600 - 8Z = 3Z - 200 &lt;br /&gt;11Z = 800 &lt;br /&gt;Z = 800/11 i.e. 72.727 &lt;br /&gt;&lt;br /&gt;But Z must be an integer, hence Z=72. Also, X=16 and Y=12 &lt;br /&gt;&lt;br /&gt;There were 16 men, 12 women and 72 children working with the constructor.&lt;br /&gt;&lt;br /&gt;Because cigars cannot be entirely smoked, a Bobo who collects cigar butts can make a cigar to smoke out of every 3 butts that he finds. &lt;br /&gt;&lt;br /&gt;Today, he has collected 27 cigar butts. How many cigars will he be able to smoke?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;13 not 12 &lt;br /&gt;&lt;br /&gt;He makes 9 originals from the 27 butts he found, and after he smokes them he has 9 butts left for another 3 cigars. And then he has 3 butts for another cigar. &lt;br /&gt;&lt;br /&gt;So 9+3+1=13&lt;br /&gt;In a small town, there are three temples in a row and a well in front of each temple. A pilgrim came to the town with certain number of flowers. &lt;br /&gt;&lt;br /&gt;Before entering the first temple, he washed all the flowers he had with the water of well. To his surprise, flowers doubled. He offered few flowers to the God in the first temple and moved to the second temple. Here also, before entering the temple he washed the remaining flowers with the water of well. And again his flowers doubled. He offered few flowers to the God in second temple and moved to the third temple. Here also, his flowers doubled after washing them with water. He offered few flowers to the God in third temple. &lt;br /&gt;&lt;br /&gt;There were no flowers left when pilgrim came out of third temple and he offered same number of flowers to the God in all three temples. &lt;br /&gt;&lt;br /&gt;What is the minimum number of flowers the pilgrim had initially? How many flower did he offer to each God?&lt;br /&gt;Answer&lt;br /&gt; &lt;br /&gt;&lt;br /&gt;The pilgrim had 7 flowers, initially and he offered 8 flowers to each God. &lt;br /&gt;&lt;br /&gt;Assume that the pilgrim had X flowers initially and he offered Y flowers to each God. &lt;br /&gt;&lt;br /&gt;From the above figure, there are (8X - 7Y) flowers when the pilgrim came out of the third temple. But it is given that there were no flowers left when he came out of third temple. It means that &lt;br /&gt;(8X - 7Y) = 0 &lt;br /&gt;8X = 7Y &lt;br /&gt;&lt;br /&gt;The minimum values of X and Y are 7 and 8 respectively to satisfy above equation. Hence, the pilgrim had 7 flowers and he offered 8 flowers to each God. &lt;br /&gt;&lt;br /&gt;In general, the pilgrim had 7N flowers initially and he offered 8N flowers to each God, where N = 1, 2, 3, 4, .....&lt;br /&gt;&lt;br /&gt; Brain Teaser No : 00432&lt;br /&gt;&lt;br /&gt;Tanya wants to go on a date and prefers her date to be tall, dark and handsome. &lt;br /&gt;1. Of the preferred traits - tall, dark and handsome - no two of Adam, Bond, Cruz and Dumbo have the same number. &lt;br /&gt;2. Only Adam or Dumbo is tall and fair. &lt;br /&gt;3. Only Bond or Cruz is short and handsome. &lt;br /&gt;4. Adam and Cruz are either both tall or both short. &lt;br /&gt;5. Bond and Dumbo are either both dark or both fair.&lt;br /&gt;Who is Tanya's date? &lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Cruz is Tanya's date. &lt;br /&gt;&lt;br /&gt;As no two of them have the same number of preferred traits - from (1), exactly one of them has none of the preferred traits and exactly one of them has all the preferred traits. &lt;br /&gt;&lt;br /&gt;From (4) and (5), there are only two possibilities: &lt;br /&gt;* Adam &amp; Cruz both are tall and Bond &amp; Dumbo both are fair. &lt;br /&gt;* Adam &amp; Cruz both are short and Bond &amp; Dumbo both are dark. &lt;br /&gt;&lt;br /&gt;But from (2), second possibility is impossible. So the first one is the correct possibility i.e. Adam &amp; Cruz both are tall and Bond &amp; Dumbo both are fair. &lt;br /&gt;&lt;br /&gt;Then from (3), Bond is short and handsome. &lt;br /&gt;&lt;br /&gt;Also, from (1) and (2), Adam is tall and fair. Also, Dumbo is the person without any preferred traits. Cruz is Dark. Adam and Cruz are handsome. Thus, following are the individual preferred traits: &lt;br /&gt;&lt;br /&gt;Cruz - Tall, Dark and Handsome &lt;br /&gt;Adam - Tall and Handsome &lt;br /&gt;Bond - Handsome &lt;br /&gt;Dumbo - None :-( &lt;br /&gt;&lt;br /&gt;Hence, Cruz is Tanya's date.&lt;br /&gt;Consider a game of Tower of Hanoi (like the one that you can play on BrainVista). &lt;br /&gt;&lt;br /&gt;If the tower has 2 discs, the least possible moves with which you can move the entire tower to another peg is 3. &lt;br /&gt;&lt;br /&gt;If the tower has 3 discs, the least possible moves with which you can move the entire tower to another peg is 7. &lt;br /&gt;&lt;br /&gt;What is the least possible moves with which you can move the entire tower to another peg if the tower has N discs?&lt;br /&gt;Submitted&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;There are number of ways to find the answer. &lt;br /&gt;&lt;br /&gt;To move the largest disc (at level N) from one tower to the other, it requires 2(N-1) moves. Thus, to move N discs from one tower to the other, the number of moves required is &lt;br /&gt;= 2(N-1) + 2(N-2) + 2(N-3) + ..... + 22 + 21 + 20 &lt;br /&gt;= 2N - 1 &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;For N discs, the number of moves is one more than two times the number of moves for N-1 discs. Thus, the recursive function is &lt;br /&gt;F(1) = 1 &lt;br /&gt;F(N) = 2*[F(N-1)] + 1 &lt;br /&gt;where N is the total number of discs &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Also, one can arrive at the answer by finding the number of moves for smaller number of discs and then derive the pattern. &lt;br /&gt;For 1 disc, number of moves = 1 &lt;br /&gt;For 2 discs, number of moves = 3 &lt;br /&gt;For 3 discs, number of moves = 7 &lt;br /&gt;For 4 discs, number of moves = 15 &lt;br /&gt;For 5 discs, number of moves = 31 &lt;br /&gt;&lt;br /&gt;Thus, the pattern is 2N – 1&lt;br /&gt;A boy found that he had a 48 inch strip of paper. He could cut an inch off every second. &lt;br /&gt;&lt;br /&gt;How long would it take for him to cut 48 pieces? He can not fold the strip and also, can not stack two or more strips and cut them together.&lt;br /&gt;SubmiAnswer&lt;br /&gt;&lt;br /&gt;47 seconds. &lt;br /&gt;&lt;br /&gt;To get 48 pieces, the boy have to put only 47 cuts. i.e. he can cut 46 pieces in 46 seconds. After getting 46 pieces, he will have a 2 inches long piece. He can cut it into two with just a one cut in 1 second. Hence, total of 47 seconds.tted by : Kimi&lt;br /&gt;&lt;br /&gt;The cricket match between India and Pakistan was over. &lt;br /&gt;• Harbhajan scored more runs than Ganguly. &lt;br /&gt;• Sachin scored more runs than Laxman but less than Dravid &lt;br /&gt;• Badani scored as much runs as Agarkar but less than Dravid and more than Sachin. &lt;br /&gt;• Ganguly scored more runs than either Agarkar or Dravid. &lt;br /&gt;Each batsman scored 10 runs more than his immediate batsman. The lowest score was 10 runs. How much did each one of them score&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;A simple one. Use the given facts and put down all the players in order. The order is as follow with Harbhajan, the highest scorer and Laxman, the lowest scorer. &lt;br /&gt;1. Harbhajan &lt;br /&gt;2. Ganguly &lt;br /&gt;3. Dravid &lt;br /&gt;4. Badani, Agarkar &lt;br /&gt;5. Sachin &lt;br /&gt;6. Laxman &lt;br /&gt;Also, as the lowest score was 10 runs. Laxman must have scored 10, Sachin 20, Badani &amp; Agarkar 30 and so on. &lt;br /&gt;1. Harbhajan - 60 runs &lt;br /&gt;2. Ganguly - 50 runs &lt;br /&gt;3. Dravid - 40 runs &lt;br /&gt;4. Badani, Agarkar - 30 runs each &lt;br /&gt;5. Sachin - 20 runs &lt;br /&gt;6. Laxman - 10 runs &lt;br /&gt;There are 10 statements written on a piece of paper: &lt;br /&gt;1. At least one of statements 9 and 10 is true. &lt;br /&gt;2. This either is the first true or the first false statement. &lt;br /&gt;3. There are three consecutive statements, which are false. &lt;br /&gt;4. The difference between the numbers of the last true and the first true statement divides the number, that is to be found. &lt;br /&gt;5. The sum of the numbers of the true statements is the number, that is to be found. &lt;br /&gt;6. This is not the last true statement. &lt;br /&gt;7. The number of each true statement divides the number, that is to be found. &lt;br /&gt;8. The number that is to be found is the percentage of true statements. &lt;br /&gt;9. The number of divisors of the number, that is to be found, (apart from 1 and itself) is greater than the sum of the numbers of the true statements. &lt;br /&gt;10. There are no three consecutive true statements. &lt;br /&gt;Find the minimal possible number?&lt;br /&gt;Submitted&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The numebr is 420. &lt;br /&gt;&lt;br /&gt;If statement 6 is false, it creates a paradox. Hence, Statement 6 must be true. &lt;br /&gt;&lt;br /&gt;Consider Statement 2: &lt;br /&gt;• If it is true, it must be the first true statement. Otherwise, it creates a paradox. &lt;br /&gt;• If it is false, it must be the second false statement. Otherwise, it creates a paradox.&lt;br /&gt;In both the cases, Statement 1 is false. &lt;br /&gt;&lt;br /&gt;As Statement 1 is false, Statement 9 and Statement 10 both are false i.e. there are three consecutive true statements. &lt;br /&gt;1 2 3 4 5 6 7 8 9 10&lt;br /&gt;False - - - - True - - False False&lt;br /&gt;&lt;br /&gt;Let\'s assume that Statement 3 is false i.e. there are no three consecutive false statements. It means that Statement 2 and Statement 8 must be true, else there will be three consecutive false statements. &lt;br /&gt;1 2 3 4 5 6 7 8 9 10&lt;br /&gt;False True False - - True - True False False&lt;br /&gt;&lt;br /&gt;Also, atleast two of Statements 4, 5 and 7 must be true as there are three consecutive true statements. &lt;br /&gt;&lt;br /&gt;According to Statement 8, the number that is to be found is the percentage of true statements. Hence, number is either 50 or 60. Now if Statement 7 is true, then the number of each true statement divides the number, that is to be found. But 7 and 8 do not divide either 50 or 60. Hence, Statement 7 is false which means that Statement 4 and 5 are true. But Statement 5 contradicts the Statement 8. Hence, our assumption that Statement 3 is false is wrong and Statement 3 is true i.e. there are 3 consecutive false statements which means that Statement 8 is false as there is no other possibilities of 3 consecutive false statements. &lt;br /&gt;&lt;br /&gt;Also, Statement 7 is true as Statement 6 is not the last true statement. &lt;br /&gt;1 2 3 4 5 6 7 8 9 10&lt;br /&gt;False - True - - True True False False False&lt;br /&gt;&lt;br /&gt;According to Statement 7, the number of each true statement divides the number, that is to be found. And according to Statement 5, the sum of the numbers of the true statements is the number, that is to be found. For all possible combinations Statement 5 is false. &lt;br /&gt;&lt;br /&gt;There 3 consecutive true statements. Hence, Statement 2 and Statement 4 are true. &lt;br /&gt;1 2 3 4 5 6 7 8 9 10&lt;br /&gt;False True True True False True True False False False&lt;br /&gt;&lt;br /&gt;Now, the conditions for the number to be found are: &lt;br /&gt;1. The numebr is divisible by 5 (Statement 4) &lt;br /&gt;2. The numebr is divisible by 2, 3, 4, 6, 7 (Statement 7) &lt;br /&gt;3. The number of divisors of the number, that is to be found, (apart from 1 and itself) is not greater than the sum of the numbers of the true statements. (Statement 9)&lt;br /&gt;The minimum possible number is 420. &lt;br /&gt;&lt;br /&gt;The divisors of 420, apart from 1 and itself are 2, 3, 4, 5, 6, 7, 10, 12, 14, 15, 20, 21, 28, 30, 35, 42, 60, 70, 84, 105, 140, 210. There are total of 22 divisors. Also, the sum of the numbers of the true statements is 22 (2+3+4+6+7=22), which satisfies the third condition.&lt;br /&gt;Ankit and Tejas divided a bag of Apples between them. &lt;br /&gt;&lt;br /&gt;Tejas said, "It's not fair! You have 3 times as many Apples I have." Ankit said, "OK, I will give you one Apple for each year of your age." Tejas replied, "Still not fair. Now, you have twice as many Apples as I have." "Dear, that's fair enough as I am twice older than you.", said Ankit. &lt;br /&gt;&lt;br /&gt;Ankit went to Kitchen to drink water. While Ankit was in Kitchen, Tejas took apples from Ankit's pile equal to Ankit's age. &lt;br /&gt;&lt;br /&gt;Who have more apples now?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;At the end, Ankit and Tejas, both have the same number of apples. &lt;br /&gt;&lt;br /&gt;Let's assume that initially Tejas got N apples and his age is T years. Hence, initially Ankit got 3N apples and his age is 2T years. &lt;br /&gt;Operation Ankit's Apples Tejas's Apples&lt;br /&gt;Initially 3N N&lt;br /&gt;Ankit gave T apples to Tejas&lt;br /&gt;(equals age of Tejas) 3N - T N + T&lt;br /&gt;Tejas took 2T apples from Ankit's pile&lt;br /&gt;(equals age of Ankit) 3N - 3T N + 3T&lt;br /&gt;&lt;br /&gt;It is given that after Ankit gave T apples to Tejas, Ankit had twice as many apples as Tejas had. &lt;br /&gt;3N - T = 2*(N + T) &lt;br /&gt;3N - T = 2N + 2T &lt;br /&gt;N = 3T &lt;br /&gt;&lt;br /&gt;From the table, at the end Ankit have (3N - 3T) apples and Tejas have (N + 3T) apples. Substituting N = 3T, we get &lt;br /&gt;Ankit's apples = 3N - 3T = 9T - 3T = 6T &lt;br /&gt;Tejas's apples = N + 3T = 3T + 3T = 6T &lt;br /&gt;&lt;br /&gt;Thus, at the end Ankit and Tejas, both have the same number of apples.&lt;br /&gt;&lt;br /&gt;On evey Sunday Amar, Akbar and Anthony lunch together at Preetam-Da-Dhaba where they order lassi based on following facts. &lt;br /&gt;1. Unless neither Amar nor Akbar have lassi, Anthony must have it. &lt;br /&gt;2. If Amar does not have lassi, either Akbar or Anthony or both have it. &lt;br /&gt;3. Anthony has lassi only if either Amar or Akbar or both have it. &lt;br /&gt;4. Akbar and Anthony never have lassi together.&lt;br /&gt;Who order(s) lassi?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Amar and Anthony both have lassi whereas Akbar never does. &lt;br /&gt;&lt;br /&gt;Fact (2) can be alternatively stated that "either Amar or Akbar or Anthony must have lassi". &lt;br /&gt;&lt;br /&gt;From Fact (3), it can be infered that either Amar or Akbar must have lassi. &lt;br /&gt;&lt;br /&gt;Now, from Fact (1), it is apparent that Anthony too must have lassi. But according to Fact (4), Akbar cannot have lassi when Anthony does.&lt;br /&gt; Brain Teaser No : 00191&lt;br /&gt;&lt;br /&gt;Decipher this sentence.&lt;br /&gt;&lt;br /&gt;         B R W Q H L F K W   H J K   Q I B W K   &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;         Q I C E D W   Z B G   W K K   M I K E&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;         Z B G   Q H S K   Z B G J   K Z K W&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;         B U U   Z B G J   D B H F W.&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Start with ZBG and ZBGJ. It should be either "the/then" or "you/your" combination as they appear more.&lt;br /&gt;&lt;br /&gt;         B R W Q H L F K W   H J K   Q I B W K   &lt;br /&gt;&lt;br /&gt;         o b s t a c l e s   a r e   t h o s e&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;         Q I C E D W   Z B G   W K K   M I K E&lt;br /&gt;&lt;br /&gt;         t h i n g s   y o u   s e e   w h e n&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;         Z B G   Q H S K   Z B G J   K Z K W&lt;br /&gt;&lt;br /&gt;         y o u   t a k e   y o u r   e y e s&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;         B U U   Z B G J   D B H F W.&lt;br /&gt;&lt;br /&gt;         o f f   y o u r   g o a l s.&lt;br /&gt; Brain Teaser No : 00001&lt;br /&gt;&lt;br /&gt;At what time immediately prior to Six O'clock the hands of the clock are exactly opposite to each other. Give the exact time in hours, minutes and seconds. &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;It is obvious that between 5 O'clock and 6 O'clock the hands will not be exactly opposite to each other. It is also obvious that the hands will be opposite to each other just before 5 O'clock. Now to find exact time: &lt;br /&gt;&lt;br /&gt;The hour hand moves 1 degree for every 12 degrees that the minute hand moves. Let the hour hand be X degree away from 5 O'clock. Therefore the minute hand is 12X degree away from 12 O'clock. &lt;br /&gt;&lt;br /&gt;Therefore solving for X &lt;br /&gt;&lt;br /&gt;Angle between minute hand and 12 O'clock + Angle between 12 O'clock and 4 O'clock + Angle between 4 O'clock and hour hand = 180 &lt;br /&gt;12X + 120 + (30-X) = 180 &lt;br /&gt;11X = 30 &lt;br /&gt;Hence X = 30/11 degrees &lt;br /&gt;(hour hand is X degree away from 5 O'clock) &lt;br /&gt;&lt;br /&gt;Now each degree the hour hand moves is 2 minutes. &lt;br /&gt;&lt;br /&gt;Therefore minutes are &lt;br /&gt;= 2 * 30/11 &lt;br /&gt;= 60/11 &lt;br /&gt;= 5.45 (means 5 minutes 27.16 seconds) &lt;br /&gt;&lt;br /&gt;Therefore the exact time at which the hands are opposite to each other is &lt;br /&gt;= 4 hrs. 54 min. 32.74 seconds&lt;br /&gt;&lt;br /&gt;Ali Baba had four sons, to whom he bequeathed his 39 camels, with the proviso that the legacy be divided in the following way : &lt;br /&gt;&lt;br /&gt;The oldest son was to receive one half the property, the next a quarter, the third an eighth and the youngest one tenth. The four brothers were at a loss as how to divide the inheritance among themselves without cutting up a camel, until a stranger appeared upon the scene. &lt;br /&gt;Dismounting from his camel, he asked if he might help, for he knew just what to do. The brothers gratefully accepted his offer. &lt;br /&gt;&lt;br /&gt;Adding his own camel to Ali Baba's 39, he divided the 40 as per the will. The oldest son received 20, the next 10, the third 5 and the youngest 4. One camel remained : this was his, which he mounted and rode away. &lt;br /&gt;&lt;br /&gt;Scratching their heads in amazement, they started calculating. The oldest thought : is not 20 greater than the half of 39? Someone must have received less than his proper share ! But each brother discovered that he had received more than his due. How is it possible?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;They took their percentages from 40 and not from 39, so they got more than their share. &lt;br /&gt;&lt;br /&gt;The oldest son got 1/2 of 40 = 20 which is 0.5 more &lt;br /&gt;The second son got 1/4 of 40 = 10 which is 0.25 more &lt;br /&gt;The third son got 1/8 of 40 = 5 which is 0.125 more &lt;br /&gt;The youngest son got 1/10 of 40 = 4 which is 0.1 more &lt;br /&gt;&lt;br /&gt;And the stranger got 1/40 of 40 = 1 which is 0.025 more (As he is not supposed to get anything) &lt;br /&gt;&lt;br /&gt;All these fractions add to = 0.5 + 0.25 + 0.125 + 0.1 + 0.025 = 1 which stranger took away.&lt;br /&gt;There is a family party consisting of two fathers, two mothers, two sons, one father-in-law, one mother-in-law, one daughter-in-law, one grandfather, one grandmother and one grandson. &lt;br /&gt;&lt;br /&gt;What is the minimum number of persons required so that this is possible?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;There are total 2 couples and a son. Grandfather and Grand mother, their son and his wife and again their son. So total 5 people. &lt;br /&gt;&lt;br /&gt;Grandfather, Grandmother &lt;br /&gt;| &lt;br /&gt;| &lt;br /&gt;Son, wife &lt;br /&gt;| &lt;br /&gt;| &lt;br /&gt;Son&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;A man went into a fast food restaurant and ate a meal costing Rs. 105, giving the accountant a Rs. 500 note. He kept the change, came back a few minutes later and had some food packed for his girl friend. He gave the accountant a Rs. 100 note and received Rs. 20 in change. Later the bank told the accountant that both the Rs. 500 and the Rs. 100 notes were counterfeit. &lt;br /&gt;&lt;br /&gt;How much money did the restaurant lose? Ignore the profit of the food restaurant.&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;He lost Rs.600 &lt;br /&gt;&lt;br /&gt;First time restaurant has given food worth Rs.105 and Rs. 395 change. Similarly second time, food worth Rs.80 and Rs.20 change. Here, we are not considering food restaurant profits.&lt;br /&gt;&lt;br /&gt;               S L I D E&lt;br /&gt;&lt;br /&gt;             -   D E A N&lt;br /&gt;&lt;br /&gt;               ---------&lt;br /&gt;&lt;br /&gt;                 3 6 5 1&lt;br /&gt;Each of seven digits from 0-9 are represented by a different letter above such that the subtraction is true. &lt;br /&gt;&lt;br /&gt;What word represents 3651?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;3651 represents LENS. &lt;br /&gt;&lt;br /&gt;Let's assign possible values to each letter and then use trial-n-error. &lt;br /&gt;&lt;br /&gt;S must be 1. &lt;br /&gt;&lt;br /&gt;Then D (under L) must be greater than 5. If D is 6, then L is 0. But then A must be 0 or 1 which is impossible. Hence, the possible values of D are 7, 8 or 9. &lt;br /&gt;&lt;br /&gt;N must be E + 1. Also, D must be A + 5 as the possible values of D are 7, 8 or 9, D can not be (10+A) + 5. &lt;br /&gt;&lt;br /&gt;Now using trial-n-error, we get S=1, I=2, L=3, A=4, N=5, E=6 and D=9&lt;br /&gt;&lt;br /&gt;         S  L  I  D  E             1  3  2  9  6&lt;br /&gt;&lt;br /&gt;       -    D  E  A  N           -    9  6  4  5 &lt;br /&gt;&lt;br /&gt;         --------------            --------------&lt;br /&gt;&lt;br /&gt;            3  6  5  1                L  E  N  S&lt;br /&gt;Hence, 3651 represents LENS.&lt;br /&gt;Adam, Burzin, Clark and Edmund each live in an apartment. Their apartments are arranged in a row numbered 1 to 4 from left to right. Also, one of them is the landlord. &lt;br /&gt;1. If Clark's apartment is not next to Burzin's apartment, then the landlord is Adam and lives in apartment 1. &lt;br /&gt;2. If Adam's apartment is right of Clark's apartment, then the landlord is Edmund and lives in apartment 4. &lt;br /&gt;3. If Burzin's apartment is not next to Edmund's apartment, then the landlord is Clark and lives in apartment 3. &lt;br /&gt;4. If Edmund's apartment is right of Adam's apartment, then the landlord is Burzin and lives in apartment 2.&lt;br /&gt;Who is the landlord?&lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Clark is the landlord. &lt;br /&gt;&lt;br /&gt;Assume each statement true, one at a time and see that no other statement is contradicted. &lt;br /&gt;&lt;br /&gt;Let's assume that Statement (1) is true. Then, Adam is the landlord and lives in apartment 1. Also, other three's apartments will be on the right of his apartment - which contradicts Statement (4) i.e. If Edmund's apartment is right of Adam's apartment, then the landlord is Burzin. Thus, Adam is not the landlord. &lt;br /&gt;&lt;br /&gt;Let's assume that Statement (2) is true. Then, Edmund is the landlord and lives in apartment 4. Also, other three's apartments will be on the left of his apartment - which again contradicts Statement (4) i.e. If Edmund's apartment is right of Adam's apartment, then the landlord is Burzin. Thus, Edmund is not the landlord either. &lt;br /&gt;&lt;br /&gt;Let's assume that Statement (3) is true. Then, Clark is the landlord and lives in apartment 3. It satisfies all the statements for &lt;br /&gt;(1) Adam - (2) Edmund - (3) Clark - (4) Burzin &lt;br /&gt;&lt;br /&gt;Hence, Clark is the landlord. &lt;br /&gt;&lt;br /&gt;Similarly, you can assume Statement (4) true and find out that it also contradicts.&lt;br /&gt; Brain Teaser No : 00456&lt;br /&gt;&lt;br /&gt;B, J and P are related to each other. &lt;br /&gt;1. Among the three are B's legal spouse, J's sibling and P's sister-in-law. &lt;br /&gt;2. B's legal spouse and J's sibling are of the same sex.&lt;br /&gt;Who is the married man? &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;J is the married man. &lt;br /&gt;&lt;br /&gt;Note that a person's sister-in-law may be the wife of that person's brother or the sister of that person's spouse. &lt;br /&gt;&lt;br /&gt;There are 2 cases: &lt;br /&gt;1. If B's legal spouse is J, then J's sibling must be P and P's sister-in-law must be B. &lt;br /&gt;2. If B's legal spouse is P, then P's sister-in-law must be J and J's sibling must be B.&lt;br /&gt;It is given that B's legal spouse and J's sibling are of the same sex. Also, it is obvious that P's sister-in-law is female. Then, B's legal spouse and J's sibling both must be males.&lt;br /&gt;&lt;br /&gt;          B's spouse   J's sibling   P's sister-in-law&lt;br /&gt;&lt;br /&gt;           (male)        (male)          (female)&lt;br /&gt;&lt;br /&gt;------------------------------------------------------&lt;br /&gt;&lt;br /&gt;Case I       J             P                B&lt;br /&gt;&lt;br /&gt;Case II      P             B                J&lt;br /&gt;&lt;br /&gt;Case II is not possible as B &amp; P are married to each other and both are male. Hence, J is the married man.&lt;br /&gt; Brain Teaser No : 00041&lt;br /&gt;&lt;br /&gt;A polygon has 1325 diagonals. How many vertices does it have? &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The formula to find number of diagonals (D) given total number of vertices or sides (N) is&lt;br /&gt;&lt;br /&gt;                 N * (N - 3)    &lt;br /&gt;&lt;br /&gt;           D  =  -----------       &lt;br /&gt;&lt;br /&gt;                     2&lt;br /&gt;&lt;br /&gt;Using the formula, we get &lt;br /&gt;1325 * 2 = N * (N - 3) &lt;br /&gt;N2 - 3N - 2650 = 0 &lt;br /&gt;&lt;br /&gt;Solving the quadratic equation, we get N = 53 or -50 &lt;br /&gt;&lt;br /&gt;It is obvious that answer is 53 as number of vertices can not be negative. &lt;br /&gt;&lt;br /&gt;Alternatively, you can derive the formula as triange has 0 diagonals, quadrangel has 2, pentagon has 5, hexagon has 9 and so on...... &lt;br /&gt;&lt;br /&gt;Hence the series is 0, 0, 0, 2, 5, 9, 14, ........ (as diagram with 1,2 or 3 vertices will have 0 diagonals). &lt;br /&gt;&lt;br /&gt;Using the series one can arrive to the formula given above.&lt;br /&gt; Brain Teaser No : 00076&lt;br /&gt;&lt;br /&gt;A cube is made of a white material, but the exterior is painted black. &lt;br /&gt;&lt;br /&gt;If the cube is cut into 125 smaller cubes of exactly the same size, how many of the cubes will have atleast 2 of their sides painted black? &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;44 &lt;br /&gt;&lt;br /&gt;36 of the cubes have EXACTLY 2 of their sides painted black, but because a cube with 3 of its sides painted black has 2 of its sides painted black, you must also include the corner cubes. This was a trick question, but hopefully the title of the puzzle tipped you off to this.&lt;br /&gt; Brain Teaser No : 00238&lt;br /&gt;&lt;br /&gt;Imagine a triangle of coins on a table so that the first row has one coin in it and the second row has two coins in it and so on. If you can only move one coin at a time, how many moves does it take to make the triangle point the other way? &lt;br /&gt;&lt;br /&gt;For a triangle with two row it is one, for a triangle with three rows it is two, for a triangle with four rows it is three. &lt;br /&gt;&lt;br /&gt;For a traingle with five rows is it four?&lt;br /&gt;Submitted &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;It takes 5 moves to make the triangle with 5 rows point the other way. &lt;br /&gt;&lt;br /&gt;0 = a coin that has not been moved. &lt;br /&gt;X = the old position of the moved coin &lt;br /&gt;8 = the new position of the moved coin. &lt;br /&gt;&lt;br /&gt;________X &lt;br /&gt;_______X X &lt;br /&gt;____8 0 0 0 8 &lt;br /&gt;_____0 0 0 0 &lt;br /&gt;____X 0 0 0 X &lt;br /&gt;_______8 8 &lt;br /&gt;________8 &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;For traingle of any number of rows, the optimal number of moves can be achieved by moving the vertically symmetrical coins i.e. by moving same number of coins from bottom left and right, and remaining coins from the top. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;For a triangle with an odd number of rows, the total moves require are : &lt;br /&gt;(N2/4) - (N-4) Where N = 4, 6, 8, 10, ... &lt;br /&gt;&lt;br /&gt;For a triangle with even number of rows, the total moves require are : &lt;br /&gt;((N2-1)/4) - (N-4) Where N = 5, 7, 9, 11, ... &lt;br /&gt;&lt;br /&gt;Thanks to Alex Crosse for submitting above formulas.&lt;br /&gt; Brain Teaser No : 00053&lt;br /&gt;&lt;br /&gt;A man is going to an Antique Car auction. All purchases must be paid for in cash. He goes to the bank and draws out $25,000. &lt;br /&gt;&lt;br /&gt;Since the man does not want to be seen carrying that much money, he places it in 15 evelopes numbered 1 through 15. Each envelope contains the least number of bills possible of any available US currency (i.e. no two tens in place of a twenty). &lt;br /&gt;&lt;br /&gt;At the auction he makes a successful bid of $8322 for a car. He hands the auctioneer envelopes number(s) 2, 8, and 14. After opening the envelopes the auctioneer finds exactly the right amount. &lt;br /&gt;&lt;br /&gt;How many ones did the auctioneer find in the envelopes? &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Each envelope contains the money equal to the 2 raised to the envelope number minus 1. The sentence "Each envelope contains the least number of bills possible of any available US currency" is only to misguide you. This is always possible for any amount !!! &lt;br /&gt;&lt;br /&gt;One more thing to notice here is that the man must have placed money in envelopes in such a way that if he bids for any amount less than $25000, he should be able to pick them in terms of envelopes. &lt;br /&gt;&lt;br /&gt;First envelope contains, 20 = $1 &lt;br /&gt;Second envelope contains, 21 = $2 &lt;br /&gt;Third envelope contains, 22 = $4 &lt;br /&gt;Fourth envelope contains, 23 = $8 and so on... &lt;br /&gt;&lt;br /&gt;Hence the amount in envelopes are $1, $2, $4, $8, $16, $32, $64, $128, $256, $512, $1024, $2048, $4096, $8192, $8617 &lt;br /&gt;&lt;br /&gt;Last envelope (No. 15) contains only $8617 as total amount is only $25000. &lt;br /&gt;&lt;br /&gt;Now as he bids for $8322 and gives envelope number 2, 8 and 14 which contains $2, $128 and $8192 respectively. &lt;br /&gt;&lt;br /&gt;Envelope No 2 conrains one $2 bill &lt;br /&gt;Envelope No 8 conrains one $100 bill, one $20 bill, one $5 bill, one $2 bill and one $1 bill &lt;br /&gt;Envelope No 14 conrains eighty-one $100 bill, one $50 bill, four $10 bill and one $2 bill &lt;br /&gt;&lt;br /&gt;Hence the auctioneer will find one $1 bill in the envelopes.&lt;br /&gt; Brain Teaser No : 00090&lt;br /&gt;&lt;br /&gt;The minute and the hour hand of a watch meet every 65 minutes. &lt;br /&gt;&lt;br /&gt;How much does the watch lose or gain time and by how much? &lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The minute and the hour hand meet 11 times in 12 hours in normal watch i.e. they meet after every &lt;br /&gt;= (12 * 60) / 11 minutes &lt;br /&gt;= 65.45 minutes &lt;br /&gt;= 65 minutes 27.16 seconds &lt;br /&gt;&lt;br /&gt;But in our case they meet after every 65 minutes means the watch is gaining 27.16 seconds.&lt;br /&gt; Brain Teaser No : 00093&lt;br /&gt;&lt;br /&gt;There is a number that is 5 times the sum of its digits. What is this number? Answer is not 0. &lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;The number is 45, simply because &lt;br /&gt;45 = 5 * (4 + 5) &lt;br /&gt;How does one find this number? &lt;br /&gt;&lt;br /&gt;Let T be the digit in the tens place and U be the digit in the units place. Then, the number is 10*T + U, and the sum of its digits is T + U. &lt;br /&gt;&lt;br /&gt;The following equation can be readily written: &lt;br /&gt;10*T + U = 5*(T + U) or &lt;br /&gt;10*T + U = 5*T + 5*U or &lt;br /&gt;5*T = 4*U &lt;br /&gt;&lt;br /&gt;Thus, T / U = 4 / 5 &lt;br /&gt;&lt;br /&gt;Since T and U are digits, T must be 4 and U must be 5.&lt;br /&gt;There are six boxes containing 5, 7, 14, 16, 18, 29 balls of either red or blue in colour. Some boxes contain only red balls and others contain only blue. &lt;br /&gt;&lt;br /&gt;One sales man sold one box out of them and then he says, "I have the same number of red balls left out as that of blue." &lt;br /&gt;&lt;br /&gt;Which box is the one he solds out?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Total no of balls = 5 + 7 + 14 + 16 + 18 + 29 = 89 &lt;br /&gt;&lt;br /&gt;Total number of balls are odd. Also, same number of red balls and blue balls are left out after selling one box. So it is obvious that the box with odd number of balls in it is sold out i.e. 5, 7 or 29. &lt;br /&gt;&lt;br /&gt;Now using trial and error method, &lt;br /&gt;(89-29) /2 = 60/2 = 30 and &lt;br /&gt;14 + 16 = 5 + 7 + 18 = 30 &lt;br /&gt;&lt;br /&gt;So box with 29 balls is sold out.&lt;br /&gt; Brain Teaser No : 00218&lt;br /&gt;&lt;br /&gt;Ekta got chocolates to give her friends on her Birthday. If she gives 3 chocolates to each friend, one friend will get only 2 chocolates. Also, if she gives 2 chocolates to each friends, she will left with 15 chocolates. &lt;br /&gt;&lt;br /&gt;How many chocolates Ekta got on her Birthday? and how many friends are there? &lt;br /&gt;&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;47 Chocolates and 16 Friends &lt;br /&gt;&lt;br /&gt;Let's assume that there are total C chocolates and F friends. &lt;br /&gt;&lt;br /&gt;According to first case, if she gives 3 chocolates to each friend, one friend will get only 2 chocolates. &lt;br /&gt;3*(F - 1) + 2 = C &lt;br /&gt;&lt;br /&gt;Similarly, if she gives 2 chocolates to each friends, she will left with 15 chocolates. &lt;br /&gt;2*F + 15 = C &lt;br /&gt;&lt;br /&gt;Solving above 2 equations, F = 16 and C = 47. Hence, Ekta got 47 chocolates and 16 friends&lt;br /&gt;Pooja and Esha met each other after long time. In the course of their conversation, Pooja asked Esha her age. Esha replied, "If you reverse my age, you will get my husbund's age. He is of course older than me. Also, the difference between our age is 1/11th of the sum of our age." &lt;br /&gt;&lt;br /&gt;Can you help out Pooja in finding Esha's age?&lt;br /&gt;Answer&lt;br /&gt;&lt;br /&gt;Esha's age is 45 years. &lt;br /&gt;&lt;br /&gt;Assume that Esha's age is 10X+Y years. Hence, her hunsbands age is (10Y + X) years. &lt;br /&gt;&lt;br /&gt;It is given that difference between their age is 1/11th of the sum of their age. Hence, &lt;br /&gt;[(10Y + X) - (10X + Y)] = (1/11)[(10Y + X) + (10X + Y)] &lt;br /&gt;(9Y - 9X) = (1/11)(11X + 11Y) &lt;br /&gt;9Y - 9X = X + Y &lt;br /&gt;8Y = 10X &lt;br /&gt;4Y = 5X &lt;br /&gt;&lt;br /&gt;Hence, the possible values are X=4, Y=5 and Esha's age is 45 years.&lt;br /&gt;A fish had a tail as long as its head plus a quarter the lenght of its body. Its body was three-quarters of its total length. Its head was 4 inches long. &lt;br /&gt;&lt;br /&gt;What was the length of the fish?&lt;br /&gt;Submitted&lt;br /&gt;&lt;br /&gt;The fish is 128 inches long. &lt;br /&gt;&lt;br /&gt;It is obvious that the lenght of the fish is the summation of lenghts of the head, the body and the tail. Hence, &lt;br /&gt;Fish (F) = Head (H) + Body (B) + Tail (T) &lt;br /&gt;&lt;br /&gt;But it is given that the lenght of the head is 4 inches i.e. H = 4. The body is three-quarters of its total length i.e. B = (3/4)*F. And the tail is its head plus a quarter the lenght of its body i.e. T =
