Posts made by moaaz

Please share your current paper

Browse and transfer files between your Mac computer and your Android device.

Download now

Supports macOS 10.7 and higher.

How to use it

• Download the app.
• Open AndroidFileTransfer.dmg.
• Drag Android File Transfer to Applications.
• Use the USB cable that came with your Android device and connect it to your Mac.
• Double click Android File Transfer.
• Browse the files and folders on your Android device and copy files.

@gpulch
humm thanks for providing useful information.
@zareen please check that one and try to use this way!

@gpulch
this solution may be crate the security issue?

@moaaz said in CS502 Quiz 2 Solution and Discussion:

What general property of the list indicates that the graph has an isolated vertex?

The Isolated vertex is not handled in list.

What general property of the list indicates that the graph has an isolated vertex?

• There is Null pointer at the end of list.

• The Isolated vertex is not handled in list.

• Only one value is entered in the list.

• There is at least one null list.

@moaaz said in The Huffman algorithm finds for?:

Optimal

If optimal is measured by average code word length, Huffman’s algorithm gives optimal codes, and the redundancy can be measured as the difference between the average code word length and Shannon’s entropy. If the objective function is replaced by an exponentially weighted average, then a simple modification of Huffman’s algorithm gives optimal codes. The redundancy can now be measured as the difference between this new average and Renyi’s generalization of Shannon’s entropy. By decreasing some of the codeword lengths in a Shannon code, the upper bound on the redundancy given in the standard proof of the noiseless source coding theorem is improved. The lower bound is improved by randomizing between codeword lengths, allowing linear programming techniques to be used on an integer programming problem. These bounds are shown to be asymptotically equal, providing a new proof of Kricevski’s results on the redundancy of Huffman codes. These results are generalized to the Renyi case and are related to Gallager’s bound on the redundancy of Huffman codes.

► Optimal
► Non-optimal
► Exponential
► Polynomial

@moaaz said in What is generally true of Adjacency List and Adjacency Matrix representations of graphs?:

• Lists require less space than matrices but take longer to find the weight of an edge (v1,v2)

In graph theory and computer science, an adjacency list is a collection of unordered lists used to represent a finite graph. Each list describes the set of neighbors of a vertex in the graph. This is one of several commonly used representations of graphs for use in computer programs.

@cyberian
How many days they will be keep in Redemption Period? and they will be charge extra fee to renew it.

We registered a domain, after 60 days domain registrar asking for redemption grace period Fee?

This domain is currently in the so-called Redemption Grace Period. The redemption period is a domain registry period that a domain name enters into usually 30 days after its official expiration date. During the 30-45-day redemption period, the original domain registrant is allowed to retrieve the domain name at an additional fee as defined by the domain registry.

@Anonymous-Person-2
It’s up and working fine for me. its not web promotion its re marketing to help students to build that project, we have Mobile application, but we are in testing phase will be launched soon!

@Anonymous-Person-2
Chat.cyberian.pk

A graph is not connected if every vertex can reach every other vertex. CS502

• True
• False Page No. 116

A graph is said to be acyclic if it contains no cycles. A graph is connected if every vertex can reach every other vertex. A directed graph that is acyclic is called a directed acyclic graph (DAG).

In strong components algorithm, first of all DFS is run for computing finish times of vertices. CS502

• True Page No.138
• False

This is presented in Figure 8.37. Recall that the component DAG consists of super vertices.