Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
1 write a program to reverse the direction of a given singly-linked list in other words after the reversal all pointers
design a dictionary data structure in which search insertion and deletion can all be processed in o1 time in the worst
find an expression for the sum of the ith row of the following triangle and prove its correctness each entry is the sum
you have an unordered array x of n integers find the array m containing n elements where mi is the product of all
suppose you are given an input set s of n numbers and a black box that if given any sequence of real numbers and an
design a data structure to support the following operationsbull insertxt - insert item x into the set tbull deletekt -
in the bin-packing problem we are given n metal objects each weighing between zero and one kilogram our goal is to find
1 imagine you have a closet full of shirts what can you do to organize your shirts for easy retrieval2 write a function
you are given a search string and a magazine you seek to generate all the characters in search string by cutting them
1 determine whether a linked list contains a loop as quickly as possible without using any extra storage also identify
the grinch is given the job of partitioning 2n players into two teams of n players each each player has a numerical
1 write a function to find the middle node of a singly-linked list2 write a program to convert a binary search tree
1 what is the best data structure for maintaining urls that have been visited by a web crawler give an algorithm to
describe how to modify any balanced tree data structure such that search insert delete minimum and maximum still take
a give an efficient algorithm to find the second-largest key among n keys you can do better than 2n - 3 comparisonsb
take a sequence of 2n real numbers as input design an on log n algorithm that partitions the numbers into n pairs with
suppose you are given an array a of n sorted numbers that has been circularly shifted k positions to the right for
consider the numerical 20 questions game in this game player 1 thinks of a number in the range 1 to n player 2 has to
consider an n times n array a containing integer elements positive negative and zero assume that the elements in each
1 implement an algorithm that takes an input array and returns only the unique elements in it2 you have a computer with
a company database consists of 10000 sorted names 40 of whom are known as good customers and who together account for
let p be a simple but not necessarily convex polygon and q an arbitrary point not necessarily in p design an efficient
implement versions of several different sorting algorithms such as selection sort insertion sort heapsort mergesort and
implement an external sort which uses intermediate files to sort files bigger than main memory mergesort is a good
design and implement a parallel sorting algorithm that distributes data across several processors an appropriate