Question to the answer no 1:
In my last class I was learned about Linked list, stack and queue.
A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. In simple words, a linked list consists of nodes where each node contains a data field and a reference(link) to the next node in the list.
Stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO) principle.
Queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) principle.


Question to the answer no 2:
With increasing complexities in computer algorithms, the amount of data usage is increasing, this can affect the performance of the application and can create some areas of concern:

• Processing speed: To handle very large data, high-speed processing is required, but with growing data processor may fail to archive required processing speed.
• Data Search: Getting a particular record from database should be quick and with optimum use of resources.
• Multiple requests: To handle simultanous requests from multiple users

Data Structure Advantages
• Efficient Memory use: With efficient use of data structure memory usage can be optimized, for e.g we can use linked list vs arrays when we are not sure about the size of data. When there is no more use of memory, it can be released.
• Reusability: Data structures can be reused, i.e. once we have implemented a particular data structure, we can use it at any other place. Implementation of data structures can be compiled into libraries which can be used by different clients.
• Abstraction: Data structure serves as the basis of abstract data types, the data structure defines the physical form of ADT(Abstract Data Type). ADT is theoretical and Data structure gives physical form to them.
All of those point shows the importance of Data Structure in computer science and engineering field.

Question to the answer no 3:
The real time application of tree, graph, stack and queue in data structure:
Now, i am gonna write some real life applications and by real life i mean applications of the data structures in your daily routine.
Tree : We must've used our windows task manager,when we right click on the name of some currently running application you'd have seen that there's a option to end the process tree ,it shuts down not only that application but all the child applications of that root application which we want to shut down,so the windows basically forms a tree of processes that are related to that application and makes that app the root.Trees are also used in DBMS ,we are really gotta know how to deal with them while working with database management system.
Graph : Graphs have many applications not only in computer science but in other fields too.graphs are used in game theory ,artificial intelligence,computer networks and in genetic algorithms.
Stack : Stack plays a crucial part in designing a operating systems.
Queue : In our smartphone we must've used some music apps like saavn,wynk and music player which our mobile has and we also have maintained a playlist of our favourite songs ,well thats when the queue come in but there are some modifications in that but the main idea comes from the queues only.

1)Ans:
In my last class I was learned about Linked list, stack and queue.

2)Ans:
Data Structure is the combination of data objects which gives a way of collecting and handling data in the computer so that it can be used. Their various types are arrays, Linked List, Stack, Queue, etc. Data Structures are used extensively in nearly every aspect of Computer Science for simple as well as complex calculations. They are practiced in all such areas such as AI, Graphics, Operating System, etc.

Data Structures are a crucial part of several computer algorithms as they allow programmers to do data management efficiently. A wise selection of data structures can improve the performance of a computer program or algorithm in a more useful way.

1. Handling complexity:
Increase in complexities in computer algorithms, the volume of data usage is rising; this can affect the execution of the application and can create remarkable areas of concern like processing speed, data search, and multiple requests. To counter these data structures are used.

2. Systematic memory use:
Systematic application of data structure memory usage can be optimized, e.g., we can use linked list vs. arrays when we are not particular about the data size. When there is no longer use of memory, it can be cleared.

3. Ability to reuse:
Once we have executed a particular data structure, we can reuse it in any distinct position. Implementation of data structures can be assembled into libraries that can be utilized by various clients.

4. Abstraction: 
Data structure acts as the foundation of abstract data types; the data structure describes the physical form of Abstract Data Type. In ADT, the set of operations is supposed to be understood, and the data structure provides physicality to them.

Data structures are the integral constituent of any programming language or complex computations. Mostly, structured data structures are crucial to designing efficient algorithms.

3)Ans:
The real time application of tree, graph, stack and queue in data structure.Now i will write in detail all the real time application.

Tree:
Trees are hierarchical structures having a single root node.Some applications of the trees are:

1.XML Parser uses tree algorithms.
Decision-based algorithm is used in machine learning which works upon the algorithm of tree.
2.Databases also uses tree data structures for indexing.
3.Domain Name Server(DNS) also uses tree structures.

Graph:
Graph is a data structure where data is stored in a collection of interconnected vertices (nodes) and edges (paths).Some applications of a graph are:

1.Facebook’s Graph API uses the structure of Graphs.
2.Google’s Knowledge Graph also has to do something with Graph.
3.Dijkstra algorithm or the shortest path first algorithm also uses graph structure to finding the smallest path between the nodes of the graph.
4.GPS navigation system also uses shortest path APIs.

Stack:
A stack is a data structure which uses LIFO order.Some Applications of a stack are:

1.Converting infix to postfix expressions.
Undo operation is also carried out through stacks.
2.Syntaxes in languages are parsed using stacks.
3.It is used in many virtual machines like JVM.

Queue:
A queue is a data structure which uses FIFO order.Some applications of a queue are:

1.Operating System uses queue for job scheduling.
2.To handle congestion in networking queue can be used.
3.Data packets in communication are arranged in queue format.

Answer : 01

In this week i have learn about Linked list, stack and queue. In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory.
Stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO)principle.
Queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) principle.


Answer : 02

It is axiom that data structures base of computer science. It is actual computer science.Data structures are like hands for algorithms to make recipe. Using combination of data structure and algorithms, we can improve performance of program drastically. For example, you are using any searching algorithm like binary search, then set data structure would be perfect rather than array. The reason is, set is much better for checking whether element is present in specified place or not. This is actually not a quite good example but it can tell you the actual need of data structure in algorithms. Data Structures teach you how computer stores the data in memory so that it can be retrieved, updated, stored in a faster manner. A coding problem that is solvable using Polynomial Time without using appropriate data structure, can be solved in linear time it data is stored in an appropriate data structure.


Answer : 03

I am going to write about the real time application of tree, graph ,stack, queue.
Graphs : They are a tool to model a problem. It just unbelievable at the diversity of problems that we can solve using graphs. Its applications vary from Google Search to Facebook Feeds to Image Segmentation. It is a separate field in its own (Graph Theory) and listing its applications would just limit its scope.
Tree : Trees are a form of graph. Application of trees can be found in implementing complex data-structures for 1. Search (Binary Search Trees, Tries, Red-Black Trees etc etc) 2. Range Max/Min Queries (Segment Trees , Binary Index Trees , Heaps) 3. String Analysis Data Structures like Suffix Tries. These are just a few from the vast ocean.
Queue: This is like a basic tool for everything. From adhoc uses, to multi-threaded Synchronization , to Graph Algorithms … everywhere we will find them. Some primary ones are Producer-Consumer Problem.
Stack: These are also found everywhere. Stack is used internally by system in implementing recursions and maintaining process states. Some prime uses are Expression Evaluation and DFS.

In my last class I was learned about Linked list, stack and queue.

Answer to the question no - 2 :-

It is aphorism that information structures base of software engineering. It is genuine PC science. Data structures resemble hands for calculations to make formula. Utilizing mix of information structure and calculations, we can improve execution of program radically. For instance, you are utilizing any looking through calculation like double hunt, at that point set information structure would be immaculate instead of cluster. The explanation is, set is vastly improved for checking whether component is available in indicated place or not. This is really not a very genuine model but rather it can reveal to you the real need of information structure in calculations. Information Structures show you how PC stores the information in memory with the goal that it very well may be recovered, refreshed, put away in a quicker way. A coding issue that is reasonable utilizing Polynomial Time without utilizing fitting information structure, can be illuminated in straight time it information is put away in a suitable information structure.


Answer to the question no - 3 :-

The ongoing use of tree, chart, stack and line in information structure:

Presently, I am going to keep in touch with some genuine applications and by genuine I mean uses of the information structures in your every day schedule.

Tree :- We must've utilized our windows task manager, when we right snap on the name of some as of now running application you'd have seen that there's a choice to end the cycle tree ,it closes down that application as well as all the kid uses of that root application which we need to close down, so the windows essentially shapes a tree of cycles that are identified with that application and makes that application the root. Trees are additionally utilized in DBMS ,we are truly gotten realize how to manage them while functioning with information base administration framework.

Graph :- Graphs have numerous applications in software engineering as well as in different fields too. Graphs are utilized in game hypothesis ,fake intelligence, computer networks and in hereditary calculations.

Stack :- Stack has a urgent influence in planning a working frameworks.

Queue :- In our cell phone we must've utilized some music applications like savant, wink and music player which our portable has and we likewise have kept up a playlist of our main tunes ,well that is the point at which the line come in however there are a few adjustments in that yet the principle thought originates from the lines as it were.

Answer to the Question No. 1
I have learned about Linked list, Stack and Queue in this week.

Answer to the Question No. 2
Data structure is a particular way of storing and organizing information in a computer so that it can be retrieved and used most productively. Different kinds of data structures are meant for different kinds of applications, and some are highly specialized to specific tasks. Data structures are important for the following reasons:
1. Data structures are used in almost every program or software system.
2. Specific data structures are essential ingredients of many efficient algorithms, and make possible the management of huge amounts of data, such as large integrated collection of databases.
3. Some programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design.

Answer to the Question No. 3
The real time application of tree, graph, stack and queue in data structure:
Tree: It is used in many search applications where data is constantly entering or leaving, such as the map and set objects in many languages’ libraries. It is also used in almost every high-bandwidth router for storing router-tables and every 3D video game to determine what objects need to be rendered. Domain Name Server uses tree structures and databases also uses tree data structures for indexing.

Graph: Google maps uses graphs for building transportation systems, where intersection of two (or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.

Stack: The stack can be used to convert infix to postfix expressions and undo operation is also carried out through stacks. It can be also used to process syntaxes of language and it is used in many virtual machines like JVM.

Queue: It is used to handle congestion in networking. Call center phone systems uses queues to hold people calling them in an order, until a service representative is free and Operating System uses queue for job scheduling.

Answer to the Q. No. 1
This week I learned about linked lists, stacks and rows. In computer science, a linked list is a linear collection of data elements whose order is not given by their physical location in memory.

Stack is an abstract data type with a limited capacity. It is a simple data structure that allows to add and delete elements in a specific order. Each time an element is added, it goes to the top of the stack and only the element can be removed.

Queue is a linear list of elements in which deletions can take place only at one end, called the " front " and insertion can take place only at the other end, called " rear ". The term " front " and " rear " are used in describing a linear list only when it is implemented as a queue. Queues are also called "first-in first-out " (FIFO) list. Since the first element in a queue will be the first element out of the queue. In other words, the order in which elements enter in a queue is the order in which they leave. The real life example: the people waiting in a line at Railway tickets Counter form a queue, where the first person in a line is the first person to be waited on. An important example of a queue in computer science occurs in time sharing system, in which programs with the same priority form a queue while waiting to be executed. Graph structures represents hierarchical relationship between individual data elements. Graphs are nothing but trees with certain restrictions removed. A graph consists of a set of nodes and a set of arc (or edge ).


Answer to the Q. No. 2

Data structure is a special format for organizing, processing, retrieving and storing data. There are several types of basic and advanced structures, but any data structure is designed to sort the data as it is useful for a specific purpose so that it can be accessed and acted upon appropriately.

In computer programming, data structures can be chosen or designed to store data for the purpose of working with different algorithms. Each data structure contains information about data values, the relationship between data and functions that can be applied to data.

With increasing complexities in computer algorithms, the amount of data usage is increasing, this can affect the performance of the application and can create some areas of concern:


i) Processing speed: To handle very large data, high-speed processing is required, but with growing data processor may fail to archive required
processing speed.


ii) Data Search:
Getting a particular record from database should be quick and with optimum use of resources.

iii) Multiple requests:
To handle simultaneous requests from multiple users.


iv) Efficient Memory use:
With efficient use of data structure memory usage can be optimized, for e.g. we can use linked list vs arrays when we are not sure about the size of data. When there is no more use of memory, it can be released.

v) Reusability:
Data structures can be reused, i.e. once we have implemented a particular data structure, we can use it at any other place. Implementation of data structures can be compiled into libraries which can be used by different clients.

vi) Abstraction:
Data structure serves as the basis of abstract data types , the data structure defines the physical form of ADT (Abstract Data Type). ADT is theoretical and Data structure gives physical form to them.

All of those point shows the importance of Data Structure in computer science and engineering field.


Answer to the Q. No. 3

The real life applications of trees, graphs, stacks, queue are below….

Stacks :
A stack is a linear Structure in which item may be added or removed only at one end. There are certain frequent situations in computer science when one wants to restrict insertions and deletions so that they can take place only at the beginning or end of the list, not in the middle.
A stack is a list of elements in which an elements may be inserted or deleted only at one end, called the Top. This means, in particular, the elements are removed from a stack in the reverse order of that which they are inserted in to the stack. The stack also called "last-in first -out (LIFO) " list.

Primary operations defined on a stack:

PUSH:
Add an element at the top of the list.

POP:
Remove an element from the top of the list.

Graphs :
They are a tool to model a problem. You just can not believe at the diversity of problems that you can solve using graphs. Its applications vary from Google Search to Facebook Feeds to Image Segmentation. It is a separate field in its own (Graph Theory) and listing its applications would just limit its scope.

Trees :
Trees are a form of graph. Application of trees can be found in implementing complex data-structures for…
1. Search (Binary Search Trees, Tries, Red-Black Trees etc ).
2. Range Max/Min Queries (Segment Trees , Binary Index Trees , Heaps) .
3. String Analysis Data Structures like Suffix Tries. These are just a few from the vast ocean.

Queue :
Queue is a linear list of elements in which deletions can take place only at one end, called the " front " and insertion can take place only at the other end, called " rear ". The term " front " and " rear " are used in describing a linear list only when it is implemented as a queue. Queues are also called "first-in first-out " (FIFO) list. Since the first element in a queue will be the first element out of the queue. In other words, the order in which elements enter in a queue is the order in which they leave. The real life example: the people waiting in a line at Railway tickets Counter form a queue, where the first person in a line is the first person to be waited on. An important example of a queue in computer science occurs in time sharing system, in which programs with the same priority form a queue while waiting to be executed. Graph structures represents hierarchical relationship between individual data elements. Graphs are nothing but trees with certain restrictions removed. A graph consists of a set of nodes and a set of arc .

1)In my last class I was learned about Linked list, stack and queue.

2)Information Structure is the blend of information objects which gives a method of gathering and taking care of information in the PC with the goal that it tends to be utilized. Their different sorts are exhibits, Linked List, Stack, Queue, and so on. Information Structures are utilized widely in practically every part of Computer Science for straightforward just as perplexing estimations. They are rehearsed in all such zones, for example, AI, Graphics, Operating System, and so on.

Information Structures are a significant aspect of a few PC calculations as they permit software engineers to do information the board effectively. A savvy choice of information structures can improve the presentation of a PC program or calculation in a more valuable manner.

1. Dealing with unpredictability:

Increment in complexities in PC calculations, the volume of information utilization is rising; this can influence the execution of the application and can make amazing territories of concern like preparing speed, information search, and various solicitations. To counter these information structures are utilized.

2. Deliberate memory use:

Deliberate use of information structure memory utilization can be upgraded, e.g., we can utilize connected rundown versus clusters when we are not specific about the information size. When there is no longer utilization of memory, it tends to be cleared.

3. Capacity to reuse:

When we have executed a specific information structure, we can reuse it in any particular position. Usage of information structures can be amassed into libraries that can be used by different customers.

4. Reflection:

Information structure goes about as the establishment of dynamic information types; the information structure portrays the physical type of Abstract Data Type. In ADT, the arrangement of activities should be perceived, and the information structure gives genuineness to them.

Information structures are the fundamental constituent of any programming language or complex calculations. Generally, organized information structures are pivotal to planning proficient calculations.


3)Data Structure is the mix of data objects which gives a technique for get-together and dealing with data in the PC so it will in general be used. Their various types are groups, Linked List, Stack, Queue, etc. Data Structures are used generally in essentially all aspects of Computer Science for fundamental similarly as perplexing figurings. They are bored in all such areas, for instance, AI, Graphics, Operating System, etc.

Data Structures are a fundamental part of a couple of PC estimations as they license programming designers to do data the board beneficially. A shrewd assurance of data structures can improve the introduction of a PC program or count in a more significant way.

1. Dealing with multifaceted nature:

Augmentation in complexities in PC computations, the volume of data use is rising; this can impact the execution of the application and can make astounding districts of concern like dealing with speed, data search, and various requesting. To counter these data structures are used.

2. Exact memory use:

Exact use of data structure memory use can be progressed, e.g., we can use associated once-over versus shows when we are not explicit about the data size. When there is no longer use of memory, it might be cleared.

3. Ability to reuse:

At the point when we have executed a particular data structure, we can reuse it in a specific position. Use of data structures can be gathered into libraries that can be utilized by various clients.

4. Reflection:

Data structure goes about as the foundation of dynamic data types; the data structure portrays the physical sort of Abstract Data Type. In ADT, the plan of exercises ought to be seen, and the data structure offers validity to them.

Data structures are the vital constituent of any programming language or complex computations. For the most part, sorted out data structures are fundamental to arranging beneficial computations.

