Freshy

AUTOCAD Practice Exam When using the Move command, from which point is an object moved? - Answer- Base point When using the method of typing an angle degree into the Command line to rotate an object, which way will AutoCAD automatically turn the object? - Answer- Counterclockwise Which option will break apart an array so that it is made up of individual components? - Answer- Explode If a mistake is made in a project, which is the shortcut key that undoes something within AutoCAD - An...

AutoCAD Certification Test Associative - Answer- This hatch or fill is updated when you modify its boundary objects Draw Order - Answer- Allows you to place a hatch or fill behind all other objects, in front of all other objects, behind the hatch boundary, or in front of the hath boundary Pick Points - Answer- Determines a boundary from existing objects that form an enclosed area around the specified points Select objects - Answer- Determines a boundary from selected objects that for...

Autocad certification Grip mode - Answer- it allows you to edit the size, position, and rotation of a selected object Where do you go to change snap and grid settings? - Answer- 1. Bottom told bar right click on icon for Snap Mode, click on settings 2. In drafting settings under snap and grid How to use the Window Polygon command - Answer- 1. In command line enter SELECT and press enter 2. Type WP and press enter 3. click in the area you want What is the correct method of selectin...

CITS2200 Data Structures & Algorithms Proof by Induction - Answer- Aims to prove correctness for an infinite amount of cases/input. Base case: prove the statement holds true for the smallest possible input/first case. Inductive case: assuming the statement holds true for the n'th case, the statement should hold true for n+1 cases 1) State what it is your trying to prove and prove it is true for the lowest value of n (usually 1) 2) Assume it to be true for P(k) and write that mathemat...

3358 Data Structures and Algorithms Exam I If two or more different functions are given the same name, that name is said to be ____________ - Answer- overloaded The name of a function can be overloaded, provided no two definitions of the function have the same __________ - Answer- signature The ___________ of a function is a list of the types of its parameters, including any const and reference or pointer indicators (& or *) - Answer- signature Why are function signatures importan...

Data Structures and Algorithms Python Name Every Data Structure (There are 8 Main Ones) - Answer- 1. Array 2. Stack 3. Queue 4. Linked Lists 5. Hash Table 6. BST 7. B-Tree, Red Black Trees 8. Heaps Name Every Python Super Basic Datastructure - Answer- 1. List 2. Tuples 3. Sets 4. Strings 5. Arrays (you must use numpy) Strings - Answer- 1. They are immutable 2. Access characters in strings like you do for arrays/lists 3. empty strings are false, non empty are true. 4. | an...

C949 Data Structures And Algorithms Record - Answer- Data structure that stores subitems, w/ names associated w/ each subitem Array - Answer- Data structure that stores an ordered list of items, w/ each item directly accessible by a positional index. Linked List - Answer- Data structure that stores an ordered list as nodes, each node stores data and has a pointer to the next node. Binary Tree - Answer- Data structure where each node stores data and has up to two children, left child ...

Ch. 15 Computer Science 201: Data Structures & Algorithms Which algorithm is used by garbage collector for detecting unused objects? - Answer- Mark and sweep algorithm Which exception is thrown when Java is out of memory? - Answer- OutOfMemoryError Which of the following has highest memory requirement? - Answer- JVM Which JVM option is used to define the maximum size of heap memory? - Answer- -Xmx Which memory holds the references to objects stored in heap? - Answer- Stack memory ...

Module 1: Introduction to Data Structures and Algorithm Data Structure - Answer- a particular way of storing and organizing data in a computer so that it can be used efficiently; physical implementation of abstract data type Linear Data Structure - Answer- elements form a sequence or a linear list Non-Linear Data Structure - Answer- elements does not form a sequence or a linear list. Traversal - Answer- travel through the data structure Search - Answer- traversal through the data ...

Data Structures and Algorithms Final Exam Study Guide Depth First Search - Answer- "think sink" Root node first Visit Root -> visit left child -> repeat until no more left children -> visit sibling -> if children visit those -> climb back up Post-Order Traversal - Answer- Visit node after all children are visited Root node last Breadth First Search - Answer- Visit nodes top to Bottom, left to right like reading a book In-Order Traversal - Answer- Visit node after l...

