Fondamenti di Informatica 1 Esercizi di riepilogo.

Slides:



Advertisements
Similar presentations
Uso dei puntatori.
Advertisements

Date of Birth Design Problem
Boolean Algebra Variables: only 2 values (0,1)
X March C- Copyright Soft Test Inc. Yellow Black = Stored data | Yellow = Write cycle | Red = Read cycle March C- Fundamentals of.
Register Transfer and Microoperations Part2
Analysis of Algorithms II
Inside the binary adder. Electro-mechanical relay A solid state relay is a switch that is controlled by a current. When current flows from A to B, the.
Laboratorio di Linguaggi lezione VII Marco Tarini Università dellInsubria Facoltà di Scienze Matematiche, Fisiche e Naturali di Varese Corso di Laurea.
2000 Prentice Hall, Inc. All rights reserved. 1 Capitolo 8 – Overloading di operatori 1.Introduzione 2.Fondamenti sulloverloading di operatori 3.Restrizioni.
Corso di Studi in Informatica Applicata – Università di Catania, Campus di Comiso Dr. Simone Faro – – Diapositiva
SkipNet: A Scalable Overlay Network with Practical Locality Properties Nick Harvey, Mike Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman Microsoft Research.
Magnetic Data Storage A computer hard drive stores your data magnetically Disk NS direction of disk motion Write Head __ Bits of information.
Magnets used to store data ? Magnet with unknown state Current N S S N 0 1.
Building a Time Dimension Copyright © 2001 by Michael A. Mina.
4-2 Warm Up Problem of the Day Lesson Presentation
Preview Warm Up California Standards Lesson Presentation.
Functional Programming Lecture 15 - Case Study: Huffman Codes.
Specifying Languages Our aim is to be able to specify languages for use in the computer. The sketch of an FSA is easy for us to understand, but difficult.
Logic Gate Objects This document contains various images created by Andrew C. M. Rodger, 4 October Tools used:LibreOffice Impress 3 Microsoft Powerpoint.
WHO WANTS TO BE A MILLIONAIRE? CAPACITY STYLE.
Pulse Code Modulation Pulse Code Modulation
Computer Structure.
Recursion and Induction
Recursive Descent Technique CMSC 331. UMBC 2 The Header /* This program matches the following A -> B { '|' B } B -> C { '&' C } C -> D { '^' D } D ->
Computer technology The history of computer technology video clip The history of computer technology video clip The history of computer technology video.
LINKED LIST, STACKS AND QUEUES Saras M Srivastava, PGT – Comp. Sc. Kendriya Vidyalaya TengaValley.
De Morgans Law. Some expressions dont simplify easily For example ABC + A + C De Morgans laws can help with expressions of this kind. It comes in two.
Princess Sumaya University
Introduction to CAFE Yu Hen Hu September 25, 2000.
Truth Tables and Logic Gates. What are Logic Gates? Logic gates are components used in making logic circuits. Each gate has one or more inputs and produces.
Lab02 :Logic Gate Fundamentals:
Announcements mid-term on Thursday 12:30 – be on time. Calculators allowed (required!) No assignment due this week Assignment 6 posted on Thursday Project.
Department of Computer and Information Science, School of Science, IUPUI CSCI 240 Digital Logic.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
CHAPTER 2 LOGIC GATES.
Boolean Algebra and Logic Gates
©2010 Akula LLC, Jeremy R. Hertzberg, BS CMPE Computer Technology Transistor to computer gates
Logic Circuits Situations to explain states What is a logic Gate
Logic Gates & Circuits. AND Gate Input AInput BOutput X AND Logic Gate AND Truth Table X = A. B AND Boolean Expression.
Chapter 3 Digital Logic Structures
topics Logic gates Gates types Universal gates
Computer Logic & Logic Gates Justin Champion. IITCT Contents Introduction to Logic Look at the different Logic Gates Summary.
CS1010: Programming Methodology
For(int i = 1; i
 Which number is in exponential form: -10,, 10  Identify the Base of that number  What is the exponent in that number? - the number being multiplied.
Fixed-point and floating-point numbers CS370 Fall 2003.
CS 121 Digital Logic Design
10 Year Old Topic 2 9 Year Old Topic 4 8 Year Old Topic 5 8 Year Old Topic 6 7 Year Old Topic 7 7 Year Old Topic 8 6 Year Old Topic 9 6 Year Old Topic.
Are You Smarter Than a 5 th Grader? 1,000,000 5th Grade Topic 1 5th Grade Topic 2 4th Grade Topic 3 4th Grade Topic 4 3rd Grade Topic 5 3rd Grade Topic.
Digital Logic & Design Lecture No. 3. Number System Conversion Conversion between binary and octal can be carried out by inspection.  Each octal digit.
4.1 Powers of 10.
Starting Out with C++, 3 rd Edition 1 Chapter 10 – Characters, Strings, and the string Class.

Starting Out with C++, 3 rd Edition 1 Chapter 11 – Structured Data Abstract data types (ADTs) are data types created by the programmer. ADTs have their.
Mathematical Puzzles and Not So Puzzling Mathematics C. L. Liu National Tsing Hua University.
Finite State Machines Finite state machines with output
Node Optimization. Simplification Represent each node in two level form Use espresso to minimize each node Several simplification procedures which vary.
File and I/O system calls int open(const char* path, int flags, mode_t modes) int creat(const char *path, mode_t mode) ssize_t read(int fd, void *buf,
Union, bitfield, typedef, enum union nama_u{ }; union nama_u{ struct nama_s byte; }; enum{ }; Tipedef var BYTE.
An Adaptive Learning Solution to the Keyboard Optimization Problem Reporter: En-ping Su
Dynamic Allocation and Linked Lists. Dynamic memory allocation in C C uses the functions malloc() and free() to implement dynamic allocation. malloc is.
Mobile Devices ACGNJ February 9, 2011 Text Messaging.
Colors, Numbers, Letters, NSEW Meaningful Movement Mats Improve School Success - Move to Learn -
Print Row Function void PrintRow(float x[ ][4],int i) { int j; for(j=0;j
Int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 5 void main () { Int Sum; : Sum = fact (5); : } Factorial Program Using Recursion.
* In Call Back Department Transfer Out 1 2ABC 3DEF 4GHI 5JKL 6MNO
Phone Puzzler.
Independent Spelling Activities
Phone: + 40 (728) | +40 (733)
Selection Sort Fonte: Fondamenti di Informatica - A.Accattatis Selection Sort Fonte:
Presentation transcript:

Fondamenti di Informatica 1 Esercizi di riepilogo

Fondamenti di Informatica 2 MNP

Fondamenti di Informatica 3 MNP

Fondamenti di Informatica 4 Puntatori

Fondamenti di Informatica 5

6 TXT2PHONE

Fondamenti di Informatica 7 TXT2PHONE Lettura file (fgets): per ogni riga –Estrazione dati struct con: –nome compagnia –numero in forma testuale –Conversione stringa numero da forma testuale a cifre –Scrittura riga nel file di uscita

Fondamenti di Informatica 8 TXT2PHONE char txt2digit (char ch) { char phone_text_table ['z' - 'a' + 1] = { '2', '2', '2', /* abc */ '3', '3', '3', /* def */ '4', '4', '4', /* ghi */ '5', '5', '5', /* jkl */ '6', '6', '6', /* mno */ '7', '7', '7', '7', /* pqrs */ '8', '8', '8', /* tuv */ '9', '9', '9', '9' /* wxyz */ }; return phone_text_table[tolower(ch) - 'a']; }

Fondamenti di Informatica 9 TXT2PHONE void txt2phone (char s[], char t[]) { int i = 0, j = 0; while (s[i] != '\0') { if (s[i] >= '0' && s[i] <= '9') t[j++] = s[i++]; else if ((s[i] >= 'a' && s[i] <= 'z') || (s[i] >= 'A' && s[i] <= 'Z')) t[j++] = txt2digit (s[i++]); else i++; } t[j] = '\0'; return; }

Fondamenti di Informatica 10 Noise gate

Fondamenti di Informatica 11