Question 1: In this week I was learned about Linked list, stack and queue.
Question 2:
In computer science, a computer program is a collection of instructions to perform a specific task. For this, a computer program may need to store data, retrieve data, and perform computations on the data.
A data structure is a named location that can be used to store and organize data. Data structures are being used in almost every program or software system that has been developed. All the more accurately, data Structure is a way of collecting and organising data in such a way that we can perform operations on these data in an effective way.It represents the knowledge of data to be organized in memory.
There are many need of data structure in computer science and also programming, like
Processing speed: To handle very large data, high-speed processing is required
Data Search: Getting a particular record from database should be quick and with optimum use of resources.
Multiple requests: To handle simultanous requests from multiple users.

Question 3:

The real time application of tree, graph, stack and queue in data structure:

Stack: It is a linear List of elements, elements can be inserted or deleted only at one end called the TOP of the stack. It uses the concept of LIFO (Last In First Out). Consider the example of Stack: CD case, In CD case you put the CD one by one and the last CD would be the one that will be first taken out from the CD case.

Queues: It is the list of elements, element can be inserted only at one end called the REAR end and element can be deleted only at other end called the FRONT end. It uses the concept of FIFO (First In First Out). You acn consider the example of queue at the registration counter. The person standing at first position will be the one who get first registered at the person standing at the last position will be registered at the last.

Trees: It is a non linear Data Structure,which is hierarchical in nature and must maintain a hierarchy.

Graphs: It is a non linear data structure in which it is not necessary that the relationship between the data items is in hierarchy. Graphs are used in artificial intelligence and computer networks.

Answer to the Question No 1:
I have learned about Linked list, Stack and Queue in this week.

Answer to the question No 2:

In computer science, a data structure is a data organization, management, and storage format that enables efficient access and modification. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data.
Data structures serve as the basis for abstract data types (ADT). The ADT defines the logical form of the data type. The data structure implements the physical form of the data type.
Different types of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks.
Data structures provide a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services. Usually, efficient data structures are key to designing efficient algorithms. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design. Data structures can be used to organize the storage and retrieval of information stored in both main memory and secondary memory.

Advantages of data structure
Given below are important advantages of data structure:

Data structure helps in efficient storage of data in storage device.
Data structure usage provides convenience while retrieving the data from storage device.
Data structure provides effective and efficient processing of small as well as large amount of data.
Usage of proper data structure, can help programmer save lots of time or processing time while operations such as storage, retrieval or processing of data.
Manipulation of large amount of data can be carried out easily with the use of good data structure approach.
Most of the well organized data structures like Array, stack, queues, graph, tree, linked list has well built and pre-planned approach for operations like storage, addition, retrieval, manipulation, deletion, etc. While using them, programmer can be completely rely on these data structures.
Data structure usage can simply encourage reusability in long run as well.


Answer to the question no 3:

The real life application of tree, graph, stack, queue are given below:

Trees are hierarchical structures having a single root node.

Some applications of the trees are:

1. XML Parser uses tree algorithms.
2. Decision-based algorithm is used in machine learning which works upon the algorithm of tree.
3. Databases also uses tree data structures for indexing.
4. Domain Name Server(DNS) also uses tree structures.



Graph is a data structure where data is stored in a collection of interconnected vertices (nodes) and edges (paths).

Some applications of a graph are:

1. Facebook’s Graph API uses the structure of Graphs.
2. Google’s Knowledge Graph also has to do something with Graph.
3. Dijkstra algorithm or the shortest path first algorithm also uses graph structure to finding the smallest path between the nodes of the graph.
4. GPS navigation system also uses shortest path APIs.



A stack is a data structure which uses LIFO order.
Some Applications of a stack are:

1. Converting infix to postfix expressions.
2. Undo operation is also carried out through stacks.
3. Syntaxes in languages are parsed using stacks.
4. It is used in many virtual machines like JVM.


A queue is a data structure which uses FIFO order.
Some applications of a queue are:

1. Operating System uses queue for job scheduling.
2. To handle congestion in networking queue can be used.
3. Data packets in communication are arranged in queue format.

Q1 answer : In this week I have learned about Linked list, Stack & Queue,


Q2 answer : Data structure is important in computer science becasue I think Data structures are key building blocks of important algorithms,
also by getting a good understanding of data structure will help to write codes for better information and in a logical flow. A good understanding and implementation of data structure will make the program efficient, high performing and easily maintainable.
By Implementing data structures we can perform these operations easily For example, perform searching, sorting or looping.


Q3 answer :
In my opinion real life application of tree, graph ,stack, queue are below:

Tree : Trees are a form of graph. Application of trees can be found in data-structures for . Search Binary Search Trees, Tries, Range Max/Min Queries ,Segment Trees , Binary Index etc.

Graphs : Graphs have many real life application ,graphs are used in game theory ,artificial intelligence,computer networks.

Stacks : Stack plays a crucial part in designing a operating systems.

Queue : Queue is used in serving requests of a single shared resource (printer, disk, CPU)

Question 1:
I have learned linked list, stack and queue.

Question 2:
With increasing complexities in computer algorithms, the amount of data usage is increasing, this can affect the performance of the application and can create some areas of concern:

Processing speed: To handle very large data, high-speed processing is required, but with growing data processor may fail to achive required processing speed.

Data Search: Getting a particular record from database should be quick and with optimum use of resources.

Multiple requests: To handle simultanous requests from multiple users

In order to work on concern areas, data structures are used. Data is organized to form a data structure in such a way that all items are not required to be searched and required data can be searched instantly.

Question 3:
Tree : Windows task manager
Graph : Google map
Stack : Mainly used to design operating systems

Answer to the Q No :- ( 1 )

If I talk about my previous classes then I must say that in this week the classes are awesome . Also in my last class I was learnt :- 

• Linked list
• stack
• queue.
• Address, null, head .

Answer to the Q No :- ( 2 )

Data Structures are the key part of many computer algorithms as they allow the programmers to do data management in an efficient way. A right selection of data structure can enhance the efficiency of computer program or algorithm in a better way.
With increasing complexities in computer algorithms, the amount of data usage is increasing, this can affect the performance of the application and can create some areas of concern:

1. Processing speed: To handle very large data, high-speed processing is required, but with growing data processor may fail to achieve required processing speed.
2. Data Search: Getting a particular record from database should be quick and with optimum use of resources.
3. Multiple requests: To handle simultaneous requests from multiple user
4. Efficient Memory use: With efficient use of data structure memory usage can be optimized, for e.g we can use linked list vs arrays when we are not sure about the size of data. When there is no more use of memory, it can be released.

Data structures are the basic building block of any programming language, complex computations. In order to work on concern areas, data structures are used. Data is organized to form a data structure in such a way that all items are not required to be searched and required data can be searched instantly. 

Answer to the Q No :- ( 3 )

The real life application of tree, graph ,stack, queue is given below:- 

Tree:- If We used our windows task manger, when we right click on the name of some currently running application we'd have seen that there's a option to end the process tree ,it shuts down not only that application but all the child applications of that root application which we want to shut down, so the windows basically forms a tree of processes that are related to that application and makes that app the root. Trees are also used in DBMS , we really got a know how to deal with these while working with DBMS.

Graphs:- Graphs have many applications not only in computer science but in other fields too. Graphs are used in game theory ,artificial intelligence, computer networks and in genetic algorithms.

Stack:- Stack plays a crucial part in designing a operating systems.

Queue:- If we use a smartphone then we must've used some music apps like saavn, wynk and music player which your mobile has and you also have maintained a playlist of your favorite songs ,well that’s when the queue come in but there are some modifications in that but the main idea comes from the queues only

1. Ans:
I have learned about basic information about data structure, linked list, stack, queue.

2. Ans:
We are living in a repository of data. This is the data structure through which we can easily organize and use the information in less time in our life. Data structure can be defined as a way or a organized structure where we can access the data and can make any operation on data efficiently.

To search a data from big data is easier now by using data structure. Again, by using data structure in any program and application we can save the wastage of memory and the program or application will run fast. As it can create link with other data easily, so data structure is very useful in making any application. There is so many usages of data structure in computer science which make the course one of the important part of computer science.

3.Ans:
Real life application of tree: File manager.
Real life application of graph: Notification bar.
Real life application of stack: Recent apps.
Real life application of queue: Copy or deleting in any data operating system

Question to the answer no 1:
In my last class I was learned about stack , Linked list and queue.
These are some of the basic Steps for starting data structure. A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations.
Stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO) law.
Queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) law.

Question to the answer no 2:
Transforming any data into information is very necessary. Data Structure to work with different kind of data types together and make a custom data type and it also saves our time and space. This is a very efficient way of working with various data types. It is also very fast in terms of processing any functions.
Data Structures (DS) tutorial provides basic and advanced concepts of Data Structure. Our Data Structure tutorial is designed for beginners and professionals. Data Structure is a way to store and organize data so that it can be used efficiently.
Our Data Structure tutorial includes all topics of Data Structure such as Array, Pointer, Structure, Linked List, Stack, Queue, Graph, Searching, Sorting, Programs, etc.

Question to the answer no 3:

The real time application of tree, graph, stack and queue in data structure:

Information bases utilizes tree information structures for indexing. Domain Name Server additionally utilizes tree structures. Binary Space Partition are utilized in pretty much every 3D computer game to figure out what articles should be rendered. Binary Tries are utilized in pretty much every high-data transmission switch for putting away switch tables.

Graphs are used to represent data organization. Graph theory is used to find shortest path in road or a network. In Google Maps, various locations are represented as vertices or nodes and the roads are represented as edges and graph theory is used to find the shortest path between two nodes. In physics and chemistry, graph theory is used to study molecules.

Stack is used to convert some infix expression into its prefix equivalent. These postfix or prefix notations are used in computers to express some expressions. These expressions are not so much familiar to the infix expression, but they have some great advantages also. We do not need to maintain operator ordering, and parenthesis. Backtracking is one of the algorithm designing technique. Another great use of stack is during the function call and return process.

Queue can be useful when things don't have to be processed immediately, but have to be processed in First In First Out order like Breadth First Search. Serving requests on a single shared resource, like a printer, CPU task scheduling etc. In real life scenario, Call Center phone systems uses Queues to hold people calling them in an order, until a service representative is free. Handling of interrupts in real-time systems.

Answer to the Question No 1:
I have learned about Linked list, Stack and Queue in our last class.

Answer to the Question No 2:
Computer science is the process of efficiently communicating data and producing the best solutions to a given problem that uses all resources in a complete way and the data structure is a special way to store and organize data in a computer so that it can be recovered and used most productively.
Different types of data structures are meant for different types of applications and some are highly specialized for specific tasks.
Data structures are important for the following reasons
1. Data structures are used in almost every program or software system.
2. Specific data structures are the necessary components of many efficient algorithms and make it possible to manage large amounts of data, such as large integrated collections of databases.
3. Some programming languages, as the main organizer of software design, emphasize data structures rather than algorithms.

Answer to the Question No 3:
The real time application of tree, graph, stack and queue in data structure:
Tree : Trees are a form of graph. Application of trees can be found in implementing complex data-structures for
1. Can be found in structural application for complex search (search (binary search tree, tree, red-black tree, etc.)
2 Limit maximum / minimum query (division tree, binary index tree, pile)
3. Analyze data structures like string suffix attempts.
These are a few from the vast ocean.
Graphs : They are a tool to model a problem. You just can not believe at the diversity of problems that you can solve using graphs. Its applications vary from Google Search to Facebook Feeds to Image Segmentation. It is a separate field in its own (Graph Theory) and listing its applications would just limit its scope.
Stack: It is a linear List of elements, elements can be inserted or deleted only at one end called the TOP of the stack. It uses the concept of LIFO (Last In First Out). Consider the example of Stack: CD case, In CD case you put the CD one by one and the last CD would be the one that will be first taken out from the CD case.
Queues: It is the list of elements, element can be inserted only at one end called the REAR end and element can be deleted only at other end called the FRONT end. It uses the concept of FIFO (First In First Out).You acn consider the example of queue at the registration counter. The person standing at first position will be the one who get first registered at the person standing at the last position will be registered at the last.

Ans of Q1: i have learn about Linked list, stack and queue in this course.
Ans of Q2: Data structure is very important in computer science for real life projects. Data Structure is the combination of data objects which gives a way of collecting and handling data in the computer so that it can be used. Their various types are arrays, Linked List, Stack, Queue, etc. Data Structures are used extensively in nearly every aspect of Computer Science for simple as well as complex calculations. They are practiced in all such areas such as AI, Graphics, Operating System, etc.

Data Structures are a crucial part of several computer algorithms as they allow programmers to do data management efficiently. A wise selection of data structures can improve the performance of a computer program or algorithm in a more useful way.

1. Handling complexity:
Increase in complexities in computer algorithms, the volume of data usage is rising; this can affect the execution of the application and can create remarkable areas of concern like processing speed, data search, and multiple requests. To counter these data structures are used.

2. Systematic memory use:
Systematic application of data structure memory usage can be optimized, e.g., we can use linked list vs. arrays when we are not particular about the data size. When there is no longer use of memory, it can be cleared.

3. Ability to reuse:
Once we have executed a particular data structure, we can reuse it in any distinct position. Implementation of data structures can be assembled into libraries that can be utilized by various clients.

4. Abstraction: 
Data structure acts as the foundation of abstract data types; the data structure describes the physical form of Abstract Data Type. In ADT, the set of operations is supposed to be understood, and the data structure provides physicality to them.

Data structures are the integral constituent of any programming language or complex computations. Mostly, structured data structures are crucial to designing efficient algorithms.

Ans of Q3: we use data structure a lot in our real life application. When we use any search tool it finds the results using tree and queue. Graphs are used in almost all games. Stack is used everywhere. When we use rearrange our files or create a playlist in our music player, when we save any file in our computer it uses the stack. Actually all softwares are a combination of tree, graph, stack and queue. We are using these everyday.

Answer to the Question No : 1

The names of the topic I have learned this week in this course are Data structure , Data structure applications - Link list, Stack, Queue and importance of data structure in computer science.

Answer to the Question No : 2

Data structure is important in computer science because it is foundation of computer science. It helps computing to store the data efficiently in short time and process the data cleverly in low storage.

Answer to the Question No : 3

The real life application of tree , graph, stack, queue :

Tree - A tree is a nonlinear hierarchical data structure that consists of nodes connected by edges. The real life applications of the tree in data structure are - Folders in operating system, HTML document object model, Network routing, Syntax tree in compiler.

Graph - A graph data structure is a data structure where data is stored in a collection of interconnected vertices (nodes) and edges (paths). The real life applications of the graph in data structure are - Social graph, Knowledge graph, Path optimization algorithm.

Stack - It is basically LIFO ( Last In First Out).The real life applications of the stack in data structure are - undo redo stacks in word excel, Backtracking.

Queue - It is basically FIFO(First IN First Out). The real life applications of the queue in data structure are - Serving requests on a single shared resource, like a printer, CPU task scheduling etc.

Q1_Ans:
In this particular week,I have learned about Linked list, stack and queue.
Q2_Ans:
In computer science, a data structure is a data organization, management, and storage format that enables efficient access and modification. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data.
Q3_Ans :
Real life application of-
Tree: File manager.
Graph: Google Map.
Stack: To design operating systems.
Queue: Wikipedia

Answer no 1:-
In this week I have learned three basic topics of data structure named-
-Linked List
-Stack and
-Queue.

Answer no 2:-
Data Structure is the collection of data objects which provides a way of storing and managing data in the computer so that it can be used. Data structures are directly connected with computer science.
Importance of Data Structures in Computer Science:-
• Almost every aspect of computer science is related with data structures.
• Data Structures are the main part of many computer algorithms as they allow the programmers to do data management in an organized way.
• Data structures are needed in all such areas such as Graphics, Operating System, Artificial Intelligence etc.
• Data structure can handle too large data in a short time.
• It also handle simultanous requests from multiple users.

Answer no 3:-
Real life application of tree, graph, stack, queue:-
Tree:
 Database
 Domain name server
 XML Parser
Graph:
 GPS Navigation system
 Facebook’s Graph API
Stack:
 Undo Operations
 Virtual machines like JVM
 Converting infix to postfix expressions.
Queue:
 Operating system
 Handle congestion in networking

Ans: to the Ques: No.1
In this week, I had learned about linked list, stack and queue.

Ans: to the Ques: No.2
data structure is important in computer science because 1stly we can reuse data structure, 2ndly by using data structure, memory usage can be optimized. Moreover Data structure acts as the foundation of abstract data types.

Ans: to the Ques: No.3
The real life application of tree, graph ,stack, queue are explained below:

Tree : Trees are a form of graph. Application of trees can be found in implementing complex data-structures for 1. Search (Binary Search Trees, Tries, Red-Black Trees etc etc) 2. Range Max/Min Queries (Segment Trees , Binary Index Trees , Heaps) 3. String Analysis Data Structures like Suffix Tries. These are just a few from the vast ocean.

Graph: Graphs are used to represent data organization. Graph theory is used to find shortest path in road or a network. In Google Maps, various locations are represented as vertices or nodes and the roads are represented as edges and graph theory is used to find the shortest path between two nodes.In physics and chemistry, graph theory is used to study molecules.

Queue: This is like a basic tool for everything. From adhoc uses, to multi-threaded Synchronization , to Graph Algorithms … everywhere we will find them. Some primary ones are Producer-Consumer Problem.

Stack: These are also found everywhere. Stack is used internally by system in implementing recursions and maintaining process states. Some prime uses are Expression Evaluation and DFS.

nt

6
Notifications

You have no notifications
See all

Course Overview
SECTIONS

Welcome to Data Structures
1
Week 1: Preparing Background
2
Week 2: Exercise and Course Project
3
Week 3: Discussion on Link-List
4
Week 4: Adaptive Lesson on Link-List
5
Week 5: Review discussion on Link-List
6
Week 6: Discussion on Stack Applications
7
Week 8: Discussion on Tree Data Structure
8
Week 9: Discussion on Binary Search Tree (BST)
9
Week 10: Discussion on Heap
10
Week 11: Discussion on Graph
11
Week 12: Review Discussion
12
Skip to main content
Data Structure and Lab
Dashboard
My courses
CSE134/135-MA
Week 1: Preparing Background
Discussion Forum (Week 1)
Answer the question and discuss if you have any confusion
Search
1
1
Discussion Forum (Week 1)
Answer the question and discuss if you have any confusion
Display mode
Display replies in nested form
Picture of Md Assaduzzaman
Answer the question and discuss if you have any confusion
by Md Assaduzzaman - Thursday, 24 September 2020, 10:55 PM
Number of replies: 23
Q1. List the name of the topic you have learned this week in this course?
Q2. Why data structure is important in computer science?
Q3. Write down the real life application of tree, graph ,stack, queue.

Write your reply...

Picture of Md. Atikur Rahman
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Md. Atikur Rahman - Friday, 25 September 2020, 12:26 AM
Picture of DS-(PC-F)
Question to the answer no 1:
In my last class I was learned about Linked list, stack and queue.
A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. In simple words, a linked list consists of nodes where each node contains a data field and a reference(link) to the next node in the list.
Stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO) principle.
Queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) principle.


