Q.273 Suppose we wish to partition the square roots of the integers from 1 to 100 in to
two piles of fifty numbers each, such that the sum of the numbers in the first pile
is as close as possible to the sum of the numbers in the second pile. If you could
use minimum computer time to answer this question, what computations would
you perform on the computer in that time? (5)
Ans :

DESIGN A NAND GATE USING 2:1 MULTIPLEXER?

WHY PMOS WIDTH IS GREATER THAN NMOS?

WHAT HAPPENS IF PMOS AND NMOS INTERCHANGE?

WHICH IS FASTER WRITE CACHE OR READ CACHE?

IN A NEGATIVE FEEDBACK CONTROL SYSTEM,WHAT HAPPENS TO GAIN AND BANDWIDTH?

WHAT HAPPENS TO VTH IF TEMPERATURE INCREASES?

DIFFERENCE BETWEEN SRAM AND DRAM?

DIFFERENCE BETWEEN LATCH AND FLIPFLOPS?

ASIC FLOW STEPS?

WHAT IS DIFFERENCE BETWEEN WRITE AND DISPLAY?

HOW TO PLAY MUSIC FROM C PROGRAMM?

HOW TO SEE TOTAL MEMORY CONSUMED BY C PROGRAMM?

WHAT IS BINARY SEARCH TREE AND AVL TREE?

WHAT IS PAGE FAULT?

DIFFERENCE BETWEEN PROCESS AND THREAD?

WHAT IS DIFFERENCE BETWEEN ENUM,STRUCTURE AND UNION?

WHAT IS DIFFERENCE BETWEEN STATIC AND VOLATILE?

SASKEN COMPANY PROFILE