Admin use case diagram

-

Comments

Post a Comment

Popular posts from this blog

Data structure mcq

-
The memory address of the first element of an array is called a. floor address b. foundation address c. first address d. base address The memory address of fifth element of an array can be calculated by the formula a. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array b. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array c. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array d. None of above Which of the following data structure can't store the non-homogeneous data elements? a. Arrays b. Records c. Pointers d. None Which of the following data structure store the homogeneous data elements? a. Arrays b. Records c. Pointers d. None Which of the following is not the required condition for binary search algorithm? a. The list must be sorted b. there should be the direct access to the middle element in any sublist c. ...
Read more

Normal form

-
Logical Paradigms in Computing Normal Forms (Continue…) Conjunctive normal forms and validity An algorithm which always computes the same output CNF for a given input φ. This algorithm, called CNF, should satisfy the following requirements: 1. CNF terminates for all formulas of propositional logic as input. 2. For each such input, CNF outputs an equivalent formula. 3. All output computed by CNF is in CNF. If a call of CNF with a formula φ of propositional logic as input terminates, which is enforced by (1), then (2) ensures that ψ ≡ φ holds for the output ψ. Thus,(3)guarantees that ψ is an equivalent CNF of φ. So φ is valid iff ψ is valid. If formula φ is an input then first we have to translate all implications in φ by replacing all sub formulas of the form ψ → η by ¬ψ ∨ η. This is done by a procedure called IMPL FREE. The application of IMPL FREE might introduce double negations into the output formula. If we want to compute a CNF for ¬φ from a CNF for φ then just translate ¬φ as an...
Read more

Semantics of LTL

-
A transition system M=(S,→,L) is a set of states S endowed with a transition relation → (a binary relation), such that every s ∈ S has some s’∈ S with s → s’, and a labeling function L: S →P(Atoms). Transition systems are also simply called models. a model has a collection of states S, a relation →,saying how the system can move from state to state, and, associated with each state s, one has the set of atomic propositions L(s)which are true at that particular state. L is that it is just an assignment of truth values to all the propositional atoms. A transition system has more than one state, so this assignment depends on which state s the system is in: L(s) contains all atoms which are true in state s. All the information about a (finite) transition system M always be figured by using directed graphs whose nodes (which we call states) contain all propositional atoms that are true in that state. For example, if our system has only three states s0, s1 and s2; if the only possible transit...
Read more