{
    "componentChunkName": "component---src-templates-learn-js",
    "path": "/learn/ds/intro",
    "result": {"data":{"mdx":{"frontmatter":{"title":"Introduction","date":"July 24, 2021","tags":["ds"],"description":"Data Structure Introduction"},"body":"var _excluded = [\"components\"];\n\nfunction _extends() { _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\n\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\n\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\n\n/* @jsxRuntime classic */\n\n/* @jsx mdx */\nvar _frontmatter = {\n  \"title\": \"Introduction\",\n  \"date\": \"2021-07-24\",\n  \"description\": \"Data Structure Introduction\",\n  \"tags\": [\"ds\"],\n  \"type\": \"tuts\"\n};\nvar layoutProps = {\n  _frontmatter: _frontmatter\n};\nvar MDXLayout = \"wrapper\";\nreturn function MDXContent(_ref) {\n  var components = _ref.components,\n      props = _objectWithoutProperties(_ref, _excluded);\n\n  return mdx(MDXLayout, _extends({}, layoutProps, props, {\n    components: components,\n    mdxType: \"MDXLayout\"\n  }), mdx(\"p\", null, \"A Data Structure is a way to store and organize data in a computer , so that it can be used efficiently. A Data Structure is collection of data elements organized in a specific manner, characterized by its own specific methods of accesing data elements.\"), mdx(\"br\", null), mdx(\"h3\", null, \"Need of Data Structure\"), \"As applications are getting complexed and amount of data is increasing day by day. these may arise the following patterns:\", mdx(\"ol\", null, mdx(\"li\", {\n    parentName: \"ol\"\n  }, mdx(\"strong\", null, \"Resources overflow\"), \" : To handle very large amount of data , we need to more space to process and more processor speed is required. As data is grouwing day by day to the billions of files per day, the resources couldnt handle large amount of data .\"), mdx(\"li\", {\n    parentName: \"ol\"\n  }, mdx(\"strong\", null, \"Time Consuming\"), \" : If we need to find a element in a array, it works very fast.But finding a element in a large array which contains billions of elements , it takes lots of time. Results in slowing down the resulting output as excepted.\"), mdx(\"li\", {\n    parentName: \"ol\"\n  }, mdx(\"strong\", null, \"Concurrent request processing\"), \" : If \", mdx(\"span\", {\n    className: \"highight\"\n  }, \"thousand\"), \" of users are searching the data simultaneously on a web server, then there are changes that a very large server can be failed during that process.\")), mdx(\"p\", null, \"Data Structure can be classified into :\"), mdx(\"ul\", null, mdx(\"li\", null, \"Primitive type\"), mdx(\"li\", null, \"Non Primitive type\")), mdx(\"strong\", null, \"Primitive Type: \"), \" These are basics Structures and are directly operated upon the machine instructions. Primitive Data Structures holds the value directly into the predefined data types present in the programming languages.\", mdx(\"br\", null), mdx(\"strong\", null, \"Non Primitive : \"), \" Non Primitives are complex data Structures ,it stores the address instead of values. These data structures are created by programmers. They are also called the \\\"reference variables\\\" or \\\"object reference\\\" since it has address/reference .\", mdx(\"div\", {\n    className: \"tree-diagram\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, \"Data Structures\", mdx(\"ul\", null, mdx(\"li\", null, \"Primitive Data Structure\", mdx(\"ul\", null, mdx(\"li\", null, \"Integer\"), mdx(\"li\", null, \"Float\"), mdx(\"li\", null, \"Character\"), mdx(\"li\", null, \"Pointer\"))), mdx(\"li\", null, \"Non - Primitive Data Structure\", mdx(\"ul\", null, mdx(\"li\", null, \"Arrays\"), mdx(\"li\", null, \"Lists\", mdx(\"ul\", null, mdx(\"li\", null, \"Liner Lists\", mdx(\"ul\", null, mdx(\"li\", null, \"Stacks\"), mdx(\"li\", null, \"Queues\"))), mdx(\"li\", null, \"Non - Linear Lists\", mdx(\"ul\", null, mdx(\"li\", null, \"Graphs\"), mdx(\"li\", null, \"Trees\")))), \" \"), mdx(\"li\", null, \"Files\"))))))));\n}\n;\nMDXContent.isMDXComponent = true;","slug":"ds/intro"},"allMdx":{"edges":[{"node":{"slug":"ds/arrays","id":"8ab43cbe-bc50-5590-925e-1a45d7028386"}},{"node":{"slug":"ds/binary_addition","id":"26e70246-f787-5a17-baa8-9375bbacc879"}},{"node":{"slug":"ds/binary_divison","id":"ec6f892f-531e-5661-8a44-d08f906ecba5"}},{"node":{"slug":"ds/binary_operations","id":"b2e4a072-3108-546d-a06a-646e43d834cc"}},{"node":{"slug":"ds/binary_multiplication","id":"0b241fae-5107-5843-b21e-7a5ed393168f"}},{"node":{"slug":"ds/binary_substraction","id":"18f53266-039e-5e0c-af57-37c05a2e80ec"}},{"node":{"slug":"ds/linear_data_structures","id":"0d96c16b-7430-59aa-b81a-73e67dcfd3d2"}},{"node":{"slug":"ds/bit_manipulation","id":"03ba2551-8800-5f50-9724-3a84d09a5989"}},{"node":{"slug":"ds/intro","id":"67e2c78b-07c3-57cf-9984-08e405f77783"}},{"node":{"slug":"ds/roadmap","id":"f7856a33-93ca-5464-8e5a-d5dc41765650"}},{"node":{"slug":"ds/programming_language","id":"ac14fda6-ff3a-5306-964a-3ce25168a6f0"}},{"node":{"slug":"ds/number_systems","id":"12494952-aaee-5db2-91ef-4db461c5b95c"}},{"node":{"slug":"ds/time_space_complex","id":"b7695373-5e9c-56c5-9b7f-5a632785916f"}}]}},"pageContext":{"id":"67e2c78b-07c3-57cf-9984-08e405f77783","filePath":"/ds/","previousPostId":"ds/bit_manipulation","nextPostId":"ds/roadmap"}},
    "staticQueryHashes": ["2033233798"]}