Data Structures Using C A Practical Approach For Beginners 1st Edition Amol M Jagtap, Ajit S Mali - Solutions

Briefly differentiate linear search algorithm from a binary search algorithm.
Which of the following data structure is used in hash tables?A. QueueB. Doubly linked listC. StackD. Array
List all types of sorting techniques? Give the advantage of merge sort?
What is the time complexity of searching, deleting and inserting into direct addressing in hashing?A. O(1), O(n), O(1)B. O(n), O(n), O(1)C. O(1), O(1), O(1)D. O(1), O(n), O(n2)
Which of the following sorting technique is called non-linear sorting?A. Heap sortB. Bubble sortC. Insertion sortD. Quick sort
Explain in detail about sorting and different types of sorting techniques.
Which of the following is not an example of a closed hashing or open addressing method?A. Linear probingB. Quadratic probingC. Double HashingD. Chaining
Write a program to explain bubble sort. What is the worst-case and best-case time complexity of bubble sort?
What is the quickest search method among the following in the worst case?A. Linear searchingB. Binary searchingC. HashingD. Sequential search
Write a C-program for sorting integers in ascending order using insertion sort.
Which of the following is an example of an open hashing or closed addressing method?A. Linear probingB. Quadratic probingC. Double HashingD. Use of buckets
Explain the selection sort? Demonstrate the selection sort results for each pass for the following initial array of elements 21, 36, 83, 57, 31, 79, 31, 18 and 55.
What is the space complexity of quick sort and merge sort algorithm?A. O (n log2 n), O (log2 n)B. O (log2 n), O (n)C. O (n), O (log2 n)D. O (1), O (n)
Explain the algorithm for selection sort and give a suitable example.
Explain the analysis of searching techniques with best, average and worst case.
Write and explain the C program for binary search with time complexity?
Explain the algorithm for quick sort and give a suitable example.
Write a program to implement quick sort.
What are the different types of hashing techniques explain with a suitable example?
What is hashing? Explain collision in hash function with suitable example?
Write a note on types of hash functions?
What is open and closed hashing?
Discuss collision resolution techniques with examples.
Write a note on linear probing and chaining without replacement?
Why do we want to use BST?
If a node has two children that node we want to delete from a BST, then that deleted node must be replaced by its A. In-order successor B. In-order predecessor C. Post-order successor D. Post-order predecessor
What is AVL Tree?
A 2-3 is a type of tree which is having the following properties,a. 2-3 tree’s all internal nodes have either two or three children.b. 2-3 tree’s all paths from root to leaves have the same lengthc. Then the number of internal nodes of a 2-3 tree having nine leaves could be A. 4 or 8 B. 5 or
What are advantages and disadvantages of BST?
Which type of traversal of BST produces the value in ascending sorted order?A. Preorder traversal B. Post-order traversal C. In-order traversal D. All of the above
Explain the difference between binary tree and BST with an example?
In a complete binary tree or perfect binary tree, every inner node has exactly two children. If there are 21 leaf nodes or exterior nodes in the tree, how many internal nodes are there in the perfect binary tree?A. 19 B. 20 C. 22 D. 18
Implement preorder traversal of binary tree using recursion?
Assume that we have numbers between 1 and 1000 in a BST and want to search for the number 363. Which of the below ordering could not be the ordering of the node reviewed?A. 2, 252, 401, 398, 330, 344, 397, 363 B. 924, 220, 911, 244, 898, 258, 362, 363 C. 925, 202, 911, 240, 912, 245, 258, 363 D.
What are different binary tree traversal techniques?
What is an algorithm and flowchart explain with suitable example?
Explain pseudo-code representation in detail.
Write an algorithm to read three different numbers from the user and then find the largest between that three numbers.
Draw the flowchart to check whether a number is a prime number.
Write an algorithm and flowchart for finding the sum of all odd numbers from 100 to 500.
Write an algorithm and flowchart to calculate even numbers between 0 and 500.
Write an algorithm and flowchart to find the middle number by giving three numbers.
What is an ADT in data structure?
What is the difference between an ADT and a data structure?
Explain data structure with suitable examples?
What are the applications of data structures?
What are the different types of data structures?
What are the different advantages and disadvantages of flowchart?
What is the performance analysis of an algorithm?
What are the two main measures for the efficiency of an algorithm?
Explain the different symbols used in the flowchart.
Which of the following issues cannot be resolved by recursion?A. Factorial of a numberB. Finding of a prime numberC. Problems without base caseD. Finding of sum of digits in any number
The recursion process is identical with which of the following construct?A. Switch caseB. If elseC. LoopD. if else if ladder
What will be the output of the following code?A. 642B. 654321C. 662D. 6420 #include void recursion (int n) { if (n = 0) return; } printf("%d", n) ; recursion (n-2); } int main() { recursion (6); return 0;
Which of the following data structure used to implement recursion in the main memory?A. StackB. ArrayC. Linked listD. Tree
What will be the output of the following C code?A. Hello students is printed onceB. Hello students is printed infinite timesC. Hello students is printed till the stack overflows occurD. None of the above #include int main () { } printf ("Hello students"); main (); return 0;
A sequential solution of any program that is written in any natural language is called as:A. FlowchartB. AlgorithmC. MethodD. A and B both
Which of the following code describes how you would implement an algorithm without getting into syntactical details.A. Program codeB. Pseudo-codeC. Machine-level codeD. Binary code
Which of the following is true for ADT that is ADT?I. ADT is a type or class for objects whose behavior is defined by a set of values and a set of functions.II. ADT is only stating that what operations are to be carried out.III. ADT does not mention how data will be organized in memory.A. I and II
Algorithm efficiency or performance analysis of an algorithm is concerned with which of the following things.A. Time complexityB. Space complexityC. Both A and BD. None of the above
Elements of program space within space complexity include which of the following.A. Instruction spaceB. Data spaceC. Stack spaceD. All the above
Which of the following statements is false or true?1. Pseudo-code is an informal language used by programmers to develop algorithms.2. The pseudo-code contains no variable declaration.A. Statement 1 is falseB. Statement 2 is falseC. Statements 1 and 2 both are falseD. Statements 1 and 2 both are
Which of the following statements is false or true?1. A flowchart is a kind of diagram which represents an algorithmic program, a workflow or operations.2. A sequential solution of any program that is scripted in any natural language is called as an algorithm.A. Statement 1 is falseB. Statement 2
Which of the following statements is false or true?1. Space complexity is defined as the total amount of secondary memory a program needs to run to its completion.2. The amount of time required for a program to compile is called as its time complexity.A. Statement 1 is falseB. Statement 2 is
Which of the following statements is false or true?1. Minimum number of steps that can be executed for given inputs is called as best case.2. Maximum number of steps that can be executed for given inputs is called as worst case.A. Statement 1 is falseB. Statement 2 is falseC. Statements 1 and 2
Which of the following statements is false or true?1. The recursive function is a function that is invoked by itself.2. Algorithm A is considered direct recursive algorithm if it calls another algorithm B that in turn calls A.A. Statement 1 is falseB. Statement 2 is falseC. Statements 1 and 2 both
What is a queue?
What is a priority queue?
What are the disadvantages of sequential storage?
What are the disadvantages of representing a stack or queue by a linked list?
List out the areas in which data structures are applied extensively.
What is LIFO?
Which data structures are applied when dealing with a recursive function?
What is a stack?
What is the difference between a PUSH and a POP operation?
List different applications of queue data structure.
Explain what are Infix, Prefix and Postfix Expressions?
Why and when should we use stack and queue data structures instead of arrays or Lists?
What are different operations we can perform on queues?
What is the advantage of the heap over a stack?
What is a dequeue?
What is the state of the stack after the following sequence of pushes and pops? Stack s; 3 ); s.push( s.push ( 5 ); 2); 15 ); 42 ) ; s.push( s.push( s.push( s.pop (); s.pop (); s.push ( 14 ); s.push ( 7 ); s.pop (); s.push ( 9 ); s.pop (); s.pop (); s.push ( 51 ); s.pop (); s.pop();
Suppose the numbers 0, 1, 2,. . . , 9 were pushed onto a stack in that order but that pops to occur at random points between the various pushes. The following is a valid sequence in which the values in the stack could have been popped:3, 2, 6, 5, 7, 4, 1, 0, 9, 8 Explain why it is not possible that
Consider an empty stack of integers. Let the numbers 1, 2, 3, 4, 5 and 6 be pushed onto this stack only in the order they appeared from left to right. Let S indicate a push and X indicate a pop operation. Can they be permuted into order 325641 (output) and order 154623? (if a permutation is
How to implement two stacks using only one array. Your stack practices must not indicate an overflow unless every slot in the array is used?
How to implement stack using two queues?
Stack data structure is based on which of the following principleA. First in frst outB. First in last outC. Last in last outD. Last in frst out
Which of the following is not the type of queue data structure?A. Priority queueB. Circular queueC. Single-ended queueD. Ordinary queue
Which of the following data structure is non-primitive linear data structure?A. StackB. GraphC. TreesD. Binary tree
Which of the below is true about stack implementation using a linked list?A. In a push operation, if new nodes are inserted at the beginning of the linked list, then in pop operation, nodes must be deleted from the end.B. In a push operation, if new nodes are inserted at the end of the linked list,
Assume that a stack is to be implemented with a linked list rather than an array. What is the time complexity of the push and pop operations of the stack implemented using a linked list hoping that stack is implemented effectively?A. O(n log k)B. O(nk)C. O(n2)D. O(k2)
Which of the following statements is false or true?A. The stack is a non-primitive linear data structure.B. The queue is a primitive nonlinear data structure.A. Statement 1 is falseB. Statement 2 is falseC. Statements 1 and 2 are falseD. Statements 1 and 2 are true
The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, that is, starting from G. The stack is popped fve times, and each element is inserted into a queue. Two elements are deleted from the queue and pushed back onto the stack. Now, one element is popped from the stack.
Which of the following is an application of non-primitive linear queue data structure?A. When a resource is shared among multiple consumers?B. When data is transferred asynchronously between two processes?C. Load balancingD. All of the above
Which of the following statements is false or true?A. The queue is useful in CPU scheduling, disk scheduling.B. Priority queues are used in Huffman codes for data compression.A. Statement 1 is falseB. Statement 2 is falseC. Statements 1 and 2 are falseD. Statements 1 and 2 are true
Which of the following statements is false or true?A. In the DFS graph, the traversing technique queue data structure is used.B. In expression evaluation, the stack data structure is used.A. Statement 1 is falseB. Statement 2 is falseC. Statements 1 and 2 are falseD. Statements 1 and 2 are true
Stack cannot be used toA. Implement recursionB. Arithmetic expression evaluationC. Parsing or syntax analysisD. In CPU scheduling and disk scheduling.
A single array A[1..MAXSIZE] is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables top1 and top2 (topl< top 2) point to the location of the topmost element in each of the stacks. If the space is to be used efficiently, the condition for “stack full” is
Which one of the following is an application of stack data structure?A. Implement recursionB. Towers of Hanoi problemsC. Arithmetic expression evaluationD. All of the above
The postfx form of the expression (A+ B)*(C*D-E)*F / G is?A. AB+ CD*E - FG /**B. AB + CD* E - F **G /C. AB + CD* E -*F *G /D. AB + CDE * -* F *G /

Showing 100 - 200 of 507

Data Structures Using C A Practical Approach For Beginners 1st Edition Amol M Jagtap, Ajit S Mali - Solutions

Step by Step Answers