Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
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
a graph g with n nodes is bipartite if it have no cycle of odd
the difference among the height of the left sub tree and height of the right tree for each node is almost one avl -
the largest and the second largest number from a set of n distinct numbers can be found in o
to execute sparse matrix dynamically which data structure is usedlinked list data structure is used to execute sparse matrix
what are advantages and disadvantages of ttl gates design with wired-and connection ansadvantages and disadvantages in this ic added logic is
what are the applications of linked list area fixed block storage allocationb garbage
which operations is performed more efficiently by doubly linked list than by singly linked listdeleting a node whose location is given
the search method for searching a sorted file that needs increased amount of space isthe search technique for searching a sorted file that needs
a sorting method which uses the binary tree concept such that label of any node is larger than all the labels in the sub trees is calleda sorting
recursive procedures are implemented by usingrecursive procedures are executed by using stacks due to stacks are lifo data structure and we require