DSA Exam Questions And Correct Answers | Graded To Pass

DSA Exam Questions And Correct Answers | Graded To Pass Abstract Data Types - Answer- Computational problems Data - Answer- info to state knowledge about world components and properties of a type of data, relationships among these data Operations - Answer- manipulate data to reason about world Specification - Answer- ADT Stage what are the data and operations from the pov of the user Representation - Answer- ADT Stage how are the data stored decided by someone implementing ADT Implementation - Answer- ADT Stage how are the operations performed decided by someone implement ADT Fields, Methods - Answer- OOP languages implement adt naturally Set of Data - Answer- static, dynamic static - Answer- change infrequently, fixed dynamic - Answer- items are added or removed over time Data Relationship, Operation on data, Static or Dynamic - Answer- factors for modelling set of data Data Structures - Answer- Representation that show relationship among data in computer environment Primitive data structure - Answer- Bit boolean Bit string/byte/int/char Composite data structure - Answer- Ordered tuple Arrays, structs, classes/objects String of char/ floating point number Algorithms - Answer- well-defined procedure that processes input values to generate desired output values to solve a problem implement operations using data structure Abu Ja'Far - Answer- wrote procedure to perform math operations Al-Khwarizmi - Answer- algorithms Aspect of Good Algorithm - Answer- input output definite finite correct effective general efficient 3 ways of implementation - Answer- natural language programming language pseudocode Program - Answer- data structure + algorithms functions - Answer- with return value subroutines - Answer- no return value, has side effects toString - Answer- returns conversion of sequence to string isFull - Answer- return true if the sequence is full append - Answer- subroutine, add a character at the end of sequence, unless it is full iteration - Answer- execution of loops body iterating block of statements (looping once) recursion - Answer- solves problems in terms of smaller part or instances though procedure - functions /subroutines procedure calling itself / cycle of procedure calls elements of recursion - Answer- basis, recursive step basis - Answer- direct solution to smallest part recursive step - Answer- solves big problem in terms of solution to smaller part pseudocode - Answer- algorithms will be described using __________ similar to pascal notation iteration - Answer- -more efficient -critical -application is called repeatedly or executed Recursion - Answer- -faster if hardware & o/s are built for it -simple and consistent -different execution time is not perceivable -conversion to iteration is complex Tail Recursion - Answer- linear recursive method makes the recursive call as its last step (kung ano yung last step dun na magiistop yung program) after recursive call wala na gagawin array reversal method Non-tail recursion - Answer- recursive call is not the last step tail call optimization - Answer- avoid stack overflow by removing frames can drop old stack frame Algorithm Analysis - Answer- study of amount of resources used by algorithm to solve problems Correctness & Generality Efficiency Correctness & Generality - Answer- Primary properties Efficiency - Answer- secondary but also important time & space efficiency Time efficiency - Answer- amount of time algorithm takes to complete problem Space efficiency - Answer- The amount of memory that an algorithm uses Empirical Method - Answer- experimental approach to measuring efficiency based on ACTUAL EXPERIENCE dependent sa runtime environment and sa machine na ginagamit hands-on actual running ng algo sa program languages 1. Write program 2. Run program 3. Measure resources - Answer- process of empirical method External Factors - Answer- -computer hardware -network conditions -input -algorithm -concurrent users & programs -OS -prog language -computer processor -available memory Theoretical Method - Answer- detach sa runtime environment focus on algorithm, input language & machine independent theoretical units of time & space Theoretical method - Answer- preferred way to analyze algorithm compare fairly w/o environmental factors