Saturday, May 14, 2011

ALL vu mid term current papers spring 2011 (may 2011)

Some Solved unsolved current mid term papers spring 2011 Updated links

For new Updates daily visit dis link http://vuscool.com/current-papers/


Remember me in ur Prayers

Note:
        Download Papers Without any Login Password no membership Ruquired..

MGT101 mid term current Solved Subjective...

Friday, February 18, 2011

all subjects current papers of final term fall2010 dated (February 2011)





















































more subject papers will be posted soon kindly visit this link daily  http://vuscool.com/current-papers for new current latest paper updates.

Friday, February 11, 2011

cs507 current final term papers fall2010

click here to see

Total Qs were 45 out of them 10 were subjective. 

short Qs which i have in my memory were 

Define data and information------ 2 marks 
attributes of ERP, eaplain______ 5 marks 
what are the change agents, explain their role in change------- 3 marks 
what factors are helpful for the successful implementation of 
cahnge.-------------- 3marks 
property issues regarding privacy------------ 3 marks 
what is ethics and code of ethics---------------------3 marks 
what are physical threats-------------- 3 marks 
the role of audit in MIS----------------- 3 marks 
input of risk determination--------------------- 2 marks 
risk variance ---------- 2 marks

Current final term papers fall2010


  here is some subjects today current papers link 


 cs201 current final term collection of papers









more subject papers will posted soon kindly visit this link daily  http://vuscool.com/current-papers for new current and latest papers updates.

Tuesday, February 1, 2011

cs402 GDB idea solution

Formal Languages set is superset of Regular Languages set"?


Solution:

·                     it can be accepted by a deterministic finite state machine.
·                     it can be accepted by a nondeterministic finite state machine
·                     it can be accepted by an alternating finite automaton
·                     it can be described by a formal regular expression. Note that the "regular expression" features provided with many programming languages are augmented with features that make them capable of recognizing languages which are not regular, and are therefore not strictly equivalent to formal regular expressions.
·                     it can be generated by a regular grammar
·                     it can be generated by a prefix grammar
·                     it can be accepted by a read-only Turing machine
·                     it can be defined in monadic second-order logic
·                     it is recognized by some finitely generated monoid
·                     it is the preimage of a subset of a finite monoid under a homomorphism from the free monoid on its alphabet

Second:
 A formal language is basically a set of words over some alphabet. A regular language is a formal language with specific constraints. you're saying "regular languages are a subset of formal languages".

Friday, January 28, 2011

VU Overseas Students new software installation Problem

AOA,

If any overseas Student have problem in Installing new Software then feel free to post under dis thread or contact wid me on my gmail id.


                    Post ur problem Click here
Regards,