Algorithms and Data Structures at Duale Hochschule Baden-Württemberg

Flashcards and summaries for Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg

Arrow Arrow

It’s completely free

studysmarter schule studium
d

4.5 /5

studysmarter schule studium
d

4.8 /5

studysmarter schule studium
d

4.5 /5

studysmarter schule studium
d

4.8 /5

Study with flashcards and summaries for the course Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg

Exemplary flashcards for Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg on StudySmarter:

Different types of Queue?

Exemplary flashcards for Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg on StudySmarter:

Define the Queue ADT

Exemplary flashcards for Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg on StudySmarter:

Name different applications of Stacks

Exemplary flashcards for Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg on StudySmarter:

Name the fundamental Stack ADT methods

Exemplary flashcards for Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg on StudySmarter:

Define the Stack ADT

Exemplary flashcards for Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg on StudySmarter:

Facts about Linked List

Exemplary flashcards for Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg on StudySmarter:

What are the start and end points of a Doubly Linked List?

Exemplary flashcards for Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg on StudySmarter:

What does the Doubly Linked List Node store?

Exemplary flashcards for Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg on StudySmarter:

How to implement E setElement(int pos, E element); (Singly Linked List)

Exemplary flashcards for Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg on StudySmarter:

How to implement E getElement(int pos); (Singly Linked List)

Exemplary flashcards for Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg on StudySmarter:

How to implement E removeFirst(); (Singly Linked List)

Exemplary flashcards for Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg on StudySmarter:

What are the applications of Queue

Your peers in the course Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg create and share summaries, flashcards, study plans and other learning materials with the intelligent StudySmarter learning app.

Get started now!

Flashcard Flashcard

Exemplary flashcards for Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg on StudySmarter:

Algorithms and Data Structures

Different types of Queue?

  • Enqueue: Objects are added to the queue only at the endof the queue
  • Dequeue: Objects are removed from the queue only atfront of the queue

Algorithms and Data Structures

Define the Queue ADT

  • Collection of objects that are kept in sequence using the first-in, first-out (FIFO principle

Algorithms and Data Structures

Name different applications of Stacks

  • direct applications
    • page-visited history in a Web browser
    • Undo sequence in a text editor
    • Chain of method calls in the JVM
  • Indirect applications
    • Auxiliary data structure for algorithms
    • Component of other data structures

Algorithms and Data Structures

Name the fundamental Stack ADT methods

push() : push an item onto the top of the stack

pop() : pop an item from the top of the stack, item is removed from the stack

top/ peek(): pick the top item without removing it from the stack

Algorithms and Data Structures

Define the Stack ADT

  • Collection of objects which are added and removed from one end only (typically called the top) 
  • according to the last-in, first-out (LIFO) principle
  • Logically the top item is the only one that can even be seen

Algorithms and Data Structures

Facts about Linked List

  • Dynamic: a linked list can easily grow and shrink in size
  • don’t need to know how many elements will be in the list. They arecreated in memory as needed
  • Easy and fast insertions and deletions
  • With a linked list, no need to move other elements. Only need to reset

    some pointers

Algorithms and Data Structures

What are the start and end points of a Doubly Linked List?

Header -> node(link to previous node, element, link to next node)-> trailer

Algorithms and Data Structures

What does the Doubly Linked List Node store?

  • element
  • link to the previous node
  • link to the next node

Algorithms and Data Structures

How to implement E setElement(int pos, E element); (Singly Linked List)

public E setElement(int pos) {

      E result = null;

       if( head != null) {

               ListNode<E> current = head;

               int i = 0;

               while (i != pos && current.getnext() != null) {

                      current = current.getNext();

                       i++;

               }

             result = current.getData();

             current.setData(element);

       }

return result;

}

Algorithms and Data Structures

How to implement E getElement(int pos); (Singly Linked List)

public E getElement(int pos) {

      E result = null;

      if (head != null) {

           ListNode<E> current = head;

           int i = 0;

           while (i != pos && current.getNext() != null) {

                  current = current.getNext();

                  i++;

           }

           return result;

}

Algorithms and Data Structures

How to implement E removeFirst(); (Singly Linked List)

public E removeFirst() {

     if (isEmpty()) return null;

     E element = head.getData();

     size–;

     if (size == 0)

           head = null;

     else 

           head = head.getNext();

     return element;

}

Algorithms and Data Structures

What are the applications of Queue

Direct applications:

  • Waiting lists, bureaucracy
  • Access to shared resources (e.g., printer)
  • Multiprogramming

Indirect applications

  • Auxiliary data structure for algorithms
  • Component of other data structures

Sign up for free to see all flashcards and summaries for Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg

Singup Image Singup Image
Wave

Other courses from your degree program

For your degree program Business Computer Science - International Management For Business And Information Technology at the Duale Hochschule Baden-Württemberg there are already many courses on StudySmarter, waiting for you to join them. Get access to flashcards, summaries, and much more.

Back to Duale Hochschule Baden-Württemberg overview page

Rechnerarchitektur & Betriebssysteme

Systemanalysis & Design

Einführung in die Wirtschaftsinformatik

Einführung in die WI

What is StudySmarter?

What is StudySmarter?

StudySmarter is an intelligent learning tool for students. With StudySmarter you can easily and efficiently create flashcards, summaries, mind maps, study plans and more. Create your own flashcards e.g. for Algorithms and Data Structures at the Duale Hochschule Baden-Württemberg or access thousands of learning materials created by your fellow students. Whether at your own university or at other universities. Hundreds of thousands of students use StudySmarter to efficiently prepare for their exams. Available on the Web, Android & iOS. It’s completely free.

Awards

Best EdTech Startup in Europe

Awards
Awards

EUROPEAN YOUTH AWARD IN SMART LEARNING

Awards
Awards

BEST EDTECH STARTUP IN GERMANY

Awards
Awards

Best EdTech Startup in Europe

Awards
Awards

EUROPEAN YOUTH AWARD IN SMART LEARNING

Awards
Awards

BEST EDTECH STARTUP IN GERMANY

Awards

How it works

Top-Image

Get a learning plan

Prepare for all of your exams in time. StudySmarter creates your individual learning plan, tailored to your study type and preferences.

Top-Image

Create flashcards

Create flashcards within seconds with the help of efficient screenshot and marking features. Maximize your comprehension with our intelligent StudySmarter Trainer.

Top-Image

Create summaries

Highlight the most important passages in your learning materials and StudySmarter will create a summary for you. No additional effort required.

Top-Image

Study alone or in a group

StudySmarter automatically finds you a study group. Share flashcards and summaries with your fellow students and get answers to your questions.

Top-Image

Statistics and feedback

Always keep track of your study progress. StudySmarter shows you exactly what you have achieved and what you need to review to achieve your dream grades.

1

Learning Plan

2

Flashcards

3

Summaries

4

Teamwork

5

Feedback