Question to the answer no 2:
With increasing complexities in computer algorithms, the amount of data usage is increasing, this can affect the performance of the application and can create some areas of concern:

• Processing speed: To handle very large data, high-speed processing is required, but with growing data processor may fail to archive required processing speed.
• Data Search: Getting a particular record from database should be quick and with optimum use of resources.
• Multiple requests: To handle simultanous requests from multiple users

Data Structure Advantages
• Efficient Memory use: With efficient use of data structure memory usage can be optimized, for e.g we can use linked list vs arrays when we are not sure about the size of data. When there is no more use of memory, it can be released.
• Reusability: Data structures can be reused, i.e. once we have implemented a particular data structure, we can use it at any other place. Implementation of data structures can be compiled into libraries which can be used by different clients.
• Abstraction: Data structure serves as the basis of abstract data types, the data structure defines the physical form of ADT(Abstract Data Type). ADT is theoretical and Data structure gives physical form to them.
All of those point shows the importance of Data Structure in computer science and engineering field.

Question to the answer no 3:
The real time application of tree, graph, stack and queue in data structure:
Now, i am gonna write some real life applications and by real life i mean applications of the data structures in your daily routine.
Tree : We must've used our windows task manager,when we right click on the name of some currently running application you'd have seen that there's a option to end the process tree ,it shuts down not only that application but all the child applications of that root application which we want to shut down,so the windows basically forms a tree of processes that are related to that application and makes that app the root.Trees are also used in DBMS ,we are really gotta know how to deal with them while working with database management system.
Graph : Graphs have many applications not only in computer science but in other fields too.graphs are used in game theory ,artificial intelligence,computer networks and in genetic algorithms.
Stack : Stack plays a crucial part in designing a operating systems.
Queue : In our smartphone we must've used some music apps like saavn,wynk and music player which our mobile has and we also have maintained a playlist of our favourite songs ,well thats when the queue come in but there are some modifications in that but the main idea comes from the queues only.
Picture of ABU BAKAR SIDDIQUE 201-15-3352
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by ABU BAKAR SIDDIQUE 201-15-3352 - Friday, 25 September 2020, 9:35 AM
Picture of DS-(PC-F)
1)Ans:
In my last class I was learned about Linked list, stack and queue.

2)Ans:
Data Structure is the combination of data objects which gives a way of collecting and handling data in the computer so that it can be used. Their various types are arrays, Linked List, Stack, Queue, etc. Data Structures are used extensively in nearly every aspect of Computer Science for simple as well as complex calculations. They are practiced in all such areas such as AI, Graphics, Operating System, etc.

Data Structures are a crucial part of several computer algorithms as they allow programmers to do data management efficiently. A wise selection of data structures can improve the performance of a computer program or algorithm in a more useful way.

1. Handling complexity:
Increase in complexities in computer algorithms, the volume of data usage is rising; this can affect the execution of the application and can create remarkable areas of concern like processing speed, data search, and multiple requests. To counter these data structures are used.

2. Systematic memory use:
Systematic application of data structure memory usage can be optimized, e.g., we can use linked list vs. arrays when we are not particular about the data size. When there is no longer use of memory, it can be cleared.

3. Ability to reuse:
Once we have executed a particular data structure, we can reuse it in any distinct position. Implementation of data structures can be assembled into libraries that can be utilized by various clients.

4. Abstraction: 
Data structure acts as the foundation of abstract data types; the data structure describes the physical form of Abstract Data Type. In ADT, the set of operations is supposed to be understood, and the data structure provides physicality to them.

Data structures are the integral constituent of any programming language or complex computations. Mostly, structured data structures are crucial to designing efficient algorithms.

3)Ans:
The real time application of tree, graph, stack and queue in data structure.Now i will write in detail all the real time application.

Tree:
Trees are hierarchical structures having a single root node.Some applications of the trees are:

1.XML Parser uses tree algorithms.
Decision-based algorithm is used in machine learning which works upon the algorithm of tree.
2.Databases also uses tree data structures for indexing.
3.Domain Name Server(DNS) also uses tree structures.

Graph:
Graph is a data structure where data is stored in a collection of interconnected vertices (nodes) and edges (paths).Some applications of a graph are:

1.Facebook’s Graph API uses the structure of Graphs.
2.Google’s Knowledge Graph also has to do something with Graph.
3.Dijkstra algorithm or the shortest path first algorithm also uses graph structure to finding the smallest path between the nodes of the graph.
4.GPS navigation system also uses shortest path APIs.

Stack:
A stack is a data structure which uses LIFO order.Some Applications of a stack are:

1.Converting infix to postfix expressions.
Undo operation is also carried out through stacks.
2.Syntaxes in languages are parsed using stacks.
3.It is used in many virtual machines like JVM.

Queue:
A queue is a data structure which uses FIFO order.Some applications of a queue are:

1.Operating System uses queue for job scheduling.
2.To handle congestion in networking queue can be used.
3.Data packets in communication are arranged in queue format.
Picture of Md.Yeasin Chowdhury 201-15-3443
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Md.Yeasin Chowdhury 201-15-3443 - Friday, 25 September 2020, 10:32 AM
Picture of DS-(PC-F)
Answer : 01

In this week i have learn about Linked list, stack and queue. In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory.
Stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO)principle.
Queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) principle.


Answer : 02

It is axiom that data structures base of computer science. It is actual computer science.Data structures are like hands for algorithms to make recipe. Using combination of data structure and algorithms, we can improve performance of program drastically. For example, you are using any searching algorithm like binary search, then set data structure would be perfect rather than array. The reason is, set is much better for checking whether element is present in specified place or not. This is actually not a quite good example but it can tell you the actual need of data structure in algorithms. Data Structures teach you how computer stores the data in memory so that it can be retrieved, updated, stored in a faster manner. A coding problem that is solvable using Polynomial Time without using appropriate data structure, can be solved in linear time it data is stored in an appropriate data structure.


Answer : 03

I am going to write about the real time application of tree, graph ,stack, queue.
Graphs : They are a tool to model a problem. It just unbelievable at the diversity of problems that we can solve using graphs. Its applications vary from Google Search to Facebook Feeds to Image Segmentation. It is a separate field in its own (Graph Theory) and listing its applications would just limit its scope.
Tree : Trees are a form of graph. Application of trees can be found in implementing complex data-structures for 1. Search (Binary Search Trees, Tries, Red-Black Trees etc etc) 2. Range Max/Min Queries (Segment Trees , Binary Index Trees , Heaps) 3. String Analysis Data Structures like Suffix Tries. These are just a few from the vast ocean.
Queue: This is like a basic tool for everything. From adhoc uses, to multi-threaded Synchronization , to Graph Algorithms … everywhere we will find them. Some primary ones are Producer-Consumer Problem.
Stack: These are also found everywhere. Stack is used internally by system in implementing recursions and maintaining process states. Some prime uses are Expression Evaluation and DFS.
Picture of Ismotara Dipty
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Ismotara Dipty - Friday, 25 September 2020, 11:00 AM
Picture of DS-(PC-F)
Answer to the question no 1:

In my last class I was learned about Linked list, stack and queue.

Answer to the question no 2:



Data Structure can be defined as the collection of data objects which provides a way of storing and managing data in the computer so that it can be used. Data Structures are the key part of many computer algorithms as they allow the programmers to do data management in an efficient way. Data structure is important in computer science because of,



Preparing speed: To deal with extremely huge information, fast handling is required, yet with developing information processor may neglect to achive required handling speed.



Information Search: Getting a specific record from data set ought to be speedy and with ideal utilization of assets.



Productive Memory use: With effective utilization of information structure memory use can be upgraded, for e.g we can utilize connected rundown versus exhibits when we don't know about the size of information. When there is no more utilization of memory, it very well may be delivered.



Reusability: Data structures can be reused, for example when we have actualized a specific information structure, we can utilize it at some other spot. Execution of information structures can be ordered into libraries which can be utilized by various customers.



Reflection: Data structure fills in as the premise of theoretical information types, the information structure characterizes the physical type of ADT(Abstract Data Type). ADT is hypothetical and Data structure gives physical structure to them.

Answer to the question no 3:

The real time application of tree, graph, stack and queue in data structure:



Tree: Information bases utilizes tree information structures for indexing.Domain Name Server additionally utilizes tree structures.Binary Space Partition are utilized in pretty much every 3D computer game to figure out what articles should be rendered.Binary Tries are utilized in pretty much every high-data transmission switch for putting away switch tables.



Graph: Graphs are used to represent data organization. Graph theory is used to find shortest path in road or a network. In Google Maps, various locations are represented as vertices or nodes and the roads are represented as edges and graph theory is used to find the shortest path between two nodes.In physics and chemistry, graph theory is used to study molecules.



Stack: The stack can be used to convert some infix expression into its postfix equivalent, or prefix equivalent. These postfix or prefix notations are used in computers to express some expressions. These expressions are not so much familiar to the infix expression, but they have some great advantages also. We do not need to maintain operator ordering, and parenthesis.Backtracking is one of the algorithm designing technique. Another great use of stack is during the function call and return process.



Queue: Queue is used when things don't have to be processed immediately, but have to be processed in First In First Out order like Breadth First Search. Serving requests on a single shared resource, like a printer, CPU task scheduling etc. In real life scenario, Call Center phone systems uses Queues to hold people calling them in an order, until a service representative is free. Handling of interrupts in real-time systems.



Picture of Mohammad Ashikuzzaman
In reply to Md Assaduzzaman
Discussion Forum :-Week 1
by Mohammad Ashikuzzaman - Friday, 25 September 2020, 11:56 AM
Picture of DS-(PC-F)
Answer to the question no - 1 :-

In my last class I was learned about Linked list, stack and queue.


Answer to the question no - 2 :-

It is aphorism that information structures base of software engineering. It is genuine PC science. Data structures resemble hands for calculations to make formula. Utilizing mix of information structure and calculations, we can improve execution of program radically. For instance, you are utilizing any looking through calculation like double hunt, at that point set information structure would be immaculate instead of cluster. The explanation is, set is vastly improved for checking whether component is available in indicated place or not. This is really not a very genuine model but rather it can reveal to you the real need of information structure in calculations. Information Structures show you how PC stores the information in memory with the goal that it very well may be recovered, refreshed, put away in a quicker way. A coding issue that is reasonable utilizing Polynomial Time without utilizing fitting information structure, can be illuminated in straight time it information is put away in a suitable information structure.


Answer to the question no - 3 :-

The ongoing use of tree, chart, stack and line in information structure:

Presently, I am going to keep in touch with some genuine applications and by genuine I mean uses of the information structures in your every day schedule.

Tree :- We must've utilized our windows task manager, when we right snap on the name of some as of now running application you'd have seen that there's a choice to end the cycle tree ,it closes down that application as well as all the kid uses of that root application which we need to close down, so the windows essentially shapes a tree of cycles that are identified with that application and makes that application the root. Trees are additionally utilized in DBMS ,we are truly gotten realize how to manage them while functioning with information base administration framework.

Graph :- Graphs have numerous applications in software engineering as well as in different fields too. Graphs are utilized in game hypothesis ,fake intelligence, computer networks and in hereditary calculations.

Stack :- Stack has a urgent influence in planning a working frameworks.

Queue :- In our cell phone we must've utilized some music applications like savant, wink and music player which our portable has and we likewise have kept up a playlist of our main tunes ,well that is the point at which the line come in however there are a few adjustments in that yet the principle thought originates from the lines as it were.
Picture of Sumia Sarower Trisha 201-15-3474
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Sumia Sarower Trisha 201-15-3474 - Friday, 25 September 2020, 12:22 PM
Picture of DS-(PC-F)
Answer to the question no.1
In my last class I have learned about Linked list, stack and queue.

Answer to the question no.2
Data Structure is the combination of data objects which gives a way of collecting and handling data in the computer so that it can be used. Their various types are arrays, Linked List, Stack, Queue, etc. Data Structures are used extensively in nearly every aspect of Computer Science for simple as well as complex calculations. They are practiced in all such areas such as AI, Graphics, Operating System, etc.
Data Structures are a crucial part of several computer algorithms as they allow programmers to do data management efficiently. A wise selection of data structures can improve the performance of a computer program or algorithm in a more useful way. Increase in complexities in computer algorithms, the volume of data usage is rising; this can affect the execution of the application and can create remarkable areas of concern like processing speed, data search, and multiple requests. To counter these data structures are used. Systematic application of data structure memory usage can be optimized, e.g., we can use linked list vs. arrays when we are not particular about the data size. When there is no longer use of memory, it can be cleared. Once we have executed a particular data structure, we can reuse it in any distinct position. Implementation of data structures can be assembled into libraries that can be utilized by various clients. Data structure acts as the foundation of abstract data types; the data structure describes the physical form of Abstract Data Type. In ADT, the set of operations is supposed to be understood, and the data structure provides physicality to them.

Answer to the question no.3
The real time application of tree, graph, stack and queue in data structure:
Tree: Information bases utilizes tree information structures for indexing.Domain Name Server additionally utilizes tree structures.Binary Space Partition are utilized in pretty much every 3D computer game to figure out what articles should be rendered.Binary Tries are utilized in pretty much every high-data transmission switch for putting away switch tables.
Graph: Graphs are used to represent data organization. Graph theory is used to find shortest path in road or a network. In Google Maps, various locations are represented as vertices or nodes and the roads are represented as edges and graph theory is used to find the shortest path between two nodes.In physics and chemistry, graph theory is used to study molecules.
Stack: The stack can be used to convert some infix expression into its postfix equivalent, or prefix equivalent. These postfix or prefix notations are used in computers to express some expressions. These expressions are not so much familiar to the infix expression, but they have some great advantages also. We do not need to maintain operator ordering, and parenthesis.Backtracking is one of the algorithm designing technique. Another great use of stack is during the function call and return process.
Queue: Queue is used when things don't have to be processed immediately, but have to be processed in First In First Out order like Breadth First Search. Serving requests on a single shared resource, like a printer, CPU task scheduling etc. In real life scenario, Call Center phone systems uses Queues to hold people calling them in an order, until a service representative is free. Handling of interrupts in real-time systems.


Picture of Arif Hosen
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Arif Hosen - Friday, 25 September 2020, 1:18 PM
Picture of DS-(PC-F)
Answer to the Question No. 1
I have learned about Linked list, Stack and Queue in this week.

Answer to the Question No. 2
Data structure is a particular way of storing and organizing information in a computer so that it can be retrieved and used most productively. Different kinds of data structures are meant for different kinds of applications, and some are highly specialized to specific tasks. Data structures are important for the following reasons:
1. Data structures are used in almost every program or software system.
2. Specific data structures are essential ingredients of many efficient algorithms, and make possible the management of huge amounts of data, such as large integrated collection of databases.
3. Some programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design.

Answer to the Question No. 3
The real time application of tree, graph, stack and queue in data structure:
Tree: It is used in many search applications where data is constantly entering or leaving, such as the map and set objects in many languages’ libraries. It is also used in almost every high-bandwidth router for storing router-tables and every 3D video game to determine what objects need to be rendered. Domain Name Server uses tree structures and databases also uses tree data structures for indexing.

Graph: Google maps uses graphs for building transportation systems, where intersection of two (or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.

Stack: The stack can be used to convert infix to postfix expressions and undo operation is also carried out through stacks. It can be also used to process syntaxes of language and it is used in many virtual machines like JVM.

Queue: It is used to handle congestion in networking. Call center phone systems uses queues to hold people calling them in an order, until a service representative is free and Operating System uses queue for job scheduling.

1)
Ans :
In my last class I was learned about Linked list, stack and queue.

