{"version":"1.0","provider_name":"Editura ASE","provider_url":"https:\/\/dev.editura.ase.ro\/editura-ase","author_name":"Editura ASE","author_url":"https:\/\/dev.editura.ase.ro\/editura-ase","title":"Algoritmi \u0219i tehnici de programare - Editura ASE","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"qaExxxqoRM\"><a href=\"https:\/\/dev.editura.ase.ro\/editura-ase\/product\/algoritmi-si-tehnici-de-programare\/\">Algoritmi \u0219i tehnici de programare<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/dev.editura.ase.ro\/editura-ase\/product\/algoritmi-si-tehnici-de-programare\/embed\/#?secret=qaExxxqoRM\" width=\"600\" height=\"338\" title=\"&#8222;Algoritmi \u0219i tehnici de programare&#8221; &#8211; Editura ASE\" data-secret=\"qaExxxqoRM\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" class=\"wp-embedded-content\"><\/iframe><script>\n\/*! This file is auto-generated *\/\n!function(d,l){\"use strict\";l.querySelector&&d.addEventListener&&\"undefined\"!=typeof URL&&(d.wp=d.wp||{},d.wp.receiveEmbedMessage||(d.wp.receiveEmbedMessage=function(e){var t=e.data;if((t||t.secret||t.message||t.value)&&!\/[^a-zA-Z0-9]\/.test(t.secret)){for(var s,r,n,a=l.querySelectorAll('iframe[data-secret=\"'+t.secret+'\"]'),o=l.querySelectorAll('blockquote[data-secret=\"'+t.secret+'\"]'),c=new RegExp(\"^https?:$\",\"i\"),i=0;i<o.length;i++)o[i].style.display=\"none\";for(i=0;i<a.length;i++)s=a[i],e.source===s.contentWindow&&(s.removeAttribute(\"style\"),\"height\"===t.message?(1e3<(r=parseInt(t.value,10))?r=1e3:~~r<200&&(r=200),s.height=r):\"link\"===t.message&&(r=new URL(s.getAttribute(\"src\")),n=new URL(t.value),c.test(n.protocol))&&n.host===r.host&&l.activeElement===s&&(d.top.location.href=t.value))}},d.addEventListener(\"message\",d.wp.receiveEmbedMessage,!1),l.addEventListener(\"DOMContentLoaded\",function(){for(var e,t,s=l.querySelectorAll(\"iframe.wp-embedded-content\"),r=0;r<s.length;r++)(t=(e=s[r]).getAttribute(\"data-secret\"))||(t=Math.random().toString(36).substring(2,12),e.src+=\"#?secret=\"+t,e.setAttribute(\"data-secret\",t)),e.contentWindow.postMessage({message:\"ready\",secret:t},\"*\")},!1)))}(window,document);\n\/\/# sourceURL=https:\/\/dev.editura.ase.ro\/editura-ase\/wp-includes\/js\/wp-embed.min.js\n<\/script>\n","description":"Volumul este structurat \u00een patru capitole, care trateaz\u0103: aspecte legate de recursivitate, lucrul cu fi\u0219iere, utilizarea grafurilor, metode \u0219i tehnici de programare. Primul capitol trateaz\u0103 aspecte legate de construc\u021bia \u0219i utilizarea subprogramelor recursive, asigurarea opririi gener\u0103rii de apeluri recursive, consumul de resurse. Capitolul al doilea prezint\u0103 aspecte legate de utilizarea fi\u0219ierelor text \u0219i binare \u00een aplica\u021bii C, pornind de la aspecte teoretice, organizare \u0219i moduri de acces, p\u00e2n\u0103 la algoritmi de prelucrare pentru diferite tipuri de probleme. Capitolul trei prezint\u0103 aspecte fundamentale legate de no\u021biunea de graf \u0219i algoritmi specifici lucrului cu grafuri. \u00cen ultimul capitol sunt prezentate aspecte teoretice \u0219i practice ale utiliz\u0103rii metodelor Divide et impera,\u00a0Greedy \u0219i\u00a0Bactracking \u00een rezolvarea unor clase de probleme.","thumbnail_url":"https:\/\/dev.editura.ase.ro\/editura-ase\/wp-content\/uploads\/2023\/02\/2014-USCATU-COCIANU...-Algoritmi-si-tehnici-program...SITE_.jpg","thumbnail_width":400,"thumbnail_height":578}