Programming & Computer Science Answers

C++ 9913
Python 5288
Java | JSP | JSF 3611
C 1680
C# 1362
Computer Networks 989
Algorithms 652
Databases | SQL | Oracle | MS Access 641
HTML/JavaScript Web Application 588
Other 537
Visual Basic 358
Assembler 209
Software Engineering 202
AJAX | JavaScript | HTML | PHP 166
MatLAB 150
MatLAB | Mathematica | MathCAD | Maple 124
Action Script | Flash | Flex | ColdFusion 112
UNIX/Linux Programming 89
Web Development 73
Excel 36
ASP | ASP.NET 23
Delphi | Pascal 21
Perl 16
Prolog 9
Functional Programming 9
MathCAD 5
Wolfram Mathematica 4
WPF 4
Ruby | Ruby on Rails 3
NodeJS Web Application 2

Questions answered by Experts: 26 876

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Search

Alice and Bob were buying some chocolates. It was Alice's turn today to buy Bob chocolates. Bob gives Alice A of N chocolates where A[i] denotes price of ith chocolates. Bob allows him to remove some chocolates whose price is X



Please Copy your MVC Application Created in Question 2 and Paste it in anther Folder named Question 3. 1. Allow User to Register Themselves by using Asp.net Identity. 2. Allow Users to Login by using Asp.net Identity. 3. Create Two Roles 1. Teacher 2. Student in your application using asp.net identity. 4. Teacher Role should no be able to access Student Controller and Student Role Should not be able to access Teacher Controller. 5. Allow users to login via their facebook, twitter, linked in, gmail and Microsoft account


As information centers are progressively centered on energy efficiency, it gets to be imperative to create Low control usage of the different applications that run on them. Data or Information compression plays a basic part in information centers to reduce storage capacity and communication costs. This work pivot on building a Low control, High performance execution usage for canonical Huffman encoding.

 

Suppose given Letters I, Q, R, A, C, M, P, U, S with following frequencies.       

           

                                  Frequency Table

                       Character          Frequency       

                               I                          20                  

                                   Q                       11                 

                                   R                        8                    

                                   A                        12                  

                                   C                         49

                                   M                           10

                                    P                            5

                                    U                           5

                                    S                           33

                                                       

 A.    Create a Single Huffman tree to determine the Binary codes for each character.

B.     Encode the following secret message sequence using Huffman encoding scheme.

   “IQRACAMPUS”

C. Compress and encode the given Information using Huffman coding Scheme.

    “STAY HOME STAY SAFE”  

Mr. Akbar is senior software developer working on an ecommerce website he wants to add the following products on his website with following keys

Mouse 4614

Keyboard 5882

Cable 6713

Webcam 4409

Monitor 1825

To make searching better he asked his junior to find the 2 digit hash address of products by following techniques and share results with him 

a) Division method with m=97

b) Mid square method

c) Folding method without reversing

d) Folding method with reversing


Draw a binary search tree and AVL tree from the following traversals:

{15, 5, 20, 70, 3, 10, 60, 90, 16}

·        Delete 15 and re-draw both Binary Search Tree and AVL Tree drawn in given traversal.

·        Reverse path of Binary Search Tree drawn

·        Convert Binary Search Tree into Binary Tree such that sum of all greater keys is added to every key.

·        Write a code to Convert Binary Search Tree drawn into Balanced Binary Search Tree


An array A[0..n-1] is sorted using the merge-sort algorithm. The worst case and the best case running time of this computation respectively are


Suppose a business person launches new cinema at Islamabad and ask his team to develop a ticket system for box office. He assigns some requirements about system that how should it work. The requirements are such a way that there are only '5' number of box office windows in the theatre. Each window can have at max '20' number of people waiting in line. To start with, only one window is opened. If the number of people waiting in line in that window exceeds 20, then the next window is opened and people can join the line in that window. Likewise, if both the first and second windows have n number of people waiting in each queue, then a third window is opened. This can go on until the maximum number of windows w is reached. Let us assume that once a window is opened it never closes. A new window is only opened if all open windows are full. Each person can buy only one ticket. So, the system should not allot more than one ticket per person. Let us assume that the system issues one ticket each across all open windows. When a ticket is issued, the count of the number of people in each open queue is reduced by 1.

When a new person has to join the queue, the system has to prompt him to join a queue such that they are issued a ticket as fast as possible. The system prompts the person based on these factors: o First it looks for an open window with the least number of people and prompts that window number. If more than one window has the least number of people, then the system can prompt the person to join the first window (smaller window ld) it encounters with the least number of people. If the queues of all open windows are full and a new window can be opened, then the new person is prompted to join the new queue for the new box office window. O If all queues for all windows are full, a corresponding message is displayed. That person need not be considered in the next iteration .After a queue is prompted to a person, the person or system cannot change the queue.

Implement the system based on above scenario in java using suitable data structure.



Use the function written in the last lesson to calculate a student's GPA. Ask them how many classes they are taking, then ask them to enter the grades for


each class and if it is weighted.


Your program should then output the averaged GPA including the decimal


place.


Your main program must call the function.


Sample Run


HOw many classes are you taking? 7


Enter your Letter Grade: C

Is it weighted? (1 = yes) 1

Your GPA Score is: 3


Enter your Letter Grade: D

Is it weighted? (1 = yes) 0

Your GPA Score is: 1


Enter your Letter Grade: A

Is it weighted? (1 = yes) 1

Your GPA score is: 5


Enter your Letter Grade: B

Is it weighted? (1 = yes) 1

Your GPA Score is: 4


Enter your Letter Grade: C

Is it weighted? (1 = yes) 0

Your GPA Score is: 2


Your weighted GPA is a 3.0



i dont know how to code an animation for computer programming. In this assignment, you will use all of the graphics commands you have learned to create an animated scene. Your program should have a clear theme and tell a story. You may pick any school-appropriate theme that you like.

The program must include a minimum of:

  • 5 circles
  • 5 polygons
  • 5 line commands
  • 2 for loops
  • 1 global variable

Q.4. Answer the following as SQL queries. Also write corresponding relational algebra expression:                                                                                                                 

           a. Number of rakats prayed as Qaza by each person

           b. How many females have skipped fajar salah on 1st shawwal

           c. How many salah are missed by Mr. Noman

           d. Average time M. Noman takes for praying Isha Salah

           e. Which salah is missed mostly by M. Saleem

           f. Which salah is missed the second most by all people



LATEST TUTORIALS
APPROVED BY CLIENTS