2)
Ans :
Data Structure can be defined as the collection of data objects which provides a way of storing and managing data in the computer so that it can be used. Various Data Structures types are arrays, Linked List, Stack, Queue, etc. Data Structures are widely used in almost every aspect of Computer Science for simple as well as complex computations. Data structures are used in all areas of computer science such as Artificial Intelligence, graphics, Operating system etc.

3)
Ans :

A data structure is a particular way of organizing data in a computer so that it can be used effectively. In this article, the real-time applications of all the data structures are discussed.

Stack :
Some Applications of a stack are:
1.Converting infix to postfix expressions.
2.Undo operation is also carried out through stacks.
3.Syntaxes in languages are parsed using stacks.
4.It is used in many virtual machines like JVM.

Queue :
Some applications of a queue are:
1.Operating System uses queue for job scheduling.
2.To handle congestion in networking queue can be used.
3.Data packets in communication are arranged in queue format.

Graph :

Some applications of a graph are:
1.Facebook’s Graph API uses the structure of Graphs.
2.Google’s Knowledge Graph also has to do something with Graph.
3.Dijkstra algorithm or the shortest path first algorithm also uses graph structure to finding the smallest path between the nodes of the graph.

Tree :
Some applications of the trees are:
1.XML Parser uses tree algorithms.
2.Decision-based algorithm is used in machine learning which works upon the algorithm of tree.
3.Databases also uses tree data structures for indexing.
4.Domain Name Server(DNS) also uses tree structures.

nt

6
Notifications

You have no notifications
See all

Course Overview
SECTIONS

Welcome to Data Structures
1
Week 1: Preparing Background
2
Week 2: Exercise and Course Project
3
Week 3: Discussion on Link-List
4
Week 4: Adaptive Lesson on Link-List
5
Week 5: Review discussion on Link-List
6
Week 6: Discussion on Stack Applications
7
Week 8: Discussion on Tree Data Structure
8
Week 9: Discussion on Binary Search Tree (BST)
9
Week 10: Discussion on Heap
10
Week 11: Discussion on Graph
11
Week 12: Review Discussion
12
Skip to main content
Data Structure and Lab
Dashboard
My courses
CSE134/135-MA
Week 1: Preparing Background
Discussion Forum (Week 1)
Answer the question and discuss if you have any confusion
Search
1
1
Discussion Forum (Week 1)
Answer the question and discuss if you have any confusion
Display mode
Display replies in nested form
Picture of Md Assaduzzaman
Answer the question and discuss if you have any confusion
by Md Assaduzzaman - Thursday, 24 September 2020, 10:55 PM
Number of replies: 23
Q1. List the name of the topic you have learned this week in this course?
Q2. Why data structure is important in computer science?
Q3. Write down the real life application of tree, graph ,stack, queue.

Write your reply...

Picture of Md. Atikur Rahman
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Md. Atikur Rahman - Friday, 25 September 2020, 12:26 AM
Picture of DS-(PC-F)
Question to the answer no 1:
In my last class I was learned about Linked list, stack and queue.
A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. In simple words, a linked list consists of nodes where each node contains a data field and a reference(link) to the next node in the list.
Stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO) principle.
Queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) principle.


Question to the answer no 2:
With increasing complexities in computer algorithms, the amount of data usage is increasing, this can affect the performance of the application and can create some areas of concern:

• Processing speed: To handle very large data, high-speed processing is required, but with growing data processor may fail to archive required processing speed.
• Data Search: Getting a particular record from database should be quick and with optimum use of resources.
• Multiple requests: To handle simultanous requests from multiple users

Data Structure Advantages
• Efficient Memory use: With efficient use of data structure memory usage can be optimized, for e.g we can use linked list vs arrays when we are not sure about the size of data. When there is no more use of memory, it can be released.
• Reusability: Data structures can be reused, i.e. once we have implemented a particular data structure, we can use it at any other place. Implementation of data structures can be compiled into libraries which can be used by different clients.
• Abstraction: Data structure serves as the basis of abstract data types, the data structure defines the physical form of ADT(Abstract Data Type). ADT is theoretical and Data structure gives physical form to them.
All of those point shows the importance of Data Structure in computer science and engineering field.

Question to the answer no 3:
The real time application of tree, graph, stack and queue in data structure:
Now, i am gonna write some real life applications and by real life i mean applications of the data structures in your daily routine.
Tree : We must've used our windows task manager,when we right click on the name of some currently running application you'd have seen that there's a option to end the process tree ,it shuts down not only that application but all the child applications of that root application which we want to shut down,so the windows basically forms a tree of processes that are related to that application and makes that app the root.Trees are also used in DBMS ,we are really gotta know how to deal with them while working with database management system.
Graph : Graphs have many applications not only in computer science but in other fields too.graphs are used in game theory ,artificial intelligence,computer networks and in genetic algorithms.
Stack : Stack plays a crucial part in designing a operating systems.
Queue : In our smartphone we must've used some music apps like saavn,wynk and music player which our mobile has and we also have maintained a playlist of our favourite songs ,well thats when the queue come in but there are some modifications in that but the main idea comes from the queues only.
Picture of ABU BAKAR SIDDIQUE 201-15-3352
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by ABU BAKAR SIDDIQUE 201-15-3352 - Friday, 25 September 2020, 9:35 AM
Picture of DS-(PC-F)
1)Ans:
In my last class I was learned about Linked list, stack and queue.

2)Ans:
Data Structure is the combination of data objects which gives a way of collecting and handling data in the computer so that it can be used. Their various types are arrays, Linked List, Stack, Queue, etc. Data Structures are used extensively in nearly every aspect of Computer Science for simple as well as complex calculations. They are practiced in all such areas such as AI, Graphics, Operating System, etc.

Data Structures are a crucial part of several computer algorithms as they allow programmers to do data management efficiently. A wise selection of data structures can improve the performance of a computer program or algorithm in a more useful way.

1. Handling complexity:
Increase in complexities in computer algorithms, the volume of data usage is rising; this can affect the execution of the application and can create remarkable areas of concern like processing speed, data search, and multiple requests. To counter these data structures are used.

2. Systematic memory use:
Systematic application of data structure memory usage can be optimized, e.g., we can use linked list vs. arrays when we are not particular about the data size. When there is no longer use of memory, it can be cleared.

3. Ability to reuse:
Once we have executed a particular data structure, we can reuse it in any distinct position. Implementation of data structures can be assembled into libraries that can be utilized by various clients.

4. Abstraction: 
Data structure acts as the foundation of abstract data types; the data structure describes the physical form of Abstract Data Type. In ADT, the set of operations is supposed to be understood, and the data structure provides physicality to them.

Data structures are the integral constituent of any programming language or complex computations. Mostly, structured data structures are crucial to designing efficient algorithms.

3)Ans:
The real time application of tree, graph, stack and queue in data structure.Now i will write in detail all the real time application.

Tree:
Trees are hierarchical structures having a single root node.Some applications of the trees are:

1.XML Parser uses tree algorithms.
Decision-based algorithm is used in machine learning which works upon the algorithm of tree.
2.Databases also uses tree data structures for indexing.
3.Domain Name Server(DNS) also uses tree structures.

Graph:
Graph is a data structure where data is stored in a collection of interconnected vertices (nodes) and edges (paths).Some applications of a graph are:

1.Facebook’s Graph API uses the structure of Graphs.
2.Google’s Knowledge Graph also has to do something with Graph.
3.Dijkstra algorithm or the shortest path first algorithm also uses graph structure to finding the smallest path between the nodes of the graph.
4.GPS navigation system also uses shortest path APIs.

Stack:
A stack is a data structure which uses LIFO order.Some Applications of a stack are:

1.Converting infix to postfix expressions.
Undo operation is also carried out through stacks.
2.Syntaxes in languages are parsed using stacks.
3.It is used in many virtual machines like JVM.

Queue:
A queue is a data structure which uses FIFO order.Some applications of a queue are:

1.Operating System uses queue for job scheduling.
2.To handle congestion in networking queue can be used.
3.Data packets in communication are arranged in queue format.
Picture of Md.Yeasin Chowdhury 201-15-3443
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Md.Yeasin Chowdhury 201-15-3443 - Friday, 25 September 2020, 10:32 AM
Picture of DS-(PC-F)
Answer : 01

In this week i have learn about Linked list, stack and queue. In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory.
Stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO)principle.
Queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) principle.


Answer : 02

It is axiom that data structures base of computer science. It is actual computer science.Data structures are like hands for algorithms to make recipe. Using combination of data structure and algorithms, we can improve performance of program drastically. For example, you are using any searching algorithm like binary search, then set data structure would be perfect rather than array. The reason is, set is much better for checking whether element is present in specified place or not. This is actually not a quite good example but it can tell you the actual need of data structure in algorithms. Data Structures teach you how computer stores the data in memory so that it can be retrieved, updated, stored in a faster manner. A coding problem that is solvable using Polynomial Time without using appropriate data structure, can be solved in linear time it data is stored in an appropriate data structure.


Answer : 03

I am going to write about the real time application of tree, graph ,stack, queue.
Graphs : They are a tool to model a problem. It just unbelievable at the diversity of problems that we can solve using graphs. Its applications vary from Google Search to Facebook Feeds to Image Segmentation. It is a separate field in its own (Graph Theory) and listing its applications would just limit its scope.
Tree : Trees are a form of graph. Application of trees can be found in implementing complex data-structures for 1. Search (Binary Search Trees, Tries, Red-Black Trees etc etc) 2. Range Max/Min Queries (Segment Trees , Binary Index Trees , Heaps) 3. String Analysis Data Structures like Suffix Tries. These are just a few from the vast ocean.
Queue: This is like a basic tool for everything. From adhoc uses, to multi-threaded Synchronization , to Graph Algorithms … everywhere we will find them. Some primary ones are Producer-Consumer Problem.
Stack: These are also found everywhere. Stack is used internally by system in implementing recursions and maintaining process states. Some prime uses are Expression Evaluation and DFS.
Picture of Ismotara Dipty
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Ismotara Dipty - Friday, 25 September 2020, 11:00 AM
Picture of DS-(PC-F)
Answer to the question no 1:

In my last class I was learned about Linked list, stack and queue.

Answer to the question no 2:



Data Structure can be defined as the collection of data objects which provides a way of storing and managing data in the computer so that it can be used. Data Structures are the key part of many computer algorithms as they allow the programmers to do data management in an efficient way. Data structure is important in computer science because of,



Preparing speed: To deal with extremely huge information, fast handling is required, yet with developing information processor may neglect to achive required handling speed.



Information Search: Getting a specific record from data set ought to be speedy and with ideal utilization of assets.



Productive Memory use: With effective utilization of information structure memory use can be upgraded, for e.g we can utilize connected rundown versus exhibits when we don't know about the size of information. When there is no more utilization of memory, it very well may be delivered.



Reusability: Data structures can be reused, for example when we have actualized a specific information structure, we can utilize it at some other spot. Execution of information structures can be ordered into libraries which can be utilized by various customers.



Reflection: Data structure fills in as the premise of theoretical information types, the information structure characterizes the physical type of ADT(Abstract Data Type). ADT is hypothetical and Data structure gives physical structure to them.

Answer to the question no 3:

The real time application of tree, graph, stack and queue in data structure:



Tree: Information bases utilizes tree information structures for indexing.Domain Name Server additionally utilizes tree structures.Binary Space Partition are utilized in pretty much every 3D computer game to figure out what articles should be rendered.Binary Tries are utilized in pretty much every high-data transmission switch for putting away switch tables.



Graph: Graphs are used to represent data organization. Graph theory is used to find shortest path in road or a network. In Google Maps, various locations are represented as vertices or nodes and the roads are represented as edges and graph theory is used to find the shortest path between two nodes.In physics and chemistry, graph theory is used to study molecules.



Stack: The stack can be used to convert some infix expression into its postfix equivalent, or prefix equivalent. These postfix or prefix notations are used in computers to express some expressions. These expressions are not so much familiar to the infix expression, but they have some great advantages also. We do not need to maintain operator ordering, and parenthesis.Backtracking is one of the algorithm designing technique. Another great use of stack is during the function call and return process.



Queue: Queue is used when things don't have to be processed immediately, but have to be processed in First In First Out order like Breadth First Search. Serving requests on a single shared resource, like a printer, CPU task scheduling etc. In real life scenario, Call Center phone systems uses Queues to hold people calling them in an order, until a service representative is free. Handling of interrupts in real-time systems.



Picture of Mohammad Ashikuzzaman
In reply to Md Assaduzzaman
Discussion Forum :-Week 1
by Mohammad Ashikuzzaman - Friday, 25 September 2020, 11:56 AM
Picture of DS-(PC-F)
Answer to the question no - 1 :-

In my last class I was learned about Linked list, stack and queue.


Answer to the question no - 2 :-

It is aphorism that information structures base of software engineering. It is genuine PC science. Data structures resemble hands for calculations to make formula. Utilizing mix of information structure and calculations, we can improve execution of program radically. For instance, you are utilizing any looking through calculation like double hunt, at that point set information structure would be immaculate instead of cluster. The explanation is, set is vastly improved for checking whether component is available in indicated place or not. This is really not a very genuine model but rather it can reveal to you the real need of information structure in calculations. Information Structures show you how PC stores the information in memory with the goal that it very well may be recovered, refreshed, put away in a quicker way. A coding issue that is reasonable utilizing Polynomial Time without utilizing fitting information structure, can be illuminated in straight time it information is put away in a suitable information structure.


Answer to the question no - 3 :-

The ongoing use of tree, chart, stack and line in information structure:

Presently, I am going to keep in touch with some genuine applications and by genuine I mean uses of the information structures in your every day schedule.

Tree :- We must've utilized our windows task manager, when we right snap on the name of some as of now running application you'd have seen that there's a choice to end the cycle tree ,it closes down that application as well as all the kid uses of that root application which we need to close down, so the windows essentially shapes a tree of cycles that are identified with that application and makes that application the root. Trees are additionally utilized in DBMS ,we are truly gotten realize how to manage them while functioning with information base administration framework.

Graph :- Graphs have numerous applications in software engineering as well as in different fields too. Graphs are utilized in game hypothesis ,fake intelligence, computer networks and in hereditary calculations.

Stack :- Stack has a urgent influence in planning a working frameworks.

Queue :- In our cell phone we must've utilized some music applications like savant, wink and music player which our portable has and we likewise have kept up a playlist of our main tunes ,well that is the point at which the line come in however there are a few adjustments in that yet the principle thought originates from the lines as it were.
Picture of Sumia Sarower Trisha 201-15-3474
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Sumia Sarower Trisha 201-15-3474 - Friday, 25 September 2020, 12:22 PM
Picture of DS-(PC-F)
Answer to the question no.1
In my last class I have learned about Linked list, stack and queue.

Answer to the question no.2
Data Structure is the combination of data objects which gives a way of collecting and handling data in the computer so that it can be used. Their various types are arrays, Linked List, Stack, Queue, etc. Data Structures are used extensively in nearly every aspect of Computer Science for simple as well as complex calculations. They are practiced in all such areas such as AI, Graphics, Operating System, etc.
Data Structures are a crucial part of several computer algorithms as they allow programmers to do data management efficiently. A wise selection of data structures can improve the performance of a computer program or algorithm in a more useful way. Increase in complexities in computer algorithms, the volume of data usage is rising; this can affect the execution of the application and can create remarkable areas of concern like processing speed, data search, and multiple requests. To counter these data structures are used. Systematic application of data structure memory usage can be optimized, e.g., we can use linked list vs. arrays when we are not particular about the data size. When there is no longer use of memory, it can be cleared. Once we have executed a particular data structure, we can reuse it in any distinct position. Implementation of data structures can be assembled into libraries that can be utilized by various clients. Data structure acts as the foundation of abstract data types; the data structure describes the physical form of Abstract Data Type. In ADT, the set of operations is supposed to be understood, and the data structure provides physicality to them.

Answer to the question no.3
The real time application of tree, graph, stack and queue in data structure:
Tree: Information bases utilizes tree information structures for indexing.Domain Name Server additionally utilizes tree structures.Binary Space Partition are utilized in pretty much every 3D computer game to figure out what articles should be rendered.Binary Tries are utilized in pretty much every high-data transmission switch for putting away switch tables.
Graph: Graphs are used to represent data organization. Graph theory is used to find shortest path in road or a network. In Google Maps, various locations are represented as vertices or nodes and the roads are represented as edges and graph theory is used to find the shortest path between two nodes.In physics and chemistry, graph theory is used to study molecules.
Stack: The stack can be used to convert some infix expression into its postfix equivalent, or prefix equivalent. These postfix or prefix notations are used in computers to express some expressions. These expressions are not so much familiar to the infix expression, but they have some great advantages also. We do not need to maintain operator ordering, and parenthesis.Backtracking is one of the algorithm designing technique. Another great use of stack is during the function call and return process.
Queue: Queue is used when things don't have to be processed immediately, but have to be processed in First In First Out order like Breadth First Search. Serving requests on a single shared resource, like a printer, CPU task scheduling etc. In real life scenario, Call Center phone systems uses Queues to hold people calling them in an order, until a service representative is free. Handling of interrupts in real-time systems.


