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

1 your job is to cook 3 cakes as efficiently as possible

1. Your job is to cook 3 cakes as efficiently as possible. Assuming that you only have one oven large enough to hold one cake, one large bowl, one cake pan, and one mixer, come up with a schedule to make three cakes as q ...

1 a tv channel has a bandwidth of 6 mhz if we send a

1. A TV channel has a bandwidth of 6 MHz. If we send a digital signal using one channel, what are the data rates if we use one harmonic, three harmonics, and five harmonics? 2. A signal travels from point A to point B. A ...

1 write a regular expression that finds all the words in a

1. Write a regular expression that finds all the words in a string that contain double letters, such as "deep" and "book". 2. Write a regular expression that finds all the header tags (, , etc.) in a Web page. 3. Write a ...

Secure encrypted communicationstransmitting personal and

Secure Encrypted Communications Transmitting personal and business data and information over secure communication channels is critical. In some cases it is required, especially when personally identifiable information is ...

1 in a very small as using ospf is it more efficient to use

1. In a very small AS using OSPF, is it more efficient to use only one single area (backbone) or several areas? 2. Why do you think we need only one RIP update message, but several OSPF update messages? 3. OSPF messages ...

Assignment1must be a 200-300 word responsesupporting

Assignment 1.) Must be a 200-300 word response Supporting Activity: Version Control Concerns Discuss the concerns of trying to maintain multiple baselines of your system. For example, Microsoft in 2015 announced they wou ...

Respond to t he following questions in one essay at least

Respond to t he following questions in one essay. At least three to four paragraphs for each question with examples is expected. Describe the term performance booster(s) and how it relates to a Virtual Teams There are th ...

Design an algorithm that solves the towers of hanoi problem

Design an algorithm that solves the Towers of Hanoi problem where are n disks and poles. For this configuration, your algorithm should exhibit linear rather than exponential behavior. Recursion is not necessary to solve ...

1 if a label in a connection-oriented service is 8 bits how

1. If a label in a connection-oriented service is 8 bits, how many virtual circuits can be established at the same time? 2. List the three phases in the virtual-circuit approach to switching. 3. Do we have any of the fol ...

Consider a developer who has both an isp workstation and a

Consider a developer who has both an ISP workstation and a devnet workstation on his desk, and who wants to move a program from the ISP workstation to the devnet workstation. a. Assume that the user is not allowed to mou ...

  • 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