Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
the void type is used for the void type is used to make generic
what is a digital multiplexer ansmultiplexer data selector or mux is a logic circuit selects binary information from one of several input and
the variable that are declared outside all the functions are calledthe variables that are declared outside every functions are known as global
the constructed datatype of c is known as structure is a constructed datatype of
direct or random access of elements is not possible in-in linked list direct or random access of elements is not
what are the requirements to design sequential circuitans design requirements of sequential circuiti the circuit specifications translated into a
what are the requirements to design combinational logic ans design requirements of combinational logic-i by the specifications of circuit we find out
a desirable choice for the partitioning element in quick sort isfirst element of the
the slowest sorting procedure is bubble sort is the slowest sorting
a data structure in which an element is added and detached only from one end is known
a sorting algorithm is stable if preserves the original order of records with equivalent
the data structure required to convert a recursion to an iterative procedure is stack is the data structure required to convert a recursion to an
hashing collision resolution techniques area chainingb bucket addressing
how will you form an 8 bit adder using 2 four bit adder ics 7483ans4 bit adder ic is ic 7483 this has two four bit data inputs and output carry 4 bit
explain the power dissipation characteristics for digital icsanspower dissipation - it is amount of power dissipated in a digital ic this is
explain the propagation delay characteristics for digital icsanspropagation delay - the speed of a digital ic operation is given in terms of
the extra key inserted at the end of the array is called asentinel is the extra key inserted at the end of the
the ning tree of connected graph with 10 vertices have9 edges of ning tree of connected graph with 10
a sorted file having 16 items using binary search the maximum number of comparisons to find for an item in this file isthe maximum number of
the maximum number of nodes in a binary tree of depth 5 is31 is the maximum number of nodes in a binary
a binary tree can be converted in to its mirror image by traversing it in
one can change an infix expression to a postfix expression using a by using stack you can convert infix expression to a postfix
overflow condition in linked list may happen when attempting tomake a node when free space pool is
the sorting method where array to be sorted is partitioned again and again in such a way that all elements less than or equivalent to partitioning
a full binary tree with n non-leaf nodes have 2nl