Picture of Arif Hosen
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Arif Hosen - Friday, 25 September 2020, 1:18 PM
Picture of DS-(PC-F)
Answer to the Question No. 1
I have learned about Linked list, Stack and Queue in this week.

Answer to the Question No. 2
Data structure is a particular way of storing and organizing information in a computer so that it can be retrieved and used most productively. Different kinds of data structures are meant for different kinds of applications, and some are highly specialized to specific tasks. Data structures are important for the following reasons:
1. Data structures are used in almost every program or software system.
2. Specific data structures are essential ingredients of many efficient algorithms, and make possible the management of huge amounts of data, such as large integrated collection of databases.
3. Some programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design.

Answer to the Question No. 3
The real time application of tree, graph, stack and queue in data structure:
Tree: It is used in many search applications where data is constantly entering or leaving, such as the map and set objects in many languages’ libraries. It is also used in almost every high-bandwidth router for storing router-tables and every 3D video game to determine what objects need to be rendered. Domain Name Server uses tree structures and databases also uses tree data structures for indexing.

Graph: Google maps uses graphs for building transportation systems, where intersection of two (or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.

Stack: The stack can be used to convert infix to postfix expressions and undo operation is also carried out through stacks. It can be also used to process syntaxes of language and it is used in many virtual machines like JVM.

Queue: It is used to handle congestion in networking. Call center phone systems uses queues to hold people calling them in an order, until a service representative is free and Operating System uses queue for job scheduling.

nt

6
Notifications

You have no notifications
See all

Course Overview
SECTIONS

Welcome to Data Structures
1
Week 1: Preparing Background
2
Week 2: Exercise and Course Project
3
Week 3: Discussion on Link-List
4
Week 4: Adaptive Lesson on Link-List
5
Week 5: Review discussion on Link-List
6
Week 6: Discussion on Stack Applications
7
Week 8: Discussion on Tree Data Structure
8
Week 9: Discussion on Binary Search Tree (BST)
9
Week 10: Discussion on Heap
10
Week 11: Discussion on Graph
11
Week 12: Review Discussion
12
Skip to main content
Data Structure and Lab
Dashboard
My courses
CSE134/135-MA
Week 1: Preparing Background
Discussion Forum (Week 1)
Answer the question and discuss if you have any confusion
Search
1
1
Discussion Forum (Week 1)
Answer the question and discuss if you have any confusion
Display mode
Display replies in nested form
Picture of Md Assaduzzaman
Answer the question and discuss if you have any confusion
by Md Assaduzzaman - Thursday, 24 September 2020, 10:55 PM
Number of replies: 23
Q1. List the name of the topic you have learned this week in this course?
Q2. Why data structure is important in computer science?
Q3. Write down the real life application of tree, graph ,stack, queue.

Write your reply...

Picture of Md. Atikur Rahman
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Md. Atikur Rahman - Friday, 25 September 2020, 12:26 AM
Picture of DS-(PC-F)
Question to the answer no 1:
In my last class I was learned about Linked list, stack and queue.
A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. In simple words, a linked list consists of nodes where each node contains a data field and a reference(link) to the next node in the list.
Stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO) principle.
Queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) principle.


Question to the answer no 2:
With increasing complexities in computer algorithms, the amount of data usage is increasing, this can affect the performance of the application and can create some areas of concern:

• Processing speed: To handle very large data, high-speed processing is required, but with growing data processor may fail to archive required processing speed.
• Data Search: Getting a particular record from database should be quick and with optimum use of resources.
• Multiple requests: To handle simultanous requests from multiple users

Data Structure Advantages
• Efficient Memory use: With efficient use of data structure memory usage can be optimized, for e.g we can use linked list vs arrays when we are not sure about the size of data. When there is no more use of memory, it can be released.
• Reusability: Data structures can be reused, i.e. once we have implemented a particular data structure, we can use it at any other place. Implementation of data structures can be compiled into libraries which can be used by different clients.
• Abstraction: Data structure serves as the basis of abstract data types, the data structure defines the physical form of ADT(Abstract Data Type). ADT is theoretical and Data structure gives physical form to them.
All of those point shows the importance of Data Structure in computer science and engineering field.

Question to the answer no 3:
The real time application of tree, graph, stack and queue in data structure:
Now, i am gonna write some real life applications and by real life i mean applications of the data structures in your daily routine.
Tree : We must've used our windows task manager,when we right click on the name of some currently running application you'd have seen that there's a option to end the process tree ,it shuts down not only that application but all the child applications of that root application which we want to shut down,so the windows basically forms a tree of processes that are related to that application and makes that app the root.Trees are also used in DBMS ,we are really gotta know how to deal with them while working with database management system.
Graph : Graphs have many applications not only in computer science but in other fields too.graphs are used in game theory ,artificial intelligence,computer networks and in genetic algorithms.
Stack : Stack plays a crucial part in designing a operating systems.
Queue : In our smartphone we must've used some music apps like saavn,wynk and music player which our mobile has and we also have maintained a playlist of our favourite songs ,well thats when the queue come in but there are some modifications in that but the main idea comes from the queues only.
Picture of ABU BAKAR SIDDIQUE 201-15-3352
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by ABU BAKAR SIDDIQUE 201-15-3352 - Friday, 25 September 2020, 9:35 AM
Picture of DS-(PC-F)
1)Ans:
In my last class I was learned about Linked list, stack and queue.

2)Ans:
Data Structure is the combination of data objects which gives a way of collecting and handling data in the computer so that it can be used. Their various types are arrays, Linked List, Stack, Queue, etc. Data Structures are used extensively in nearly every aspect of Computer Science for simple as well as complex calculations. They are practiced in all such areas such as AI, Graphics, Operating System, etc.

Data Structures are a crucial part of several computer algorithms as they allow programmers to do data management efficiently. A wise selection of data structures can improve the performance of a computer program or algorithm in a more useful way.

1. Handling complexity:
Increase in complexities in computer algorithms, the volume of data usage is rising; this can affect the execution of the application and can create remarkable areas of concern like processing speed, data search, and multiple requests. To counter these data structures are used.

2. Systematic memory use:
Systematic application of data structure memory usage can be optimized, e.g., we can use linked list vs. arrays when we are not particular about the data size. When there is no longer use of memory, it can be cleared.

3. Ability to reuse:
Once we have executed a particular data structure, we can reuse it in any distinct position. Implementation of data structures can be assembled into libraries that can be utilized by various clients.

4. Abstraction: 
Data structure acts as the foundation of abstract data types; the data structure describes the physical form of Abstract Data Type. In ADT, the set of operations is supposed to be understood, and the data structure provides physicality to them.

Data structures are the integral constituent of any programming language or complex computations. Mostly, structured data structures are crucial to designing efficient algorithms.

3)Ans:
The real time application of tree, graph, stack and queue in data structure.Now i will write in detail all the real time application.

Tree:
Trees are hierarchical structures having a single root node.Some applications of the trees are:

1.XML Parser uses tree algorithms.
Decision-based algorithm is used in machine learning which works upon the algorithm of tree.
2.Databases also uses tree data structures for indexing.
3.Domain Name Server(DNS) also uses tree structures.

Graph:
Graph is a data structure where data is stored in a collection of interconnected vertices (nodes) and edges (paths).Some applications of a graph are:

1.Facebook’s Graph API uses the structure of Graphs.
2.Google’s Knowledge Graph also has to do something with Graph.
3.Dijkstra algorithm or the shortest path first algorithm also uses graph structure to finding the smallest path between the nodes of the graph.
4.GPS navigation system also uses shortest path APIs.

Stack:
A stack is a data structure which uses LIFO order.Some Applications of a stack are:

1.Converting infix to postfix expressions.
Undo operation is also carried out through stacks.
2.Syntaxes in languages are parsed using stacks.
3.It is used in many virtual machines like JVM.

Queue:
A queue is a data structure which uses FIFO order.Some applications of a queue are:

1.Operating System uses queue for job scheduling.
2.To handle congestion in networking queue can be used.
3.Data packets in communication are arranged in queue format.
Picture of Md.Yeasin Chowdhury 201-15-3443
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Md.Yeasin Chowdhury 201-15-3443 - Friday, 25 September 2020, 10:32 AM
Picture of DS-(PC-F)
Answer : 01

In this week i have learn about Linked list, stack and queue. In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory.
Stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO)principle.
Queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) principle.


Answer : 02

It is axiom that data structures base of computer science. It is actual computer science.Data structures are like hands for algorithms to make recipe. Using combination of data structure and algorithms, we can improve performance of program drastically. For example, you are using any searching algorithm like binary search, then set data structure would be perfect rather than array. The reason is, set is much better for checking whether element is present in specified place or not. This is actually not a quite good example but it can tell you the actual need of data structure in algorithms. Data Structures teach you how computer stores the data in memory so that it can be retrieved, updated, stored in a faster manner. A coding problem that is solvable using Polynomial Time without using appropriate data structure, can be solved in linear time it data is stored in an appropriate data structure.


Answer : 03

I am going to write about the real time application of tree, graph ,stack, queue.
Graphs : They are a tool to model a problem. It just unbelievable at the diversity of problems that we can solve using graphs. Its applications vary from Google Search to Facebook Feeds to Image Segmentation. It is a separate field in its own (Graph Theory) and listing its applications would just limit its scope.
Tree : Trees are a form of graph. Application of trees can be found in implementing complex data-structures for 1. Search (Binary Search Trees, Tries, Red-Black Trees etc etc) 2. Range Max/Min Queries (Segment Trees , Binary Index Trees , Heaps) 3. String Analysis Data Structures like Suffix Tries. These are just a few from the vast ocean.
Queue: This is like a basic tool for everything. From adhoc uses, to multi-threaded Synchronization , to Graph Algorithms … everywhere we will find them. Some primary ones are Producer-Consumer Problem.
Stack: These are also found everywhere. Stack is used internally by system in implementing recursions and maintaining process states. Some prime uses are Expression Evaluation and DFS.
Picture of Ismotara Dipty
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Ismotara Dipty - Friday, 25 September 2020, 11:00 AM
Picture of DS-(PC-F)
Answer to the question no 1:

In my last class I was learned about Linked list, stack and queue.

Answer to the question no 2:



Data Structure can be defined as the collection of data objects which provides a way of storing and managing data in the computer so that it can be used. Data Structures are the key part of many computer algorithms as they allow the programmers to do data management in an efficient way. Data structure is important in computer science because of,



Preparing speed: To deal with extremely huge information, fast handling is required, yet with developing information processor may neglect to achive required handling speed.



Information Search: Getting a specific record from data set ought to be speedy and with ideal utilization of assets.



Productive Memory use: With effective utilization of information structure memory use can be upgraded, for e.g we can utilize connected rundown versus exhibits when we don't know about the size of information. When there is no more utilization of memory, it very well may be delivered.



Reusability: Data structures can be reused, for example when we have actualized a specific information structure, we can utilize it at some other spot. Execution of information structures can be ordered into libraries which can be utilized by various customers.



Reflection: Data structure fills in as the premise of theoretical information types, the information structure characterizes the physical type of ADT(Abstract Data Type). ADT is hypothetical and Data structure gives physical structure to them.

Answer to the question no 3:

The real time application of tree, graph, stack and queue in data structure:



Tree: Information bases utilizes tree information structures for indexing.Domain Name Server additionally utilizes tree structures.Binary Space Partition are utilized in pretty much every 3D computer game to figure out what articles should be rendered.Binary Tries are utilized in pretty much every high-data transmission switch for putting away switch tables.



Graph: Graphs are used to represent data organization. Graph theory is used to find shortest path in road or a network. In Google Maps, various locations are represented as vertices or nodes and the roads are represented as edges and graph theory is used to find the shortest path between two nodes.In physics and chemistry, graph theory is used to study molecules.



Stack: The stack can be used to convert some infix expression into its postfix equivalent, or prefix equivalent. These postfix or prefix notations are used in computers to express some expressions. These expressions are not so much familiar to the infix expression, but they have some great advantages also. We do not need to maintain operator ordering, and parenthesis.Backtracking is one of the algorithm designing technique. Another great use of stack is during the function call and return process.



Queue: Queue is used when things don't have to be processed immediately, but have to be processed in First In First Out order like Breadth First Search. Serving requests on a single shared resource, like a printer, CPU task scheduling etc. In real life scenario, Call Center phone systems uses Queues to hold people calling them in an order, until a service representative is free. Handling of interrupts in real-time systems.



Picture of Mohammad Ashikuzzaman
In reply to Md Assaduzzaman
Discussion Forum :-Week 1
by Mohammad Ashikuzzaman - Friday, 25 September 2020, 11:56 AM
Picture of DS-(PC-F)
Answer to the question no - 1 :-

In my last class I was learned about Linked list, stack and queue.


Answer to the question no - 2 :-

It is aphorism that information structures base of software engineering. It is genuine PC science. Data structures resemble hands for calculations to make formula. Utilizing mix of information structure and calculations, we can improve execution of program radically. For instance, you are utilizing any looking through calculation like double hunt, at that point set information structure would be immaculate instead of cluster. The explanation is, set is vastly improved for checking whether component is available in indicated place or not. This is really not a very genuine model but rather it can reveal to you the real need of information structure in calculations. Information Structures show you how PC stores the information in memory with the goal that it very well may be recovered, refreshed, put away in a quicker way. A coding issue that is reasonable utilizing Polynomial Time without utilizing fitting information structure, can be illuminated in straight time it information is put away in a suitable information structure.


Answer to the question no - 3 :-

The ongoing use of tree, chart, stack and line in information structure:

Presently, I am going to keep in touch with some genuine applications and by genuine I mean uses of the information structures in your every day schedule.

Tree :- We must've utilized our windows task manager, when we right snap on the name of some as of now running application you'd have seen that there's a choice to end the cycle tree ,it closes down that application as well as all the kid uses of that root application which we need to close down, so the windows essentially shapes a tree of cycles that are identified with that application and makes that application the root. Trees are additionally utilized in DBMS ,we are truly gotten realize how to manage them while functioning with information base administration framework.

Graph :- Graphs have numerous applications in software engineering as well as in different fields too. Graphs are utilized in game hypothesis ,fake intelligence, computer networks and in hereditary calculations.

Stack :- Stack has a urgent influence in planning a working frameworks.

Queue :- In our cell phone we must've utilized some music applications like savant, wink and music player which our portable has and we likewise have kept up a playlist of our main tunes ,well that is the point at which the line come in however there are a few adjustments in that yet the principle thought originates from the lines as it were.
Picture of Sumia Sarower Trisha 201-15-3474
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Sumia Sarower Trisha 201-15-3474 - Friday, 25 September 2020, 12:22 PM
Picture of DS-(PC-F)
Answer to the question no.1
In my last class I have learned about Linked list, stack and queue.

Answer to the question no.2
Data Structure is the combination of data objects which gives a way of collecting and handling data in the computer so that it can be used. Their various types are arrays, Linked List, Stack, Queue, etc. Data Structures are used extensively in nearly every aspect of Computer Science for simple as well as complex calculations. They are practiced in all such areas such as AI, Graphics, Operating System, etc.
Data Structures are a crucial part of several computer algorithms as they allow programmers to do data management efficiently. A wise selection of data structures can improve the performance of a computer program or algorithm in a more useful way. Increase in complexities in computer algorithms, the volume of data usage is rising; this can affect the execution of the application and can create remarkable areas of concern like processing speed, data search, and multiple requests. To counter these data structures are used. Systematic application of data structure memory usage can be optimized, e.g., we can use linked list vs. arrays when we are not particular about the data size. When there is no longer use of memory, it can be cleared. Once we have executed a particular data structure, we can reuse it in any distinct position. Implementation of data structures can be assembled into libraries that can be utilized by various clients. Data structure acts as the foundation of abstract data types; the data structure describes the physical form of Abstract Data Type. In ADT, the set of operations is supposed to be understood, and the data structure provides physicality to them.

Answer to the question no.3
The real time application of tree, graph, stack and queue in data structure:
Tree: Information bases utilizes tree information structures for indexing.Domain Name Server additionally utilizes tree structures.Binary Space Partition are utilized in pretty much every 3D computer game to figure out what articles should be rendered.Binary Tries are utilized in pretty much every high-data transmission switch for putting away switch tables.
Graph: Graphs are used to represent data organization. Graph theory is used to find shortest path in road or a network. In Google Maps, various locations are represented as vertices or nodes and the roads are represented as edges and graph theory is used to find the shortest path between two nodes.In physics and chemistry, graph theory is used to study molecules.
Stack: The stack can be used to convert some infix expression into its postfix equivalent, or prefix equivalent. These postfix or prefix notations are used in computers to express some expressions. These expressions are not so much familiar to the infix expression, but they have some great advantages also. We do not need to maintain operator ordering, and parenthesis.Backtracking is one of the algorithm designing technique. Another great use of stack is during the function call and return process.
Queue: Queue is used when things don't have to be processed immediately, but have to be processed in First In First Out order like Breadth First Search. Serving requests on a single shared resource, like a printer, CPU task scheduling etc. In real life scenario, Call Center phone systems uses Queues to hold people calling them in an order, until a service representative is free. Handling of interrupts in real-time systems.


