FE Electrical and Computer Engineering 2024

Software Engineering Page Numbers Correct Answer-410 - 416 MSB & LSB Correct Answer-410 MSB - Most Significant Bit, known as Big-endian LSB - Least Significant Bit, known as Little-endian Pointer Correct Answer-410 is a reference to an object. The literal value of a pointer is the objects location in memory Algorithms Correct Answer-410 is a specific sequence of steps that describe a process Bubble Sort Correct Answer-410 continuously steps through a list, swapping items until they appear in the correct order Insertion Sort Correct Answer-410 takes elements from a list one by one and inserts them in their correct position into a new sorted list Merge Sort Correct Answer-410 divides the list into the smallest units, then compares each element with the adjacent list to sort and merge the two adjacent lists Heap Sort Correct Answer-410 Divides a list into sorted and unsorted lists and extracts the largest element from the unsorted list and moves it to the bottom of the sorted list Quick Sort Correct Answer-410 Partitions list using a pivot value, placing elements smaller than the pivot before the pivot value and greater elements after it Searching Algorithm Correct Answer-410 determines if an element exists in a collection of elements. If the elements does exist, the location is returned Binary Search Correct Answer-410 finds a search value within a sorted list by comparing the search value to the middle element of the array. If they are not equal, the half in which the target cannot lie is eliminated and the search continues. Repeating until the target is found. Hashing Correct Answer-410 uses a hashing function that maps data of arbitrary size to data of a fixed size and then to compute an index that suggests where the entry can be found in a hash table Data Structures (Page Number) Correct Answer-411 Array Correct Answer-411 collection of elements, typically of the same type, where each individual element can be accessed using an integer index Linked List Correct Answer-411 a collection of nodes, where each node contains an element and a pointer to the next node in the linked list Stack Correct Answer-411 collection of elements that are kept in order and can only be accessed at one end of the set Queue Correct Answer-411 Collection of elements that are kept in order and can be accessed at both ends of the set where one is used to insert elements and the other end is used to remove elements Map Correct Answer-411 Collection of key, value pairs, such that each possible key appears at most once in the collection. Also known as an associative array Set Correct Answer-411 Collection of elements, without any particular order, that can be queried and/or modified by inserting or deleting elements Graph Correct Answer-411 collection of nodes and a set of edges which connect a pair of nodes Tree Correct Answer-411 collection of nodes and a set of edges that connect the nodes hierarchically Graph Traversal (Page Number) Correct Answer-411 Tree Traveral (Page Number) Correct Answer-411 Algorithm Efficiency (Big-O) Correct Answer-412 Logarithmic Big-O Correct Answer-412 Types: Binary Tree Traversal, Hash table search Eqn: O(log N) Loglinear Big-O Correct Answer-412 Types: Merge sort, Heap sort, Fast Fourier Transform Eqn: O(nlog(n)) = O(log n!) Quadratic Big - O Correct Answer-412 Types: Insertion Sort, Bubble Sort, Quick Sort Eqn: O(n^2) Software Syntax Guidelines (Page Number) Correct Answer-412 Flow Chart (Page Number) Correct Answer-413 Software Testing (Page Number) Correct Answer-413