{"componentChunkName":"component---src-templates-blog-post-jsx","path":"/blogs/introductiontoDSA","result":{"data":{"blog":{"frontmatter":{"title":"DATA STRUCTURES & ALGORITHMS","thumbnail":"blog20","date":"November 21, 2020","dsaCppCodeFile":null},"excerpt":"<div class=\"my-2 p-2\">\n              <h4>Introduction</h4>\n              <div class=\"m-2\">\n                <p>\n                  This blog series is for anyone who wish to learn\n                  <strong>Data Structures & Algorithms</strong>\n                  from scratch or just to brush up the topics.\n                </p>\n                <p>\n                  DSA is heart of Computer Science and you simply can't skip it.\n                  It helps alot during placements.\n                </p>\n                <p>\n                  This series covers both theory(in shorts) and\n                  implementation(in C++). I will attach the code file at the end\n                  of implementation part.\n                </p>\n              </div>\n            </div>\n            <div class=\"my-2 p-2\">\n              <h4>What is Data Structure?</h4>\n              <div class=\"m-2\">\n                <p>\n                  Data structure is a particular way of storing and organizing\n                  data in a computer so that it can be used efficiently.\n                </p>\n                <p>\n                  A data structure is a special format for organizing and\n                  storing data. It makes the students to understand the way in\n                  which the data is organized and retrieved later.\n                </p>\n                <p class=\"lead mb-0\"><u>Types of DS:</u></p>\n                <p>\n                  Depending on the organization of the elements, data structures\n                  are classified into two types:\n                </p>\n                <p>\n                  <strong>Linear DS:</strong> Elements are accessed in a\n                  sequential order but it is not compulsory to store all\n                  elements sequentially. Examples: Linked Lists, Stacks and\n                  Queues.\n                </p>\n                <p>\n                  <strong>Non–linear DS:</strong> Elements of this data\n                  structure are stored/accessed in a non-linear order. Examples:\n                  Trees and graphs.\n                </p>\n              </div>\n            </div>\n            <div class=\"my-2 p-2\">\n              <h4>What is Algorithm?</h4>\n              <div class=\"m-2\">\n                <p>\n                  An algorithm is the step-by-step unambiguous instructions to\n                  solve a given problem.\n                </p>\n                <p>\n                  An algorithm contains finite set of instructions that are\n                  carried in a specific order to perform specific task.\n                </p>\n                <p class=\"lead mb-0\"><u>Analysis of an Algorithm:</u></p>\n                <p>\n                  Mainly there are two criteria for judging the merits of\n                  algorithms:\n                </p>\n                <p>\n                  <strong>Correctness:</strong> Does the algorithm give solution\n                  to the problem in a finite number of steps?.\n                </p>\n                <p>\n                  <strong>Efficiency:</strong> How much resources in terms of\n                  memory and time does it take to execute the problem?.\n                </p>\n              </div>\n            </div>\n            <div class=\"my-2 p-2\">\n              <h4>What is ADT?</h4>\n              <div class=\"m-2\">\n                <p>\n                  An Abstract Data Type(ADT) is user-defined data type which can\n                  be implemented by defining set of operations on them.\n                </p>\n                <p>\n                  While defining the ADTs, do not worry about the implementation\n                  details. They come into the picture only when we want to use\n                  them. Different kinds of ADTs are suited to different kinds of\n                  applications, and some are highly specialized to specific\n                  tasks.\n                </p>\n                <p class=\"lead mb-0\"><u>Commonly used ADTs:</u></p>\n                <p>\n                  Linked Lists, Stacks, Queues, Priority Queues, Binary Trees,\n                  Dictionaries, Disjoint Sets (Union and Find), Hash Tables,\n                  Graphs etc.\n                </p>\n              </div>\n            </div>\n            <div class=\"my-2 p-2\">\n              <strong>Checkout the full series:</strong>\n              <a href=\"/category/dsa\">DSA Series</a>\n            </div>\n","html":"<div class=\"my-2 p-2\">\n              <h4>Introduction</h4>\n              <div class=\"m-2\">\n                <p>\n                  This blog series is for anyone who wish to learn\n                  <strong>Data Structures & Algorithms</strong>\n                  from scratch or just to brush up the topics.\n                </p>\n                <p>\n                  DSA is heart of Computer Science and you simply can't skip it.\n                  It helps alot during placements.\n                </p>\n                <p>\n                  This series covers both theory(in shorts) and\n                  implementation(in C++). I will attach the code file at the end\n                  of implementation part.\n                </p>\n              </div>\n            </div>\n            <div class=\"my-2 p-2\">\n              <h4>What is Data Structure?</h4>\n              <div class=\"m-2\">\n                <p>\n                  Data structure is a particular way of storing and organizing\n                  data in a computer so that it can be used efficiently.\n                </p>\n                <p>\n                  A data structure is a special format for organizing and\n                  storing data. It makes the students to understand the way in\n                  which the data is organized and retrieved later.\n                </p>\n                <p class=\"lead mb-0\"><u>Types of DS:</u></p>\n                <p>\n                  Depending on the organization of the elements, data structures\n                  are classified into two types:\n                </p>\n                <p>\n                  <strong>Linear DS:</strong> Elements are accessed in a\n                  sequential order but it is not compulsory to store all\n                  elements sequentially. Examples: Linked Lists, Stacks and\n                  Queues.\n                </p>\n                <p>\n                  <strong>Non–linear DS:</strong> Elements of this data\n                  structure are stored/accessed in a non-linear order. Examples:\n                  Trees and graphs.\n                </p>\n              </div>\n            </div>\n            <div class=\"my-2 p-2\">\n              <h4>What is Algorithm?</h4>\n              <div class=\"m-2\">\n                <p>\n                  An algorithm is the step-by-step unambiguous instructions to\n                  solve a given problem.\n                </p>\n                <p>\n                  An algorithm contains finite set of instructions that are\n                  carried in a specific order to perform specific task.\n                </p>\n                <p class=\"lead mb-0\"><u>Analysis of an Algorithm:</u></p>\n                <p>\n                  Mainly there are two criteria for judging the merits of\n                  algorithms:\n                </p>\n                <p>\n                  <strong>Correctness:</strong> Does the algorithm give solution\n                  to the problem in a finite number of steps?.\n                </p>\n                <p>\n                  <strong>Efficiency:</strong> How much resources in terms of\n                  memory and time does it take to execute the problem?.\n                </p>\n              </div>\n            </div>\n            <div class=\"my-2 p-2\">\n              <h4>What is ADT?</h4>\n              <div class=\"m-2\">\n                <p>\n                  An Abstract Data Type(ADT) is user-defined data type which can\n                  be implemented by defining set of operations on them.\n                </p>\n                <p>\n                  While defining the ADTs, do not worry about the implementation\n                  details. They come into the picture only when we want to use\n                  them. Different kinds of ADTs are suited to different kinds of\n                  applications, and some are highly specialized to specific\n                  tasks.\n                </p>\n                <p class=\"lead mb-0\"><u>Commonly used ADTs:</u></p>\n                <p>\n                  Linked Lists, Stacks, Queues, Priority Queues, Binary Trees,\n                  Dictionaries, Disjoint Sets (Union and Find), Hash Tables,\n                  Graphs etc.\n                </p>\n              </div>\n            </div>\n            <div class=\"my-2 p-2\">\n              <strong>Checkout the full series:</strong>\n              <a href=\"/category/dsa\">DSA Series</a>\n            </div>"},"thumbnail":{"childImageSharp":{"fluid":{"tracedSVG":"data:image/svg+xml,%3csvg%20xmlns='http://www.w3.org/2000/svg'%20width='400'%20height='225'%20viewBox='0%200%20400%20225'%20preserveAspectRatio='none'%3e%3cpath%20d='M27%2086c-1%200-2%202-2%209-1%2010-1%2011%205%209%205-1%208-5%208-11%200-7-4-9-11-7m18%200l-6%2017c0%203%204%203%205%200l3-2%202%202c0%201%201%202%203%202l2-2-3-16c-1-2-4-3-6-1m11%200l-1%203c0%202%200%202%203%202l2-1v7c0%207%200%208%202%208s3-4%203-12c0-2%200-3%202-3l2-2c0-3%200-3-6-3l-7%201m20%202c-3%204-6%2015-5%2016%201%202%204%201%205-1l2-2%202%202c1%202%204%203%205%201%201-1-2-16-3-18-2-2-5-1-6%202m23-1c-4%203-4%206%200%209s4%206%200%204h-3c-1%202-1%203%202%204%203%202%205%201%208-1%203-4%203-4-1-9l-3-4h1c0%202%205%203%205%201l3-1c2%200%202%200%202%207s0%208%202%208%202-1%203-3a4549%204549%200%20002-12l2-2c0-3%200-3-6-3-7%200-7%200-7%202v2l-2-2c-3-3-5-3-8%200m27-1c-1%200-2%201-2%209l-1%209c2%202%205%200%205-2%200-4%202-4%203%200%201%202%203%203%205%201%201-1%200-2-1-4v-4c5-7%200-11-9-9m14%200l-2%2015c2%205%2010%205%2013%200l1-10c0-6%200-6-2-6s-3%201-3%207c-1%207-1%209-3%207v-7c0-7%200-7-2-7l-2%201m18%200c-7%204-6%2019%201%2019%202%200%207-4%207-6s-2-2-4-1c-2%204-4%201-3-4%200-4%203-6%203-3l2%202c2%201%203%200%203-3%200-4-5-6-9-4m11%200c-2%201-1%205%201%205%202-1%202%200%202%207s0%207%203%207c2%200%202%200%202-7s0-8%202-8%203-1%203-3%200-2-6-2l-7%201m15%200l-1%209c0%209%201%2011%207%209%205-1%206-3%206-12%200-6%200-7-2-7s-3%203-3%2010c0%204-1%206-3%205v-8c0-6%200-7-2-7l-2%201m16%200c-1%200-2%201-2%209l-1%209c2%202%205%200%205-2%200-4%202-4%203%200%201%202%203%203%205%201%201-1%200-2-1-4v-4c5-7%200-11-9-9m14%200c-1%201-3%2018-1%2018h6c5%200%206-1%206-3s0-2-4-2c-5%200-4-2%200-2%204-1%203-5%200-4-2%200-3-1-3-2l4-1c4%200%204%200%204-2%200-3%200-3-5-3l-7%201m16%201c-3%203-3%207%201%2010%204%202%203%204-1%203h-3c0%203%201%204%204%205%207%201%2011-7%205-11-3-2-4-5-2-5l1%202%202%201%202-2c0-5-5-7-9-3m38%2015c-3%203-5%2013-3%2017%201%202%204%203%205%201%201-1-1-9-3-10-4-1%202-9%208-9%207%200%209%205%206%2011-2%205-2%208%200%209%204%201%207-8%204-9l-1-4c0-8-10-12-16-6m31%204l-1%208v7h17l-5%205a67%2067%200%2000-19%2036l-2%2010c0%203-1%203%208-7%205-8%2015-12%2015-8%200%202%201%203%203%203s3-1%201-2l-1-3h4c3%200%202%201%200%204l-2%204v3h-17v7c0%206%200%207-2%208-3%202-3%203%200%203%202%200%203%204%201%206l-6%201c-9%200-11-4-7-9l2-5c0-3-8%206-8%2010-1%203-1%203-10%204-8%200-8%200-8%202s1%203%205%203c5%200%206%200%204%205-1%202%201%202%2048%202h49l1-4c1-2%202-3%205-3%205-1%205-4%200-5h-3v-14c0-14-1-21-4-21l-2-2-1-2c-7-1-7-4-3-12%207-13%207-17%200-22-4-3-5-4-5-8l-1-4c-1-1-1%201-1%204%200%205%200%205-2%204l-23%201-3%201v-10l-14-1-13%201m2%208v6h22v-13h-22v7M54%20126l-2%203-2%206c-2%205%200%208%207%208%207-1%208-1%207-4v-7l-2-4c0-4-4-5-8-2m25%204c-4%2011-5%2013-2%2013l3-1%203-2%202%202%203%201c2%200%202%200%202-6-2-9-3-12-6-13-2%200-3%200-5%206m13%201l-1%2010c0%202%200%202%206%202s6%200%206-2c0-3%200-3-3-3h-3v-7c0-7%200-7-2-7-3%200-3%200-3%207m15-5c-3%203-4%2011-2%2015%203%205%2013%201%2012-5-1-4-7-4-6%200l-1%203c-2%200-1-8%200-10%202-1%202-1%202%201%200%201%201%202%203%202s2%200%202-3c0-5-5-7-10-3m13%201c-4%206-2%2016%204%2016s10-8%207-16c-2-4-8-5-11%200m14-2l-1%2010c-1%208%200%208%202%208l2-2c0-4%202-4%203-1%202%203%203%204%205%202%201-1%201-2-1-4-1-2-1-3%201-4v-9h-11m15%200v1l-1%209c0%208%200%208%203%208%202%200%202%200%202-7%200-6%200-7%203-7%202%200%202%200%202%207s0%207%202%207c3%200%203%200%203-7s1-8%203-8l2-2c0-2-1-2-10-2l-9%201m21%200l-1%2010-1%208h3c3%200%203%200%203-3l2-4c1-1%201%200%201%203%200%204%200%204%203%204h3v-19h-2c-3%200-3%200-3%204%200%202%200%203-2%203s-2-1-2-3c0-3%200-4-2-4l-2%201m15%203l-1%209c0%206%200%206%203%206l2-2c0-2%200-2%202%200h3c1-2%201-2%201%200s1%202%203%202h3l-1-8-1-10c0-2-3-1-5%203l-2%205-1-3c-1-7-5-8-6-2m19-1c-3%203-3%205%201%208s4%204%200%204c-1-1-2-1-3%201-1%203%207%204%2010%201%203-2%202-6-1-8l-3-4h1c2%203%205%203%205%200%200-5-6-7-10-2m66%2014l1%209h12v-18h-13v9m55%2016c0%201-1%202-3%202s-2%201-2%204v3h6c9%200%209%200%208%207l1%208v2l-1%203c0%204%200%204%205%204%207%201%2010-1%207-7v-5l-1-3-3-5-1-3h-1v-2l-3-5c-1-2-3-3-7-4l-5-2v3m-52%207l-1%205c0%203%200%204-1%203%200-4-2-3-3%200l2%204%202%203%203%201c2%200%202%200%202-3%200-2%200-3%202-3s2-1%202-4l-1-4-1%203c0%204-2%203-2-2-1-3-1-4-4-3'%20fill='%23d3d3d3'%20fill-rule='evenodd'/%3e%3c/svg%3e","aspectRatio":1.7699115044247788,"src":"/static/b13739e84eefe2612f8cb4818c55d8d2/ee604/blog20.png","srcSet":"/static/b13739e84eefe2612f8cb4818c55d8d2/69585/blog20.png 200w,\n/static/b13739e84eefe2612f8cb4818c55d8d2/497c6/blog20.png 400w,\n/static/b13739e84eefe2612f8cb4818c55d8d2/ee604/blog20.png 800w,\n/static/b13739e84eefe2612f8cb4818c55d8d2/f3583/blog20.png 1200w,\n/static/b13739e84eefe2612f8cb4818c55d8d2/e4d72/blog20.png 1280w","sizes":"(max-width: 800px) 100vw, 800px"}}}},"pageContext":{"blog":"introductiontoDSA","thumbnail":"thumbnails/blog20.png"}},"staticQueryHashes":["2987289216","63159454"]}