Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
Provide an example of when passing parameters through reference as opposed to passing them by value is a better technique. For each example explain why you believe that technique is better than the
If a telephone line can carry a signal with a baud rate of 6000 and we want to transmit data at 33600 bps, how many different signal levels will be necessary? Is this how 33600 bps modem operates?
Describe an algorithm to play the Game of Nim using all of the three tools discussed in class (pseudocode, flowchart, hierarchy chart). The rules for the game given
Design a DSS to help decision-makers run the 2012 London Olympics.
Explain how you would estimate arithmetic expression using stack. Describe in detail.
Write down the algorithm for inserting a node in circular linked list.
Explain the worst and average case time complexities of the binary search.
Explain the divide and conquer method?
Describe traveling salesperson problem by using dynamic programming and greedy technique?
Describe the term linked list. Explain how you perform addition and removal in the linked list.
Illustrate the efficiency of the Merge Sort algorithm? Also illustrate the efficiency of Insertion Sort, Bubble Sort and Selection Sort algorithms in the worst case?
Assume that we build the Huffman code tree for the set of letters and frequencies shown below:
Make a binary tree for the given pre-order and in-order traversal sequences.
Distinguish between the Stack and Queue data structure.
Explain why is a linked list termed as a dynamic data structure? Illustrate the merits of using linked lists over arrays?
Describe first fit and best fit approaches of the memory management. Write down an algorithm for best fit approach.
Write down an algorithm for the quick sort. Compare its complexities for worst case, average case and the best case. Sort the given by using quick sort:
Illustrate the meaning of complete threaded binary tree? Explain how null pointers are replaced in it?
Transform the following infix expression into its equivalent postfix and prefix expression: (A+B^D)/ (E-F) +G. Determine the postfix expression for the following given expression: P : 6,2,3,+,-,3,8,2
Discuss the method of Quick sort by explaining the sorting of following given example:A = {9, 93, 16, 34, 42, 58}. Write down the program for explaining the insertion sort.
Describe the data type and draw the hierarchy of data types.
What do you mean by adjacency list representation of a graph? Describe with the help of an illustration. As well write its merits over the adjacency matrix representations of graph.
Describe the fundamental principle of dynamic programming by using a simple illustration.
Calculate the average case complexity of the linear search algorithm.
Write down a function in C program which traverses a threaded binary tree in preorder.