Computer Science

Show that f1(n)+f2(n)= o(m4*(g1(n),g2(n)) where f1(n)= o(g1(n)) and f2(n)=o(g2(n))? o is small o asymptotic notation and question is related to time complexity

1. T(n)=3T(n/u)+nlogn 2. T(n)=2T(n/2)+n^3

Show that f1(n)+f2(n)= o(m4*(g1(n),g2(n)) where f1(n)= o(g1(n)) and f2(n)=o(g2(n))? o is small o asymptotic notation and question is related to time complexity

explain divide and conquer strategy that multiply two nxn matrices using O(n^3) operations. determine the precise number of multiplications and additions.

Ques.1 If P1/W1 is less than P2/W2...less than Pn/Wn, prove greedy generate optimal solution to knapsack prob.? Ques.2 time complexity of- for i:= 1 to n do for j:= i+1 to n do for k:= j+1 to n do z= z+1

find the optimal sequence and minimum number of operations required for the following chain matrix multiplication using dynamic programming. A(30,40) B(40,5) C(5,15) D(15,6)

how to find pixels required for generating a line from(0,0) to (10,5) initial calculation- x=0 y=0 Δx=x2-x1 = 10-0= 10 Δy=y2-y1, 5-0, 5→2Δy=10 m= Δy/Δx = 5/10 = 1/2 2Δy-2Δx = 10-20 = -10 first plot(0,0) now incrementing through main loop yields next plots. now how to find next plot. i am confuse here

show that f1(n)+f2(n)= o(m4*(g1(n),g2(n)) where f1(n)= o(g1(n)) and f2(n)=o(g2(n))? o is small o asymptotic notation and question is related to time complexity

time complexity of- for i:= 1 to n do for j:= i+1 to n do for k:= j+1 to n do if P1/W1 is less than P2/W2...less than Pn/Wn, prove greedy generate optimal solution to knapsack prob.

Hello everyone, I am making a webpage and. In photoshop i made a website layout. This is just a big rectangle image. Then i sliced it into a lot of smaller rectangles. This is the website layout: So I have s lot of images that are rectangles or squares and together they form a complete rectangle image. As you can see in the image below: I need an algorithm. The idea is that i can adjust the big rectangle width to any value i want and the small tiles rearange themselves. I have searched google, but i don't know where to start. I don't know what this type of algorithm is called in mathematical terms of if it even exists. Does anyone know something …

I'm currently choosing between two colleges and their programs. Both are in the computer and network security sector. My primary interests are: Privacy, Data/Information Assurance, Computer & Network Security, Penetration Testing, etc. DSU Teaches: SQL, JavaScript, HTML, XML, Visual Basic, Assembly Language and Linear Programming. It also goes in depth about Databases. Penn State Teaches: C++ and only a little about data. However, Penn State is the much more "known" college; yet I think DSU's program/course load looks better. Here's Penn State's Course List for their program: http://www.worldcampus.psu.edu/degrees-and-certificates/security-and-risk-an…

Hi!!! I want to use the value "age" at a program I have to write in C.... How must the value "age" be declared????As int or as float???Thank you!

Hey guys, just thought I'd bounce a random thought off of you. Since we can now "3D Print" on a molecular level, would it be possible to construct a body (crystalline maybe) using say Carbon G60 and other compounds to create multi-level data storage? I know there have already been advances in storing data in crystals, but from what I've read so far they are only on small discs. Maybe during the "construction" of such a thing different electrical pathways could be created by using different carbon molecules. Also while I have your attention, any thoughts behind using extremely dense carbon as a form of extreme heat-shielding?

The company I work for is trying to come up with a way to improve the connection between academic library researchers that want the paid or free content that the university or college provides, but might be working from a remote location. The workflow goes Researcher -> Library Catalog -> Proxy Server -> Content (paid or open). We want to use Open URL so the program goes faster. Any thoughts?

sigma i=1 upto n, i(i-1)= n(n-1)(n+1)/3

the adjacency list representation of a graph G, which has 7 vertices and 10 edges is, a:- d,e,b,g b:- e,c,a c;- f,e,b,d d:- c,a,f e:- a,c,b f:- d,c g:- a 1. show the tree produced by depth first search when it is run on the graph G, using vertex a as the source 2. In the DFS of item 1, show the edges of the graph G which is not present in DFS tree by dashed line

I am in urgent need of software that can be used to limit bandwidth to all computers on a local area network connected via a router. Preferably this software could be controlled from a single ('main') pc where I could set all necessary restrictions. I've been looking around but didn't find anything useful, if anyone has anything to suggest... feel free!

Right, I need some help from you CompSci guys out there. On early computers (IBM PC/XT/AT era), was MS-DOS dependent on BIOS interrupts to perform certain functions? Also, does this mean that the versions of DOS a computer could run is limited by whether or not a particular BIOS interrupt routine was available on the ROM? If this is true, I hope that there is a resource somewhere which lists the BIOS interrupts required for DOS to run, so that a BIOS could be designed around a particular version of DOS. Any clarification from anyone who knows more about software than I do would be fantastic.

can anyone help me in this question dnt need solution just make me understand the logic how to solve..please

For instance if x is one bit of information, how many similar bits (y) are necessary to describe x ? *It seem obvious that y > x, I just wanted to know had any rules been established. This would be done without using compression, predictions, sets or subsets, and each bit of information must be individually described. *Could a clone be considered as a valid description, in the physical or theoretical sense? Would this mean the smallest possible uncompressed description of a system can be no smaller than the system itself. Btw I know very little about computer science, physics or maths so a link to a '________ for dummies' site would not be considered inapp…

I'm learning machine code. My questions are: 1) What is an accumulator? 2) What does the following statement mean, in simpler form? "The machine instruction to add 1 to the value in accumulator A is 01001100."

"An individual machine code is called a machine instruction." What does "individual machine" code mean, what does that do? Please don't give me links, I came on a forum for answers, I can find my own links. Thanks!

There are 5 parameters, R1-R5, with the following relation R1<R2<R3<R4<R5. An algorithm assigns some values to these parameter (P1,P2,P3,P4,P5) which are not so important as it is the relation between them (P3<P1<P2<P4<P5). Is there any way to quantify the difference between the inequality R1<R2<R3<R4<R5 and P3<P1<P2<P4<P5, where Pi is the predicted value of the parameter Ri? thanks, Thomas

>:DIs it possible to take an image 3.5 Mb and convert it to kilobytes. Also. Is it possible to free up memory on a compter?

Cryptography and Network Security by Atul Kahate