1 / 68

FE Review Computers

FE Review Computers. April 10, 2012 Matthew C. Valenti, Ph.D., P.E. Lane Dept. Comp. Sci. & Elect. Eng. Outline. Introduction Overview of Computer Section Spreadsheets Structured Programming Terminology Exam Tips. Outline. Introduction Overview of Computer Section Spreadsheets

aricin
Download Presentation

FE Review Computers

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. FE ReviewComputers April 10, 2012 Matthew C. Valenti, Ph.D., P.E. Lane Dept. Comp. Sci. & Elect. Eng.

  2. Outline • Introduction • Overview of Computer Section • Spreadsheets • Structured Programming • Terminology • Exam Tips

  3. Outline • Introduction • Overview of Computer Section • Spreadsheets • Structured Programming • Terminology • Exam Tips

  4. About Me… • B.S.E.E., Virginia Tech, 1992. • Electronics Engineer, U.S. Naval Research Lab, 1992-1995. • M.S.E.E., Johns Hopkins, 1995. • Ph.D., Virginia Tech, 1999. • Assistant Professor, WVU, 1999-2005. • Associate Professor, WVU, 2005-2010. • Full Professor, WVU, 2010-present. • Passed FE Exam, Oct. 2010. • Passed PE Exam, Oct. 2011.

  5. Outline • Introduction • Overview of Computer Section • Spreadsheets • Structured Programming • Terminology • Exam Tips

  6. Computer Section Overview • 7% of 120 morning questions ≈ 8 problems.

  7. Outline • Introduction • Overview of Computer Section • Spreadsheets • Structured Programming • Terminology • Exam Tips

  8. Supplied Handbook, p. 109

  9. Relative Addressing

  10. Absolute Addressing

  11. Question #1 • In a typical spreadsheet, the reference H$8 is typed into cell T5. If this reference is copied into cell AA8, which cell will it refer to? • (a) AA5 • (b) O8 • (c) O11 • (d) T8 K. Whitehead, “999 Nonquantitative Problems for FE Examination Review,” PPI, 1997

  12. Question #1 • In a typical spreadsheet, the reference H$8 is typed into cell T5. If this reference is copied into cell AA8, which cell will it refer to? • (a) AA5 • (b) O8 • (c) O11 • (d) T8 • The answer is (b) H I J K L M N O T U V W X Y Z AA K. Whitehead, “999 Nonquantitative Problems for FE Examination Review,” PPI, 1997

  13. Question #2 K. Whitehead, “999 Nonquantitative Problems for FE Examination Review,” PPI, 1997

  14. Question #2 K. Whitehead, “999 Nonquantitative Problems for FE Examination Review,” PPI, 1997

  15. Question #3 “Fundamentals of Engineering FE/EIT Exam Preparation, 18th edition,” Kaplan, 2008.

  16. Question #3 “Fundamentals of Engineering FE/EIT Exam Preparation, 18th edition,” Kaplan, 2008.

  17. Question #4 “Fundamentals of Engineering FE/EIT Exam Preparation, 18th edition,” Kaplan, 2008.

  18. Question #4 2 3 4 16 “Fundamentals of Engineering FE/EIT Exam Preparation, 18th edition,” Kaplan, 2008.

  19. Question #5 “Fundamentals of Engineering FE/EIT Exam Preparation, 18th edition,” Kaplan, 2008.

  20. Question #5

  21. Question #6 “FE Fundamentals of Engineering Exam, 2nd Edition,” Barron’s, 2008.

  22. Question #6 “FE Fundamentals of Engineering Exam, 2nd Edition,” Barron’s, 2008.

  23. Question #7 A partial spreadsheet is shown below: “FE Fundamentals of Engineering Exam, 2nd Edition,” Barron’s, 2008.

  24. Question #7

  25. Question #7 The answer is (D) 4

  26. Question #8 “FE Fundamentals of Engineering Exam, 2nd Edition,” Barron’s, 2008.

  27. Question #8

  28. Question #9 “FE Fundamentals of Engineering Exam, 2nd Edition,” Barron’s, 2008.

  29. Question #9

  30. Outline • Introduction • Overview of Computer Section • Spreadsheets • Structured Programming • Terminology • Exam Tips

  31. Structured Programming • You will be given several lines of pseudocode, and asked to determine the final values of variables. • Syntax similar to Matlab or Fortran. • Need to understand logic for branching and looping. • IF/THEN • DO/WHILE • DO/UNTIL • FOR • GOTO (outdated) • Could be asked about generic programming concepts.

  32. Question #10 • A computer structured programming segment contains the following program segment. What is the value of Y after the segment is executed? Y = 4 B = 4 Y = 3*B – 6 IF Y > B THEN Y = B – 2 IF Y < B THEN Y = Y + 2 IF Y = B THEN Y = B + 2 (a) 2 (b) 6 (c) 8 (d) 12 M.R. Lindeburg, “FE Review Manual, 2nd Edition,” PPI, 2006.

  33. Question #10 • A computer structured programming segment contains the following program segment. What is the value of Y after the segment is executed? Y = 4 B = 4 Y = 3*B – 6  Y = 3(4) – 6 = 6 IF Y > B THEN Y = B – 2  TRUE, SO Y = B-2 = 4-2 = 2 IF Y < B THEN Y = Y + 2  TRUE, SO Y = Y+2 = 2+2 = 4 IF Y = B THEN Y = B + 2  TRUE, SO Y = B+2 = 4+2 = 6 (a) 2 (b) 6 (c) 8 (d) 12 M.R. Lindeburg, “FE Review Manual, 2nd Edition,” PPI, 2006.

  34. Question #11 M.R. Lindeburg, “FE Review Manual, 2nd Edition,” PPI, 2006.

  35. Question #11 M.R. Lindeburg, “FE Review Manual, 2nd Edition,” PPI, 2006.

  36. Question #12 M.R. Lindeburg, “FE Review Manual, 2nd Edition,” PPI, 2006.

  37. Question #12 M.R. Lindeburg, “FE Review Manual, 2nd Edition,” PPI, 2006.

  38. Question #13 “Fundamentals of Engineering FE/EIT Exam Preparation, 18th edition,” Kaplan, 2008.

  39. Question #13 “Fundamentals of Engineering FE/EIT Exam Preparation, 18th edition,” Kaplan, 2008.

  40. Question #14 K. Whitehead, “999 Nonquantitative Problems for FE Examination Review,” PPI, 1997

  41. Question #14 RESULT = TRUE implies A.AND.B = TRUE which requires that both A and B be TRUE. So A must be TRUE.

  42. Question #15 • The following code segment is an example of what programming technique? b = cube(a) cube(a) { b= a*a*a return b } • branching • function call • looping • subroutine M.R. Lindeburg, “FE/EIT Sample Examinations, 2nd Edition,” PPI, 2010.

  43. Question #15 • The following code is an example of what programming technique? b = cube(a) cube(a) { b= a*a*a return b } • branching • function call • looping • subroutine M.R. Lindeburg, “FE/EIT Sample Examinations, 2nd Edition,” PPI, 2010.

  44. Outline • Introduction • Overview of Computer Section • Spreadsheets • Structured Programming • Terminology • Exam Tips

  45. Terminology • Memory concepts: • Different types of memory. • Know difference between bits and bytes. • Mega, kilo, etc. • Data transmission concepts: • baud, bps (bits per second). • simplex, half duplex, full duplex. • Compilers: • Machine code vs. assembly code. • Problems may require simple calculation, but the challenge is to know the terminology.

  46. Question #16 K. Whitehead, “999 Nonquantitative Problems for FE Examination Review,” PPI, 1997

  47. Question #16 K. Whitehead, “999 Nonquantitative Problems for FE Examination Review,” PPI, 1997

  48. Question #17 K. Whitehead, “999 Nonquantitative Problems for FE Examination Review,” PPI, 1997

  49. Question #17 K. Whitehead, “999 Nonquantitative Problems for FE Examination Review,” PPI, 1997

  50. Question #18 K. Whitehead, “999 Nonquantitative Problems for FE Examination Review,” PPI, 1997

More Related