cse1301 computer programming lecture 35 revision 1 l.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
CSE1301 Computer Programming: Lecture 35 Revision 1 PowerPoint Presentation
Download Presentation
CSE1301 Computer Programming: Lecture 35 Revision 1

Loading in 2 Seconds...

play fullscreen
1 / 19

CSE1301 Computer Programming: Lecture 35 Revision 1 - PowerPoint PPT Presentation


  • 379 Views
  • Uploaded on

CSE1301 Computer Programming: Lecture 35 Revision 1 Topics Type of questions What do you need to know? About the exam Exam technique Staff consultation Revision Drop-in Center Sample questions Types of Questions Tutorial Sheets

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'CSE1301 Computer Programming: Lecture 35 Revision 1' - liam


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
topics
Topics
  • Type of questions
  • What do you need to know?
  • About the exam
  • Exam technique
  • Staff consultation
  • Revision Drop-in Center
  • Sample questions
types of questions
Types of Questions
  • Tutorial Sheets
    • solutions to selected tutorial sheets will be posted on the 1st Year Notice Board (and some on-line)Warning: Avoid being dependent on the sample solutions
  • Practical Sheets
    • solutions are not available
types of questions cont
Types of Questions (cont)
  • Mid-Semester Test
    • multiple-choice questions
    • coding/programming questions
  • Sample Past Exam
    • short-answer questions
    • coding/programming questions
    • sample solutions on the web
    • no True/False questions on 2003 exam
types of questions cont5
Types of Questions (cont)
  • A small number of questions from past papers will be made available on the web.
about the exam
About the Exam
  • 10 minutes reading time
  • 3 hours duration
  • 180 total marks
  • No calculators, books, notes, etc.
exam structure
Exam Structure
  • 30 Multiple Choice (30 x 1 mark)
  • 20 Short Answer (20 x 2 marks)
  • Longer Questions
    • Algorithms,flowcharts,structure charts,test data,program execution,output,debugging
    • Coding/programming questions
what do you need to know
What Do You Need to Know?

Coverage:

  • All lectures, practicals, tutorials and readings
overview
Overview
  • Gates
    • AND, OR, NOT
  • Binary representation
    • bit, byte, word
    • integer: decimal to binary, unsigned, signed magnitude, 2’s complement, excess-k
    • float: IEEE standard
    • precision, under/overflow
    • floating point arithmetic
overview cont
Overview (cont)
  • Values
  • Variables
  • Types
    • char, int, float, const, typedef, struct
    • arrays (2-dim), strings, int for “Boolean”
  • Operations
    • initialization
    • arithmetic, Boolean expressions, precedence
    • string library functions
overview cont11
Overview (cont)
  • Pointer Basics
    • when to use &and *
  • Structures
    • definition vs. instance
    • accessing members/elements
    • pointers to structs
    • array of structures
    • structures within structures
overview cont12
Overview (cont)
  • Flow of control
    • Flow diagrams/charts
  • Selection
    • if...else
    • nested selection
    • cascaded selection
  • Iteration
    • while, for, break
    • nested loops
overview cont13
Overview (cont)
  • Functions
    • Prototypes
    • Definition
    • Parameters
      • actual, formal, arrays, structs, pointers
    • Return values
    • Variable scope
    • Recursion
overview cont14
Overview (cont)
  • Streams
    • stdio, stderr, stdout
  • printf()and scanf()
    • conversion specifiers
    • return values
    • the & operator
  • Files
    • fopen(), fclose(), fprintf(),fscanf()
overview cont15
Overview (cont)
  • Software Engineering
    • development process
    • design: top-down, bottom-up
    • structure chart: control and data coupling
    • test data
    • (not included: Bingo)
overview cont16
Overview (cont)
  • Lists
    • a list as an array
    • operations
      • addition, deletion, search
  • Searching
    • linear search, binary search
  • Sorting
    • selection sort, insertion sort, bubble sort
  • Complexity
    • Big-O notation
exam technique
Exam Technique
  • Don’t Panic
  • Make use of reading time
  • Go for the marks  Attempt the questions in the order that gives the best result
  • Don’t spend too much time on any question
    • Approximately 1 minute per mark
  • Indicate clearly which question you are attempting
  • Don’t forget to write your name and ID!
staff consultation
Staff Consultation
  • Mondays & Thursdays
    • 2.00-4.00pm: Su
  • Wednesdays (but not 28/10)
    • 9.00-11.00am: Ann
  • Fridays
    • 10.00-12.00: Ann
  • Thursday 13th Nov
    • 10.00-12.00: Su

Ann’s office: Room 119, Building 75

Su’s office:

Room G38, Building 75