Posts

Which are the following Data structure operations?

Which are the best topics Data structure operations play a major role? The following four operation play a major role in this text:- 1✍️Traversing:-                 Accessing each record exactly once so that certain items in the record may be processed. 2✍️ Searching:-                 Finding the location of the record with a given key value or finding the location of all records which satisfy one or more conditions. 3✍️ Inserting:-                 Adding a new record to the structure. 4✍️Deleting:-                 Removing a record from the structure. The following two operation which are used in special situations will also be considered:- 1✍️ Sorting:-                  Arranging the records in some logical order (e.g., alphabetically according to some NAME key,in numerical order acc...

What are the best automatic layout?

What is the most important automatic layout? Hierarchical stick diagram are a good way to design large costom cells.But you will probably design large cells from scratch infrequently. Use layout generated by one of two automated methods:- 1✍️Cell generator:-               It is a parametrized layout it is a program written by a person to generate the layout for a particular cell or a families of cells.Generator language let skilled designer create parameterized layout for such cells which can be used by chip designer whose expertise is in system design not circuit and layout design. 2✍️ Standard cell placement and routing:-              In which are logic gates,latch, flip-flops or occasionally slightly larger functions like full adder.    The components cell which are of standard height but of varying width are arranged in rows,wires are in routing channls between the cell rows,along the sides and occasiona...

The IBM ASIC design flow require cooperation between the costomer and the manufacturer's design house.

The IBM ASIC design flow require cooperation between costomer and the manufacturer's design house. ✍️ Design entry:-               Design are entered in a hardware description language such as VHDL or verilog Schematic entry is also supported. ✍️ Logic synthesis:-               IBM logic synthesis tools are used to map the design into a gate level design in the IBM cell library.Logic synthesis also ensures that the design is appropriate for LSSD. ✍️ Simulation:-               The design can be supported either at the functional or gate level. ✍️Floorplaning:-                 It can be used to estimate wiring capacitance,area and wiring congestion. ✍️Test structure verification:-                This step ensure that the design satisfies a set of IBM defined rules that ensure the design - including RAM,etc-...

How do you have any transistor parasitics ?

How do you have any device are transistor parasitics? Real device have parasitic that are necessary artifact's of the device structure.The transistor itself introduces significant gate capacitance(Cg) This capacitance which comes from the parallel plate formed by the poly gate and the substrate form the majority of the capacitive load in small logic circuit.Ch=0.9fF/,micrometer square for both n-type and p-type transistor in a typical 2micrometer process.The total gate capacitance for a transistor is computed by measuring the are of the active region (or W × L) and multiplying the area by the unit Cg.       During fabrication the dopants in the source/drain region diffuse in all directions including under the gate.The source/drain overlap region is independent of the transistor length so it is usually given in units of farada per unit gate width Then the total source overlap capacitance for a transistor would be                 ...

What is Sorting and searching are fundamental operation in computer science engineering?

What is Sorting and Searching are fundamental operation in computer science engineering? What is Sorting?       Sorting refers to the operation of arranging data in some given order,such as increasing or decreasing with numerical data or alphabetically with character data. Let A be a list of n elements A1, A2,......An in memory. Sorting a refers to the operation of rearranging the contents of A so that they are increasing in order (numerical or lexicographically ), that is,so that                 A1<=A2<=A3<=...<=An Since A has n elements there are n!ways that the contents can appear in A. These way correspond precisely to the n! permutations of 1,2,......n . Accordingly each sorting algorithm must take care of these n! possibilities. What is searching?          Searching refers to the operation of finding the location of a given item in a collection of items.

CAD system and algorithms

CAD tool require learning its underlying models and its algorithms.A brief word about design representation in CAD system There are two ways to organise a collection of CAD tools.In a database system, information is stored in a central set of files and access to that information is provided through a set of standard routine.             A database driven CAD system is sometimes referred to as a hub -and-spoke system becouse all tools talk to the central database and see a common representation for the design.            CAD design data may be thought of as structural description -graph,geometric etc. Functional behaviour is often stored as either a simple data flow graph or as a more general control data flow graph [Sno78], which includes both data flow and sequencing information.          One important function of integrated CAD system is back annotation the amendment of a description usually a circuit...

Who are stacks and recursion?There basic are operation associated

What happened by stacks and recursion?There are basically used for operation associated with stacks and recursion. What is a stacks?  Stack is a list of elements in which an element may be inserted or deleted only at one end the top of the stack. Two basic operation associated with stacks:- ✍️"Push" is the term used to insert an element into a stack. ✍️"Pop" is the term used to delete an element from a stack. What is a recursion? Recursion is an important concept in computer science.Many algorithms can be best described in terms of recursion. Recursion may be implemented by means of stacks. Recursive procedure must have the following two properties:- ✍️There must be certain called base criteria for which the procedure doesn't call itself. ✍️Each time the procedure does call itself (directly or indirectly)it must be closer to the base criteria. Recursive defined by it must have the following two properties:- ✍️There must be certain argument called base value for ...