Gi\u1edbi thi\u1ec7u l\u1eadp tr\u00ecnh th\u1ee7 t\u1ee5c<\/p>\n
Nhi\u1ec1u ng\u00f4n ng\u1eef l\u1eadp tr\u00ecnh truy\u1ec1n th\u1ed1ng m\u00e0 sinh vi\u00ean v\u1eabn th\u01b0\u1eddng h\u1ecdc \u0111\u1ea7u ti\u00ean khi m\u1edbi t\u1eadp t\u1ec5nh b\u01b0\u1edbc v\u00e0o ngh\u1ec1 IT l\u00e0 nh\u1eefng ng\u00f4n ng\u1eef l\u1eadp tr\u00ecnh ki\u1ec3u th\u1ee7 t\u1ee5c (procedural languages<\/strong>). C\u00f3 th\u1ec3 k\u1ec3 ra m\u1ed9t s\u1ed1 ng\u00f4n ng\u1eef l\u1eadp tr\u00ecnh d\u1ea1ng n\u00e0y nh\u01b0:\u00a0C, C++, Fortran, Pascal, v\u00e0 Basic.<\/p>\n M\u1ed9t ch\u01b0\u01a1ng tr\u00ecnh \u0111\u01b0\u1ee3c vi\u1ebft theo ki\u1ec3u l\u1eadp tr\u00ecnh th\u1ee7 t\u1ee5c l\u00e0 m\u1ed9t d\u00e3y c\u00e1c l\u1ec7nh (instructions), n\u00f3i v\u1edbi m\u00e1y t\u00ednh bi\u1ebft tu\u1ea7n t\u1ef1 c\u00e1c b\u01b0\u1edbc \u0111\u1ec3 l\u00e0m m\u1ed9t vi\u1ec7c n\u00e0o \u0111\u00f3: Open a file, read a number, multiply by 4, display something. C\u00e1c \u0111\u01a1n v\u1ecb c\u1ee7a ch\u01b0\u01a1ng tr\u00ecnh bao g\u1ed3m c\u00e1c kh\u1ed1i ch\u01b0\u01a1ng tr\u00ecnh ch\u00ednh, c\u00e1c kh\u1ed1i ch\u01b0\u01a1ng tr\u00ecnh con, c\u00e1c h\u00e0m v\u00e0 th\u1ee7 t\u1ee5c; c\u00e1c t\u1ea7m v\u1ef1c, c\u00e1c th\u01b0 vi\u1ec7n d\u00f9ng th\u00eam ho\u1eb7c nh\u1eefng modules b\u00ean ngo\u00e0i d\u00f9ng k\u00e8m v\u1edbi ch\u01b0\u01a1ng tr\u00ecnh.<\/p>\n L\u1eadp tr\u00ecnh th\u1ee7 t\u1ee5c ph\u00f9 h\u1ee3p v\u1edbi nh\u1eefng d\u1ef1 \u00e1n nh\u1ecf. It is the most natural way to tell a computer what to do, and the computer processor’s own language, machine code, is procedural, so the translation of the procedural high-level language into machine code is straightforward and efficient. What is more, procedural programming has a built-in way of splitting big lists of instructions into smaller lists: the function.<\/p>\n","protected":false},"excerpt":{"rendered":" Gi\u1edbi thi\u1ec7u l\u1eadp tr\u00ecnh th\u1ee7 t\u1ee5c Nhi\u1ec1u ng\u00f4n ng\u1eef l\u1eadp tr\u00ecnh truy\u1ec1n th\u1ed1ng m\u00e0 sinh vi\u00ean v\u1eabn th\u01b0\u1eddng h\u1ecdc \u0111\u1ea7u ti\u00ean khi m\u1edbi t\u1eadp t\u1ec5nh b\u01b0\u1edbc v\u00e0o ngh\u1ec1 IT l\u00e0… <\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[33],"tags":[93],"class_list":["post-263","post","type-post","status-publish","format-standard","hentry","category-structured-programming","tag-procedural-programming"],"_links":{"self":[{"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/posts\/263","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/comments?post=263"}],"version-history":[{"count":0,"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/posts\/263\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/media?parent=263"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/categories?post=263"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/tags?post=263"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}