CSC 2200 Study Guide - Spring 2018, Comprehensive Midterm Notes - Algorithm, Time Complexity, Sorting Algorithm

• School: Wayne State University
• Department: Computer Science
• Course: CSC 2200
• Professor: Sushma Vallamkonda

Document Summary

Introduction to data structures: study of various ways of organizing data in a computer. Information is manipulated systematic and step-by-step procedure called algorithm: manipulation involves adding, searching, deleting, re-arranging, sorting, traversing data items, foundation terms of a data structure. Interface: represents the set of operations that a data structure supports, provides the list of supported operations, types of parameters, they can accept and return type these operations. If the application is to search an item, it has to search an item in 1 million(10^6) items every time slowing down the search. If a(cid:374) operatio(cid:374) takes (cid:894)(cid:374)(cid:895) ti(cid:373)e i(cid:374) executio(cid:374), then m operations will take (cid:373) (cid:894)(cid:374)(cid:895) ti(cid:373)e: best case, this is the scenario depicting the least possible execution time of an operation of a data structure. If a(cid:374) operatio(cid:374) takes (cid:894)(cid:374)(cid:895) ti(cid:373)e i(cid:374) executio(cid:374), the(cid:374) the actual operation may take time as the random number which would be maximum as.