Picture of Arif Hosen
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Arif Hosen - Friday, 25 September 2020, 1:18 PM
Picture of DS-(PC-F)
Answer to the Question No. 1
I have learned about Linked list, Stack and Queue in this week.

Answer to the Question No. 2
Data structure is a particular way of storing and organizing information in a computer so that it can be retrieved and used most productively. Different kinds of data structures are meant for different kinds of applications, and some are highly specialized to specific tasks. Data structures are important for the following reasons:
1. Data structures are used in almost every program or software system.
2. Specific data structures are essential ingredients of many efficient algorithms, and make possible the management of huge amounts of data, such as large integrated collection of databases.
3. Some programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design.

Answer to the Question No. 3
The real time application of tree, graph, stack and queue in data structure:
Tree: It is used in many search applications where data is constantly entering or leaving, such as the map and set objects in many languages’ libraries. It is also used in almost every high-bandwidth router for storing router-tables and every 3D video game to determine what objects need to be rendered. Domain Name Server uses tree structures and databases also uses tree data structures for indexing.

Graph: Google maps uses graphs for building transportation systems, where intersection of two (or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.

Stack: The stack can be used to convert infix to postfix expressions and undo operation is also carried out through stacks. It can be also used to process syntaxes of language and it is used in many virtual machines like JVM.

Queue: It is used to handle congestion in networking. Call center phone systems uses queues to hold people calling them in an order, until a service representative is free and Operating System uses queue for job scheduling.

nt

6
Notifications

You have no notifications
See all

Course Overview
SECTIONS

Welcome to Data Structures
1
Week 1: Preparing Background
2
Week 2: Exercise and Course Project
3
Week 3: Discussion on Link-List
4
Week 4: Adaptive Lesson on Link-List
5
Week 5: Review discussion on Link-List
6
Week 6: Discussion on Stack Applications
7
Week 8: Discussion on Tree Data Structure
8
Week 9: Discussion on Binary Search Tree (BST)
9
Week 10: Discussion on Heap
10
Week 11: Discussion on Graph
11
Week 12: Review Discussion
12
Skip to main content
Data Structure and Lab
Dashboard
My courses
CSE134/135-MA
Week 1: Preparing Background
Discussion Forum (Week 1)
Answer the question and discuss if you have any confusion
Search
1
1
Discussion Forum (Week 1)
Answer the question and discuss if you have any confusion
Display mode
Display replies in nested form
Picture of Md Assaduzzaman
Answer the question and discuss if you have any confusion
by Md Assaduzzaman - Thursday, 24 September 2020, 10:55 PM
Number of replies: 23
Q1. List the name of the topic you have learned this week in this course?
Q2. Why data structure is important in computer science?
Q3. Write down the real life application of tree, graph ,stack, queue.

Write your reply...

Picture of Md. Atikur Rahman
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Md. Atikur Rahman - Friday, 25 September 2020, 12:26 AM
Picture of DS-(PC-F)
Question to the answer no 1:
In my last class I was learned about Linked list, stack and queue.
A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. In simple words, a linked list consists of nodes where each node contains a data field and a reference(link) to the next node in the list.
Stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO) principle.
Queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) principle.


Question to the answer no 2:
With increasing complexities in computer algorithms, the amount of data usage is increasing, this can affect the performance of the application and can create some areas of concern:

• Processing speed: To handle very large data, high-speed processing is required, but with growing data processor may fail to archive required processing speed.
• Data Search: Getting a particular record from database should be quick and with optimum use of resources.
• Multiple requests: To handle simultanous requests from multiple users

Data Structure Advantages
• Efficient Memory use: With efficient use of data structure memory usage can be optimized, for e.g we can use linked list vs arrays when we are not sure about the size of data. When there is no more use of memory, it can be released.
• Reusability: Data structures can be reused, i.e. once we have implemented a particular data structure, we can use it at any other place. Implementation of data structures can be compiled into libraries which can be used by different clients.
• Abstraction: Data structure serves as the basis of abstract data types, the data structure defines the physical form of ADT(Abstract Data Type). ADT is theoretical and Data structure gives physical form to them.
All of those point shows the importance of Data Structure in computer science and engineering field.

Question to the answer no 3:
The real time application of tree, graph, stack and queue in data structure:
Now, i am gonna write some real life applications and by real life i mean applications of the data structures in your daily routine.
Tree : We must've used our windows task manager,when we right click on the name of some currently running application you'd have seen that there's a option to end the process tree ,it shuts down not only that application but all the child applications of that root application which we want to shut down,so the windows basically forms a tree of processes that are related to that application and makes that app the root.Trees are also used in DBMS ,we are really gotta know how to deal with them while working with database management system.
Graph : Graphs have many applications not only in computer science but in other fields too.graphs are used in game theory ,artificial intelligence,computer networks and in genetic algorithms.
Stack : Stack plays a crucial part in designing a operating systems.
Queue : In our smartphone we must've used some music apps like saavn,wynk and music player which our mobile has and we also have maintained a playlist of our favourite songs ,well thats when the queue come in but there are some modifications in that but the main idea comes from the queues only.
Picture of ABU BAKAR SIDDIQUE 201-15-3352
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by ABU BAKAR SIDDIQUE 201-15-3352 - Friday, 25 September 2020, 9:35 AM
Picture of DS-(PC-F)
1)Ans:
In my last class I was learned about Linked list, stack and queue.

2)Ans:
Data Structure is the combination of data objects which gives a way of collecting and handling data in the computer so that it can be used. Their various types are arrays, Linked List, Stack, Queue, etc. Data Structures are used extensively in nearly every aspect of Computer Science for simple as well as complex calculations. They are practiced in all such areas such as AI, Graphics, Operating System, etc.

Data Structures are a crucial part of several computer algorithms as they allow programmers to do data management efficiently. A wise selection of data structures can improve the performance of a computer program or algorithm in a more useful way.

1. Handling complexity:
Increase in complexities in computer algorithms, the volume of data usage is rising; this can affect the execution of the application and can create remarkable areas of concern like processing speed, data search, and multiple requests. To counter these data structures are used.

2. Systematic memory use:
Systematic application of data structure memory usage can be optimized, e.g., we can use linked list vs. arrays when we are not particular about the data size. When there is no longer use of memory, it can be cleared.

3. Ability to reuse:
Once we have executed a particular data structure, we can reuse it in any distinct position. Implementation of data structures can be assembled into libraries that can be utilized by various clients.

4. Abstraction: 
Data structure acts as the foundation of abstract data types; the data structure describes the physical form of Abstract Data Type. In ADT, the set of operations is supposed to be understood, and the data structure provides physicality to them.

Data structures are the integral constituent of any programming language or complex computations. Mostly, structured data structures are crucial to designing efficient algorithms.

3)Ans:
The real time application of tree, graph, stack and queue in data structure.Now i will write in detail all the real time application.

Tree:
Trees are hierarchical structures having a single root node.Some applications of the trees are:

1.XML Parser uses tree algorithms.
Decision-based algorithm is used in machine learning which works upon the algorithm of tree.
2.Databases also uses tree data structures for indexing.
3.Domain Name Server(DNS) also uses tree structures.

Graph:
Graph is a data structure where data is stored in a collection of interconnected vertices (nodes) and edges (paths).Some applications of a graph are:

1.Facebook’s Graph API uses the structure of Graphs.
2.Google’s Knowledge Graph also has to do something with Graph.
3.Dijkstra algorithm or the shortest path first algorithm also uses graph structure to finding the smallest path between the nodes of the graph.
4.GPS navigation system also uses shortest path APIs.

Stack:
A stack is a data structure which uses LIFO order.Some Applications of a stack are:

1.Converting infix to postfix expressions.
Undo operation is also carried out through stacks.
2.Syntaxes in languages are parsed using stacks.
3.It is used in many virtual machines like JVM.

Queue:
A queue is a data structure which uses FIFO order.Some applications of a queue are:

1.Operating System uses queue for job scheduling.
2.To handle congestion in networking queue can be used.
3.Data packets in communication are arranged in queue format.
Picture of Md.Yeasin Chowdhury 201-15-3443
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Md.Yeasin Chowdhury 201-15-3443 - Friday, 25 September 2020, 10:32 AM
Picture of DS-(PC-F)
Answer : 01

In this week i have learn about Linked list, stack and queue. In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory.
Stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO)principle.
Queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) principle.


Answer : 02

It is axiom that data structures base of computer science. It is actual computer science.Data structures are like hands for algorithms to make recipe. Using combination of data structure and algorithms, we can improve performance of program drastically. For example, you are using any searching algorithm like binary search, then set data structure would be perfect rather than array. The reason is, set is much better for checking whether element is present in specified place or not. This is actually not a quite good example but it can tell you the actual need of data structure in algorithms. Data Structures teach you how computer stores the data in memory so that it can be retrieved, updated, stored in a faster manner. A coding problem that is solvable using Polynomial Time without using appropriate data structure, can be solved in linear time it data is stored in an appropriate data structure.


Answer : 03

I am going to write about the real time application of tree, graph ,stack, queue.
Graphs : They are a tool to model a problem. It just unbelievable at the diversity of problems that we can solve using graphs. Its applications vary from Google Search to Facebook Feeds to Image Segmentation. It is a separate field in its own (Graph Theory) and listing its applications would just limit its scope.
Tree : Trees are a form of graph. Application of trees can be found in implementing complex data-structures for 1. Search (Binary Search Trees, Tries, Red-Black Trees etc etc) 2. Range Max/Min Queries (Segment Trees , Binary Index Trees , Heaps) 3. String Analysis Data Structures like Suffix Tries. These are just a few from the vast ocean.
Queue: This is like a basic tool for everything. From adhoc uses, to multi-threaded Synchronization , to Graph Algorithms … everywhere we will find them. Some primary ones are Producer-Consumer Problem.
Stack: These are also found everywhere. Stack is used internally by system in implementing recursions and maintaining process states. Some prime uses are Expression Evaluation and DFS.
Picture of Ismotara Dipty
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Ismotara Dipty - Friday, 25 September 2020, 11:00 AM
Picture of DS-(PC-F)
Answer to the question no 1:

In my last class I was learned about Linked list, stack and queue.

Answer to the question no 2:



Data Structure can be defined as the collection of data objects which provides a way of storing and managing data in the computer so that it can be used. Data Structures are the key part of many computer algorithms as they allow the programmers to do data management in an efficient way. Data structure is important in computer science because of,



Preparing speed: To deal with extremely huge information, fast handling is required, yet with developing information processor may neglect to achive required handling speed.



Information Search: Getting a specific record from data set ought to be speedy and with ideal utilization of assets.



Productive Memory use: With effective utilization of information structure memory use can be upgraded, for e.g we can utilize connected rundown versus exhibits when we don't know about the size of information. When there is no more utilization of memory, it very well may be delivered.



Reusability: Data structures can be reused, for example when we have actualized a specific information structure, we can utilize it at some other spot. Execution of information structures can be ordered into libraries which can be utilized by various customers.



Reflection: Data structure fills in as the premise of theoretical information types, the information structure characterizes the physical type of ADT(Abstract Data Type). ADT is hypothetical and Data structure gives physical structure to them.

Answer to the question no 3:

The real time application of tree, graph, stack and queue in data structure:



Tree: Information bases utilizes tree information structures for indexing.Domain Name Server additionally utilizes tree structures.Binary Space Partition are utilized in pretty much every 3D computer game to figure out what articles should be rendered.Binary Tries are utilized in pretty much every high-data transmission switch for putting away switch tables.



Graph: Graphs are used to represent data organization. Graph theory is used to find shortest path in road or a network. In Google Maps, various locations are represented as vertices or nodes and the roads are represented as edges and graph theory is used to find the shortest path between two nodes.In physics and chemistry, graph theory is used to study molecules.



Stack: The stack can be used to convert some infix expression into its postfix equivalent, or prefix equivalent. These postfix or prefix notations are used in computers to express some expressions. These expressions are not so much familiar to the infix expression, but they have some great advantages also. We do not need to maintain operator ordering, and parenthesis.Backtracking is one of the algorithm designing technique. Another great use of stack is during the function call and return process.



Queue: Queue is used when things don't have to be processed immediately, but have to be processed in First In First Out order like Breadth First Search. Serving requests on a single shared resource, like a printer, CPU task scheduling etc. In real life scenario, Call Center phone systems uses Queues to hold people calling them in an order, until a service representative is free. Handling of interrupts in real-time systems.



Picture of Mohammad Ashikuzzaman
In reply to Md Assaduzzaman
Discussion Forum :-Week 1
by Mohammad Ashikuzzaman - Friday, 25 September 2020, 11:56 AM
Picture of DS-(PC-F)
Answer to the question no - 1 :-

In my last class I was learned about Linked list, stack and queue.


Answer to the question no - 2 :-

It is aphorism that information structures base of software engineering. It is genuine PC science. Data structures resemble hands for calculations to make formula. Utilizing mix of information structure and calculations, we can improve execution of program radically. For instance, you are utilizing any looking through calculation like double hunt, at that point set information structure would be immaculate instead of cluster. The explanation is, set is vastly improved for checking whether component is available in indicated place or not. This is really not a very genuine model but rather it can reveal to you the real need of information structure in calculations. Information Structures show you how PC stores the information in memory with the goal that it very well may be recovered, refreshed, put away in a quicker way. A coding issue that is reasonable utilizing Polynomial Time without utilizing fitting information structure, can be illuminated in straight time it information is put away in a suitable information structure.


Answer to the question no - 3 :-

The ongoing use of tree, chart, stack and line in information structure:

Presently, I am going to keep in touch with some genuine applications and by genuine I mean uses of the information structures in your every day schedule.

Tree :- We must've utilized our windows task manager, when we right snap on the name of some as of now running application you'd have seen that there's a choice to end the cycle tree ,it closes down that application as well as all the kid uses of that root application which we need to close down, so the windows essentially shapes a tree of cycles that are identified with that application and makes that application the root. Trees are additionally utilized in DBMS ,we are truly gotten realize how to manage them while functioning with information base administration framework.

Graph :- Graphs have numerous applications in software engineering as well as in different fields too. Graphs are utilized in game hypothesis ,fake intelligence, computer networks and in hereditary calculations.

Stack :- Stack has a urgent influence in planning a working frameworks.

Queue :- In our cell phone we must've utilized some music applications like savant, wink and music player which our portable has and we likewise have kept up a playlist of our main tunes ,well that is the point at which the line come in however there are a few adjustments in that yet the principle thought originates from the lines as it were.
Picture of Sumia Sarower Trisha 201-15-3474
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Sumia Sarower Trisha 201-15-3474 - Friday, 25 September 2020, 12:22 PM
Picture of DS-(PC-F)
Answer to the question no.1
In my last class I have learned about Linked list, stack and queue.

Answer to the question no.2
Data Structure is the combination of data objects which gives a way of collecting and handling data in the computer so that it can be used. Their various types are arrays, Linked List, Stack, Queue, etc. Data Structures are used extensively in nearly every aspect of Computer Science for simple as well as complex calculations. They are practiced in all such areas such as AI, Graphics, Operating System, etc.
Data Structures are a crucial part of several computer algorithms as they allow programmers to do data management efficiently. A wise selection of data structures can improve the performance of a computer program or algorithm in a more useful way. Increase in complexities in computer algorithms, the volume of data usage is rising; this can affect the execution of the application and can create remarkable areas of concern like processing speed, data search, and multiple requests. To counter these data structures are used. Systematic application of data structure memory usage can be optimized, e.g., we can use linked list vs. arrays when we are not particular about the data size. When there is no longer use of memory, it can be cleared. Once we have executed a particular data structure, we can reuse it in any distinct position. Implementation of data structures can be assembled into libraries that can be utilized by various clients. Data structure acts as the foundation of abstract data types; the data structure describes the physical form of Abstract Data Type. In ADT, the set of operations is supposed to be understood, and the data structure provides physicality to them.

Answer to the question no.3
The real time application of tree, graph, stack and queue in data structure:
Tree: Information bases utilizes tree information structures for indexing.Domain Name Server additionally utilizes tree structures.Binary Space Partition are utilized in pretty much every 3D computer game to figure out what articles should be rendered.Binary Tries are utilized in pretty much every high-data transmission switch for putting away switch tables.
Graph: Graphs are used to represent data organization. Graph theory is used to find shortest path in road or a network. In Google Maps, various locations are represented as vertices or nodes and the roads are represented as edges and graph theory is used to find the shortest path between two nodes.In physics and chemistry, graph theory is used to study molecules.
Stack: The stack can be used to convert some infix expression into its postfix equivalent, or prefix equivalent. These postfix or prefix notations are used in computers to express some expressions. These expressions are not so much familiar to the infix expression, but they have some great advantages also. We do not need to maintain operator ordering, and parenthesis.Backtracking is one of the algorithm designing technique. Another great use of stack is during the function call and return process.
Queue: Queue is used when things don't have to be processed immediately, but have to be processed in First In First Out order like Breadth First Search. Serving requests on a single shared resource, like a printer, CPU task scheduling etc. In real life scenario, Call Center phone systems uses Queues to hold people calling them in an order, until a service representative is free. Handling of interrupts in real-time systems.


