3. CompTIA A+ - Windows 8 , 8.1

Windows 8 and 8.1


Windows 8

- Released OCTOBER 26 2012

- New user interface

- No traditional "START" button

Windows 8.1

- Released OCTOBER 17 2013

- Free update to Windows 8 (Not really a upgrade)

Support:

- Mainstream support ended JAN 9 2018

- Extended support end JAN 10 2023


Editions:

- Windows 8/8.1 (CORE)

- Windows 8/8.1 PRO

- Windows 8/8.1 ENTERPRISE


Windows 8/8.1 (CORE)

- Basic version for home use. has x86 and x64 versions

- INTEGRATES microsoft account into the OS to use all apps/services

- INTEGRATES Windows Defender

- Has windows media player for playing audio CD and DVDs


Windows 8/8.1 PRO

- Similar to Windows 7 Professional/Ultimate

- BitLocker and EFS for Full-disk and file-level encryption

- Join a Windows Domain (Support for IT Management)

- Group Policy Support (Centralized management of Windows devices)


Windows 8/8.1 ENTERPRISE

- Volume Licensing to "SOFTWARE ASSURANCE" customers

- AppLocker, Windows TO Go, DirectAccess, BranchCache


PROCESSOR REQUIREMENTS FOR WINDOWS 8/8.1 (CPU NEEDS)

- PAE (Physical Address Extension). 32Bit CPUs can use more than 4GB RAM limit

- NX (NX Processor Bit). Allows CPU to protect against malicious software

- SSE2 (Streaming SIMD Extensions 2). Processor instruction set used by app developers when creating drivers/apps for Windows 8. 


HARDWARE REQUIREMENTS FOR WINDOWS 8/8.1

x86/32Bit:

- 1 GHz processor with support for PAE, NX, SSE2

- 1GB RAM

- 16GB STORAGE

- DIRECTX 9 with WDDM Driver


x64/64Bit:

- 1 GHz processor with support for PAE, NX, SSE2

- 2GB RAM

- 20GB STORAGE

- DIRECTX 9 with WDDM Driver


Comparison:



Comments

Post a Comment

Popular posts from this blog

2. FreeCodeCamp - Dynamic Programming - Learn to Solve Algorithmic Problems & Coding Challenges

Dynamic Programming - Parts      PART 1 - Memoization     P ART 2 - Tabulation Dynamic Programming with Fibonacci Example Recursion: Slow because time complexity is O(2^n) func fibR (x int ) int {     if x <= 2 {         return 1     }     return fibR (x- 1 ) + fibR (x- 2 ) } Dynamic Way Example Recursion with Stored Value:  // Fast because it removes duplicate processes by checking map. // Tail recursion-ish // Results are hitchhiking each recursive call func fibR2 (x int , y map [ int ] int ) int {     if _ , ok := y[x]; ok {         return y[x]     }     if x <= 2 {         return 1     }     y[x] = fibR2 (x- 1 , y) + fibR2 (x- 2 , y)     return y[x] }
Read more

20. Data Analytics - Analyze Data to Answer Questions - Week 1

Goal of analysis is to identify trends and relationships within data so you can accurately answer the questions you're asking. Most data is organized in tables, always have data in the right format. Definition : Analysis // process used to make sense of the data collected Sorting // involves arranging data into a meaningful order to make it easier to understand, analyze, visualize Outliers // data points that are very different from similarly collected data and might not be reliable values Filtering // extracting specific data that meet certain criteria while hiding the rest Customized sort order // when you sort data in a spreadsheet using multiple conditions The 4 phases of analysis:          1. Organize data // getting the right data in the right size and order                     - Sorting : arrange data in meaningful order                     - Filtering : can help find errors or outliers          2. Format and adjust data // filtering or sorting or compiling data in a better
Read more

3. Algorithms - Selection Sort

Selection sort sorts an array by finding the lowest value element and appending it to an empty array. The algorithm will shrink the unsorted array and repeat the process recursively until all unsorted elements are used up. package main func selectionSort (list *[] int ) {     sorted := make ([] int , 0 , len (*list))     unSorted := *list     for i := 0 ; i < len (*list); i++ {         min := unSorted[ 0 ]         index := 0         for i , e := range unSorted {             if e <= min {                 min = e                 index = i             }         }         sorted = append (sorted, (unSorted)[index])         if index == 0 {             unSorted = unSorted[ 1 :]         } else if index == ( len (*list) - 1 ) {             unSorted = unSorted[:index]         } else {             unSorted = append (unSorted[ 0 :index], unSorted[index+ 1 :]...)         }     }     * list = sorted } /*func main() {     x := []int{4, 6, 3, 2, 9, 7, 3, 5}     fmt.Print
Read more