7 Pages

PRACTICA 3

Course: MSE SEM, Spring 2011
School: ITESM
Rating:
 
 
 
 
 

Word Count: 349

Document Preview

3 DECODIFICADOR PRACTICA BCD A 7 SEGMENTOS Y DISPLAY. OBJETIVO: Comprobar y entender el correcto funcionamiento de un decodificador BCD a 7 segmentos. CONOCIMIENTOS PREVIOS. Decodificadores El cdigo binario que manejan internamente los circuitos lgicos generalmente requiere ser convertido a otro cdigo ms apropiado en la etapa de salida. Al circuito que realiza esta tarea se le denomina decodificador. Por ejemplo...

Register Now

Unformatted Document Excerpt

Coursehero >> Other International >> ITESM >> MSE SEM

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
3 DECODIFICADOR PRACTICA BCD A 7 SEGMENTOS Y DISPLAY. OBJETIVO: Comprobar y entender el correcto funcionamiento de un decodificador BCD a 7 segmentos. CONOCIMIENTOS PREVIOS. Decodificadores El cdigo binario que manejan internamente los circuitos lgicos generalmente requiere ser convertido a otro cdigo ms apropiado en la etapa de salida. Al circuito que realiza esta tarea se le denomina decodificador. Por ejemplo si a la salida se requiere un despliegue de numrico visual hay que convertir de binario puro a cdigo de 7 segmentos. Dos decodificadores de BCD a 7 segmentos muy frecuentemente usados son el 7447 (para display de nodo comn) y el 7448 (para display de ctodo comn). Tabla de Funcin. D 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 Entradas C B A a b Salidas 7448 c d e f g a b c d e f g 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 1 0 1 1 0 1 0 1 1 1 0 0 0 1 0 0 1 1 1 1 1 0 0 1 1 1 0 0 1 0 0 0 1 1 0 1 1 1 1 1 1 1 0 1 0 0 0 0 1 0 0 0 1 1 1 0 1 1 0 0 1 1 1 0 0 0 1 1 1 1 1 0 1 1 1 1 1 1 1 0 0 1 0 0 1 0 1 0 0 0 1 1 1 0 1 1 0 0 0 0 0 1 1 0 0 0 1 1 0 1 1 1 0 0 1 0 0 0 0 0 0 0 1 0 1 1 1 1 0 1 0 0 1 0 0 1 0 1 0 0 1 0 0 1 0 1 0 1 1 1 0 1 0 1 0 1 1 1 0 1 0 1 1 1 0 0 0 1 0 0 1 1 0 0 0 1 1 1 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 1 0 1 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 1 0 0 0 1 0 1 0 1 0 0 0 1 0 Salidas de 7447 Acerca los Pines Lamp Test, RB Output, RB Input. Lamp Test: Seal para encender todos los segmentos (GND). BI / RBO (Blanking Input / Ripple Blanking Output) BI: Salida para apagar todos los segmentos. RBI (Ripple Blanking Input): Entrada que determina si el display se apaga cuando exhibe un cero. MATERIAL: Tablilla (proto board) Fuente de +5 V de CD. Cable telefnico. Gua de reemplazo ECG. Circuito integrado 7448 Display ctodo comn. PROCEDIMIENTO. Buscar en la gua de reemplazo ECG el decodificador 7448 y el display de 7 segmentos ctodo comn con el fin de ver la distribucin de pines. Conectar las salidas del decodificador al display de 7 segmentos y darle a las entradas A B C D todas las combinaciones posibles para ver que se despliega en el display. Lo que el display despleg fue lo siguiente: OBSERVACIONES Y CONCLUSIONES. Al implementar fsicamente el circuito, este funcion sin ningn contratiempo y realiz su funcin correctamente. Se pudo observar que a partir de la combinacin 1010 en adelante, el decodificador despliega en el display dgitos que no nos dan a entender ningn significado comn. BIBLIOGRAFA Electrnica Digital Bsica John A. Dempsey Presentaciones y Servicios de Ingeniera S.A.
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