Picture of Arif Hosen
In reply to Md Assaduzzaman
Re: Answer the question and discuss if you have any confusion
by Arif Hosen - Friday, 25 September 2020, 1:18 PM
Picture of DS-(PC-F)
Answer to the Question No. 1
I have learned about Linked list, Stack and Queue in this week.

Answer to the Question No. 2
Data structure is a particular way of storing and organizing information in a computer so that it can be retrieved and used most productively. Different kinds of data structures are meant for different kinds of applications, and some are highly specialized to specific tasks. Data structures are important for the following reasons:
1. Data structures are used in almost every program or software system.
2. Specific data structures are essential ingredients of many efficient algorithms, and make possible the management of huge amounts of data, such as large integrated collection of databases.
3. Some programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design.

Answer to the Question No. 3
The real time application of tree, graph, stack and queue in data structure:
Tree: It is used in many search applications where data is constantly entering or leaving, such as the map and set objects in many languages’ libraries. It is also used in almost every high-bandwidth router for storing router-tables and every 3D video game to determine what objects need to be rendered. Domain Name Server uses tree structures and databases also uses tree data structures for indexing.

Graph: Google maps uses graphs for building transportation systems, where intersection of two (or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.

Stack: The stack can be used to convert infix to postfix expressions and undo operation is also carried out through stacks. It can be also used to process syntaxes of language and it is used in many virtual machines like JVM.

Queue: It is used to handle congestion in networking. Call center phone systems uses queues to hold people calling them in an order, until a service representative is free and Operating System uses queue for job scheduling.

1)
In my last class I was learned about Linked list, stack and queue.

2)Data Structure can be defined as the collection of data objects which provides a way of storing and managing data in the computer so that it can be used.their various types are arrays, Linked List, Stack, Queue, etc. Data Structures are used extensively in nearly every aspect of Computer Science for simple as well as complex calculations. They are practiced in all such areas such as AI, Graphics, Operating System, etc.

Data Structures are a crucial part of several computer algorithms as they allow programmers to do data management efficiently. A wise selection of data structures can improve the performance of a computer program or algorithm in a more useful way.

1. Handling complexity:
Increase in complexities in computer algorithms, the volume of data usage is rising; this can affect the execution of the application and can create remarkable areas of concern like processing speed, data search, and multiple requests. To counter these data structures are used.

2. Systematic memory use:
Systematic application of data structure memory usage can be optimized, e.g., we can use linked list vs. arrays when we are not particular about the data size. When there is no longer use of memory, it can be cleared.

3. Ability to reuse:
Once we have executed a particular data structure, we can reuse it in any distinct position. Implementation of data structures can be assembled into libraries that can be utilized by various clients.

4. Abstraction: 
Data structure acts as the foundation of abstract data types; the data structure describes the physical form of Abstract Data Type. In ADT, the set of operations is supposed to be understood, and the data structure provides physicality to them.

Data structures are the integral constituent of any programming language or complex computations. Mostly, structured data structures are crucial to designing efficient algorithms.

3)
The real time application of tree, graph, stack and queue in data structure.Now i will write in detail all the real time application.

Tree:
Trees are hierarchical structures having a single root node.Some applications of the trees are:

1.XML Parser uses tree algorithms.
Decision-based algorithm is used in machine learning which works upon the algorithm of tree.
2.Databases also uses tree data structures for indexing.
3.Domain Name Server(DNS) also uses tree structures.

Graph:
Graph is a data structure where data is stored in a collection of interconnected vertices (nodes) and edges (paths).Some applications of a graph are:

1.Facebook’s Graph API uses the structure of Graphs.
2.Google’s Knowledge Graph also has to do something with Graph.
3.Dijkstra algorithm or the shortest path first algorithm also uses graph structure to finding the smallest path between the nodes of the graph.
4.GPS navigation system also uses shortest path APIs.

Stack:
A stack is a data structure which uses LIFO order.Some Applications of a stack are:

1.Converting infix to postfix expressions.
Undo operation is also carried out through stacks.
2.Syntaxes in languages are parsed using stacks.
3.It is used in many virtual machines like JVM.

Queue:
A queue is a data structure which uses FIFO order.Some applications of a queue are:

1.Operating System uses queue for job scheduling.
2.To handle congestion in networking queue can be used.
3.Data packets in communication are arranged in queue format.

Answer to the Question no: 01

List the name of the topic I have learned this week in this course is given below:
• Linked list
• Stack
• Queue

Answer to the Question no: 02

A data structure is a particular way of organizing data in a computer so that it can be used effectively. For example, we can store a list of items having the same data-type using the array data structure. Various Data Structures types are arrays, Linked List, Stack, Queue, etc. Data Structures are widely used in almost every aspect of Computer Science for simple as well as complex computations. Data structures are used in all areas of computer science such as Artificial Intelligence, graphics, Operating system etc. Importance of data structure in computer science is described below:

High Processing Speed: High-speed processing is required to handle very large data, but with growing data processor may fail to achieve required processing speed.

Searching Data: Getting a particular record from database should be quick and with optimum use of resources.

Handling Multiple Requests: Use of data structure helps to handle simultaneous requests from multiple users.

Using Memory Systematically: With systematic use of data structure memory usage can be optimized, for e.g. we can use linked list vs. arrays when we are not sure about the size of data. When there is no more use of memory, it can be released.

Reusing ability: Data structures can be reused, i.e. once we have implemented a particular data structure, we can use it at any other place. Implementation of data structures can be compiled into libraries which can be used by different clients.

Abstraction: Data structure serves as the basis of abstract data types, the data structure defines the physical form of ADT (Abstract Data Type). ADT is theoretical and Data structure gives physical form to them.

Answer to the Question no: 03

Real Life applications of tree, graph, stack and queue are described below:

Tree: A tree is a nonlinear data structure, compared to arrays, linked lists, stacks and queues which are linear data structures. A tree can be empty with no nodes or a tree is a structure consisting of one node called the root and zero or one or more subtrees. Real life applications of tree are:
• Binary Search Tree: Used in many search applications where data is constantly entering/leaving, such as the map and set objects in many languages' libraries.
• Binary Space Partition: Used in almost every 3D video game to determine what objects need to be rendered.
• Binary Tries: Used in almost every high-bandwidth router for storing router-tables.
• Hash Trees: used in p2p programs and specialized image-signatures in which a hash needs to be verified, but the whole file is not available.
• Heaps: Used in implementing efficient priority-queues, which in turn are used for scheduling processes in many operating systems, Quality-of-Service in routers, and A* (path-finding algorithm used in AI applications, including robotics and video games). Also used in heap-sort.
• Huffman Coding Tree (Chip Uni): used in compression algorithms, such as those used by the .jpeg and .mp3 file-formats.
• GGM Trees Used in cryptographic applications to generate a tree of pseudo-random numbers.
• Syntax Tree: Constructed by compilers and (implicitly) calculators to parse expressions.
• Treap: Randomized data structure used in wireless networking and memory allocation.
• T-tree: Though most databases use some form of B-tree to store data on the drive, databases which keep all (most) their data in memory often use T-trees to do so.
• BTree: we use BTree in indexing large records in database to improve search.

Graph: A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph. Real life applications of graph are:
• Facebook: Each user is represented as a vertex and two people are friends when there is an edge between two vertices. Similarly friend suggestion also uses graph theory concept.
• Google Maps: Various locations are represented as vertices and the roads are represented as edges and graph theory is used to find  shortest path between two nodes.

• Recommendations on e-commerce websites: The “Recommendations for you” section on various e-commerce websites uses graph theory to  recommend items of similar type to user’s choice.

Stack: A stack is an Abstract Data Type (ADT), commonly used in most programming languages. It is named stack as it behaves like a real-world stack, for example – a deck of cards or a pile of plates, etc. A real-world stack allows operations at one end only. Real life applications of stack are:
• To reverse a word. You push a given word to stack - letter by letter - and then pop letters from the stack.
• An "undo" mechanism in text editors; this operation is accomplished by keeping all text changes in a stack. Undo/Redo stacks in Excel or Word.
• Language processing space for parameters and local variables is created internally using a stack. Compiler's syntax check for matching braces is implemented by using stack.

• Support for recursion activation records of method calls.

Queue: Queue is an abstract data structure, somewhat similar to Stacks. Unlike stacks, a queue is open at both its ends. One end is always used to insert data (enqueue) and the other is used to remove data (dequeue). Real life applications of queue are:
• Queue is used when things don’t have to be processed immediately, but have to be processed in First In First Out order like Breadth First Search. This property of Queue makes it also useful in following kind of scenarios.

• When a resource is shared among multiple consumers. Examples include CPU scheduling, Disk Scheduling.
• When data is transferred asynchronously (data not necessarily received at same rate as sent) between two processes. Examples include IO Buffers, pipes, file IO, etc.

Answer to the question No.1:
In my last class I was learned about Linked list, stack and queue.

Answer to the question No.2:
Data Structure is the combination of data objects which gives a way of collecting and handling data in the computer so that it can be used. Their various types are arrays, Linked List, Stack, Queue, etc. Data Structures are used extensively in nearly every aspect of Computer Science for simple as well as complex calculations. They are practiced in all such areas such as AI, Graphics, Operating System, etc.

Data Structures are a crucial part of several computer algorithms as they allow programmers to do data management efficiently. A wise selection of data structures can improve the performance of a computer program or algorithm in a more useful way.

1. Handling complexity:
Increase in complexities in computer algorithms, the volume of data usage is rising; this can affect the execution of the application and can create remarkable areas of concern like processing speed, data search, and multiple requests. To counter these data structures are used.

2. Systematic memory use:
Systematic application of data structure memory usage can be optimized, e.g., we can use linked list vs. arrays when we are not particular about the data size. When there is no longer use of memory, it can be cleared.

Answer to the question No.3:
Application of Tree:
Trees are hierarchical structures having a single root node.
Some applications of the trees are:
1.XML Parser uses tree algorithms.
2.Decision-based algorithm is used in machine learning which works upon the algorithm of tree.
3.Databases also uses tree data structures for indexing.
4.Domain Name Server(DNS) also uses tree structures.

Application of Graph:
Graph is a data structure where data is stored in a collection of interconnected vertices (nodes) and edges (paths).
Some applications of a graph are:
1.Facebook’s Graph API uses the structure of Graphs.
2.Google’s Knowledge Graph also has to do something with Graph.
3.Dijkstra algorithm or the shortest path first algorithm also uses graph structure to finding the smallest path between the nodes of the graph.
4.GPS navigation system also uses shortest path APIs.

Application of Stack:
A stack is a data structure which uses LIFO order.
Some Applications of a stack are:
1.Converting infix to postfix expressions.
2.Undo operation is also carried out through stacks.
3.Syntaxes in languages are parsed using stacks.
4.It is used in many virtual machines like JVM.

Application of Queue:
A queue is a data structure which uses FIFO order.
Some applications of a queue are:
1.Operating System uses queue for job scheduling.
2.To handle congestion in networking queue can be used.
3.Data packets in communication are arranged in queue format.

Picture of DS-(PC-F)
1)Ans:
In my last class I was learned about Linked list, stack and queue.

2)Ans:
Data Structure is the combination of data objects which gives a way of collecting and handling data in the computer so that it can be used. Their various types are arrays, Linked List, Stack, Queue, etc. Data Structures are used extensively in nearly every aspect of Computer Science for simple as well as complex calculations. They are practiced in all such areas such as AI, Graphics, Operating System, etc.

Data Structures are a crucial part of several computer algorithms as they allow programmers to do data management efficiently. A wise selection of data structures can improve the performance of a computer program or algorithm in a more useful way.

1. Handling complexity:
Increase in complexities in computer algorithms, the volume of data usage is rising; this can affect the execution of the application and can create remarkable areas of concern like processing speed, data search, and multiple requests. To counter these data structures are used.

2. Systematic memory use:
Systematic application of data structure memory usage can be optimized, e.g., we can use linked list vs. arrays when we are not particular about the data size. When there is no longer use of memory, it can be cleared.

3. Ability to reuse:
Once we have executed a particular data structure, we can reuse it in any distinct position. Implementation of data structures can be assembled into libraries that can be utilized by various clients.

4. Abstraction: 
Data structure acts as the foundation of abstract data types; the data structure describes the physical form of Abstract Data Type. In ADT, the set of operations is supposed to be understood, and the data structure provides physicality to them.

Data structures are the integral constituent of any programming language or complex computations. Mostly, structured data structures are crucial to designing efficient algorithms.

3)Ans:
The real time application of tree, graph, stack and queue in data structure.Now i will write in detail all the real time application.

Tree:
Trees are hierarchical structures having a single root node.Some applications of the trees are:

1.XML Parser uses tree algorithms.
Decision-based algorithm is used in machine learning which works upon the algorithm of tree.
2.Databases also uses tree data structures for indexing.
3.Domain Name Server(DNS) also uses tree structures.

Graph:
Graph is a data structure where data is stored in a collection of interconnected vertices (nodes) and edges (paths).Some applications of a graph are:

1.Facebook’s Graph API uses the structure of Graphs.
2.Google’s Knowledge Graph also has to do something with Graph.
3.Dijkstra algorithm or the shortest path first algorithm also uses graph structure to finding the smallest path between the nodes of the graph.
4.GPS navigation system also uses shortest path APIs.

Stack:
A stack is a data structure which uses LIFO order.Some Applications of a stack are:

1.Converting infix to postfix expressions.
Undo operation is also carried out through stacks.
2.Syntaxes in languages are parsed using stacks.
3.It is used in many virtual machines like JVM.

Queue:
A queue is a data structure which uses FIFO order.Some applications of a queue are:

1.Operating System uses queue for job scheduling.
2.To handle congestion in networking queue can be used.
3.Data packets in communication are arranged in queue format.

Notifications

You have no notifications
See all

Course Overview
SECTIONS

Welcome to Data Structures
1
Week 1: Preparing Background
2
Week 2: Exercise and Course Project
3
Week 3: Discussion on Link-List
4
Week 4: Adaptive Lesson on Link-List
5
Week 5: Review discussion on Link-List
6
Week 6: Discussion on Stack Applications
7
Week 8: Discussion on Tree Data Structure
8
Week 9: Discussion on Binary Search Tree (BST)
9
Week 10: Discussion on Heap
10
Week 11: Discussion on Graph
11
Week 12: Review Discussion
12
Skip to main content
Data Structure and Lab
Dashboard
My courses
CSE134/135-MA
Week 1: Preparing Background
Discussion Forum (Week 1)
Week 1 Forum discuss
Search
Discussion Forum (Week 1)
Week 1 Forum discuss
Display mode
Picture of Saim Jaman
Week 1 Forum discuss
by Saim Jaman - Saturday, 26 September 2020, 11:14 AM
Number of replies: 0
Picture of DS-(PC-F)
Answer to the question no.1

In my last class I was learned about this course are Data structure , Data structure applications - Link list, Stack, Queue and importance of data structure in computer science.

Answer to the question no.2

Data structure To handle very large data, high-speed processing is required, but with growing data processor may fail to archive required processing speed. Data structure is important in computer science because it is foundation of computer science. It helps computing to store the data efficiently in short time and process the data cleverly in low storage .Getting a particular record from database should be quick and with optimum use of resources.

Answer to the question no.3

he real life application of tree , graph, stack, queue :

Tree - A tree is a nonlinear hierarchical data structure that consists of nodes connected by edges. The real life applications of the tree in data structure are - Folders in operating system, HTML document object model, Network routing, Syntax tree in compiler.

Graph - A graph data structure is a data structure where data is stored in a collection of interconnected vertices (nodes) and edges (paths). The real life applications of the graph in data structure are - Social graph, Knowledge graph, Path optimization algorithm.

Stack: A stack is a data structure which uses LIFO order.Some Applications of a stack are:
1.Converting infix to postfix expressions. Undo operation is also carried out through stacks. 2.Syntaxes in languages are parsed using stacks. 3.It is used in many virtual machines like JVM.
Queue: A queue is a data structure which uses FIFO order.Some applications of a queue are:
1.Operating System uses queue for job scheduling. 2.To handle congestion in networking queue can be used. 3.Data packets in communication are arranged in queue format.

Question to the answer no 1:
In my last class I was learned about Linked list, stack and queue.
A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. In simple words, a linked list consists of nodes where each node contains a data field and a reference(link) to the next node in the list.
Stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO) principle.
Queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) principle.


Question to the answer no 2:
With increasing complexities in computer algorithms, the amount of data usage is increasing, this can affect the performance of the application and can create some areas of concern:

• Processing speed: To handle very large data, high-speed processing is required, but with growing data processor may fail to archive required processing speed.
• Data Search: Getting a particular record from database should be quick and with optimum use of resources.
• Multiple requests: To handle simultanous requests from multiple users

