2. CompTIA A+ - Windows 7

 Windows 7

- Released OCTOBER 22 2009

- Mainstream support ended JANUARY 13 2015

- Extended Support ended JANUARY 14 2020

- Used same hardware and software as Vista, but increased performance

- Updated features from Vista (Libraries/HomeGroup/Pinned Taskbar)


Versions:

- Starter

- Home Basic

- Home Premium (Built for consumer market)

- Ultimate

- Professional

- Enterprise



Windows 7 Starter (Version for Netbooks [Bootleg Tablets] )

- No DVD playback or Windows Media Center (CPU cant handle video)

- No Windows Aero

- No internet connection sharing (ICS)

- No Internet Information Service Web Server ( IIS )

- No enterprise technologies (Domain Connection, BitLocker, EFS, etc)

- Only 32 BIT VERSION, 2GB RAM


Windows Home Premium

- DVD Playback, Aero, Internet Connection Sharing, IIS Web Server

- No enterprise tech (Domain Connection, BitLocker, EFS)

- Has 64 BIT, 16GB RAM, can support 2 physical processors


Windows 7 Ultimate

- Complete functionality

- Domain Support, Remote Desktop, EFS

- All enterprise tech (Bitlocker for disk encryption)

- 64BIT, support 192 GB RAM

- Same feature as Windows 7 Enterprise 


Windows 7 Professional

- Same features as Home Premium

- Can connect to Windows Domain

- Support REMOTE DESKTOP HOST and EFS

- Missing enterprise tech (NO BITLOCKER)

- 64BIT, support 192 GB RAM


Windows 7 Enterprise

- Sold only with volume license

- Multilingual User Interface Package

- Bitlocker Drive Encryption



Windows 7 Hardware Requirements for 32 and 64 bit

32:

1GHz CPU, 1GB RAM, 16GB STORAGE, DirectX 9

64:

1 GHz CPU, 2 GB RAM, 20GB STORAGE, DirectX 9

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