100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Previously searched by you
Previously searched by you
logo
FE Electrical and Computer Engineering Exam with Accurate Solutions | Already Passed £7.71   Add to cart
Quickly navigate to
Preview
  2.  
  3. FE Electrical And Computer Engineering
  4.  
  5. FE Electrical and Computer Engineering

Exam (elaborations)

FE Electrical and Computer Engineering Exam with Accurate Solutions | Already Passed
 11 views  0 purchase
  • Module
  • FE Electrical and Computer Engineering
  • Institution
  • FE Electrical And Computer Engineering

FE Electrical and Computer Engineering Exam with Accurate Solutions | Already Passed MSB & LSB - 410 MSB - Most Significant Bit, known as Big-endian LSB - Least Significant Bit, known as Little-endian Pointer - 410 is a reference to an object. The literal value of a pointer is the objects l...

[Show more]

Preview 4 out of 34  pages

Document information

  • September 4, 2024
  • 34
  • 2024/2025
  • Exam (elaborations)
  • Questions & answers

Subjects

  • fe electrical and computer engineering

Written for

  • FE Electrical and Computer Engineering
  • FE Electrical and Computer Engineering

Seller

avatar-seller
JOSHCLAY

Reviews received

Content preview

FE Electrical and Computer Engineering

Exam with Accurate Solutions | Already

Passed


MSB & LSB - ✔✔410

MSB - Most Significant Bit, known as Big-endian

LSB - Least Significant Bit, known as Little-endian

Pointer - ✔✔410

is a reference to an object. The literal value of a pointer is the objects

location in memory

Algorithms - ✔✔410

is a specific sequence of steps that describe a process

Bubble Sort - ✔✔410

continuously steps through a list, swapping items until they appear in the

correct order

Insertion Sort - ✔✔410

,takes elements from a list one by one and inserts them in their correct

position into a new sorted list

Merge Sort - ✔✔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 - ✔✔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 - ✔✔410

Partitions list using a pivot value, placing elements smaller than the pivot

before the pivot value and greater elements after it

Searching Algorithm - ✔✔410

determines if an element exists in a collection of elements. If the elements

does exist, the location is returned

Binary Search - ✔✔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 - ✔✔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

Array - ✔✔411

collection of elements, typically of the same type, where each individual

element can be accessed using an integer index

Linked List - ✔✔411

a collection of nodes, where each node contains an element and a pointer

to the next node in the linked list

Stack - ✔✔411

collection of elements that are kept in order and can only be accessed at

one end of the set

Queue - ✔✔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 - ✔✔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 - ✔✔411

Collection of elements, without any particular order, that can be queried

and/or modified by inserting or deleting elements

Graph - ✔✔411

collection of nodes and a set of edges which connect a pair of nodes

Tree - ✔✔411

collection of nodes and a set of edges that connect the nodes hierarchically

Algorithm Efficiency (Big-O) - ✔✔412

Logarithmic Big-O - ✔✔412

Types: Binary Tree Traversal, Hash table search

Eqn: O(log N)

Loglinear Big-O - ✔✔412

Types: Merge sort, Heap sort, Fast Fourier Transform

Eqn: O(nlog(n)) = O(log n!)

Quadratic Big - O - ✔✔412

Types: Insertion Sort, Bubble Sort, Quick Sort

Eqn: O(n^2)

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller JOSHCLAY. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for £7.71. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

75323 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy revision notes and other study material for 14 years now

Start selling
£7.71
  • (0)
  Add to cart