<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" media="screen" href="/~d/styles/atom10full.xsl"?><?xml-stylesheet type="text/css" media="screen" href="http://feeds.feedburner.com/~d/styles/itemcontent.css"?><feed xmlns="http://www.w3.org/2005/Atom" xmlns:openSearch="http://a9.com/-/spec/opensearch/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:gd="http://schemas.google.com/g/2005" xmlns:feedburner="http://rssnamespace.org/feedburner/ext/1.0" gd:etag="W/&quot;D0IGQ30zfip7ImA9WxBRF04.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205</id><updated>2010-01-05T21:52:02.386-02:00</updated><title>Qual a do C?</title><subtitle type="html">Artigos relacionados a linguagem C e afins, tais como C++ e C#.</subtitle><link rel="http://schemas.google.com/g/2005#feed" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/posts/default" /><link rel="alternate" type="text/html" href="http://qualadoce.blogspot.com/" /><link rel="hub" href="http://pubsubhubbub.appspot.com/" /><link rel="next" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default?start-index=26&amp;max-results=25&amp;redirect=false&amp;v=2" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email></author><generator version="7.00" uri="http://www.blogger.com">Blogger</generator><openSearch:totalResults>26</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>25</openSearch:itemsPerPage><atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="self" type="application/atom+xml" href="http://feeds.feedburner.com/qualadoce" /><atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="hub" href="http://pubsubhubbub.appspot.com" /><entry gd:etag="W/&quot;DUYESH86fyp7ImA9WxJQFkw.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-8150126331178246867</id><published>2009-05-29T14:06:00.007-03:00</published><updated>2009-05-29T14:11:49.117-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2009-05-29T14:11:49.117-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="Operadores aritméticos" /><category scheme="http://www.blogger.com/atom/ns#" term="Operadores de incremento e decremento" /><title>Operadores de incremento e decremento</title><summary>Operadores de incremento e decrementoA linguagem C é cheia de atalhos para o programador.Um dos atalhos mais utilizados é o operador de incremento (++). Esse operador é largamente utilizado no for.Esse operador incrementa a variável em uma unidade.Um exemplo prático pode ser visto logo abaixo:int a;a = 7;a++;printf("%d\n", a);A saída produzida por esse programa é 8. Como esperado, o operador de </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/8150126331178246867/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=8150126331178246867" title="2 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/8150126331178246867?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/8150126331178246867?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/R7Uyeu6OEVU/operadores-de-incremento-e-decremento.html" title="Operadores de incremento e decremento" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">2</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2009/05/operadores-de-incremento-e-decremento.html</feedburner:origLink></entry><entry gd:etag="W/&quot;DUIAQXY_eip7ImA9WxdbEkQ.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-6413474209572310788</id><published>2008-08-09T12:59:00.000-03:00</published><updated>2008-08-09T12:59:00.842-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-08-09T12:59:00.842-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="do while" /><category scheme="http://www.blogger.com/atom/ns#" term="laços de repetição" /><title>Do while</title><summary>Do whileO do while é um laço de repetição que executa primeiro o bloco de comandos e depois testa a condição. Caso a condição seja verdadeira, o laço é executado novamente. Quando a condição é falsa, a execução do laço é terminada.Essa característica de executar e depois testar, garante que o laço será executado ao menos uma vez, diferentemente do while, o qual não executa quando sua condição é </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/6413474209572310788/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=6413474209572310788" title="1 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/6413474209572310788?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/6413474209572310788?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/IifR5lwzITA/do-while.html" title="Do while" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">1</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/08/do-while.html</feedburner:origLink></entry><entry gd:etag="W/&quot;CEcCR3w7eip7ImA9WxdbEUk.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-3872856542529630978</id><published>2008-08-07T17:41:00.002-03:00</published><updated>2008-08-07T17:47:46.202-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-08-07T17:47:46.202-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="while" /><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="laços de repetição" /><title>While</title><summary>Retomando o assunto Laços de Repetição, abordado em abril/2008, hoje vamos tratar do while.A forma geral desse laço é:whilewhile(condicao){  comandos...}É importante saber que dentro do bloco de comandos do while é necessário tornar a condicao falsa. Caso isso não ocorra, o while entrará em loop infinito.Vamos recorrer a um exemplo simples:Suponha que uma cidade A possua 1.500.000 habitantes e </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/3872856542529630978/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=3872856542529630978" title="1 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/3872856542529630978?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/3872856542529630978?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/gdHnEv8Cl0A/while.html" title="While" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">1</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/08/while.html</feedburner:origLink></entry><entry gd:etag="W/&quot;DUUCRnY-fSp7ImA9WxZbGUU.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-4389826452318567886</id><published>2008-04-23T18:46:00.002-03:00</published><updated>2008-04-23T18:47:47.855-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-04-23T18:47:47.855-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="for" /><category scheme="http://www.blogger.com/atom/ns#" term="laços de repetição" /><title>For</title><summary>No tópico Laços de Repetição foram abordados de forma geral os três laços possíveis na linguagem C.Esse tópico trata do laço for.Como visto, a forma geral desse laço é:forfor(variavel = valor_inicial; condicao_envolvendo_variavel; incremento/decremento de variavel){  comandos...}Vamos vê-lo na prática:001:  #include &lt;stdio.h&gt;002:  #include &lt;stdlib.h&gt;003:004:  int main(int argc, char * argv[])005:</summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/4389826452318567886/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=4389826452318567886" title="2 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/4389826452318567886?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/4389826452318567886?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/vPq7U3dGX2U/for.html" title="For" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">2</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/04/for.html</feedburner:origLink></entry><entry gd:etag="W/&quot;DUYFRXc5fyp7ImA9WxZbGUU.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-1291868920739257543</id><published>2008-04-23T18:44:00.001-03:00</published><updated>2008-04-23T18:45:14.927-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-04-23T18:45:14.927-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="while" /><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="for" /><category scheme="http://www.blogger.com/atom/ns#" term="do-while" /><category scheme="http://www.blogger.com/atom/ns#" term="laços de repetição" /><title>Laços de repetição</title><summary>Os laços de repetição são ferramentas poderosas para o controle do fluxo de execução do programa. Eles permitem que um determinado trecho de código seja executado até que uma condição específica seja satisfeita.A linguagem C possui três tipos de laço de repetição, a saber, o for (para), o while (enquanto) e o do while (faça enquanto).O for deve ser utilizado quando você sabe o número de vezes em </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/1291868920739257543/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=1291868920739257543" title="0 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/1291868920739257543?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/1291868920739257543?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/OeTISZFcBa0/laos-de-repetio.html" title="Laços de repetição" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/04/laos-de-repetio.html</feedburner:origLink></entry><entry gd:etag="W/&quot;DU4AQHk-cSp7ImA9WxZbGUw.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-6529994708652313546</id><published>2008-04-22T23:20:00.004-03:00</published><updated>2008-04-22T23:32:21.759-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-04-22T23:32:21.759-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="case" /><category scheme="http://www.blogger.com/atom/ns#" term="break" /><category scheme="http://www.blogger.com/atom/ns#" term="switch" /><category scheme="http://www.blogger.com/atom/ns#" term="if" /><category scheme="http://www.blogger.com/atom/ns#" term="estrutura condicional" /><category scheme="http://www.blogger.com/atom/ns#" term="else" /><title>Está indeciso?</title><summary>Esse não é um tópico de auto-ajuda e muito menos de auto-conhecimento. :-)A intenção aqui é mostrar que quando possuímos várias decisões, podemos utilizar um comando especial, chamado de switch.Esse comando avalia uma variável e toma uma decisão de acordo com seu valor.Um exemplo vale mais que mil palavras. Suponha que você deve construir uma pequena calculadora de quatro operações básicas. É </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/6529994708652313546/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=6529994708652313546" title="2 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/6529994708652313546?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/6529994708652313546?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/STEKJfSAAM8/est-indeciso.html" title="Está indeciso?" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">2</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/04/est-indeciso.html</feedburner:origLink></entry><entry gd:etag="W/&quot;DUYASHo8fCp7ImA9WxZbGUw.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-7736110238258037769</id><published>2008-04-22T23:14:00.002-03:00</published><updated>2008-04-22T23:19:09.474-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-04-22T23:19:09.474-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="if" /><category scheme="http://www.blogger.com/atom/ns#" term="estrutura condicional" /><category scheme="http://www.blogger.com/atom/ns#" term="else" /><title>E o else if?</title><summary>Quando abordo as questões relativas aos comandos de decisões, muitos alunos me perguntam como devem proceder para escrever o camando else if.Primeiramente respondo que não existe esse comando. Mas como explicar construção abaixo?if(condicao){  comandos...} else if (condicao 2){   mais comandos...}Lembra-se que no tópico Lá vêm as chaves, chaves, chaves... eu disse que as chaves são opcionais </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/7736110238258037769/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=7736110238258037769" title="0 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/7736110238258037769?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/7736110238258037769?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/bQLj_Elk4vI/e-o-else-if.html" title="E o else if?" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/04/e-o-else-if.html</feedburner:origLink></entry><entry gd:etag="W/&quot;AkECRXY6cSp7ImA9WxZVEE8.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-2959844555144456992</id><published>2008-03-20T12:55:00.001-03:00</published><updated>2008-03-20T12:57:44.819-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-03-20T12:57:44.819-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><title>La vêm as chaves, chaves, chaves....</title><summary>O título é uma brincadeira com o nome do personagem da tv.As chaves delimitam um bloco de comandos na linguagem C e isso foi comentado no post Anatomia do programa em C.Elas voltaram a aparecer na estrutura condicional, e é claro, delimitando um bloco de comandos tanto para o if quanto para o else.Quando uma expressão condicional, localizada no if, é verdadeira, o bloco de comandos (que fica </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/2959844555144456992/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=2959844555144456992" title="0 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/2959844555144456992?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/2959844555144456992?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/NUTJuqhtME0/la-vm-as-chaves-chaves-chaves.html" title="La vêm as chaves, chaves, chaves...." /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/03/la-vm-as-chaves-chaves-chaves.html</feedburner:origLink></entry><entry gd:etag="W/&quot;DUIGSXk4eip7ImA9WxZWGEQ.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-7515465421882735919</id><published>2008-03-18T13:01:00.002-03:00</published><updated>2008-03-19T00:32:08.732-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-03-19T00:32:08.732-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="if" /><category scheme="http://www.blogger.com/atom/ns#" term="estrutura condicional" /><category scheme="http://www.blogger.com/atom/ns#" term="else" /><title>Condicional composto</title><summary>O condicional simples resolve apenas uma pequena parte dos problemas de programação. É interessante testar uma condição e se ela for falsa, tomar alguma decisão. Isso é possível com o condicional composto.SE condicao ENTAO  comando_001;  comando_002;SENAO  comando_003;  comando_004;FIM SEOs comandos 001 e 002 serão executados sempre que o valor de condicao for verdadeiro e os comandos 003 e 004 </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/7515465421882735919/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=7515465421882735919" title="0 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/7515465421882735919?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/7515465421882735919?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/boSbRP8qgjc/condicional-composto.html" title="Condicional composto" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/03/condicional-composto.html</feedburner:origLink></entry><entry gd:etag="W/&quot;DEcFSHk4cSp7ImA9WxZWFU8.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-5700557809197785329</id><published>2008-03-14T17:18:00.001-03:00</published><updated>2008-03-14T17:20:19.739-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-03-14T17:20:19.739-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="Operadores relacionais" /><category scheme="http://www.blogger.com/atom/ns#" term="operadores lógicos" /><title>Qual a negação do OU?</title><summary>Pense bem antes de responder!!!!A negação da operação lógica OU não é a operação lógica E.Vamos demonstrar por meio de um exemplo prático! Suponha a seguinte condição idade &lt;= 10 || idade &gt; 20 como necessária a uma pesquisa de opinião, que visa consultar pessoas fora da idade da adolescência.A tabela verdade para a seguinte expressão é:idade &lt;= 10idade &gt; 20idade &lt;= 10 || idade &gt; </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/5700557809197785329/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=5700557809197785329" title="0 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/5700557809197785329?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/5700557809197785329?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/UMzPsHYt-kU/qual-negao-do-ou.html" title="Qual a negação do OU?" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/03/qual-negao-do-ou.html</feedburner:origLink></entry><entry gd:etag="W/&quot;CkUCQ386eCp7ImA9WxZWE0o.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-5950792907877339329</id><published>2008-03-10T12:53:00.004-03:00</published><updated>2008-03-12T22:04:22.110-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-03-12T22:04:22.110-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="Operadores relacionais" /><category scheme="http://www.blogger.com/atom/ns#" term="operadores lógicos" /><title>Qual a negação do maior?</title><summary>Se sua resposta é menor, então deverá ler esse post.Essa é uma questão puramente matemática, mas de fundamental importância para compreender o famoso senão da estrutura condicional.O conceito da negação de uma expressão condicional está ligado a operação lógica não, afinal a expressão relacional retorna verdadeiro ou falso, a negação dessa expressão é, na verdade, negar o seu resultado.Voltando a</summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/5950792907877339329/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=5950792907877339329" title="2 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/5950792907877339329?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/5950792907877339329?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/bCe4vms1FQQ/qula-negao-do-maior.html" title="Qual a negação do maior?" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">2</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/03/qula-negao-do-maior.html</feedburner:origLink></entry><entry gd:etag="W/&quot;D0QGRH89eSp7ImA9WxZXGU0.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-697155303851828222</id><published>2008-03-07T12:54:00.000-03:00</published><updated>2008-03-07T12:55:25.161-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-03-07T12:55:25.161-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="if" /><category scheme="http://www.blogger.com/atom/ns#" term="estrutura condicional" /><category scheme="http://www.blogger.com/atom/ns#" term="Operadores relacionais" /><category scheme="http://www.blogger.com/atom/ns#" term="operadores lógicos" /><title>Condicional simples</title><summary>O mais interessante quando programamos é a sensação de poder que temos sobre o destino dos dados. Quando escrevemos um programa, nada mais fazemos do que determinar qual tratamento será dado para os dados que alimentam o programa.Os dados sofrem transformações, são utilizados ou descartados de acordo com seu valor. Para inferir os valores, usamos as estruturas condicionais. Elas são capazes de </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/697155303851828222/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=697155303851828222" title="0 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/697155303851828222?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/697155303851828222?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/5WWcGd8tH-w/condicional-simples.html" title="Condicional simples" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/03/condicional-simples.html</feedburner:origLink></entry><entry gd:etag="W/&quot;CU8GRHg9fip7ImA9WxZXF04.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-3777985452111077503</id><published>2008-03-05T13:16:00.000-03:00</published><updated>2008-03-05T13:17:05.666-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-03-05T13:17:05.666-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="tipos de dados" /><category scheme="http://www.blogger.com/atom/ns#" term="operadores lógicos" /><title>Operadores lógicos</title><summary>Existem três operações lógicas básicas, a operação E, a OU e a NÃO, as quais operam com valores lógicos verdadeiro(V) ou falso(F).A operação E e a OU, exigem dois operandos, já a NÃO exige somente um.A operação E será verdadeira quando os dois operandos forem verdadeiros, elá valerá falso quando ao menos um dos operandos for falso.ABA E BFFFFVFVFFVVVA operação OU retornará verdadeiro quando pelo </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/3777985452111077503/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=3777985452111077503" title="0 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/3777985452111077503?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/3777985452111077503?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/Cn7XmpbemMQ/operadores-lgicos.html" title="Operadores lógicos" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/03/operadores-lgicos.html</feedburner:origLink></entry><entry gd:etag="W/&quot;CEAFQ3w9cSp7ImA9WxZXFUg.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-7275983249911250902</id><published>2008-03-03T10:57:00.000-03:00</published><updated>2008-03-03T10:58:32.269-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-03-03T10:58:32.269-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="tipos de dados" /><title>Aqui vírgula é ponto!</title><summary>Os iniciantes em linguagem C costumam confundir vírgula com ponto ou vice-e-versa.Para os norte americanos, criadores da linguagem, o separador decimal é ponto e o de milhar é vírgula.O número 10.326 para a linguagem C é dez inteiros e trezentos e vinte e seis milésimos, ou 10 + (float)326/1000.Você se enganou se pensou que o número é dez mil e trezentos e vinte e seis.Quando você programar, não </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/7275983249911250902/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=7275983249911250902" title="0 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/7275983249911250902?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/7275983249911250902?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/QK27qUqo0vU/aqui-vrgula-ponto.html" title="Aqui vírgula é ponto!" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/03/aqui-vrgula-ponto.html</feedburner:origLink></entry><entry gd:etag="W/&quot;C0ACQ3wyfyp7ImA9WxZXEUg.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-1143612458554691105</id><published>2008-02-27T19:34:00.001-03:00</published><updated>2008-02-27T19:36:02.297-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-02-27T19:36:02.297-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="tipos de dados" /><category scheme="http://www.blogger.com/atom/ns#" term="if" /><category scheme="http://www.blogger.com/atom/ns#" term="estrutura condicional" /><category scheme="http://www.blogger.com/atom/ns#" term="else" /><category scheme="http://www.blogger.com/atom/ns#" term="Operadores relacionais" /><title>Verdadeiro e falso</title><summary>A linguagem c não possui um tipo de dado booleano, então de que forma ele trada o que é verdadeiro e falso?Sabe-se que para a linguagem C tudo o que tiver valor 0 é falso e tudo o que for diferente de 0 é verdadeiro.Para fins de demonstração recorrerei a dois exemplos.O primeiro exemplo apresenta o valor numérico de duas expressões lógicas, uma verdadeira e outra falsa.001:  #include &lt;stdio.h&gt;002</summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/1143612458554691105/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=1143612458554691105" title="0 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/1143612458554691105?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/1143612458554691105?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/cU5EtIXzxTY/verdadeiro-e-falso.html" title="Verdadeiro e falso" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/02/verdadeiro-e-falso.html</feedburner:origLink></entry><entry gd:etag="W/&quot;Ck4AQnY9fCp7ImA9WxZXEUg.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-4133441107694743940</id><published>2008-02-27T19:11:00.000-03:00</published><updated>2008-02-27T19:22:23.864-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-02-27T19:22:23.864-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="Operadores relacionais" /><title>Operadores relacionais</title><summary>Os operadores relacionais estabelecem uma relação (Não poderia ser mais óbvio!) entre seus operandos.Essa relação pode ser de:(==) igualdade(!=) diferença(&gt;) maior que(&lt;) menor que(&gt;=) maior ou igual a(&lt;=) menor ou igual aÉ interessante saber que o resultado de uma expressão relacional é sempre lógico, ou seja, retorna verdadeiro ou falso.Analisando a equação relacionalX == 7;concluímos que o </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/4133441107694743940/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=4133441107694743940" title="3 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/4133441107694743940?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/4133441107694743940?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/eNRTz9VME6Y/operadores-relacionais.html" title="Operadores relacionais" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">3</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/02/operadores-relacionais.html</feedburner:origLink></entry><entry gd:etag="W/&quot;C0QNQno6eCp7ImA9WxZXEUg.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-2161749517422309702</id><published>2008-02-25T21:39:00.011-03:00</published><updated>2008-02-27T19:29:53.410-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-02-27T19:29:53.410-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="entrada e saida de dados" /><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="scanf" /><title>O scanf engana</title><summary>Quando falei sobre a função scanf, chamei a atenção para a limpeza do buffer do teclado.Naquele momento enfatizei que limpar o buffer do teclado evitaria algumas dores de cabeça.Execute o código abaixo e verifique o seu funcionamento.001:  #include &lt;stdio.h&gt;002:  #include &lt;stdlib.h&gt;003:004:  int main(int argc, char *argv[])005:  {006:    char chr1, chr2;007:    008:    printf("Digite o primeiro </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/2161749517422309702/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=2161749517422309702" title="4 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/2161749517422309702?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/2161749517422309702?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/l1ju9YJRQgQ/o-scanf-engana.html" title="O scanf engana" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">4</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/02/o-scanf-engana.html</feedburner:origLink></entry><entry gd:etag="W/&quot;DkYBQXY9fyp7ImA9WxZXEE8.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-5695079621302296174</id><published>2008-02-25T13:47:00.006-03:00</published><updated>2008-02-26T08:09:10.867-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-02-26T08:09:10.867-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="tipos de dados" /><category scheme="http://www.blogger.com/atom/ns#" term="Operadores aritméticos" /><title>Operadores aritméticos</title><summary>A linguagem C disponibiliza cinco operadores aritméticos binários.(+) soma(-) subtração(*) multiplicação(/) divisão(%) resto de uma divisão entre inteirosOs operadores binários recebem esse nome porque necessitam de dois operandos para que a operação exista.x = a + b;Nem todas as operações são binárias. A linguagem C disponibiliza a operação menos unário, a qual necessita somente de um operando </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/5695079621302296174/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=5695079621302296174" title="0 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/5695079621302296174?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/5695079621302296174?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/9GUOs7RJAU8/operadores-aritmticos.html" title="Operadores aritméticos" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/02/operadores-aritmticos.html</feedburner:origLink></entry><entry gd:etag="W/&quot;AkEGQHs6eyp7ImA9WxZQGUg.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-7604472085501188905</id><published>2008-02-22T10:27:00.004-03:00</published><updated>2008-02-25T13:57:01.513-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-02-25T13:57:01.513-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="entrada e saida de dados" /><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="tipos de dados" /><category scheme="http://www.blogger.com/atom/ns#" term="scanf" /><title>lendo dados - a função scanf</title><summary>Agora que você sabe como funciona o operador de endereço &amp;, posso apresentar a você a função scanf (leia-se scanEFE).Essa função, como a printf, está localizada na biblioteca stdio.h e serve como entrada de dados em seu programa. Tudo aquilo que você digita no teclado será lido por essa função.É claro que para o scanf você deverá informar duas coisas: Em qual formato o dado será lido? Onde ele </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/7604472085501188905/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=7604472085501188905" title="0 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/7604472085501188905?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/7604472085501188905?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/Ya_1mXSxDqA/lendo-dados-funo-scanf.html" title="lendo dados - a função scanf" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/02/lendo-dados-funo-scanf.html</feedburner:origLink></entry><entry gd:etag="W/&quot;DkQBRX0_eCp7ImA9WxZXEE8.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-8095160755668008637</id><published>2008-02-21T07:32:00.005-03:00</published><updated>2008-02-26T08:12:34.340-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-02-26T08:12:34.340-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="memória" /><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="tipos de dados" /><category scheme="http://www.blogger.com/atom/ns#" term="operador de endereço" /><title>Operador de endereço</title><summary>Quando falei sobre criação e inicialização de variáveis, falei também que cada variável recebe uma casa, chamada de memória.Como toda casa possui um endereço (Rua, número, bairro, cidade, estado, país, CEP), a memória possui um endereçamento, muito mais simplificado, composto por números.Esses números indexam a memória byte-a-byte.Vamos recorrer ao exemplo abaixo para compreender melhor:</summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/8095160755668008637/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=8095160755668008637" title="2 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/8095160755668008637?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/8095160755668008637?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/nSzu0Fus_bg/operador-de-endereo.html" title="Operador de endereço" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">2</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/02/operador-de-endereo.html</feedburner:origLink></entry><entry gd:etag="W/&quot;DkEGQX0-eyp7ImA9WxZXEE8.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-406206172926187845</id><published>2008-02-18T21:32:00.012-03:00</published><updated>2008-02-26T08:17:00.353-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-02-26T08:17:00.353-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="entrada e saida de dados" /><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="tipos de dados" /><category scheme="http://www.blogger.com/atom/ns#" term="printf" /><title>A função printf()</title><summary>No post Meu primeiro programa em C, apresentei o uso da função printf em sua forma mais ordinária. Aquela em que a utilizamos para apresentar mensagens fixas, como a apresentada abaixo.printf("Uma mensagem para voce!");Nessa forma não existem códigos de formatação.Os códigos mais básicos servem para controlar tabulações, quebras de linhas, impressão de aspas, etc..., e são iniciados pela barra </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/406206172926187845/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=406206172926187845" title="0 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/406206172926187845?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/406206172926187845?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/HArThiurkIA/funo-printf.html" title="A função printf()" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/02/funo-printf.html</feedburner:origLink></entry><entry gd:etag="W/&quot;DkQMRX04fip7ImA9WxZXEE8.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-6567532470724163492</id><published>2008-02-18T08:01:00.002-03:00</published><updated>2008-02-26T08:13:04.336-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-02-26T08:13:04.336-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="funções" /><category scheme="http://www.blogger.com/atom/ns#" term="identificadores" /><category scheme="http://www.blogger.com/atom/ns#" term="variáveis" /><title>Identificadores</title><summary>O nome que damos a uma função ou variável é chamado de identificador.Os identificadores são fundamentais na compreensão do programa. Para isso devemos escolher identificadores significativos, que indiquem exatamente o papel que a função ou variável desempenha no sistema.Uma variável que armazena, por exemplo, o peso de um paciente pode ser identificada por pesoPaciente. Lendo somente o </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/6567532470724163492/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=6567532470724163492" title="0 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/6567532470724163492?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/6567532470724163492?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/ld_V-kLGg5M/identificadores.html" title="Identificadores" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/02/identificadores.html</feedburner:origLink></entry><entry gd:etag="W/&quot;AkQNSXw-fSp7ImA9WxZQFk4.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-8360565315464741825</id><published>2008-02-15T16:23:00.005-02:00</published><updated>2008-02-21T20:59:58.255-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-02-21T20:59:58.255-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="tipos de dados" /><category scheme="http://www.blogger.com/atom/ns#" term="variáveis" /><category scheme="http://www.blogger.com/atom/ns#" term="operadores de atribuição" /><title>Criação e inicialização de variáveis</title><summary>Na linguagem C a criação de variáveis é bastante simples. O comando de criação é formado pelo tipo de dados seguido de uma ou mais variáveis que assumirão aquele tipo e termina-se o comando com o famoso ponto-e-vírgula.Ex.: Para criar uma variável do tipo char podemos fazer:char opcao;Por esse comando sabemos que existe no programa uma variável chamada opção que manipula dados do tipo char.Para </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/8360565315464741825/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=8360565315464741825" title="1 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/8360565315464741825?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/8360565315464741825?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/DJ2aOOSL79s/criao-e-inicializao-de-variveis.html" title="Criação e inicialização de variáveis" /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">1</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/02/criao-e-inicializao-de-variveis.html</feedburner:origLink></entry><entry gd:etag="W/&quot;AkUDRHg7cCp7ImA9WxZQFk4.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-5559703746967881546</id><published>2008-02-15T10:34:00.011-02:00</published><updated>2008-02-21T20:57:55.608-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-02-21T20:57:55.608-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="memória" /><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="tipos de dados" /><category scheme="http://www.blogger.com/atom/ns#" term="variáveis" /><title>Tipos básicos de dados na linguagem C.</title><summary>Os tipos de dados são utilizados para assinalar qual será a forma de tratamento dispensada ao dado em memória ou outro sistema de armazenamento de dados.A linguagem C possui cinco tipos básicos de dados:charintfloatdoublevoidCom exceção do void, os tipos em linguagem C são todos numéricos e podem ser aplicadas às operações aritméticas disponíveis no C, com ressalvas ao operador de módulo.O tipo </summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/5559703746967881546/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=5559703746967881546" title="0 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/5559703746967881546?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/5559703746967881546?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/CMYGhuKhI4A/tipos-bsicos-de-dados-na-linguagem-c.html" title="Tipos básicos de dados na linguagem C." /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/02/tipos-bsicos-de-dados-na-linguagem-c.html</feedburner:origLink></entry><entry gd:etag="W/&quot;DU4BQHw4eyp7ImA9WxZQFk4.&quot;"><id>tag:blogger.com,1999:blog-875681637167026205.post-9169753032644825860</id><published>2008-02-14T11:09:00.006-02:00</published><updated>2008-02-21T20:52:31.233-03:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-02-21T20:52:31.233-03:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="C" /><category scheme="http://www.blogger.com/atom/ns#" term="main" /><title>Anatomia do programa em C.</title><summary>No tópico "C - Meu primeiro programa!" apresentei um programa simples que dizia "Estou vivo....!" para quem mexia com ele!Vamos entender o seu funcionamento.001:  #include &lt;stdio.h&gt;002:003:  int main(int argc, char *argv[])004:  {005:    printf("Estou vivo....!");006:    return 0;007:  }Quando você executa um programa no sistema operacional, dentre aquele amontoado de código de máquina, existe um</summary><link rel="replies" type="application/atom+xml" href="http://qualadoce.blogspot.com/feeds/9169753032644825860/comments/default" title="Postar comentários" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=875681637167026205&amp;postID=9169753032644825860" title="0 Comentários" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/9169753032644825860?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/875681637167026205/posts/default/9169753032644825860?v=2" /><link rel="alternate" type="text/html" href="http://feedproxy.google.com/~r/qualadoce/~3/gKzEZOm5voo/no-tpico-c-meu-primeiro-programa.html" title="Anatomia do programa em C." /><author><name>Anderson Guiera</name><uri>http://www.blogger.com/profile/08985590681018723536</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="16233814750324585856" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://qualadoce.blogspot.com/2008/02/no-tpico-c-meu-primeiro-programa.html</feedburner:origLink></entry></feed>
