Ask Question, Ask an Expert


Ask Computer Engineering Expert

1)(i) Derive the ADT to execute insertion and deletion in the singly linked list.

(ii) Describe cursor implementation of linked lists. prepare down the necessary operations.

2)(i) prepare down an ADT to execute stack of size N using an array. The elements in the stack are to be integers. The operations to be supported are PUSH, POP and DISPLAY. Take into account the exceptions of stack overflow and stack underflow.

(ii) Circular queue has the size of 5 and has 3 elements 10, 20 and 40 where F = 2 and R = 4. After inserting 50 and 60, find is the value of F and R. Trying to insert 30 at this stage what happens? Delete two elements from queue and insert 70, 80 & 90. Illustrate the sequence of steps with essential diagrams with the value of F & R

3)(i) prepare down an ADT to construct an AVL tree.

(ii) Assume the following sequences list nodes of a binary tree T in preorder and inorder, respectively:

Preorder: A, B, D, C, E, G, F, H,J
Inorder: D, B, A, E, G, C, H, F, J

Design the diagram of the tree.

4)(i) prepare down an ADT for performing insert and delete operations in a Binary Search Tree.

(ii) describe in detail binary heaps. Construct a min heap tree for the following:
5, 2, 6,7, 1, 3, 8, 9, 4

5)(i) Create the ADT to execute separate chaining hashing scheme.

(ii) Illustrate the result of inserting the keys 2, 3, 5, 7, 11, 13, 15, 6, 4 into the initially empty extendible hashing data structure with M = 3.

6) (i) Create an ADT to perform for the Union and find operations of disjoint sets.

(ii) describe about Union-by-rank and determine with path compression with code.

7) (i) prepare routines to determine shortest path using Dijkstra’s algorithm.

(ii) Determine all articulation points in the below graph. Illustrate the depth first spanning tree and the values of DFN and Low for each vertex.

8)(i) prepare down the pseudo code to determine a minimum spanning tree using Kruskal’s algorithm.

(ii) Determine the topological ordering of the below graph.

9)(i) Describe the running time of Divide-and-Conquer merge sort algorithm.

(ii) Describe the concept of greedy algorithm with Huffman codes ex.

10) Describe the Dynamic Programming with suitable ex.

Computer Engineering, Engineering

  • Category:- Computer Engineering
  • Reference No.:- M910318

Have any Question? 

Related Questions in Computer Engineering

After closing time the store manager would like to know how

After closing time, the store manager would like to know how much business was transacted during the day. Modify the CashRegister class to enable this functionality. Supply methods getSalesTotal and getSalesCount to get ...

Compute x as far as possible without a calculator where

Compute x as far as possible without a calculator. Where appropriate, make use of a smart decomposition of the exponent as shown in the example in Sect. 1.4.1: The last problem is called a discrete logarithm and points t ...

Write an application that retrieves a student name and

Write an application that retrieves a student name and three scores per line from a text file. Process the values by calculating the average of the scores per student. Write the name and average to a different text file. ...

Modify your implementation of the big integer adt from the

Modify your implementation of the Big Integer ADT from the previous question by adding the assignment combo operators that can be performed on the self and rhsInt big integers. Allow for any of the following operations t ...

Assume router r2 in figure 1835 receives a packet with

Assume router R2 in Figure 18.35 receives a packet with destination address How is the packet routed to its final destination?

1 how would you use a random number generator to simulate

1. How would you use a random number generator to simulate the drawing of a playing card? 2. What is an "off-by-one error"? Give an example from your own programming experience. 3. Give an example of a for loop in which ...

1 in chapter 1 we mentioned that the tcpip suite unlike the

1. In Chapter 1, we mentioned that the TCP/IP suite, unlike the OSI model, has no presentation layer. But an application-layer protocol can include some of the features defined in this layer if needed. Does HTTP have any ...

1 explain the advantages of ipv6 when compared to ipv42

1. Explain the advantages of IPv6 when compared to IPv4. 2. Explain the use of the flow field in IPv6. What is the potential application of this field? 3. Distinguish between compatible and mapped addresses and explain t ...

Create a simple model that includes some agents a rule for

Create a simple model that includes some agents, a rule for birth of agents (see hatch primitive) and a rule for death of agents (see die primitive). It is often useful to include a rule for agent movement. The agents ca ...

Suppose a virtual machine monitor call it vmm-1 is running

Suppose a virtual machine monitor (call it VMM-1) is running another virtual machine monitor (VMM-2), which in turn is running a version of the Linux operating system. The user running the Linux system is editing a file. ...

  • 4,153,160 Questions Asked
  • 13,132 Experts
  • 2,558,936 Questions Answered

Ask Experts for help!!

Looking for Assignment Help?

Start excelling in your Courses, Get help with Assignment

Write us your full requirement for evaluation and you will receive response within 20 minutes turnaround time.

Ask Now Help with Problems, Get a Best Answer

WalMart Identification of theory and critical discussion

Drawing on the prescribed text and/or relevant academic literature, produce a paper which discusses the nature of group

Section onea in an atwood machine suppose two objects of

SECTION ONE (a) In an Atwood Machine, suppose two objects of unequal mass are hung vertically over a frictionless

Part 1you work in hr for a company that operates a factory

Part 1: You work in HR for a company that operates a factory manufacturing fiberglass. There are several hundred empl

Details on advanced accounting paperthis paper is intended

DETAILS ON ADVANCED ACCOUNTING PAPER This paper is intended for students to apply the theoretical knowledge around ac

Create a provider database and related reports and queries

Create a provider database and related reports and queries to capture contact information for potential PC component pro