Data Structure Advantages
• Efficient Memory use: With efficient use of data structure memory usage can be optimized, for e.g we can use linked list vs arrays when we are not sure about the size of data. When there is no more use of memory, it can be released.
• Reusability: Data structures can be reused, i.e. once we have implemented a particular data structure, we can use it at any other place. Implementation of data structures can be compiled into libraries which can be used by different clients.
• Abstraction: Data structure serves as the basis of abstract data types, the data structure defines the physical form of ADT(Abstract Data Type). ADT is theoretical and Data structure gives physical form to them.
All of those point shows the importance of Data Structure in computer science and engineering field.

Question to the answer no 3:
The real time application of tree, graph, stack and queue in data structure:
Now, i am gonna write some real life applications and by real life i mean applications of the data structures in your daily routine.
Tree : We must've used our windows task manager,when we right click on the name of some currently running application you'd have seen that there's a option to end the process tree ,it shuts down not only that application but all the child applications of that root application which we want to shut down,so the windows basically forms a tree of processes that are related to that application and makes that app the root.Trees are also used in DBMS ,we are really gotta know how to deal with them while working with database management system.
Graph : Graphs have many applications not only in computer science but in other fields too.graphs are used in game theory ,artificial intelligence,computer networks and in genetic algorithms.
Stack : Stack plays a crucial part in designing a operating systems.
Queue : In our smartphone we must've used some music apps like saavn,wynk and music player which our mobile has and we also have maintained a playlist of our favourite songs ,well thats when the queue come in but there are some modifications in that but the main idea comes from the queues only.

Q1.
In this week, I was learned about Linked list, stack and queue.

Q2.
Data Structure can be defined as the collection of data objects which provides a way of storing and managing data in the computer so that it can be used. Various Data Structures types are arrays, Linked List, Stack, Queue, etc. Data Structures are widely used in almost every aspect of Computer Science for simple as well as complex computations. Data structures are used in all areas of computer science such as Artificial Intelligence, graphics, Operating system etc.
Data Structures are the key part of many computer algorithms as they allow the programmers to do data management in an efficient way. A right selection of data structure can enhance the efficiency of computer program or algorithm in a better way.

Why Data Structures are needed:
With increasing complexities in computer algorithms, the amount of data usage is increasing, this can affect the performance of the application and can create some areas of concern:

Processing speed: To handle very large data, high-speed processing is required, but with growing data processor may fail to achive required processing speed.

Data Search: Getting a particular record from database should be quick and with optimum use of resources.

Multiple requests: To handle simultanous requests from multiple users

In order to work on concern areas, data structures are used. Data is organized to form a data structure in such a way that all items are not required to be searched and required data can be searched instantly

Q3.
The real life application of tree, graph, stack and queue are:
Tree: Information bases utilizes tree information structures for indexing.Domain Name Server additionally utilizes tree structures.Binary Space Partition are utilized in pretty much every 3D computer game to figure out what articles should be rendered.Binary Tries are utilized in pretty much every high-data transmission switch for putting away switch tables.

Graph: Graphs are used to represent data organization. Graph theory is used to find shortest path in road or a network. In Google Maps, various locations are represented as vertices or nodes and the roads are represented as edges and graph theory is used to find the shortest path between two nodes.In physics and chemistry, graph theory is used to study molecules.

Stack: The stack can be used to convert some infix expression into its postfix equivalent, or prefix equivalent. These postfix or prefix notations are used in computers to express some expressions. These expressions are not so much familiar to the infix expression, but they have some great advantages also. We do not need to maintain operator ordering, and parenthesis.Backtracking is one of the algorithm designing technique. Another great use of stack is during the function call and return process.

Queue: Queue is used when things don't have to be processed immediately, but have to be processed in First In First Out order like Breadth First Search. Serving requests on a single shared resource, like a printer, CPU task scheduling etc. In real life scenario, Call Center phone systems uses Queues to hold people calling them in an order, until a service representative is free. Handling of interrupts in real-time systems.

1)Ans:
In my last class I was learned about Linked list, stack and queue.

2)Ans:
Data Structure is the combination of data objects which gives a way of collecting and handling data in the computer so that it can be used. Their various types are arrays, Linked List, Stack, Queue, etc. Data Structures are used extensively in nearly every aspect of Computer Science for simple as well as complex calculations. They are practiced in all such areas such as AI, Graphics, Operating System, etc.

Data Structures are a crucial part of several computer algorithms as they allow programmers to do data management efficiently. A wise selection of data structures can improve the performance of a computer program or algorithm in a more useful way.

1. Handling complexity:
Increase in complexities in computer algorithms, the volume of data usage is rising; this can affect the execution of the application and can create remarkable areas of concern like processing speed, data search, and multiple requests. To counter these data structures are used.

2. Systematic memory use:
Systematic application of data structure memory usage can be optimized, e.g., we can use linked list vs. arrays when we are not particular about the data size. When there is no longer use of memory, it can be cleared.

3. Ability to reuse:
Once we have executed a particular data structure, we can reuse it in any distinct position. Implementation of data structures can be assembled into libraries that can be utilized by various clients.

4. Abstraction: 
Data structure acts as the foundation of abstract data types; the data structure describes the physical form of Abstract Data Type. In ADT, the set of operations is supposed to be understood, and the data structure provides physicality to them.

Data structures are the integral constituent of any programming language or complex computations. Mostly, structured data structures are crucial to designing efficient algorithms.

3)Ans:
The real time application of tree, graph, stack and queue in data structure.Now i will write in detail all the real time application.

Tree:
Trees are hierarchical structures having a single root node.Some applications of the trees are:

1.XML Parser uses tree algorithms.
Decision-based algorithm is used in machine learning which works upon the algorithm of tree.
2.Databases also uses tree data structures for indexing.
3.Domain Name Server(DNS) also uses tree structures.

Graph:
Graph is a data structure where data is stored in a collection of interconnected vertices (nodes) and edges (paths).Some applications of a graph are:

1.Facebook’s Graph API uses the structure of Graphs.
2.Google’s Knowledge Graph also has to do something with Graph.
3.Dijkstra algorithm or the shortest path first algorithm also uses graph structure to finding the smallest path between the nodes of the graph.
4.GPS navigation system also uses shortest path APIs.

Stack:
A stack is a data structure which uses LIFO order.Some Applications of a stack are:

1.Converting infix to postfix expressions.
Undo operation is also carried out through stacks.
2.Syntaxes in languages are parsed using stacks.
3.It is used in many virtual machines like JVM.

Queue:
A queue is a data structure which uses FIFO order.Some applications of a queue are:

1.Operating System uses queue for job scheduling.
2.To handle congestion in networking queue can be used.
3.Data packets in communication are arranged in queue format.

In my last class I was learned about Linked list, stack and queue.

2)Ans:
Data Structure is the combination of data objects which gives a way of collecting and handling data in the computer so that it can be used. Their various types are arrays, Linked List, Stack, Queue, etc. Data Structures are used extensively in nearly every aspect of Computer Science for simple as well as complex calculations. They are practiced in all such areas such as AI, Graphics, Operating System, etc.

Data Structures are a crucial part of several computer algorithms as they allow programmers to do data management efficiently. A wise selection of data structures can improve the performance of a computer program or algorithm in a more useful way.

1. Handling complexity:
Increase in complexities in computer algorithms, the volume of data usage is rising; this can affect the execution of the application and can create remarkable areas of concern like processing speed, data search, and multiple requests. To counter these data structures are used.

2. Systematic memory use:
Systematic application of data structure memory usage can be optimized, e.g., we can use linked list vs. arrays when we are not particular about the data size. When there is no longer use of memory, it can be cleared.

3. Ability to reuse:
Once we have executed a particular data structure, we can reuse it in any distinct position. Implementation of data structures can be assembled into libraries that can be utilized by various clients.

4. Abstraction: 
Data structure acts as the foundation of abstract data types; the data structure describes the physical form of Abstract Data Type. In ADT, the set of operations is supposed to be understood, and the data structure provides physicality to them.

Data structures are the integral constituent of any programming language or complex computations. Mostly, structured data structures are crucial to designing efficient algorithms.

3)Ans:
The real time application of tree, graph, stack and queue in data structure.Now i will write in detail all the real time application.

Tree:
Trees are hierarchical structures having a single root node.Some applications of the trees are:

1.XML Parser uses tree algorithms.
Decision-based algorithm is used in machine learning which works upon the algorithm of tree.
2.Databases also uses tree data structures for indexing.
3.Domain Name Server(DNS) also uses tree structures.

Graph:
Graph is a data structure where data is stored in a collection of interconnected vertices (nodes) and edges (paths).Some applications of a graph are:

1.Facebook’s Graph API uses the structure of Graphs.
2.Google’s Knowledge Graph also has to do something with Graph.
3.Dijkstra algorithm or the shortest path first algorithm also uses graph structure to finding the smallest path between the nodes of the graph.
4.GPS navigation system also uses shortest path APIs.

Stack:
A stack is a data structure which uses LIFO order.Some Applications of a stack are:

1.Converting infix to postfix expressions.
Undo operation is also carried out through stacks.
2.Syntaxes in languages are parsed using stacks.
3.It is used in many virtual machines like JVM.

Queue:
A queue is a data structure which uses FIFO order.Some applications of a queue are:

1.Operating System uses queue for job scheduling.
2.To handle congestion in networking queue can be used.
3.Data packets in communication are arranged in queue format.

1)Ans:
In my last class I was learned about Linked list, stack and queue.

2)Ans:
Data Structure is the combination of data objects which gives a way of collecting and handling data in the computer so that it can be used. Their various types are arrays, Linked List, Stack, Queue, etc. Data Structures are used extensively in nearly every aspect of Computer Science for simple as well as complex calculations. They are practiced in all such areas such as AI, Graphics, Operating System, etc.

Data Structures are a crucial part of several computer algorithms as they allow programmers to do data management efficiently. A wise selection of data structures can improve the performance of a computer program or algorithm in a more useful way.

1. Handling complexity:
Increase in complexities in computer algorithms, the volume of data usage is rising; this can affect the execution of the application and can create remarkable areas of concern like processing speed, data search, and multiple requests. To counter these data structures are used.

2. Systematic memory use:
Systematic application of data structure memory usage can be optimized, e.g., we can use linked list vs. arrays when we are not particular about the data size. When there is no longer use of memory, it can be cleared.

3. Ability to reuse:
Once we have executed a particular data structure, we can reuse it in any distinct position. Implementation of data structures can be assembled into libraries that can be utilized by various clients.

4. Abstraction: 
Data structure acts as the foundation of abstract data types; the data structure describes the physical form of Abstract Data Type. In ADT, the set of operations is supposed to be understood, and the data structure provides physicality to them.

Data structures are the integral constituent of any programming language or complex computations. Mostly, structured data structures are crucial to designing efficient algorithms.

3)Ans:
The real time application of tree, graph, stack and queue in data structure.Now i will write in detail all the real time application.

Tree:
Trees are hierarchical structures having a single root node.Some applications of the trees are:

1.XML Parser uses tree algorithms.
Decision-based algorithm is used in machine learning which works upon the algorithm of tree.
2.Databases also uses tree data structures for indexing.
3.Domain Name Server(DNS) also uses tree structures.

Graph:
Graph is a data structure where data is stored in a collection of interconnected vertices (nodes) and edges (paths).Some applications of a graph are:

1.Facebook’s Graph API uses the structure of Graphs.
2.Google’s Knowledge Graph also has to do something with Graph.
3.Dijkstra algorithm or the shortest path first algorithm also uses graph structure to finding the smallest path between the nodes of the graph.
4.GPS navigation system also uses shortest path APIs.

Stack:
A stack is a data structure which uses LIFO order.Some Applications of a stack are:

1.Converting infix to postfix expressions.
Undo operation is also carried out through stacks.
2.Syntaxes in languages are parsed using stacks.
3.It is used in many virtual machines like JVM.

Queue:
A queue is a data structure which uses FIFO order.Some applications of a queue are:

1.Operating System uses queue for job scheduling.
2.To handle congestion in networking queue can be used.
3.Data packets in communication are arranged in queue format.

Answer to the question no 1

At my last class I was learned about Linked list, stack and queue.

Answer to the question no 2
Data Structure can be defined as the collection of data objects which provides a way of storing and managing data in the computer so that it can be used. Data Structures are the key part of many computer algorithms as they allow the programmers to do data management in an efficient way. Data structure is important in computer science because of,
Preparing speed: To deal with extremely huge information, fast handling is required, yet with developing information processor may neglect to achive required handling speed.
Information Search: Getting a specific record from data set ought to be speedy and with ideal utilization of assets.



Productive Memory use: With effective utilization of information structure memory use can be upgraded, for e.g we can utilize connected rundown versus exhibits when we don't know about the size of information. When there is no more utilization of memory, it very well may be delivered.
Reusability: Data structures can be reused, for example when we have actualized a specific information structure, we can utilize it at some other spot. Execution of information structures can be ordered into libraries which can be utilized by various customers.
Reflection: Data structure fills in as the premise of theoretical information types, the information structure characterizes the physical type of ADT(Abstract Data Type). ADT is hypothetical and Data structure gives physical structure to them.

Answer to the question no 3

The real time application of tree, graph, stack and queue in data structure:

Tree: Information bases utilizes tree information structures for indexing.Domain Name Server additionally utilizes tree structures.Binary Space Partition are utilized in pretty much every 3D computer game to figure out what articles should be rendered.Binary Tries are utilized in pretty much every high-data transmission switch for putting away switch tables.

Graph: Graphs are used to represent data organization. Graph theory is used to find shortest path in road or a network. In Google Maps, various locations are represented as vertices or nodes and the roads are represented as edges and graph theory is used to find the shortest path between two nodes.In physics and chemistry, graph theory is used to study molecules.

Stack: The stack can be used to convert some infix expression into its postfix equivalent, or prefix equivalent. These postfix or prefix notations are used in computers to express some expressions. These expressions are not so much familiar to the infix expression, but they have some great advantages also. We do not need to maintain operator ordering, and parenthesis.Backtracking is one of the algorithm designing technique. Another great use of stack is during the function call and return process.
Queue: Queue is used when things don't have to be processed immediately, but have to be processed in First In First Out order like Breadth First Search. Serving requests on a single shared resource, like a printer, CPU task scheduling etc. In real life scenario, Call Center phone systems uses Queues to hold people calling them in an order, until a service representative is free. Handling of interrupts in real-time systems.

1)
Ans :
In my last class I was learned about Linked list, stack and queue.

2)
Ans :
Data Structure can be defined as the collection of data objects which provides a way of storing and managing data in the computer so that it can be used. Various Data Structures types are arrays, Linked List, Stack, Queue, etc. Data Structures are widely used in almost every aspect of Computer Science for simple as well as complex computations. Data structures are used in all areas of computer science such as Artificial Intelligence, graphics, Operating system etc.

3)
Ans :

A data structure is a particular way of organizing data in a computer so that it can be used effectively. In this article, the real-time applications of all the data structures are discussed.

Stack :
Some Applications of a stack are:
1.Converting infix to postfix expressions.
2.Undo operation is also carried out through stacks.
3.Syntaxes in languages are parsed using stacks.
4.It is used in many virtual machines like JVM.

Queue :
Some applications of a queue are:
1.Operating System uses queue for job scheduling.
2.To handle congestion in networking queue can be used.
3.Data packets in communication are arranged in queue format.

Graph :

Some applications of a graph are:
1.Facebook’s Graph API uses the structure of Graphs.
2.Google’s Knowledge Graph also has to do something with Graph.
3.Dijkstra algorithm or the shortest path first algorithm also uses graph structure to finding the smallest path between the nodes of the graph.

Tree :
Some applications of the trees are:
1.XML Parser uses tree algorithms.
2.Decision-based algorithm is used in machine learning which works upon the algorithm of tree.
3.Databases also uses tree data structures for indexing.
4.Domain Name Server(DNS) also uses tree structures.

1)
Ans :
In my last class I was learned about Linked list, stack and queue.

2)
Ans :
Data Structure can be defined as the collection of data objects which provides a way of storing and managing data in the computer so that it can be used. Various Data Structures types are arrays, Linked List, Stack, Queue, etc. Data Structures are widely used in almost every aspect of Computer Science for simple as well as complex computations. Data structures are used in all areas of computer science such as Artificial Intelligence, graphics, Operating system etc.

3)
Ans :

A data structure is a particular way of organizing data in a computer so that it can be used effectively. In this article, the real-time applications of all the data structures are discussed.

Stack :
Some Applications of a stack are:
1.Converting infix to postfix expressions.
2.Undo operation is also carried out through stacks.
3.Syntaxes in languages are parsed using stacks.
4.It is used in many virtual machines like JVM.

Queue :
Some applications of a queue are:
1.Operating System uses queue for job scheduling.
2.To handle congestion in networking queue can be used.
3.Data packets in communication are arranged in queue format.

Graph :

Some applications of a graph are:
1.Facebook’s Graph API uses the structure of Graphs.
2.Google’s Knowledge Graph also has to do something with Graph.
3.Dijkstra algorithm or the shortest path first algorithm also uses graph structure to finding the smallest path between the nodes of the graph.

Tree :
Some applications of the trees are:
1.XML Parser uses tree algorithms.
2.Decision-based algorithm is used in machine learning which works upon the algorithm of tree.
3.Databases also uses tree data structures for indexing.
4.Domain Name Server(DNS) also uses tree structures.