Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
ansa procedure to reverse the singly linked listreversestruct node ststruct node p q rp stq nullwhilep nullr qq pp p
q. define the terms data type and abstract data type. comment upon the significance of both these. answe determine the total amount of memory to
q. what do you understand by the term hashing? how do the collisions occur during hashing? explain the different techniques or methods for
q. devise a representation for a given list where insertions and deletions can be made at both the ends. such a structure is called deque which means
q. define the sparse metrics and also explain the representation of a 4x4 matrix using linked list. ansa matrix in which number
q. write down a programme in c to create a single linked list also write the functions to do the
q. write down an algorithm to merge the two sorted arrays into the third array. do not perform the sort function in the third array.
q. explain what are the stacks? how can we use the stacks to check whether an expression is correctly parentheses or not. for example is well
q. explain dijkstras algorithm for finding the shortest path in the graph given to us. ansthe dijkstras algorithm this is a problem which is
q. explain the term hashing? explain any five well known hash functions. anshashing method
q. write down the algorithm to insert an element to a max-heap which is represented sequentially.
q. how do we represent a max-heap sequentially? explain by taking a valid example. ansa max heap is also called as a
q. illustrate the steps for converting the infix expression into the postfix expression for the given expression a blowast c de
q. what is the need of using asymptotic notation in the study of algorithm? describe the commonly used asymptotic notations and also give their
simulation is the process of making an abstract model of a real world situation in order to be aware of the effect of modifications and alterations
a useful tool which is used for specifying the logical properties of a data type is called the abstract data type or adt. the term abstract data type
q. which are the two standard ways of traversing a graph? explain them with an example of each. ans the two ways of traversing a graph are
q. explain the insertion sort with a proper algorithm. what is the complication of insertion sort in the worst case?
q. write down a non recursive algorithm to traverse a binary tree in order. ansnon - recursive
q. write an algorithm insert which takes a pointer to a sorted list and a pointer to a node and inserts the node into its correct position or place
q. calculate that how many key comparisons and assignments an insertion sort makes in its worst case? ansthe worst case
q. write down the algorithm which does depth first search through an un-weighted connected graph. in an un-weighted graph would breadth first search
q. write down an algorithm to insert a node in the beginning of the linked
q. state the difference between a grounded header link list and a circular header link list? ansa header linked list is a linked list which
q. explain the technique to calculate the address of an element in an array. a 25 times 4 matrix array data is stored in memory in row-major