We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>


Looking For Something at vustudents.ning.com? Click Here to Search

CS614 ALL Current Final Term Papers Fall 2016 & Past Final Term Papers at One Place from 25 February 2017 to 08 March 2017

CS614 ALL Current Final Term Papers Fall 2016 & Past Final Term Papers at One Place from 25 February 2017 to 08 March 2017

+ Click Here To Join also Our facebook study Group.

..How to Join Subject Study Groups & Get Helping Material?..


See Your Saved Posts Timeline

Views: 4173

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

Replies to This Discussion

Share Your Current Final Term Papers (Questions/Pattern) & Past Papers as well here to help each other. Thanks

 

Note:-

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

Or visit this link 

Click Here For Detail.

&

.•°How to Download past papers from study groups°•.

 

Please Click on the below link to see…

.... How to Find Your Subject Study Group & Join .... 

zain nasar thanks for sharing 

kio cs614 ka 25 feb ka ppr he share kr do

cs614 paper 25/2/2017

Mostly MCQS were from past papers..

Some subjective Questions that i remember, 

List down any 2 parallel hardware architecture? (2)

Answer:

Symmetric Multi  Processing (SMP)

Distributed Memory or Massively Parallel Processing (MPP)  Non-uniform Memory Access (NUMA)

list down any four ways to identify the session in World Wide Web? (2)

Answer:

1. Using Time-contiguous Log Entries
2. Using Transient Cookies
3. Using HTTP's secure sockets layer (SSL)
4. Using session ID Ping-pong
5. Using Persistent Cooki

What is Web Data Warehouse? (2)

Answer:

Web Warehousing can be used to mine the huge web content for searching information of interest.
It’s like searching the golden needle from the haystack. Second reason of Web warehousing is to
analyze the huge web traffic. This can be of interest to Web Site owners, for e-commerce, for eadvertisement and so on. Last but not least reason of Web warehousing is to archive the huge web
content because of its dynamic nature.

How time contiguous log entries and HTTP secure socket layer are used for user session
identification? What are the limitations of these techniques? (3)

Answer: 

A session can be consolidated by collecting time-contiguous log entries from the same host

(Internet Protocol, or IP, address). In many cases, the individual hits comprising a session can be
consolidated by collating time-contiguous log entries from the same host (Internet Protocol, or IP,
address). If the log contains a number of entries with the same host ID in a short period of time
(for example, one hour), one can reasonably assume that the entries are for the same session.
Limitations
This method breaks down for visitors from large ISPs because different visitors may
reuse dynamically assigned IP addresses over a brief time period.
Different IP addresses may be used within the same session for the same visitor.
This approach also presents problems when dealing with browsers that are behind some
firewalls.

Nested loop efficient way of accessing the inner table? (3)

Answer: 
Typically used in OLTP environment.
Limited application for DSS and VLDB
In DSS environment we deal with VLDB and large sets of data. Traditionally Nested-Loop join
has been and is used in OLTP environments, but for many reasons, such a join mechanism is not
suitable for VLDB and DSS environments. Nested loop joins are useful when small subsets of
data are joined and if the join condition is an efficient way to access inner table

Two tables were given one was employee table and other exception table with attribute
IsAgeValid. Sql query was required to find the outliers not having age between 26 and 75
and set the dirtyBit in exception table to 0?5 marks
Answer:
Select * From (Select * From Employee Where DirtyBit= 0)IsAgeValid Where (Age <26 And
>75))

Why students allowed by company to visit company data warehouse? (5)

Answer:

............

Bki yad nahii 

i suggest you to prepare these file
mine 80% paper come from these files

Remember me in your pray

Best Of Luck  

Attachments:

all mcq,s from past papers zain nasir and mooaz files
subjective
2=special indexing technique names
2= why water fall model is used .
2=ssl stand for
2=why analytic track is called fun part kuch ise thra tha statment yad nhe sahe
3=dense index sparse index
3=complete data warehouse deliverables
3=2 statment the btna ka k y kis topic me hen
1= measure of correctness of your model answe =accuacy
2= abality to the technique work accurtly even in conditions of noisy or dirty data answer=Robustness:
5= presedence constraint wala tha on success on failuer wala
5= table dia tha accurasy find krne the and gender se related kuch column ko set krna tha
5=name of three automatic data cleasing technique other than clustring.

areeba ***mcs*** thanks for sharing 

Attention Students: You don’t need to go any other site for current papers pattern & questions. Because all sharing data related to current Final term papers of our members are going from here to other sites. You can judge this at other sites yourself. So don’t waste your precious time with different links. Just keep visiting http://vustudents.ning.com/ for all latest updates.

areeba kon c files me sy ziyada ppr aya pls share file

Attachments:

Attachments:

thanks sis

Areeba agar app ka classified website project hai.  To reply karee. 

RSS

© 2019   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service