ITESM - MSE - SEM
PRACTICA 4GENERADOR, DETECTOR Y CORRECTOR DE ERRORESOBJETIVODisear un dispositivo que cuando se genere un error, lo detecte y corrija en un buz de datos.MARCO TEORICACdigo de deteccin de errorA travs de un elemento de comunicacin tal como las ondas
ITESM - MSE - SEM
PROCESOS ESTOCASTICOS ITESMTAREASe tiene una funcin X como variable independiente uniforme, dentro del intervalo[-1, 1]. Representado de la siguiente forma:Funcion a convolucionar10.80.60.4Amplitud0.20-0.2-0.4-0.6-0.8-1-5-4-3-2-10T
ITESM - MSE - SEM
TAREA 6Calcular la siguiente funcin de densidad:PrK ambos en T=(T)kk!e-TPara 10 llamadas por minutoPara 15 llamadas por minutoo Mismo procedimiento en 3 minutos.Funcin de Densidad0.140.120.1Pr0.080.060.040.0200510K LlamadasNombre: Carl
ITESM - MSE - SEM
PROCESOS ESTOCASTICOS ITEMCARLOS ALBERTO GOMEZ GONZALEZ | 505967TAREASe tiene una funcin de espera de una caseta telefnica que s caracterizada con lasiguiente funcin. Representado de la siguiente forma:fi=e-Funcion a convolucionar76Amplitud543
ITESM - MSE - SEM
PROCESOS ESTOCASTICOSTAREAr =x2+y2 A dems =tan-1yxUn t i rador de dardos presenta las siguientes funciones de probabilidad sobre el blanco del siguiente modode forma horizontal y vertical:fxnormal con x=0 y 2x=1,N(0,12) en posicin horizontal.fx=12e
ITESM - MSE - SEM
Carlos Alberto Gmez Gonzlez | 505967A COMPUTERI TESM | MSE-TMaximiliano Gonzlez Cobos | 808709MODEL OF LASER ACTION IN THETEACHING OF COMPUTATIONAL PHYSICSDr. Ral I. Hernndez ArandaReporte ProyectoEQUIPO 4Carlos Alberto Gmez GonzlezA00505967Max
ITESM - MSE - SEM
A DM I N ISTRACIN GERENCIALPROCESO DE LA MERCADOTECNIAPLANEACION, ORGANIZACIN, DIRECCIN Y CONTROL DE LA MERCADOTECNIAPlaneacin en mercadotecniaLa planeacin de la mercadotecnia es un proceso sistemtico que comprende el estudio de lasposibilidades y lo
ITESM - MSE - SEM
1.etneinevnocarenam ed nalpoca es is nmoc airotceyart acin anu ne esridnuf nedeup ,setnerefid sairotceyarterbos nanoiculove etnemlaicini euq ,selbisiverpmi socitac sotneimatro pmoc sod euq artseumed esoj abart etse nE .]0991,llorraC y aroceP[ ,09 soa
ITESM - MSE - SEM
1res etnemarugeS .selanoicanretni senoicacilbup ne ad a ad nelas satseuporp sahcum y oirotarobaled soidutse ne etnemlautca ntse soac ne sodasab nicacinumoc ed sametsis sol ,etnemlaniF.cte ,setneno pmoc sol ed socirtmarap serolav sol ne nicairav a ,setn
ITESM - MSE - SEM
LIDERAZGO PARA EL DESARROLLO SOSTENIBLEPROYECTO FINAL:MODELO DE DESARROLLO BASADO EN INDICES SINPTICOSAPLICADOS AL CAPITAL STOCK MODELEQUIPO 1NOMBREMariana Rodrguez BastoCarlos Alberto Gmez GonzlezMaximiliano Gonzlez CobosAbsaln Benavides Elizond
ITESM - MSE - SEM
CarlosAlbertoGmezGonzlez|A00505967|LiderazgoparaeldesarrollosostenibleITESMMSEEnsayo:ElhombreylavidaEs muy interesante como el autor a lo largo de este fragmento de la obra, planteacomo el hombre se concibe a si mismo tan superior a las dems especies p
ITESM - MSE - SEM
Tarea4RafaelGonzlezGarcaA00379813LiderazgoparaeldesarrollosostenibleDr.RalAntonioGarzaC.25/02/2010Huella ecolgicaLa huella ecolgica se refiere a una medida de cuantos recursos naturalesconsume un individuo. Esta cuantificacin se puede dividir en m
ITESM - MSE - SEM
TereaN2A00799571GustavoRodrguezLpezTarea N 2Video de la Verdad Incmoda (AL Gore)En el video Al gore muestra una serie de graficas y evidencias de cmo elcalentamiento global afecta a nuestro planeta. El calentamiento global segn Al Goreest directamen
ITESM - MSE - SEM
LIDERAZGO PARA EL DESARROLLOSOSTENIBLEProyecto FinalEquipo #6: EquilibrioIntegrantes:Matrculas:Edgar Valladares SnchezA00371027Sergio David Villarreal ReyesA00795507Marina Trevio IrigoyenA00603947Octavio Flores GonzlezA00591110Jaime Eduardo
ITESM - MSE - SEM
Efectos de movilidad sobre la capacidad de redes inal mbricasaad hoc homog neaseCarlos Alberto G mez-Gonz lez y C sar Vargas RosalesoaeTecnol gico de MonterreyoMonterrey, N.L. 64810, M xicoeResumen En este trabajo, se estudian los efectos de m
ITESM - MSE - SEM
P roblema 1Figura Diagrama esquemtico de implementacin en SimuLink.F igura - Seal portadora 2Pcos2f0t p ara 2P= 1 y f0= 4HzFigura Seal portadora en BPSKF igura Walshcode generator a c= 0. 05A continuacin, se presentan las grficas correspondientes de
ITESM - MSE - SEM
P roblema 5. (a)0.700.3000000000.70.500.3000000000.70.500.3000000000.70.500.3000000000.70.500.3000000000.70.500.3000000000.70.500.3000000000.70.500.30.70.500.300
ITESM - MSE - SEM
I TESMProyecto 1: Cellular ConceptIntegrantes:Carlos Alberto Gmez GonzlezA00505967Maximiliano Gonzlez CobosA00808709Jos Vidal Cun CortsA00804945Ral Hernndez AquinoA00394095Materia:Redes de comunicaciones personalesProfesor:Dr. Csar Vargas Ro
University of Texas - CHEM - 301
moczulski (ksm935) H05: Atomic Theory mccord (50960)This print-out should have 33 questions.Multiple-choice questions may continue onthe next column or page nd all choicesbefore answering.001 10.0 pointsThe work function for chrominum metal is4.37
University of Texas - CHEM - 301
moczulski (ksm935) H04: EM Radiation mccord (50960)This print-out should have 16 questions.Multiple-choice questions may continue onthe next column or page nd all choicesbefore answering.001 10.0 pointsWhat is the frequency of light with a wavelengt
University of Texas - CHEM - 301
moczulski (ksm935) H03: Mixtures and KMT mccord (50960)This print-out should have 19 questions.Multiple-choice questions may continue onthe next column or page nd all choicesbefore answering.All students from Dr. McCords MWF11am class (50960) must r
University of Texas - CHEM - 301
moczulski (ksm935) H02: Gas Laws mccord (50960)This print-out should have 23 questions.Multiple-choice questions may continue onthe next column or page nd all choicesbefore answering.1If I have 44.8 liters of nitrogen gas at standardtemperature and
University of Texas - CHEM - 301
moczulski (ksm935) H01: Fundamentals mccord (50960)This print-out should have 16 questions.Multiple-choice questions may continue onthe next column or page nd all choicesbefore answering.1For 3.05 moles of water:? atoms = 3.05 mol H2O 6.02 1023 mo
SUNY Buffalo - CSE - 531
CSE 431/531Algorithm Analysis and DesignRoger HePlace: NSC 201Time: MWF 4:00 - 4:50 pmc Xin He (University at Buffalo)CSE 431/531 Algorithm Analysis and Design1 / 11Who should take this course?Anyone who is eithera computer science/engineering s
SUNY Buffalo - CSE - 531
Outline1Algorithm Analysis2Growth rate functions3The properties of growth rate functions:4Importance of the growth rate5An example6Encryptionc Xin He (University at Buffalo)CSE 431/531 Algorithm Analysis and Design1 / 29Algorithm Analysis
SUNY Buffalo - CSE - 531
Outline1Divide and Conquer Strategy2Master Theorem3Matrix Multiplication4Strassens MM Algorithm5Complexity of a Problem6Selection Problem7Summary8Computational Geometryc Xin He (University at Buffalo)CSE 431/531 Algorithm Analysis and De
SUNY Buffalo - CSE - 531
Assignment #1 CS4/531Due Date: Monday, Sep. 19, 2011UNSUPPORTED SOLUTIONS RECEIVE NO CREDIT.Total points: 551. (4pts) We want to prove the function f (n) = 3n2 + 4n 20 = (n2 ) by using the denitionof . Namely we need to nd c > 0 and n0 0 such that:3
SUNY Buffalo - CSE - 531
Assignment #1 CS4/531Due Date: Mon. Sep. 19, 2011UNSUPPORTED SOLUTIONS RECEIVE NO CREDIT.Total points: 55 You MUST turn in your HW by 2:10pm on Sep 19. After that, I will NOT accept yourHW. This rule will be STRICTLY ENFORCED. Please PRINT YOUR LAST
SUNY Buffalo - CSE - 531
Assignment #2 CS4/531Due Date: Mon. Oct. 3, 2011UNSUPPORTED SOLUTIONS RECEIVE NO CREDIT.Total points: 53 You MUST turn in your HW by 2:10pm on Oct 3. After that, I will NOT accept yourHW. This rule will be STRICTLY ENFORCED. Please PRINT YOUR LAST N
SUNY Buffalo - CSE - 596
CSE596 Fall 2011: Solution to Homework 1September 20, 2011A formula F is a tautology every assignment to its variables satises it no assignment to its variables satisfy F1. F is not satisable2. First of all, note that every variable (or its negation
SUNY Buffalo - CSE - 596
CSE596 Fall 2011: Solution To Homework 2September 25, 20111. (a) A one-taped Turing machine that recognizes cfw_0n 1n 0n |n 0 worksas follows :i. It rst scans the input to check if it is in the form of 0 1 0 .If not, REJECT.ii. It scans the input fr
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011Contact Information Instructor: Prof. Tevfik KosarLecture - IIntroductionOffice: 245 Bell HallPhone: 645-2323Email: tkosar@buffalo.eduWeb: http:/www.cse.buffalo.edu/~tkosarOffice hours: Tue noon - 1:00pm,
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011Lecture - IIntroductionTevfik Ko!arUniversity at BuffaloAugust 30th, 20111Contact Information Instructor: Prof. Tevfik KosarOffice: 245 Bell HallPhone: 645-2323Email: tkosar@buffalo.eduWeb: http:/www.cs
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011Roadmap OS Design and Implementation Different Design ApproachesLecture - II Major OS ComponentsOS Structures!!!!ProcessesMemory managementCPU SchedulingI/O ManagementTevfik Ko!arUniversity at Buffa
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011Lecture - IIOS StructuresTevfik Ko!arUniversity at BuffaloSeptember 1st, 20111Roadmap OS Design and Implementation Different Design Approaches Major OS Components!!!!ProcessesMemory managementCPU S
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011Roadmap ProcessesLecture - IIIProcessesBasic ConceptsProcess CreationProcess TerminationContext SwitchingProcess QueuesProcess SchedulingInterprocess CommunicationTevfik KoarUniversity at BuffaloSepte
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011Lecture - IIIProcessesTevfik KoarUniversity at BuffaloSeptember 6th, 20111Roadmap ProcessesBasic ConceptsProcess CreationProcess TerminationContext SwitchingProcess QueuesProcess SchedulingInterproce
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011Roadmap ThreadsLecture - IVThreadsWhy do we need them?Threads vs ProcessesThreading ExamplesThreading Implementation & Multi-threading ModelsOther Threading IssuesTevfik KoarThread cancellationSignal ha
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011Lecture - IVThreadsTevfik KoarUniversity at BuffaloSeptember 8th, 20111Roadmap ThreadsWhy do we need them?Threads vs ProcessesThreading ExamplesThreading Implementation & Multi-threading ModelsOther Th
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011Roadmap CPU Scheduling Basic Concepts Scheduling Criteria & Metrics Different Scheduling AlgorithmsLecture - VCPU Scheduling - IFCFSSJFPriorityRRTevfik KoarUniversity at BuffaloSeptember 13th, 20111
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011Lecture - VCPU Scheduling - ITevfik KoarUniversity at BuffaloSeptember 13th, 20111Roadmap CPU Scheduling Basic Concepts Scheduling Criteria & Metrics Different Scheduling AlgorithmsFCFSSJFPriorityRR
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011RoadmapLecture - VICPU Scheduling - IIMultilevel Feedback QueuesEstimating CPU burstsSystem CallsVirtual MachinesTevfik KoarUniversity at BuffaloSeptember 15th, 20111Multilevel Queue2Multilevel Queue
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011Lecture - VICPU Scheduling - IITevfik KoarUniversity at BuffaloSeptember 15th, 20111RoadmapMultilevel Feedback QueuesEstimating CPU burstsSystem CallsVirtual Machines2Multilevel Queue Ready queue is p
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011An HTTP RequestLecture - VIIProject - I Discussion <command> <argument> <HTTP version> <optional arguments> <blank line> GET /index.html HTTP/1.0Tevfik KoarUniversity at BuffaloSeptember 20th, 201112Ex
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011Lecture - VIIProject - I DiscussionTevfik KoarUniversity at BuffaloSeptember 20th, 20111An HTTP Request <command> <argument> <HTTP version> <optional arguments> <blank line> GET /index.html HTTP/1.02Se
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011RoadmapLecture - VIIIProcess Synchronization - I Process Synchronization Race Conditions Critical-Section Problem Solutions to Critical Section Different Implementations Semaphores Classic Problems of Syn
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011Lecture - VIIIProcess Synchronization - ITevfik KoarUniversity at BuffaloSeptember 22nd, 20111Roadmap Process Synchronization Race Conditions Critical-Section Problem Solutions to Critical Section Diffe
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011Roadmap Critical-Section Problem Solutions to Critical Section Different ImplementationsLecture - IXProcess Synchronization - II Semaphores Classic Problems of SynchronizationTevfik KoarUniversity at Buff
SUNY Buffalo - CSE - 521
CSE 421/521 - Operating SystemsFall 2011Lecture - IXProcess Synchronization - IITevfik KoarUniversity at BuffaloSeptember 26th, 20111Roadmap Critical-Section Problem Solutions to Critical Section Different Implementations Semaphores Classic P
SUNY Buffalo - CSE - 521
CSE 421/521 Operating SystemsFall 2011 - Homework Assignment #1The due date is: September 15th, Thursday, before the class (9:30am). Latesubmission is not allowed.int main(int argc, char *argv[])Pcfw_roblem 1:if (argc != 2)exit(0);pid_t pid;int
SUNY Buffalo - CSE - 521
P roject - 1C S E 421/521 O perating SystemsD ue: O ctober 24 @ 11:59pm , 20111. PreparationBefore beginning your work, please read the following carefully: Chapters 4-6 from Silberschatz Lecture slides on Threads, CPU Scheduling and Synchronization
SUNY Buffalo - CSE - 521
9/7/11CSE 421/521 - Operating SystemsFall 2011 RecitationsRecitation - IUNIX C ProgrammingProf. Tevfik KosarPresented by Yuan(Alex) ZhangUniversity at BuffaloSeptember 20111logon ssh timberlake.cse.buffalo.edu -l username or: ssh username@tim
SUNY Buffalo - CSE - 521
9/13/11CSE 421/521 - Operating SystemsFall 2011 RecitationsRecitation - IIUnix ProcessesProf. Tevfik KosarPresented by Yuan(Alex) ZhangUniversity at BuffaloSeptember ., 20111In Todays Class Unix Process EnvironmentCreation & Termination of Pro
SUNY Buffalo - CSE - 521
9/27/11CSE 421/521 - Operating SystemsFall 2011 RecitationsRecitation - IIINetworking &Concurrent ProgrammingProf. Tevfik KosarPresented by .University at BuffaloSeptember ., 20111Network Programming219/27/11 TCP Client-Server view Connect
LSU - CSC - 4103
CSC 4103 - Operating Systems Fall 2009Contact Information Instructor: Prof. Tevfik Kosar Office: 292 Coates (also 333 Johnston) Phone: 578-9483 Email: kosar@csc.lsu.edu Web: http:/www.cct.lsu.edu/~kosar Office hours: Wed & Thu, 2:00pm - 3:00pm(Or anyt
LSU - CSC - 4103
CSC 4103 - Operating Systems Fall 2009IntroductionLecture - ITevfik Ko!arLouisiana State UniversityAugust 25th, 20091Contact Information Instructor: Prof. Tevfik Kosar Office: 292 Coates (also 333 Johnston) Phone: 578-9483 Email: kosar@csc.lsu.ed
LSU - CSC - 4103
CSC 4103 - Operating Systems Fall 2009Announcements TA Changed. New TA: Praveenkumar Kondikoppa Email: pkondi1@lsu.eduOS StructuresLecture - II All of you should be now in the class mailing list. Let me know if you havent received any messages yet.
LSU - CSC - 4103
CSC 4103 - Operating Systems Fall 2009OS StructuresLecture - IITevfik Ko!arLouisiana State UniversityAugust 27th, 20091Announcements TA Changed. New TA: Praveenkumar Kondikoppa Email: pkondi1@lsu.edu All of you should be now in the class mailing
LSU - CSC - 4103
CSC 4103 - Operating Systems Fall 2009 ProcessesRoadmap Basic Concepts Process Creation Process Termination Context Switching Process Queues Process Scheduling Interprocess CommunicationProcessesLecture - IIITevfik Ko!arLouisiana State UniversitySe
LSU - CSC - 4103
CSC 4103 - Operating Systems Fall 2009ProcessesLecture - IIITevfik Ko!arLouisiana State UniversitySeptember 1st, 20091Roadmap Processes Basic Concepts Process Creation Process Termination Context Switching Process Queues Process Scheduling Interp
LSU - CSC - 4103
CSC 4103 - Operating Systems Fall 2009 ThreadsRoadmap Why do we need them? Threads vs Processes Threading Examples Threading Implementation & Multi-threading Models Other Threading Issues Thread cancellation Signal handling Thread pools Thread specific