Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
explain the need for user-defined functionsthe need for user-defined function1 a programmer might be having a block of code that he has repeated
why a linked list is called a dynamic data structure what are the advantages of using linked list over arrays a linked list is known as a
the various memory allocation functions are described belowi malloc it is a memory allocation function that assigns requested size of bytes and
what is dynamic memory allocationthe mechanism of allocating needs amount of memory at run time is known as dynamic allocation of memory sometimes it
what is structured programmingstructured programming means the collection of principles and practices that are directed toward developing right
necessary features of an algorithm1input the algorithm should take zero or more input2 output the algorithm should generate one or more outputs 3
how do you calculate the complexity of sorting algorithms find the complexity of insertion sort and bubble
global and local variablesglobal variables the features are as pursue declared outside of all functions or before main these can be used in all the
how is multidimensional arrays defined in terms of an array of pointeran element in a multidimensional array like two-dimensional array can be shown
what is insertion sortinsertion sort one of the easiest sorting algorithms is the insertion sort insertion sort having of n - 1 passes for pass p 2
explain a macromacro is a preprocessor directive also called as macro definition takes the following general form define identifier
what is loopingloop is a control structure used to do repetitive operation some programs include repeating a set of instruction either a particular
what are multidimensional arraysmultidimensional array multidimensional arrays can be defined as arrays of arrays for example a bidimensional array
explain file scopefile scope the variables and functions with file scope appear outside any block or list of parameters and are accessible from any
what is function scopefunction scope a label is the only part of identifier that has function scope a label is declared implicitly by its use in a
what is block scopeblock scope the variables with block scope appear in a block or within the list of formal parameter declarations in a function
two-dimensional array is represented in memory in following two ways1 row major representation to attain this linear representation the first row
two properties of recursion are- 1 a smallest base case that is processed without recursion and acts as decision criterion for stopping the method of
what is recursionrecursion - recursion is described as a technique of defining a set or a process in terms of
assume that a graph has a minimum ning tree already computed how fastly can the minimum ning tree be updated if a new vertex and incident
the six several application of stack in computer application is1 conversion of infix to postfix notation and vice versa2 evaluation of
what are stacks a stack is an abstract data type in which items are additional to and removed only from one end known as top for example consider
what is a heapa complete binary tree every of whose elements contains a value that is greater than or equal to the value of every of its children
depth-first search is different from breadth-first search in the following waysa depth search traversal method goes to the deepest level of the tree
incidence matrix - this is the incidence matrix for an undirected group for directed graphs the vertex from where an edge is originating will have 1