Monthly Archives: June 2023

Please describe a case that has been in the news recently and describe what harm can be done by the unlawful intrusion into the computer of another.

As you begin to look at data structures using Java, this first assignment will have you look at the implementation of a queue and a stack. These two algorithms will be implemented using linked lists. You will complete 2 given program shells: one for a queue and the other for a stack.

In addition, you will establish your Key Assignment template that you will build in Week 1, and each week, you will add material to the appropriate section of the document.

Your Data Structures Using Java template document should be in the following format:

• Data Structures Using Java document shell
• Use MS Word
• Title Page
  • Course number and name
  • Project name
  • Student name
  • Date
• Table of Contents
  • Use auto-generated TOC
  • Separate page for each section
  • Maximum of 3 levels deep
  • Be sure to update fields of TOC so it is up-to-date before submitting your project
• Abstract
• Paper Topic Background
• Section Headings (Create each heading on a new page with TBD as the content except for the sections you are currently working on.)
  • Section 1: Lists, Stacks, and Queues
  • Section 2: Heaps and Trees
  • Section 3: Sorting Algorithms
  • Section 4: Searching
  • Section 5: Recursion
• Conclusion
• References

Each week, you will add to this document and submit for grading. As a preview, each section will contain the following:

• Section 1: Lists, Stacks, and Queues
  • Implement 2 programs for the following:
    • Stacks
    • Queues
• Section 2: Heaps and Trees
  • Implement pseudo code for a hash table and resolve collisions with a linked list.
• Section 3: Sorting Algorithms
  • Compare sort algorithms.
• Section 4: Searching
  • Implement pseudo code to search for values in a linked list or array.
• Section 5: Recursion
  • Implement pseudo code to create a factorial of a number using recursion.

Week 1: Assignment Details

The task this week is to complete the following 2 structures using a linked list:

• Stack
• Queue

Assume the occurrence of a linked list node is represented by the object “Node” and its “Data” and “NextRef” attributes.

Part 1: Assume a “Head” node exists with the NextRef attribute pointing to the first node in the stack or being null if the stack is empty. Create pseudo code for the following 3 stack methods, showing the logic tied to the inverted list. Include a summary of these actions.  

push( item )
pop( )
display( )

Part 2: Assume “Front” and “Rear” nodes exist with the “NextRef” attributes pointing to the first and last nodes of the queue or being null if the queue is empty. Create pseudo code for the following 3 queue methods, showing the logic tied to the inverted list. Include a summary of these actions.

enqueue( item )
dequeue( )
display( )

Week 1 Deliverables:

• Pseudo code implemented for both the stack and queue methods
• Documented pseudo code
• Add the completed pseudo code and discussion to the Key Assignment template Section 1: Lists, Stacks, and Queues.
• Name the document “IT265__IP1.doc.”

Please submit your assignment.

to view the expectations for this assignment. 

6.1 Mock Dissertation Chapter One Introduction

Overview: As you observed in the LIVE session, there is a connection between chapter three and chapter one. Therefore, as an extension of our week in the mock chapter three from last week, we will write a mock chapter one. For the sake of preparation, we will be using the required headings from the University of the Cumberlands Doctoral Research Handbook.  Like we discuss in class, each university has unique parameters for what they expect in chapter one, so you may see papers from other universities that look slightly different. The importance here is to focus on the content, not necessarily the organization. This assignment will help determine your readiness to write a full-length chapter one.Directions:

1.  develop a 3-4 page (more is fine) mock chapter one that includes all sections of the respective methodology selected. 
   1. You will NOT write a theoretical framework in your mock chapter one as this will be completed in a later week. 

Write a paper on the topic: Locational base services. here are the instructions

1.Abstract

2.Introduction 

(some paragraph on why you think your topic is important)

Your introduction should be the most captivating of your writing

3. Outline on the topic(includes references, literature, methods,..)

Brief description of a chosen technology( your writing can be comparative between two or more technologies too)

Measurable characteristics of the chosen technology.

Some 5-7 sources of the secondary data to back up some of these characteristics

Three or four companies as a case study/ applying the concept.

Analysis( validation of characteristics with companies based on secondary data)

4. Conclusion

 Complete the following assignment in one MS word document: 

1. Describe the IoT and its characteristics
2. Discuss the benefits and drivers of IoT
3. Understand how IoT works

 When submitting work, be sure to include an APA cover page and include at least two APA formatted references (and APA in-text citations) to support the work this week.
All work must be original (not copied from any source). 

refer to the attached documents in the uploads.

 Discussion 1 (Chapter 1):  Give examples of systems in which it may make sense to use traditional file processing instead of a database approach.  

 Discussion 2 (Chapter 2):  If you were designing a Web-based system to make airline reservations and to sell airline tickets, which DBMS Architecture would you choose from Section 2.5? Why? Why would the other architectures not be a good choice? 

Book : https://www.auhd.site/upfiles/elibrary/Azal2020-01-22-12-28-11-76901.pdf

need atleast two apa 7 reference

refer to the attached document for the details:

need online help