Explore BrainMass

Programming Languages

What are the common problems in running an effective team meeting? Briefly describe five such problems and suggest ways to resolve them.

Design a flow chart looping the program code

//student name #include <stdio.h> main () { //declare variables float fStore1=.0725; //use floats due to possibility of using decimals float fStore2=.075; //here is where taxes are hard coded in the program float fStore3=.0775; int iStore=0; float fPurchase=0.0; float fTax=0.0; float f

Computer Programming

1. An aspect of the preferred process for almost all formal software development approaches is to do some design before coding. One of the design artifacts you are asked to use in this course is a flow chart. What challenges have you (and / or your learning team) encountered in going from an English statement of the problem to a

Multiple senders CDMA

Suppose that the receiver in figure (attached) wanted to receive the data being sent by sender 2. Show (by calculation) that the receiver is indeed able to recover sender 2's data from the aggregate channel signal by using sender 2's code.

Automata and Computability

Prove that, if A is a regular language, a family of family programs B1, B2, ... exists wherein each Bn accepts exactly the strings in A of length n and is bounded in size by a constant times n. See attached file for full problem description.

Automata and Computability

A Boolean formula is a Boolean circuit wherein every gate has only one output wire. The same input variable may appear in multiple places of a Boolean formula. Prove that a language has a polynomial size family of formulas if it is in NC1. Ignore uniformity considerations. See attached file for full problem description.

Proof by contradiction

Show the error in the following fallacious "proof" that P &#61625; NP. Proof by contradiction. Assume that P = NP. Then SAT &#61646; P. So, of some k, SAT &#61646; TIME(nk). Because every language in NP is polynomial time reducible to SAT, NP &#61645; TIME(nk). Therefore P &#61645; TIME(nk). But, by the time hierarchy the

Testing for Useless States in Pushdown Automata

A useless state in a pushdown automaton is never entered on any input string. Consider the problem of testing whether a pushdown automaton has any useless states. Formulate this problem as a language and show that it is decidable.

Automata and Computability

Show that the collection of decidable languages is closed under the operations of a. union. b. concatenation. c. star. d. complementation. e. intersection

Automata and Computability for Pumping Length

Consider the language B = L (G), where G is the grammar given in Exercise 2.13 (page 121). The pumping lemma for context-free languages, Theorem 2.19 (page 115), states the existence of a pumping length p for B. What is the minimum value of p that works in the pumping lemma? Justify your answer.

Automata and Computability NOPREFIX

Say that string x is a prefix of string y if a string z exists where xz = y and that x is a proper prefix of y if in addition x &#61625; y. In each of the following parts we define an operation on a language A. Show that the class of regular languages is closed under that operation. a. NOPREFIX (A) = {w &#61646; A| no prope

Normalizing your Data Base to the Third Normal Forum

Normalize to the 3NF the following collections of data attributes, Write the normalized entities in the correct format and underline the attributes which form the primary key(s). Make whatever assumptions that you need to, but document your assumptions. 1) Video Tapes (Title, Director, Actors, Date, Music Tracks, Duration, Th

Super keyword in Java

Read this article from the Sun website: Concerning classes and inheritance. Why is the super keyword so important? Present examples of how inheritance can be found in real-life situations

Establishing table structure

You are now going to create the final table list for Fernando's Skate Shop. Use the following preliminary field list and list of subjects to get started. Realize that the lists are incomplete and you may need to add more information as necessary by inferring data from what you know about the case. Be sure to provide a rationale

Run Length Encoding of a Bit Sequence

(a) Encode the following bit sequence using run-length encoding with 4-bit codes eighteen zeroes, 11, fifty-six zeroes, 1, fifteen zeroes, 11. (b) Encode the same sequence using run-length encoding with 5-bit codes (c) Compare the two codes. Comment on two choices.

What is RSS?

What is RSS? Describe a real-world application that uses RSS.


Mr. Oldie wants to share his wisdom too, but on a different topic: "These OO-guys looked at hardware assembly and car assembly mechanisms and dreamed that they can do it in software. They aimed for the moon using OO paradigm, but they ended up in clouds! OOD/OOP does not really make such "stand-alone" components that fit togethe

Could a function also be called an inheritance?

In computer programming would you say that a function could also be called an inheritance product due to the reuse of it in the program? A while loop that calls the function once the statement is true can be used over and over. What do you think?

Object Oriented System Design with UML

? Build use case diagrams and write use case descriptions ? Build class diagrams for static system modeling ? Build collaboration and sequence diagrams for dynamic system modeling Aims This assignment aims to establish a basic familiarity with the object-oriented system design and the use of UML for system modelling Ob

Development of software

Give an example of how efforts in the development of software can pay dividends later in software maintenance.

longest consecutively numbered string of bytes

Find the address where the longest consecutively numbered string of bytes begins. Consecutive bytes are defined as those that differ by the number 01. For example, the bytes 39h, 3Ah, 3Bh, 3Ch, 3Dh, 3Eh, 3Fh, and 40h for a string of 7 consecutive bytes. Put the winning address in register DX, and the length of the string (in

Convert Binary Number Registries

Convert any binary number found in register AX to the equivalent ASCII code for each hexadecimal nibble in AX. Place the ASCII code for the hexadecimal number in AX starting at offset location 0000. Example: AX = 3030 ;ASCII for 00 [0800] = 41h after conversion (ASCII A) Note: Please write in assembly language progr

Question about Reusable Code

You realize that the code you had created can be reused for many other purposes for future programs. You decide to create a library for your reusable code. Using the pseudocode for the program, you identify the aspects of the program that can be reusable and write/rewrite it so it can be reused. You rewrite your pseudocode to im

Finite-state automata

Hi, I'm looking for a FSA (Finite State Acceptor) for all binary strings containing an odd number of 0's. A state diagram is the easiest for me to understand. A valid regular expression to describe the language (I've verified this) is 1*0(1+01*0)* Thanks!