Database

Need Help in Database Assignment?
We can help you if you are having difficulty with your Database Assignment. Just email your Database Assignment at admin@assignmentcache.com.
We provide help for students all over the world in Database Assignment.

Items 1 to 10 of 223 total

per page
Page:
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5

Grid  List 

Set Ascending Direction
  1. DAT305 Week 3 Challenge Activity 1 Stack ADT

    DAT/305 Week 3 Challenge Activities 3.1.1: Stack ADT

    Regular Price: $5.00

    Special Price: $3.00

    DAT/305 Week 3 Challenge Activities 3.1.1: Stack ADT


    CHALLENGE ACTIVITY 1


    Given numStack: 69,87 (top is 69)
    What is the stack after the following operations?
    Pop(numStack)
    Push(numStack, 92)
    Pop(numStack)
    Push(numStack, 77)


    After the above operations, what does GetLength(numStack) return?


    CHALLENGE ACTIVITY 2


    Given numStack: 11,71,12 top is 11)
    What does Peek(numStack) return?


    What is the stack after the following operations?
    Push(numStack, 34)
    Pop(numStack)
    Push(numStack, 73)
    Peek numStack)
    Peek/numStack)


    After the above operations, what does GetLength(numStack) return?



    CHALLENGE ACTIVITY 3


    Given numStack: 16.65 (top is 16)
    Pop(numStack)
    Pop(numStack)


    After the above operations, what does GetLength(numStack) return?


    After the above operations, what does isEmpty(numStack) return?

    Learn More
  2. DAT305 Week 3 Challenge Activities 1 Stacks using linked lists

    DAT/305 Week 3 Challenge Activities 3.2.1: Stacks using linked lists

    Regular Price: $5.00

    Special Price: $3.00

    DAT/305 Week 3 Challenge Activities 3.2.1: Stacks using linked lists


    CHALLENGE ACTIVITY 1


    Given an empty stack numStack, what does the list head pointer point to? If the pointer is null, enter null.


    After the following operation, which node does the list head pointer point to?
    StackPush(numStack, 83)



    CHALLENGE ACTIVITY 2


    Given numStack: 54, 38, 25, 28 (top is 54)
    After the following operation: StackPush(numStack, 40)
    What node does newNode's next pointer point to? If the pointer is null, enter null.


    What node does the list's head pointer point to?



    CHALLENGE ACTIVITY 3


    Given numStack: 51 (top is 51)
    After the following operation: StackPop(numStack)
    What is returned?


    What node does the list's head pointer point to? If the pointer is null, enter null:

    Learn More
  3. DAT305 Week 3 Challenge Activities 1 Queue ADT

    DAT/305 Week 3 Challenge Activities 3.3.1: Queue ADT

    Regular Price: $5.00

    Special Price: $4.00

    DAT/305 Week 3 Challenge Activities 3.3.1: Queue ADT


    CHALLENGE ACTIVITY 1


    Given numQueue: 75, 45
    What are the queue's contents after the following operations?
    Enqueue (numQueue, 80)
    Dequeue(numQueue)


    After the above operations, what does GetLength(numQueue) return?



    CHALLENGE ACTIVITY 2


    Given numQueue: 90, 60
    What does Peek(numQueue) return?


    What is the queue after the following operations?
    Peek(numQueue)
    Dequeue (numQueue)
    Peek(numQueue)
    Enqueue (numQueue, 90)


    After the above operations, what does GetLength(numqueue) return?



    CHALLENGE ACTIVITY 3


    Given numQueue: 73, 39
    Peek(numQueue)
    Dequeue (numqueue)
    After the above operations, what does GetLength(numQueue) return?


    After the above operations, what does IsEmpty(numQueue) return?



    CHALLENGE ACTIVITY 4


    Given numQueue is empty, what does the list head pointer point to?


    What does the list tail pointer point to?


    After the following operations:
    Enqueue (numQueue, 26)
    Enqueue (numQueue, 47)
    Enqueue (numQueue, 22)
    Dequeue (numQueue)


    What does the list head pointer point to?


    What does the list tail pointer point to?

    Learn More
  4. DAT305 Week 3 Challenge Activities 1 Queues using linked lists

    DAT/305 Week 3 Challenge Activities 3.4.1: Queues using linked lists

    Regular Price: $5.00

    Special Price: $2.00

    DAT/305 Week 3 Challenge Activities 3.4.1: Queues using linked lists


    CHALLENGE ACTIVITY 1


    Given an empty queue numQueue, what does the list head pointer point to? If the pointer is null, enter null.


    What does the list tail pointer point to?


    After the following operations:
    QueueEnqueue(numqueue, 66)
    QueueEnqueue(numQueue, 93)
    QueueDequeue(numQueue)


    What does the list head pointer point to?


    What does the list tail pointer point to?



    CHALLENGE ACTIVITY 2


    Given numQueue: 78, 37, 47


    What does the list head pointer point to? If the pointer is null enter null.


    What does the list tail pointer point to?


    After the following operations:
    QueueEnqueue(numQueue, 60)
    QueueEnqueue(numqueue, 57)
    QueueDequeue(numQueue)
    QueueDequeue(numQueue)


    What does the list head pointer point to?


    What does the list tail pointer point to?

    Learn More
  5. DAT305 Week 3 Challenge Activities 1 Deque ADT

    DAT/305 Week 3 Challenge Activities 3.5.1: Deque ADT

    Regular Price: $5.00

    Special Price: $3.00

    DAT/305 Week 3 Challenge Activities 3.5.1: Deque ADT


    CHALLENGE ACTIVITY 1


    Given an empty deque numDeque, what are the deque's contents after the following operations?
    PushBack(numDeque, 24)
    PushFront(numDeque, 49)
    PushBack(numDeque, 44)


    After the above operations, what does PeekFront(numDeque) return?


    After the above operations, what does PeekBack(numDeque) return?


    After the above operations, what does GetLength(numDeque) return?



    CHALLENGE ACTIVITY 2


    Given an empty deque numDeque, what are the deque's contents after the following operations?
    PushBack(numDeque, 95)
    PopFront(numDeque)
    PushFront(numDeque, 42)
    PushFront(numDeque, 25)
    PopBack(numDeque)


    After the above operations, what does GetLength(numDeque) return?



    CHALLENGE ACTIVITY 3


    Given numDeque: 19, 38
    PeekFront(numDeque)
    PopFront(numDeque)
    After the above operations, what does GetLength(numDeque) return?


    After the above operations, what does IsEmpty(numDeque) return?

    Learn More
  6. DAT305 Week 3 Challenge Activity 1 Hash tables with modulo hash function

    DAT/305 Week 3 Challenge Activities 3.6.1: Hash tables with modulo hash function

    Regular Price: $5.00

    Special Price: $3.00

    DAT/305 Week 3 Challenge Activities 3.6.1: Hash tables with modulo hash function


    CHALLENGE ACTIVITY 1


    A hash table with non-negative integer keys has a modulo hash function of key % 20.


    Hash function index range: 0 to


    Item 128 will go in bucket



    CHALLENGE ACTIVITY 2


    An ordinary array contains items with keys: 30, 22, 6, 34, 2, 10,13
    A hash table has 15 buckets with hash function key % 15.
    The hash table contains the same items as the array.


    How many elements are checked when searching for each of the following items?



    CHALLENGE ACTIVITY 3


    An empty hash table hashTable has 5 buckets and a hash function of key % 5.
    The following operations are performed in order.
    Select which operations cause a collision.
    Hashinsert(hash Table, 2)
    Hashinsert(hashTable, 12)
    Hashinsert(hashTable, 0)
    Hashinsert(hashTable, 5)
    Hashinsert(hash Table, 15)

    Learn More
  7. DAT/380 Week 2 LAB 2.10 - Select employees and managers with inner join

    DAT/380 Week 2 LAB 2.10 - Select employees and managers with inner join

    Regular Price: $5.00

    Special Price: $3.00

    DAT/380 Week 2 LAB 2.10 - Select employees and managers with inner join


    The Employee table has the following columns:
    ID - integer, primary key
    FirstName - variable-length string
    LastName - variable-length string
    ManagerID - integer
    Write a SELECT statement to show a list of all employees' first names and their managers' first names. List only employees that have a manager. Order the results by Employee first name. Use aliases to give the result columns distinctly different names, like "Employee" and "Manager".


    Hint: Join the Employee table to itself using INNER JOIN.

    Learn More
  8. DAT/380 Week 3 LAB 3.10 - Create Horse table with constraints

    DAT/380 Week 3 LAB 3.10 - Create Horse table with constraints

    Regular Price: $5.00

    Special Price: $3.00

    DAT/380 Week 3 LAB 3.10 - Create Horse table with constraints


    Create a Horse table with the following columns, data types, and constraints. NULL is allowed unless 'not NULL' is explicitly stated.
    ID - integer with range 0 to 65 thousand, auto increment, primary key
    RegisteredName - variable-length string with max 15 chars, not NULL
    Breed - variable-length string with max 20 chars, must be one of the following: Egyptian Arab, Holsteiner, Quarter Horse, Paint, Saddlebred
    Height - number with 3 significant digits and 1 decimal place, must be ≥ 10.0 and ≤ 20.0
    BirthDate - date, must be ≥ Jan 1, 2015


    Note: Not all constraints can be tested due to current limitations of MySQL.

    Learn More
  9. DAT/380 Week 3 LAB 3.11 - Create Student table with constraints

    DAT/380 Week 3 LAB 3.11 - Create Student table with constraints

    Regular Price: $5.00

    Special Price: $3.00

    DAT/380 Week 3 LAB 3.11 - Create Student table with constraints


    Create a Student table with the following column names, data types, and constraints:
    ID - integer with range 0 to 65 thousand, auto increment, primary key
    FirstName - variable-length string with max 20 chars, not NULL
    LastName - variable-length string with max 30 chars, not NULL
    Street - variable-length string with max 50 chars, not NULL
    City - variable-length string with max 20 chars, not NULL
    State - fixed-length string of 2 chars, not NULL, default "TX"
    Zip - integer with range 0 to 16 million, not NULL
    Phone - fixed-length string of 10 chars, not NULL
    Email - variable-length string with max 30 chars, must be unique

    Learn More
  10. DAT/380 Week 3 LAB 3.12 - Create LessonSchedule table with FK constraints

    DAT/380 Week 3 LAB 3.12 - Create LessonSchedule table with FK constraints

    Regular Price: $5.00

    Special Price: $3.00

    DAT/380 Week 3 LAB 3.12 - Create LessonSchedule table with FK constraints


    Two tables are created:
    Horse with columns:
    ID - integer, primary key
    RegisteredName - variable-length string


    Student with columns:
    ID - integer, primary key
    FirstName - variable-length string
    LastName - variable-length string


    Create the LessonSchedule table with columns:
    HorseID - integer with range 0 to 65 thousand, not NULL, partial primary key, foreign key references Horse(ID)
    StudentID - integer with range 0 to 65 thousand, foreign key references Student(ID)
    LessonDateTime - date/time, not NULL, partial primary key


    If a row is deleted from Horse, the rows with the same horse ID should be deleted from LessonSchedule automatically.


    If a row is deleted from Student, the same student IDs should be set to NULL in LessonSchedule automatically.


    Note: Table and column names are case sensitive in the auto-grader.


    CREATE TABLE Horse (
    ID SMALLINT UNSIGNED AUTO_INCREMENT,
    RegisteredName VARCHAR(15),
    PRIMARY KEY (ID)
    );


    CREATE TABLE Student (
    ID SMALLINT UNSIGNED AUTO_INCREMENT,
    FirstName VARCHAR(20),
    LastName VARCHAR(30),
    PRIMARY KEY (ID)
    );


    -- Your SQL statements go here

    Learn More

Items 1 to 10 of 223 total

per page
Page:
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5

Grid  List 

Set Ascending Direction