Computer Science: Data Structures and Algorithms Doubly Linked List: advantage, disadvantage - Answer- Advantage: quick insert to beginning, quick removal from end Disadvantage: slow search, not great for indexing Data Structures: Discuss characteristics of a Dictionary - Answer- Use when: order is unimportant, frequently adding and removing items, frequently looking up items Why is looking up, adding, and removing elements from a dictionary or hash map an O(1) operation? - Answer- ...

Data Structures and Algorithms Midterm Linear Search - Answer- slow --> N/2 comparisons O(N) Binary Search - Answer- Fast, but the array must be sorted log2(N) Drawbacks --> insertion takes longer O(logN) Unordered Arrays - Answer- fast insertion O(1) slow linear search and deletion O(N) Ordered arrays - Answer- fast binary search O(logN) slow insertion and deletion O(N) Bubble Sort - Answer- Comparisons: O(N^2) Swaps: O(N^2) (less than comparisons) Big O: O(N^2) S...

Data Structures and Algorithms FINAL Stack - Answer- Organizes its entries according to the order in which they were added. Last In - First Out Binary Operator - Answer- When an operator has two operands ie: a + b Unary Operator - Answer- When an operator has one operand ie: -5 Infix Expression - Answer- When a binary operator is between expressions Prefix Expression - Answer- When the operator is before the expression. Postfix Expression - Answer- When the operator is after th...

Data Structures and Algorithms Test 1 ADT - Answer- Abstract Data Type(ADT) is a data type, where only behavior is defined but not implementation. Java's List interface is an example Generic Methods - Answer- Java Generic methods and generic classes enable programmers to specify, with a single method declaration, a set of related methods, or with a single class declaration, a set of related types, respectively. Rules to define Generic Methods - Answer- All generic method declaration...

Data Structures and Algorithms Runtime Array - Answer- Access: O(1) Search: O(n) Insertion: O(n) Delete: O(n) Stack - Answer- Access: O(n) Search: O(n) Insertion: O(1) Delete: O(1) Linked List (Singly and Doubly) - Answer- Access: O(n) Search: O(n) Insertion: O(1) Delete: O(1) Hash Table - Answer- O(1) for everything, but has no sorting Binary Search Tree - Answer- Average O(log(n)) for everything, worst O(n) for everything Self-Balancing Trees (Red-Black, B, Splay, AV...

Data structures and algorithms 2 Why do we need a high level language? - Answer- High-level languages encourage you to think more about the problem domain and less about the execution platform. There is less ceremony, so you can spend more time on stuff that actually brings you value. Money. Cheaper developers, faster development speeds, and less bugs equal more money. A high level language is easier to code in and therefore less error prone. Program - Answer- A set of instructions for ...

DATA STRUCTURES AND ALGORITHIMS Examples of Linear and Non-Linear Types - Answer- Linear: Array, List, Stack, Que Non-Linear: Tree, Graph Considerations for choosing a Data Structure (5) - Answer- 1. Size of data 2. Speed and manner of data use 3. Data dynamics (how much/frequency of editing/changing) 4. Size of required storage 5. Fetch time of info from data structures Name 6 Common Data structures - Answer- (linear) 1. Lists 2. Arrays 3. Records 4. Trees 5. Tables 6. Graph...

Data Structures and Algorithms A linked-list implementation of a stack guarantees constant time performance but requires more space than an array implementation. - Answer- TRUE Both implementations of pop and push guarantee constant time performance. Linked lists require additional memory (space) for storing a reference to the next node. An algorithm that uses 12n2 + 4n log n operations is a ∼n2 algorithm. - Answer- FALSE It is a ∼ 12n2 algorithm. Big-Oh notation is more precise t...

Data Structure and Algorithm - Updated Algorithm - Answer- A computable set of steps to achieve a desired result. Array - Answer- In programming, a list of data values, all of the same type, any element of which can be referenced by an expression consisting of the array name followed by an indexing expression. Arrays are part of the fundamentals of data structures, which, in turn, are a major fundamental of computer programming Data Structure - Answer- The term data structure refers to ...

Data Structures and Algorithms What is a data structure? - Answer- An arrangement of data inside a computers memory or a disk. Name 5 data types - Answer- BLASH: binary trees, linked lists, arrays, stacks, hash tables What do algorithms do? - Answer- Manipulate the data in data structures in various ways such as sorting. What is real-world storage data? - Answer- Data structure storage that describes physical entities external to the computer. Accessed by a programs user. What are...