Wednesday, February 20, 2013

.::VULMSIT::.eNoxel.com CS408 - FINAL TERM SUBJECTIVE WITH REFERENCE SOLVED BY UMAIR SAULAT

CS408- Human Computer Interaction

Solved Subjective Fall Semester 2012

 QNo.1   it has been observed that most computer users use menu option for input instead of keyboard accelerator. What is the reason behind it? (2 Marks)

Answer:-

1.       Menu options are easier to find.

2.       You don't have to memories the keys for menu option but for key board accelerators you have to memories them

REF:: Handouts Page No. 127

 

QNo.2   Define active intervention.  (2 Marks)

Answer:-

Active intervention with the participant and actively probes the participant understands of whatever is being tested.

REF:: Handouts Page No. 276

QNo.3   what is Ubiquitous Computing? (2 Marks)

Answer:-

The most profound technologies are those that disappear. They weave themselves into the fabric of everyday life until they are indistinguishable from it. These words have inspired a new generation of researchers in the area of ubiquitous computing

REF:: Handouts Page No. 140

 

QNo.4   which display device is very cheap and has fast enough response time for rapid animation with high color compatibility? (2 Marks)

Answer:-

The CRT is a cheap display device and has fast enough response times for rapid animation coupled with a high color capability.

REF:: Handouts Page No. 119

 

QNo.5   By breakdown Skelton plane into its component elements then how all piece fit together to create this as whole user experience? (3 Marks)

Answer:-

Beneath that surface is the skeleton of the site: the placement of buttons, tabs, photos, and blocks of text. The skeleton is designed to optimize the arrangement of these elements for maximum effect and efficiency

REF:: Handouts Page No. 306

 

QNo.6   Explain Meta data in term of data processing.  (3 Marks)

Answer:-

In data processing, meta-data is definitional data that provides information about or documentation of other data managed within an application or environment

REF:: Handouts Page No. 406

QNo.7   suppose you are a system analyst, with your work experience, briefly describe when it is useful to observe in contrast to observation process? (3 Marks)

Answer:-

Being a system analyst, Early in design, observation helps designers understand users' needs. Other types of observation are done later to examine whether the developing prototype meets users' needs.

REF:: Handouts Page No. 361

 

QNo.8   Describe any five usability goals of Internet Explorer. (5 Marks)

Answer:-

Usability is broken down into the following goals:

1.       Effective to use (effectiveness)

2.       Efficient to use (efficiency)

3.       Safe to use(safety)

4.       Have good utility (utility)

5.       Easy to learn (learnability)

 

1.       Effectiveness

It is a very general goal and refers to how good a system at doing what it is suppose to do.

2.       Efficiency

It refers to the way a system supports users in carrying out their tasks.

3.       Safety

It involves protecting the users from dangerous conditions and undesirable situations. In relation to the first ergonomics aspect, it refers to the external conditions where people work.

4.       Utility

It refers to the extent to which the system provides the right kind of functionality so that user can do what they need or want to do

5.       Learnability

It refers to how easy a system is to learn to use. It is well known that people do not like spending a long time learning how to use a system

REF:: Handouts Page No. 31

QNo.9   when observation is useful and how to observe?  (5 Marks) 

Answer:-

Observing is useful at any time during product development. Early in design, observation helps designers understand users' needs.

How to observe

The same basic data-collection tools are used for laboratory and field studies (i.e., direct observation, taking notes, collecting video, etc.) but the way in which they are used is different. In the laboratory the emphasis is on the details of what individuals do, while in the field the context is important and the focus is on how people interact with each other, the technology, and their environment. Furthermore, the equipment in the laboratory is usually set up in advance and is relatively static whereas in the field it usually must be moved around. In this section we discuss how to observe, and then examine the practicalities and compare data-collection tools.

REF:: Handouts Page No. 361

QNo.10 Difference between Semi-structure interview and focus group interview. (5 Marks)

Answer:-

Semi-Structure Interview

Focus Group Interview

·         Semi-structured, interviews combine features of structured and unstructured inter views and use both closed and open questions.

·         Use of pre-determined questions provides uniformity

·         Requires some level of training or practice in order to prevent interviewer suggesting answers

·          It also allows respondents to discuss and raise issues that you may not have considered

·         One form of group interview is the focus group that is frequently used in marketing, political campaigning, and social sciences research.

·         Normally three to 10 people are involved.

·         Focus groups are also attractive because they are low-cost, provide quick results, and can easily be scaled to gather more data.

·         A preset agenda is developed to guide the discussion

REF:: Handouts Page No. 373

QNo.10 Differentiate between Visual Art and Visual Design?

Answer:-

Visual Art

Visual Design

·         Visual art is art such as paintings, photographs, sculptures,

·         The term visual art separates those kinds of art from music, dance, and drama. 

·         It is two-dimensional. Visual arts are things like paintings, drawings, visual designs, photography, and computer art.

·         There is no "designing" for a purpose; it's just creating something visually appealing.

·         Visual design is the way a piece of artwork, a room, yard, video game, photo or other artistic subject is composed and appeals to the human eye

·          Photoshop designs for each page, page type, module within an app/site/software.

·         Creates or contributes to style guides detailing how everything looks and how it fits into the larger strategy.

QNo.11 which theory claimed Problem solving is both productive and reproductive what are controlled vocabularies?

Answer:-

Gestalt theory

Gestalt psychologists were answering the claim, made by behaviorists, that problem solving is a matter of reproducing known responses or trial and error. This explanation was considered by the Gestalt school to be insufficient to account for human problem solving behavior.

REF:: Handouts Page No. 91

 QNo.12 how active intervention technique performed?

Answer:-

Active intervention is particularly useful early in design. It is an excellent technique to use with prototypes, because it provides a wealth of diagnostic information. It is not the technique to use; however, if your primary concern is to measure time to complete tasks or to find out how often users will call the help desk. To do a useful active intervention test, you have to define your goals and concerns, plan the questions you will use as probes, and be careful not to bias participants by asking leading questions.

REF:: Handouts Page No. 276

QNo.13 Application software implemented in file system model?

Answer:-

Software implemented in the file system model: Our software is already designed and built that way, and users are used to it neither of these arguments is valid. The first one is irrelevant because new programs written with a unified file model can freely coexist with the older implementation model applications. The underlying file system doesn't change at all. In much the same way that toolbars quickly invaded the interfaces of most applications in the last few years, the unified file model could also be implemented with similar success and user acclaim.

 

The second argument is more insidious, because its proponents place the user community in front of them like a shield. What's more, if you ask users themselves, they will reject the new solution because they abhor change, particularly when that change affects something they have already worked hard to master — like the file system. However, users are not always the best predictors of design successes, especially when the designs are different from anything they've already experienced,

REF:: Handouts Page No. 330

 

QNo.14 explain metadata in term of data processing

Answer:-

In data processing, meta-data is definitional data that provides information about or documentation of other data managed within an application or environment.

 

For example:-

Meta-data would document data about data elements or attributes (name, size, data type, etc) and data about records or data structures (length, fields, columns, etc) and data about data (where it is located, how it is associated, ownership, etc.).

REF:: Handouts Page No. 406

QNo.15 Point out the problem with Excise task?

Answer:-

The problem with excise tasks is that the effort we expend in doing them doesn't go directly towards accomplishing our goals. Where we can eliminate the need for excise tasks, we make the user more effective and productive and improve the usability of the software.

REF:: Handouts Page No. 246

 

QNo.16 Define controlled Vocabularies?

Answer:-

Vocabulary control comes in many shapes and sizes. At its most vague, a controlled vocabulary is any defined subset of natural language. At its simplest, a controlled vocabulary is a list of equivalent terms in the form of a synonym ring, or a list of preferred terms in the form of an authority file.

REF:: Handouts Page No. 407

QNo.17 Write principles to prevent user privacy?

Answer:-

Most previous evaluations in human-computer interaction, these studies can be done without users knowing that they are being studied. This raises ethical concerns, chief among which are issues of privacy, confidentiality, informed consent, and appropriation of others' personal stories (Sharf, 1999). People often say things online that they would not say face to face.

REF:: Handouts Page No. 268

QNo.18 what is Scope Plane in context of elements of user experience?

Answer:-

On the software side, the strategy is translated into scope through the creation of functional specifications: a detailed description of the "feature set" of the product. On the information space side, scope takes the form of content requirements: a description of the various content elements that will be required. Now we can map that whole confusing array of terms into the model. By breaking each plane down into its component elements, we'll be able to take a closer look at how all the pieces fit together to create the whole user experience.

REF:: Handouts Page No. 308

 

QNo.19 by breaking down Skeleton plane into its component elements then how all the pieces fit together to create this as a whole user experience?

Answer:-

The skeleton plane breaks down into three components.

  1. On both sides, we must address information design:

The presentation of information in a way that facilitates understanding.

  1. For software products:

The skeleton also includes interface design, or arranging interface elements to enable users to interact with the functionality of the system.

  1. The interface for an information space is its navigation design:

The set of screen elements that allow the user to move through the information architecture

REF:: Handouts Page No. 308

QNo.20 what "function" will create a copy of the original document in MS Word?

Answer:-

The word snapshot makes it clear that the copy is identical to the original, while also making it clear that the copy is not tied to the original in any way. That is, subsequent changes to the original will have no effect on the copy.

REF:: Handouts Page No. 326

 

QNo.21 Define Strategy and Scope planes?

Answer:-

Strategy Planes

The scope is fundamentally determined by the strategy of the site. This strategy incorporates not only what the people running the site want to get out of it but what the users want to get out of the site as well. In the case of our bookstore example, some of the strategic objectives are pretty obvious: Users want to buy books, and we want to sell them. Other objectives might not be so easy to articulate.

Scope planes

On the software side, the strategy is translated into scope through the creation of functional specifications: a detailed description of the "feature set" of the product. On the information space side, scope takes the form of content requirements: a description of the various content elements that will be required.

REF:: Handouts Page No. 307, 308

 

QNo.22 Usability tests?

Answer:-

In most usability tests, you have one participant at a time working with the product. You usually leave that person alone and observe from a corner of the room or from behind a one-way mirror.

REF:: Handouts Page No. 275

 

QNo.23 Identify the main components that make up a global navigation system in context of a web.

Answer:-

Web designers use the term penitent navigation (or global navigation) to describe the set of navigation elements that appear on every page of a site, Persistent navigation should include the five elements you most need to have on hand at all times.

  1. The Home page.
  2. Forms.
  3. Site ID
  4. The Sections
  5. The Utilities

REF:: Handouts Page No. 287,288

 

QNo.24 You are a software engineer and design different applications that are usable for users without modifications. How do you define accessibility with respect to emerging paradigm? (5)

Answer:-

Accessibility is a general term used to describe the degree to which a system is usable by as many people as possible without modification. It is not to be confused with usability which is used to describe how easily a thing can be used by any type of user. One meaning of accessibility specifically focuses on people with disabilities and their use of assistive devices such as screen-reading web browsers or wheelchairs.

REF:: Handouts Page No. 408

 

QNo.25 Suppose you are an HCI specialist, what do you think that evaluation of design or product is beneficial? Justify your point of view. (5 marks)

Answer:-

HCI specialists test design ideas on real users and use formal evaluation techniques to replace intuition in guiding design. This constant reality check improves the final product.

o most effectively develop programs and products designed to meet customer needs, all operations are strongly science based. For example, our research and development teams emphasize improving rearing methodologies for current and new products, designing consistently significant quality control evaluations, improving natural enemy delivery methodologies and developing technologies for field population monitoring. Our science-based efforts are the best means to achieve and maintain the highest standards of program and product quality.

  1. Problems are fixed before the product is shipped, not after.
  2. The team can concentrate on real problems, not imaginary ones.
  3. Engineers code instead of debating.
  4. Time to market is sharply reduced.
  5. Finally, upon first release, your sales department has a rock-solid design it can sell without having to pepper their pitches with how it will all actually work in release 1.1 or 2.0.

REF:: Handouts Page No. 21,257

 QNo.26 Match the following regarding Goal-Directed Design (5marks)

A

B

Research

Users and use Context

Modeling

Definition of user, business& technical needs

Requirements

Definition of design structure & flow

Framework

Of behavior, form & content

Refinement

User and the Domain

Answer:-

 

A

B

Research

User and the Domain

Modeling

Users and use Context

Requirements

Definition of user, business& technical needs

Framework

Definition of design structure & flow

Refinement

Of behavior, form & content

REF:: Handouts Page No. 155

 

QNo.27 Suppose you are creating an account on yahoo, fill all the required information but forget to retype password. As you click on submit button a warning is message appears "This information is required" on retype password field. Yahoo suggests that your registration will not be submitted until you retype password. Explain this specific characteristic of considerate software.(3 marks)

Answer:-

It ensures there are no mistakes while typing the password because retyping matches and makes sure you do not make a mistake. You can type an error password once but not twice. This is a security check and it's good for user.

 

QNo.28 you are assigned to perform trunk test on website "amazon.com". Write down all the necessary steps to perform the trunk test.(3 marks)

Answer:-

Imagine that you've been blindfolded and locked in the trunk of a car, then driven around for a while and dumped on a page somewhere deep in the bowels of a Web site. If the page is well designed, when your vision clears you should be able to answer these questions without hesitation:

  1. What site is this? (Site ID) amazon.com
  2. • What page am I on? (Page name)
  3. • What are the major sections of this site? (Sections)
  4. • What are my options at this level? (Local navigation)
  5. • Where am I in the scheme of things? ("You are here" indicators)
  6. • How can I search?

REF:: Handouts Page No. 296


QNo.29 I am working on a web site and have designed a home page. The information I added does not

fit into screen size of computer. I do not want to remove any data from this page. Is this any solution that all data can be shown to user?(3 marks)

Answer:-

Tabs can be used to group related data under one heading and then creating different sections. Scroll bars can be used for data which does not fit on one screen. Different sections can be created with a heading and some content given on main page with a "Read More" indicator. This will take user to a new page if user is interested in reading more.

 

QNo.30 Suppose you are a web developer. While designing web applications you use metadata tags in your application that make efficient search? Briefly explain metadata and its purpose in web site. (3 marks)

Answer:-

A web site is a collection of interconnected systems with complex dependencies. A single link on a page can simultaneously be part of the site's structure, organization, labeling, navigation, and searching systems. It's useful to study these systems independently, but it's also crucial to consider how they interact. Reductionism will not tell us the whole truth.

REF:: Handouts Page No. 406


QNo.31 Suppose you are an HCI specialist and have to perform the usability testing for those products

that do not even have to involve any hardware or software. Which usability testing techniques you will use in this case. (2 marks)

Answer:-

Usability testing was the dominant approach in the 1980s (Whiteside et al., 1998), and remains important, although, as you will see, field studies and heuristic evaluations have grown in prominence. REF:: Handouts Page No. 259

 

QNo.32 Which screen display when user launches the program and first loads into the memory?(2 marks)

Answer:-

A splash screen is a dialog box displayed when a program first loads into memory. Sometimes it may just be the about box or Identity box, displayed automatically, but more often publishers create a separate splash screen that is more engaging and visually exciting

REF:: Handouts Page No. 398

 

 

QNo.33 what is the mean by life cycle of module? Why they are used in software development.

Answer:-

Understanding what activities are involved in interaction design is the first step to being able to do it, but it is also important to consider how the activities are related to one another so that the full development process can be seen. The term lifecycle model is used to represent a model that captures a set of activities and how they are related.

SDLC stands for Software Development Life Cycle. A Software Development Life Cycle is essentially a series of steps, or phases, that provide a model for the development and lifecycle management of an application or piece of software. The methodology within the SDLC process can vary across industries and organizations, but standards such as ISO/IEC 12207 represent processes that establish a lifecycle for software, and provide a mode for the development, acquisition, and configuration of software systems

REF:: Handouts Page No. 149

http://www.veracode.com/security/software-development-lifecycle

QNo.34 Explain the concept of Attentive environment?

Answer:-

Attentive environments are environments that are user and context aware. One project which explores these themes is IBM's Blue Eyes research project is chartered to explore and define attentive environments.

software, and provide a mode for the development, acquisition, and configuration of software systems

REF:: Handouts Page No. 418

QNo.34 Explain the following planes of conceptual framework for development interactive

product

• The structure plane

• The strategy plane

Answer:-

·         The structure plane

The skeleton is a concrete expression of the more abstract structure of the site. The skeleton might define the placement of the interface elements on our checkout page; the structure would define how users got to that page and where they could go when they were finished there. The skeleton might define the arrangement of navigational items allowing the users to browse categories of books; the structure would define what those categories actually were.

 

·         The strategy plane

The scope is fundamentally determined by the strategy of the site. This strategy incorporates not only what the people running the site want to get out of it but what the users want to get out of the site as well. In the case of our bookstore example, some of the strategic objectives are pretty obvious: Users want to buy books, and we want to sell them. Other objectives might not be so easy to articulate.

REF:: Handouts Page No. 306 ,307

 

 

QNo.35 What are good reasons for investing in user testing which are points out by tognazzini

Answer:-

Tognazzini points out that there are five good reasons for investing in user testing:

1.       Problems are fixed before the product is shipped, not after.

2.       The team can concentrate on real problems, not imaginary ones.

3.       Engineers code instead of debating.

4.       Time to market is sharply reduced.

  1. Finally, upon first release, your sales department has a rock-solid design it can sell without having to pepper their pitches with how it will all actually work in release 1.1 or 2.0.

REF:: Handouts Page No. 257

 QNo.36 How navigation excised justify your answer?

Answer:-

The most important thing to realize about navigation is that, in almost all cases, it represents pure excise, or something close to it. Except in games where the goal is to navigate successfully through a maze of obstacles, navigating through software does not meet user goals, needs, or desires.  Unnecessary or difficult

REF:: Handouts Page No. 248

 

QNo.37 Why some time direct observation is not possible

Answer:-

Sometimes direct observation is not possible because it is obtrusive or evaluators cannot be present over the duration of the study, and so users' activities are tracked indirectly.

REF:: Handouts Page No. 366

 

QNo.38 Give two examples of "Avoidance" with respect to Attitude-oriented questions. [2

Answer:-

What would you prefer not to do?

What do you procrastinate on?

REF:: Handouts Page No. 183

 

QNo.39 Write any two common ways to Improve Navigation? [2] 

Answer:-

  1. One integrated within a web site or intranet to improve navigation and retrieval, shares a common heritage with the familiar reference text but has a different form and function.
  2. Thesaurus is a semantic network of concepts, connecting words to their synonyms, homonyms, antonyms, broader and narrower terms, and related terms.

REF:: Handouts Page No. 408

 

QNo.39 List down any four principles that can help make your visual interface as easy and pleasurable to use as possible.

Answer:-

  1. Avoid visual noise and clutter
  2. Use contrast, similarity, and layering to distinguish and organize elements
  3. Provide visual structure and flow at each level of organization
  4. Use cohesive, consistent, and contextually appropriate imagery
  5. Integrate style and function comprehensively and purposefully

REF:: Handouts Page No. 345

 

QNo.40 Explain "Participants Represent Real Users" in context of usability testing.

Answer:-

While there can be wide variations in where and how you conduct a usability test, every usability test shares these five characteristics:

  1. The primary goal is to improve the usability of a product. For each test, you also have more specific goals and concerns that you articulate when planning the test.
  2. The participants represent real users.
  3. The participants do real tasks.
  4. You observe and record what participants do and say.
  5. You analyze the data, diagnose the real problems, and recommend changes to fix those problems.

REF:: Handouts Page No. 270

 

QNo.41 When is it useful to observe in context to observation process? [3]

Answer:-

Observing is useful at any time during product development. Early in design, observation helps designers understand users' needs. Other types of observation are done later to examine whether the developing prototype meets users' needs

REF:: Handouts Page No. 361

 

QNo.42 Discuss the model problems of multiple undo.

Answer:-

The problems with multiple undo are not due to its behavior as much as they are due to its manifest model. Most undo facilities are constructed in an unrelentingly function-centric manner. They remember what the user does function-by-function and separate the user's actions by individual function. In the time-honored way of creating manifest models that follow implementation models, undo systems tend to model code and data structures instead of user goals. Each click of the Undo button reverses precisely one function-sized bite of behavior. Reversing on a function-by-function basis is a very appropriate mental model for solving most simple problems caused by the user making an erroneous entry. Users sense it right away and fix it right away, usually within a two- or three-function

Limit.

For Example

The Paint program in Windows 95 had a fixed, three-action undo limit. However, when the problem grows more convoluted, the incremental, multiple undo models don't scale up very well.

REF:: Handouts Page No. 314

 

QNo.43 how can we improve data retrieval through "storage and retrieval Systems"?

Answer:-

A storage system is a method for safekeeping goods in a repository. It is a physical system composed of a container and the tools necessary to put objects in and take them back out again. A retrieval system is a method for finding goods in a repository. It is a logical system that allows the; goods to be located according to some abstract value, like name, position or some aspect of the; contents

REF:: Handouts Page No. 402

 

QNo.44 Does it is necessary for evaluation team to have the expertise needed to do the evaluation? Justify your answer with example.

Answer:-

Does the evaluation team have the expertise needed to do the evaluation?

Example, if no one has used models to evaluate systems before, then basing an evaluation on this approach is not sensible. It is no use planning to use experts to review an interface if none are available. Similarly, running usability tests requires expertise. Analyzing video can take many hours, so someone with appropriate expertise and equipment must be available to do it. If statistics are to be used, then a statistician should be consulted before starting the evaluation and then again later for analysis, if appropriate.

REF:: Handouts Page No. 402

QNo.45 Define reliability in term of evaluation technique. [1]

Answer:-

The reliability or consistency of a technique is how well it produces the same results on separate occasions under the same circumstances. Different evaluation processes have different degrees of reliability.

REF:: Handouts Page No. 268

 

QNo.45 what is the first step which describes the process of defining the interaction framework?

Answer:-

DEFINING FORM FACTOR AND INPUT METHODS

REF:: Handouts Page No. 205

QNo.46 what is meant by term "Color shows relationships" with respect to misuse of colors in visual Interface? [2]

Answer:-

Color shows relationships. Color can provide a means of grouping or relating objects together.

REF:: Handouts Page No. 358

 

QNo.47 Explain any four disadvantages of Low-fidelity prototyping.

Answer:-

  1. Limited error checking.
  2. Poor detailed specification to code to.
  3. Facilitator-driven.
  4. Limited utility after requirements established.

REF:: Handouts Page No. 211

QNo.48 Explain any two necessary conditions regarding "Page Names"?

Answer:-

  1. Street signs are big. When you're stopped at an intersection, you can read the sign for the next cross street.
  2. They're in the right place—hanging ovsr the street you're driving on, so all you have to do is glance up.

REF:: Handouts Page No. 290

 QNo.48 can we make computers "see" and "feel"?

Answer:-

We'd have to understand how the human body processes these things. Seeing is the easier of the two, but unless you are talking of some tactile sensor, I don't know how someone would make a computer feel.

REF:: http://au.answers.yahoo.com/question/index?qid=20110211192325AAE48Gs

 

QNo.48 Describe quantitative data analysis.

Answer:-

Video data collected in usability laboratories is usually annotated as it is observed Small teams of evaluator's watch monitors showing what is being recorded in a control room out of the users' sight. As they see errors or unusual behavior, one of the evaluators marks the video and records a brief remark. When the test is finished evaluators can use the annotated recording to calculate performance times so they can compared users' performance on different prototypes

REF:: Handouts Page No. 368

 QNo.49 Explain the following in context of problems with the web experience:

No sense of scale.

No sense of location.

Answer:-

  1. No sense of scale.

Even after we've used a Web site extensively, unless it's a very small site we tend to have very little sense of how big it is (50 pages? 1,000? 17,000?). For all we know, there could  be huge corners we've never explored. Compare this to a magazine, a museum, or a department store, where you always have at least a rough sense of the seen/unseen ratio. The practical result is that it's very hard to know whether you've seen everything of interest in a site, which means it's hard to know when to stop looking.

  • No sense of location.

In physical spaces, as we move around we accumulate knowledge about the space. We develop a sense of where things are and can take shortcuts to get to them. We may get to the chainsaws the first time by following the signs, but the next time we're just as likely to think,   

REF:: Handouts Page No. 283,284

 

QNo.50 Explain the following planes of Conceptual Framework for developing an interactive product.

The Structure Plane

The Scope Plane

The Surface Plane

The Strategy Plane

Answer:-

The Structure Plane

The skeleton is a concrete expression of the more abstract structure of the site. The skeleton might define the placement of the interface elements on our checkout page; the structure would define how users got to that page and where they could go when they were finished there. The skeleton might define the arrangement of navigational items allowing the users to browse categories of books; the structure would define what those categories actually were.

The Scope Plane

The structure defines the way in which the various features and functions of the site fit together. Just what those features and functions are constitutes the scope of the site. Some sites that sell books offer a feature that enables users to save previously used addresses so they can be used again. The question of whether that feature-or any feature-is included on a site is a question of scope.

The Surface Plane

On the surface you see a series of Web pages, made up of images and text. Some of these images are things you can click on, performing some sort of function such as taking you to a shopping cart. Some of these images are just illustrations, such as a photograph of a book cover or the logo of the site itself.

The Strategy Plane

The scope is fundamentally determined by the strategy of the site. This strategy incorporates not only what the people running the site want to get out of it but what the users want to get out of the site as well. In the case of our bookstore example, some of the strategic objectives are pretty obvious: Users want to buy books, and we want to sell them. Other objectives might not be so easy to articulate

REF:: Handouts Page No. 306, 307


QNo.51 Explain the term "Accessibility" with respect to Emerging Paradigms.

Accessibility is a general term used to describe the degree to which a system is usable by as many people as possible without modification. It is not to be confused with usability which is used to describe how easily a thing can be used by any type of user. One meaning of accessibility specifically focuses on people with disabilities and their use of assistive devices such as screen-reading web browsers or wheelchairs.

REF:: Handouts Page No. 408

 

QNo.52 Different between evaluation and usability?

Evaluation  

Usability

  • Focus on users and their tasks
  • Observe, measure, and analyze their  performance with the system
  • Design lucratively

 

 

REF:: Handouts Page No. 259,264

http://en.wikipedia.org/wiki/Usability_testing

 

  • Efficiency -- How much time, and how many steps, are required for people to complete basic tasks
  • Accuracy -- How many mistakes did people make
  • Recall -- How much does the person remember afterwards or after periods of non-us
  • Emotional response -- How does the person feel about the tasks completed

 

QNo.52 Define excise?

Answer:-

When we decide to drive to the office, we must open the garage door, get in, start the motor, back out, and close the garage door before we even begin the forward motion that will take us to our destination. All these actions are in support of the automobile rather than in support of getting to the destination.

REF:: Handouts Page No. 245

 

QNo.53 Name types of navigation?        

Answer:-

  • Navigation between multiple windows or screens
  • Navigation between panes within a window (or frames in a page)
  • Navigation between tools or menus in a pane
  • Navigation within information displayed in a pane or frame (for example: scrolling, panning, zooming, following links)

REF:: Handouts Page No. 249

 

QNo.54 What are Ancillary Application Windows?

Answer:-

Ancillary application windows are windows that are not really part of the application's functionality, but are provided as a matter of convention

REF:: Handouts Page No. 396

 

QNo.55 How data needs are different from functional needs? [3]

Answer:-

Functional needs are the operations that need to be performed on the objects of the system and which are eventually translated into interface controls. Functional needs also define places or containers where objects or information in the interface must be displayed.

REF:: Handouts Page No. 204

 

QNo.56 What is the widespread misconception about the error messages?
Answer:-

This is a widespread misconception. Most error message boxes are informing the user of the inability of the program to work flexibly. Most error message boxes seem to the user like an admission of

real stupidity on the program's part.

REF:: Handouts Page No. 382

 

QNo.57 List three characteristics that must be present in a good website. 3

Answer:-

Good Keywords

Good keywords are the very first building blocks you must consider before your webpage even becomes a dim notion in your head

Simple Design

Keep it simple. You must keep your webpage simple and direct. Keep it professional

Easy Navigation

A great webpage will have easy and simple navigation.

REF:: http://ezinearticles.com/?7-Characteristics-Of-A-Great-Webpage&id=155509

QNo.58 How visual explicitness of the GUI helps casual or first-time user to navigate and learn what tasks are appropriate and when? How can we relate excise with expert users? [4+6]

Answer:-

One of the main criticisms leveled at graphical user interfaces by experienced computer users — notably those trained on command-line systems — is that getting to where you want to go is made slower and more difficult by the extra effort that goes into manipulating windows and icons. Users complain that, with a command line, they can just type in the desired command and the computer executes it immediately. With windowing systems, they must open various folders looking for the desired file or program before they can launch it. Then, after it appears on the screen, they must stretch and drag the window until it is in the desired location and configuration

Any user willing to learn a command-line interface automatically qualifies as a power user. And any power user of a command-line interface will quickly become a power user of any other type of interface, GUI included. These users will easily learn each nuance of the programs they use. They will start up each program with a clear idea of exactly what it is they want to do and how they want to do it. To this user, the assistance offered to the casual or first-time user is just in the way.

REF:: Handouts Page No. 246

 


--
Zindagi mein 2 Logo ka buhat khayal rahkoooo
Ist woh jiss ney tumhari jeet ke Liye buhat kuch hara hoo
(Father)
2nd woh jiss ko tum ney har dukh me pukaara hoo (Mother)
Regards,
Umair Saulat Mc100403250

--
--
Virtual University of Pakistan*** IT n CS Blog
================================
http://www.eNoxel.com
http://www.enoxelit.tk
http://www.geniusweb.tk
 
and Please do Share this group with your Friends and Class Fellows so that our Circle would expand and can be more useful for other Students.
 
Thanks, n Best of Luck......
 
 
You received this message because you are subscribed to the Google
Groups "vulms" group.
To post to this group, send email to vulmsit@googlegroups.com
To unsubscribe from this group, send email to
vulmsit+unsubscribe@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/vulmsit?hl=en?hl=en
---
You received this message because you are subscribed to the Google Groups "vulms" group.
To unsubscribe from this group and stop receiving emails from it, send an email to vulmsit+unsubscribe@googlegroups.com.
Visit this group at http://groups.google.com/group/vulmsit?hl=en-GB.
For more options, visit https://groups.google.com/groups/opt_out.
 
 

Tuesday, February 19, 2013

.::VULMSIT::.eNoxel.com Moderator's spam report for vulmsit@googlegroups.com

This message is being sent to you because you are a moderator of the group vulmsit.

The following suspicious messages were sent to your group, but are being held in your moderation queue because they are classified as likely spam messages.

If you take no action, all the messages below will be discarded automatically as spam.

However, if you see any messages that are not spam below, you may approve them individually by going to:

http://groups.google.com/group/vulmsit/pendmsg

Please do not mark this notification as spam; this is a service for group moderators. If you do not wish to receive these notifications in the future, you may change your preferences by going to:

http://groups.google.com/group/vulmsit/manage_post


------- 1 of 8 -------
Subject: MCS, MIT, MBA, MBS, M.COM All Subjects FAQs, Glossary, Lecture wise question and answer and past final term solved paper
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 15 07:57PM +0500

Asslam .o. Alaikum
Respected VU Fellows

We are preparing Faqs, Glossary, Lecture wise Questions and Answers, Solved
Online Quiz, Solved Past Final Term Papers PDF files of All VU Subjects for
Final Term Exam Preparation. Uploading of many

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=1352437644409258770

------- 2 of 8 -------
Subject: BSCS, BSIT, B.COM, BBA, BS PSYCO All Subjects FAQs, Glossary, Lecture wise question and answer and past final term solved paper
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 15 07:58PM +0500

Asslam .o. Alaikum
Respected VU Fellows

We are preparing Faqs, Glossary, Lecture wise Questions and Answers, Solved
Online Quiz, Solved Past Final Term Papers PDF files of All VU Subjects for
Final Term Exam Preparation. Uploading of many

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=1897789745733920489

------- 3 of 8 -------
Subject: Today Online Quran & Online Hadith 16 Feb 2013 (05 Rabi'al Sani 1434)
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 16 08:37AM +0500

*Today Online Quran & Online Hadith 16 Feb 2013 (05 Rabi'al Sani 1434)*


Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=1319192161664774076

------- 4 of 8 -------
Subject: Today Online Quran & Online Hadith 17 Feb 2013 (06 Rabi'al Sani 1434)
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 17 10:06AM +0500

Today Online Quran & Online Hadith 17 Feb 2013 (06 Rabi'al Sani 1434)


Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=1276950786241365910

------- 5 of 8 -------
Subject: Today Online Quran & Online Hadith 18 Feb 2013 (07 Rabi'al Sani 1434)
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 18 09:03AM +0500

Today Online Quran & Online Hadith 18 Feb 2013 (07 Rabi'al Sani 1434)


Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=7330772298307135529

------- 6 of 8 -------
Subject: CS610 Final term MAGA file+subjative solvd by Tabish (eagle_eye)
From: "◄::-:: eagle_eye ::-::►" <fantasy.eagle@gmail.com>
Date: Feb 18 06:19PM +0500

*AOA all dearz..*
*here CS610 all solved stuff by Tabish (eagle_eye)
*
*
*
*remember me in ur prayerzz...*


*TABISH ALI RAZA*

*Love U and miss U baba, U always alive in my prayers….. *

*Live to EXPRESS not to IMPRESS..!!*

**

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=894900966955736629

------- 7 of 8 -------
Subject: Today Online Quran & Online Hadith 19 Feb 2013 (08 Rabi'al Sani 1434)
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 19 09:18AM +0500

Today Online Quran & Online Hadith 19 Feb 2013 (08 Rabi'al Sani 1434)


Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=1659351283725695910

------- 8 of 8 -------
Subject: Attention Local Pakistani Students: Exams of 20th Feb, 21st Feb and 22nd Feb, 2013 Cancelled
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 19 11:54AM +0500

Published On: Tuesday, February 19, 2013

*Attention Local Students: Exams of 20th Feb, 21st Feb and 22nd Feb, 2013
Cancelled*



Due to current law and order situation, Exams of first three days i.e.
*20th February
2013 to 22ndFebruary,

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=1327553460515433784


For more information about this message, please visit:
https://support.google.com/groups/bin/answer.py?hl=en&answer=47792

--
--
Virtual University of Pakistan*** IT n CS Blog
================================
http://www.eNoxel.com
http://www.enoxelit.tk
http://www.geniusweb.tk

and Please do Share this group with your Friends and Class Fellows so that our Circle would expand and can be more useful for other Students.

Thanks, n Best of Luck......


You received this message because you are subscribed to the Google
Groups "vulms" group.
To post to this group, send email to vulmsit@googlegroups.com
To unsubscribe from this group, send email to
vulmsit+unsubscribe@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/vulmsit?hl=en?hl=en
---
You received this message because you are subscribed to the Google Groups "vulms" group.
To unsubscribe from this group and stop receiving emails from it, send an email to vulmsit+unsubscribe@googlegroups.com.
Visit this group at http://groups.google.com/group/vulmsit?hl=en-GB.
For more options, visit https://groups.google.com/groups/opt_out.

Friday, February 15, 2013

.::VULMSIT::.eNoxel.com CS502 QUIZ NO.5 DATED FEB 15 2013

CS502 - Fundamentals of Algorithms

Quiz No.5 Dated FEB 15TH 2013

 

 

In in-place sorting algorithm is one that uses arrays for storage :
An additional array

No additional array (Right Answer)

Both of above may be true according to algorithm

More than 3 arrays of one dimension.

 

The running time of quick sort depends heavily on the selection of

No of inputs

Arrangement of elements in array

Size o elements

Pivot element (Right Answer)

 

In stable sorting algorithm

One array is used

In which duplicating elements are not handled.

More then one arrays are required. 

Duplicating elements remain in same relative position after sorting. (Right Answer)

 

Which sorting algorithn is faster :

O(n^2)

O(nlogn)

O(n+k) (Right Answer)

O(n^3)

 

In Quick sort algorithm,constants hidden in T(n lg n) are

Large

Medium

Not known

Small (Right Answer)

 

Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:

There is explicit combine process as well to conquer the solutin. (Right Answer)

No work is needed to combine the sub-arrays, the array is already sorted

Merging the subarrays

None of above.

 

 

 

There is relationship between number of back edges and number of cycles in DFS

Select correct option:

 Both are equal.

 Cycles are half of back edges.

 Cycles are one fourth of back edges.

  There is no relationship between back edges and number of cycle (Right Answer)

 

You have an adjacency list for G, what is the time complexity to compute Graph

transpose G^T ?

Select correct option:

 (V+E)  (Right Answer)

 V.E

 V

 E

 

 

Question # 3 of 10 ( Start time: 06:54:27 PM )  Total Marks: 1

You have an adjacency list for G, what is the time complexity to compute Graph

transpose G^T.?

?(V + E)  Right Answer)

?(V E)

?(V)

?(V^2)

 

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

log (V) (Right Answer)

V.V

E.E

log (E)

 

Dijkstra's algorithm :

Select correct option:

Has greedy approach to find all shortest paths

Has both greedy and Dynamic approach to find all shortest paths

Has greedy approach to compute single source shortest paths to all other vertices  (Right Answer)

Has both greedy and dynamic approach to compute single source shortest paths to all other vertices.

 

 

 

What algorithm technique is used in the implementation of Kruskal solution for the

MST?

Greedy Technique (Right Answer)

Divide-and-Conquer Technique

Dynamic Programming Technique

The algorithm combines more than one of the above techniques

 

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

O (log E)

? (V)

? (V+E)

O (log V) (Right Answer)

 

Which is true statement in the following.

Kruskal algorithm is multiple source technique for finding MST.

Kruskal's algorithm is used to find minimum spanning tree of a graph, time complexity of this algorithm is O(EV)

Both of above

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's  (choose best Tree edge) when the graph has relatively few edges ) (Right Answer)

 

The relationship between number of back edges and number of cycles in DFS is,

Both are equal

Back edges are half of cycles

Back edges are one quarter of cycles

There is no relationship between no. of edges and cycles (Right Answer)

 

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree

edge) when the graph has relatively few edges.

True  (Right Answer)

False

 

 

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

log (V)

V.V

E.E

log (E)

 

Suppose that a graph G = (V,E) is implemented using adjacency lists. What is the complexity of a breadth-first traversal of G?

Select correct option:

O(|V |^2)

O(|V | |E|) (Right Answer)

O(|V |^2|E|)

O(|V | + |E|)



What is generally true of Adjacency List and Adjacency Matrix representations of graphs?

Select correct option:

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

Lists require less space than matrices and they are faster to find the weight of an edge (v1, v2) Right Answer)

Lists require more space than matrices and they take longer to find the weight of an edge (v1, v2)

Lists require more space than matrices but are faster to find the weight of an edge (v1, v2)



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

Select correct option:

There is Null pointer at the end of list.

The Isolated vertex is not handled in list. (not Sure)

Only one value is entered in the list.

There is at least one null list.


A dense undirected graph is:

Select correct option:

A graph in which E = O(V^2) (Right Answer)

A graph in which E = O(V)

A graph in which E = O(log V)

All items above may be used to characterize a dense undirected graph

 


In digraph G=(V,E) ;G has cycle if and only if

 

Select correct option:

The DFS forest has forward edge.

The DFS forest has back edge (Right Answer)

The DFS forest has both back and forward edge

BFS forest has forward edge

 

Back edge is:

Select correct option:

(u, v) where v is an ancestor of u in the tree. (Right Answer)

(u,v) where u is an ancesstor of v in the tree.

(u, v) where v is an predcessor of u in the tree.

None of above

 

Using ASCII standard the string "abacdaacacwe" will be encoded with __________ bits

Select correct option:

64

128 (Right Answer)

96

120


Cross edge is :

Select correct option:

(u, v) where u and v are not ancestor of one another

(u, v) where u is ancesstor of v and v is not descendent of u.

(u, v) where u and v are not ancestor or descendent of one another (Right Answer)

(u, v) where u and v are either ancestor or descendent of one another. 



Which statement is true?

Select correct option:

If a dynamic-programming problem satisfies the optimal-substructure property, then a locally optimal solution is globally optimal.

If a greedy choice property satisfies the optimal-substructure property, then a locally optimal solution is globally optimal.

Both of above Right Answer)

None of above

10  If you find yourself in maze the better traversel approach will bE


A dense undirected graph is:

Select correct option:

A graph in which E = O(V^2) (Right Answer)

A graph in which E = O(V)

A graph in which E = O(log V)

All items above may be used to characterize a dense undirected graph


Which is true statement.

Select correct option:

Breadth first search is shortest path algorithm that works on un-weighted graphs (Right Answer)

Depth first search is shortest path algorithm that works on un-weighted graphs.

Both of above are true.

None of above are true.


Forward edge is:

Select correct option:

(u, v) where u is a proper descendent of v in the tree.

(u, v) where v is a proper descendent of u in the tree. (Right Answer)

(u, v) where v is a proper ancesstor of u in the tree.

(u, v) where u is a proper ancesstor of v in the tree.


Back edge is:

Select correct option:

(u, v) where v is an ancestor of u in the tree. (Right Answer)

(u,v) where u is an ancesstor of v in the tree.

(u, v) where v is an predcessor of u in the tree.

None of above

 

 

Suppose that a graph G = (V,E) is implemented using adjacency lists. What is the complexity of a breadth-first traversal of G?

Select correct option:

O(|V |^2)

O(|V | |E|) (Right Answer)

O(|V |^2|E|)

O(|V | + |E|)

 

In digraph G=(V,E) ;G has cycle if and only if

Select correct option:

The DFS forest has forward edge.

The DFS forest has back edge (Right Answer)

The DFS forest has both back and forward edge

BFS forest has forward edge

 

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

Select correct option:

There is Null pointer at the end of list.

The Isolated vertex is not handled in list. (not Sure)

Only one value is entered in the list.

There is at least one null list.

 

If you find yourself in maze the better traversel approach will be :

BFS

BFS and DFS both are valid (Right Answer)

Level order

DFS

 

Cross edge is :

(u, v) where u and v are not ancestor of one another

(u, v) where u is ancesstor of v and v is not  descendent of u.

(u, v) where u and v are not ancestor or descendent of one another (Right Answer)

 (u, v) where u and v are either ancestor or descendent of one another.

 

What algorithm technique is used in the implementation of Kruskal solution for the MST?

Greedy Technique   (Right Answer)

Divide-and-Conquer Technique

Dynamic Programming Technique 

The algorithm combines more than one of the above techniques

 

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree edge) when the graph has relatively few

True (Right Answer)

False

 

You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T.?

?(V + E)  Right Answer)

? (V E)

? (V)

? (V^2)

 

A digraph is strongly connected under what condition?

A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v .

A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v and vice versa. (Right Answer)

A digraph is strongly connected if for at least one pair of vertex u, v e V,  u can reach v and vice versa.

A digraph is strongly connected if  at least  one third pair  of vertices u, v e V, u can reach v and vice versa.

 

The relationship between number of back edges and number of cycles in DFS is,

Both are equal

Back edges are half of cycles

Back edges are one quarter of cycles

There is no relationship between no. of edges and cycles (Right Answer)

 

What algorithm technique is used in the implementation of Kruskal solution for the MST?

Greedy Technique  (Right Answer)

Divide-and-Conquer Technique

Dynamic Programming Technique 

The algorithm combines more than one of the above techniques

 

 

In in-place sorting algorithm is one that uses arrays for storage :
An additional array

No additional array (Right Answer)

Both of above may be true according to algorithm

More than 3 arrays of one dimension.

 

The running time of quick sort depends heavily on the selection of

No of inputs

Arrangement of elements in array

Size o elements

Pivot element (Right Answer)

 

In stable sorting algorithm

One array is used

In which duplicating elements are not handled.

More then one arrays are required. 

Duplicating elements remain in same relative position after sorting. (Right Answer)

Which sorting algorithn is faster :

O(n^2)

O(nlogn)

O(n+k) (Right Answer)

O(n^3)

 

In Quick sort algorithm,constants hidden in T(n lg n) are

Large

Medium

Not known

Small (Right Answer)

 

Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:

There is explicit combine process as well to conquer the solutin. (Right Answer)

No work is needed to combine the sub-arrays, the array is already sorted

Merging the subarrays

None of above.

 

 

 

There is relationship between number of back edges and number of cycles in DFS

Select correct option:

 Both are equal.

 Cycles are half of back edges.

 Cycles are one fourth of back edges.

  There is no relationship between back edges and number of cycle (Right Answer)

 

You have an adjacency list for G, what is the time complexity to compute Graph

transpose G^T ?

Select correct option:

 (V+E)  (Right Answer)

 V.E

 V

 E

 

 

Question # 3 of 10 ( Start time: 06:54:27 PM )  Total Marks: 1

You have an adjacency list for G, what is the time complexity to compute Graph

transpose G^T.?

?(V + E)  Right Answer)

?(V E)

?(V)

?(V^2)

 

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

log (V) (Right Answer)

V.V

E.E

log (E)

 

Dijkstra's algorithm :

Select correct option:

Has greedy approach to find all shortest paths

Has both greedy and Dynamic approach to find all shortest paths

Has greedy approach to compute single source shortest paths to all other vertices  (Right Answer)

Has both greedy and dynamic approach to compute single source shortest paths to all other vertices.

 

 

 

What algorithm technique is used in the implementation of Kruskal solution for the

MST?

Greedy Technique (Right Answer)

Divide-and-Conquer Technique

Dynamic Programming Technique

The algorithm combines more than one of the above techniques

 

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

O (log E)

? (V)

? (V+E)

O (log V) (Right Answer)

 

Which is true statement in the following.

Kruskal algorithm is multiple source technique for finding MST.

Kruskal's algorithm is used to find minimum spanning tree of a graph, time complexity of this algorithm is O(EV)

Both of above

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's  (choose best Tree edge) when the graph has relatively few edges ) (Right Answer)

 

The relationship between number of back edges and number of cycles in DFS is,

Both are equal

Back edges are half of cycles

Back edges are one quarter of cycles

There is no relationship between no. of edges and cycles (Right Answer)

 

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree

edge) when the graph has relatively few edges.

True  (Right Answer)

False

 

 

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

log (V)

V.V

E.E

log (E)

 

Suppose that a graph G = (V,E) is implemented using adjacency lists. What is the complexity of a breadth-first traversal of G?

Select correct option:

O(|V |^2)

O(|V | |E|) (Right Answer)

O(|V |^2|E|)

O(|V | + |E|)



What is generally true of Adjacency List and Adjacency Matrix representations of graphs?

Select correct option:

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

Lists require less space than matrices and they are faster to find the weight of an edge (v1, v2) Right Answer)

Lists require more space than matrices and they take longer to find the weight of an edge (v1, v2)

Lists require more space than matrices but are faster to find the weight of an edge (v1, v2)



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

Select correct option:

There is Null pointer at the end of list.

The Isolated vertex is not handled in list. (not Sure)

Only one value is entered in the list.

There is at least one null list.


A dense undirected graph is:

Select correct option:

A graph in which E = O(V^2) (Right Answer)

A graph in which E = O(V)

A graph in which E = O(log V)

All items above may be used to characterize a dense undirected graph

 


In digraph G=(V,E) ;G has cycle if and only if

Select correct option:

The DFS forest has forward edge.

The DFS forest has back edge (Right Answer)

The DFS forest has both back and forward edge

BFS forest has forward edge

 

Back edge is:

Select correct option:

(u, v) where v is an ancestor of u in the tree. (Right Answer)

(u,v) where u is an ancesstor of v in the tree.

(u, v) where v is an predcessor of u in the tree.

None of above

 

Using ASCII standard the string "abacdaacacwe" will be encoded with __________ bits

Select correct option:

64

128 (Right Answer)

96

120


Cross edge is :

Select correct option:

(u, v) where u and v are not ancestor of one another

(u, v) where u is ancesstor of v and v is not descendent of u.

(u, v) where u and v are not ancestor or descendent of one another (Right Answer)

(u, v) where u and v are either ancestor or descendent of one another. 



Which statement is true?

Select correct option:

If a dynamic-programming problem satisfies the optimal-substructure property, then a locally optimal solution is globally optimal.

If a greedy choice property satisfies the optimal-substructure property, then a locally optimal solution is globally optimal.

Both of above Right Answer)

None of above

10  If you find yourself in maze the better traversel approach will bE


A dense undirected graph is:

Select correct option:

A graph in which E = O(V^2) (Right Answer)

A graph in which E = O(V)

A graph in which E = O(log V)

All items above may be used to characterize a dense undirected graph


Which is true statement.

Select correct option:

Breadth first search is shortest path algorithm that works on un-weighted graphs (Right Answer)

Depth first search is shortest path algorithm that works on un-weighted graphs.

Both of above are true.

None of above are true.


Forward edge is:

Select correct option:

(u, v) where u is a proper descendent of v in the tree.

(u, v) where v is a proper descendent of u in the tree. (Right Answer)

(u, v) where v is a proper ancesstor of u in the tree.

(u, v) where u is a proper ancesstor of v in the tree.


Back edge is:

Select correct option:

(u, v) where v is an ancestor of u in the tree. (Right Answer)

(u,v) where u is an ancesstor of v in the tree.

(u, v) where v is an predcessor of u in the tree.

None of above

 

 

Suppose that a graph G = (V,E) is implemented using adjacency lists. What is the complexity of a breadth-first traversal of G?

Select correct option:

O(|V |^2)

O(|V | |E|) (Right Answer)

O(|V |^2|E|)

O(|V | + |E|)

 

In digraph G=(V,E) ;G has cycle if and only if

Select correct option:

The DFS forest has forward edge.

The DFS forest has back edge (Right Answer)

The DFS forest has both back and forward edge

BFS forest has forward edge

 

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

Select correct option:

There is Null pointer at the end of list.

The Isolated vertex is not handled in list. (not Sure)

Only one value is entered in the list.

There is at least one null list.

 

If you find yourself in maze the better traversel approach will be :

BFS

BFS and DFS both are valid (Right Answer)

Level order

DFS

 

Cross edge is :

(u, v) where u and v are not ancestor of one another

(u, v) where u is ancesstor of v and v is not  descendent of u.

(u, v) where u and v are not ancestor or descendent of one another (Right Answer)

 (u, v) where u and v are either ancestor or descendent of one another.

 

What algorithm technique is used in the implementation of Kruskal solution for the MST?

Greedy Technique   (Right Answer)

Divide-and-Conquer Technique

Dynamic Programming Technique 

The algorithm combines more than one of the above techniques

 

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree edge) when the graph has relatively few

True (Right Answer)

False

 

You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T.?

?(V + E)  Right Answer)

? (V E)

? (V)

? (V^2)

 

A digraph is strongly connected under what condition?

A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v .

A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v and vice versa. (Right Answer)

A digraph is strongly connected if for at least one pair of vertex u, v e V,  u can reach v and vice versa.

A digraph is strongly connected if  at least  one third pair  of vertices u, v e V, u can reach v and vice versa.

 

The relationship between number of back edges and number of cycles in DFS is,

Both are equal

Back edges are half of cycles

Back edges are one quarter of cycles

There is no relationship between no. of edges and cycles (Right Answer)

 

What algorithm technique is used in the implementation of Kruskal solution for the MST?

Greedy Technique  (Right Answer)

Divide-and-Conquer Technique

Dynamic Programming Technique 

The algorithm combines more than one of the above techniques

Which may be stable sort:
Select correct option:
Bubble sort
Insertion sort
Both of above
Selection sort

In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
Select correct option:
linear
arithmetic
geometric
exponent

In Quick sort algorithm, constants hidden in T(n lg n) are
Select correct option:

Large
Medium
Not known
small

How much time merge sort takes for an array of numbers?
Select correct option:

T(n^2)
T(n)
T( log n)
T(n log n)

Counting sort has time complexity:
Select correct option:

O(n)
O(n+k)
O(k)
O(nlogn)

In which order we can sort?
Select correct option:

increasing order only
decreasing order only
increasing order or decreasing order
both at the same time

A (an) _________ is a left-complete binary tree that conforms to the heap order
Select correct option:

heap
binary tree
binary search tree
array

The analysis of Selection algorithm shows the total running time is indeed ________in n,
Select correct option:

arithmetic
geometric
linear
orthogonal

Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
Select correct option:

There is explicit combine process as well to conquer the solution.
No work is needed to combine the sub-arrays, the array is already sorted
Merging the sub arrays
None of above.

Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
Select correct option:

upper
lower
average
log n

In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as, 

T(n)

T(n / 2)

log n

n / 2 + n / 4

 

Quick sort is based on divide and conquer paradigm; we divide the problem on base of

pivot element and:

There is explicit combine process as w ell to conquer

No w ork is needed to combine the sub-arrays, the a

Merging the subarrays

None of above

 

 

The number of nodes in a complete binary tree of height h is

2^(h+1) – 1

2 * (h+1) – 1

2 * (h+1)

((h+1) ^ 2) – 1

 

How many elements do we eliminate in each time for the Analysis of Selection

algorithm?

n / 2 elements

(n / 2) + n elements

n / 4 elements

2 n elements

 

Which sorting algorithn is faster : 

O(n^2)

O(nlogn)

O(n+k)

O(n^3)

 

We do sorting to, 

keep elements in random positions

keep the algorithm run in linear order

keep the algorithm run in (log n) order

keep elements in increasing or decreasing order

 

Slow sorting algorithms run in, 

T(n^2)

T(n)

T( log n)

T(n log n)

 

One of the clever aspects of heaps is that they can be stored in arrays without using any

_______________. 

Pointers

Constants

Variables

Functions

 

Counting sort is suitable to sort the elements in range 1 to k:

K is large

K is small

K may be large or small

None

 

We do sorting to, 
Select correct option: 

keep elements in random positions
keep the algorithm run in linear order
keep the algorithm run in (log n) order
keep elements in increasing or decreasing order

Question # 2 of 10 ( Start time: 06:19:38 PM ) Total Marks: 1 
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree, 
Select correct option: 

left-complete
right-complete
tree nodes
tree leaves

Question # 3 of 10 ( Start time: 06:20:18 PM ) Total Marks: 1 
Sieve Technique can be applied to selection problem? 
Select correct option: 

True
False

Question # 4 of 10 ( Start time: 06:21:10 PM ) Total Marks: 1 
A heap is a left-complete binary tree that conforms to the ___________ 
Select correct option: 

increasing order only
decreasing order only
heap order
(log n) order

Question # 5 of 10 ( Start time: 06:21:39 PM ) Total Marks: 1 
A (an) _________ is a left-complete binary tree that conforms to the heap order 
Select correct option: 

heap
binary tree
binary search tree
array

Question # 6 of 10 ( Start time: 06:22:04 PM ) Total Marks: 1 
Divide-and-conquer as breaking the problem into a small number of 
Select correct option: 

pivot
Sieve
smaller sub problems
Selection

Question # 7 of 10 ( Start time: 06:22:40 PM ) Total Marks: 1 
In Sieve Technique we do not know which item is of interest 
Select correct option: 

True
False

Question # 8 of 10 ( Start time: 06:23:26 PM ) Total Marks: 1 
The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and 2T(n-1) if n >1 In order to move a tower of 5 rings from one peg to another, how many ring moves are required? 
Select correct option: 

16
10
32
31 

Question # 9 of 10 ( Start time: 06:24:44 PM ) Total Marks: 1 
In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis, 
Select correct option: 

linear
arithmetic
geometric 
exponent


Question # 10 of 10 ( Start time: 06:25:43 PM ) Total Marks: 1 
For the heap sort, access to nodes involves simple _______________ operations. 
Select correct option: 
arithmetic
binary
algebraic
logarithmic 

For the sieve technique we solve the problem,
Select correct option:
recursively
mathematically
precisely
accurately
The sieve technique works in ___________ as follows
Select correct option:
phases
numbers
integers
routines
Slow sorting algorithms run in,
Select correct option:
T(n^2)
T(n)
T( log n)
A (an) _________ is a left-complete binary tree that conforms to the heap order
Select correct option:
heap
binary tree
binary search tree
array

In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
Select correct option:
linear
arithmetic
geometric
exponent

In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
Select correct option:
T(n)
T(n / 2)
log n
n / 2 + n / 4

The sieve technique is a special case, where the number of sub problems is just
Select correct option:
5
many
1
few

In which order we can sort?
Select correct option:
increasing order only
decreasing order only
increasing order or decreasing order
both at the same time

The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and 2T(n-1) if n >1 In order to move a tower of 5 rings from one peg to another, how many ring moves are required?
Select correct option:
16
10
32
31

Analysis of Selection algorithm ends up with,
Select correct option:
T(n)
T(1 / 1 + n)
T(n / 2)
T((n / 2) + n)


We do sorting to, 
Select correct option: 

keep elements in random positions 
keep the algorithm run in linear order 
keep the algorithm run in (log n) order 
keep elements in increasing or decreasing order 

Divide-and-conquer as breaking the problem into a small number of 
Select correct option: 

pivot 
Sieve 
smaller sub problems 
Selection 


The analysis of Selection algorithm shows the total running time is indeed ________in n,
Select correct option: 

arithmetic 
geometric 
linear 
orthogonal 




How many elements do we eliminate in each time for the Analysis of Selection algorithm? 
Select correct option: 

n / 2 elements 
(n / 2) + n elements 
n / 4 elements 
2 n elements 


Sieve Technique can be applied to selection problem? 
Select correct option: 

True 
false


For the heap sort we store the tree nodes in 
Select correct option: 

level-order traversal 
in-order traversal 
pre-order traversal 
post-order traversal

 

 

One of the clever aspects of heaps is that they can be stored in arrays without using any _______________. 
Select correct option: 
pointers
constants
variables
functions

 

A (an) _________ is a left-complete binary tree that conforms to the heap order 
Select correct option: 
heap
binary tree
binary search tree
array

 

Divide-and-conquer as breaking the problem into a small number of 
Select correct option: 
pivot
Sieve
smaller sub problems
Selection


Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree, 
Select correct option: 
left-complete
right-complete
tree nodes
tree leaves

For the sieve technique we solve the problem, 
Select correct option: 
recursively
mathematically
precisely
accurately

A heap is a left-complete binary tree that conforms to the ___________ 
Select correct option: 
increasing order only
decreasing order only
heap order
(log n) order


We do sorting to, 
Select correct option: 
keep elements in random positions
keep the algorithm run in linear order
keep the algorithm run in (log n) order
keep elements in increasing or decreasing order


How many elements do we eliminate in each time for the Analysis of Selection algorithm? 
Select correct option: 
n / 2 elements
(n / 2) + n elements
n / 4 elements
2 n elements


How much time merge sort takes for an array of numbers? 
Select correct option: 
T(n^2)
T(n)
T( log n)
T(n log n)


The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of, 
Select correct option: 
divide-and-conquer
decrease and conquer
greedy nature
2-dimension Maxima

 

Question # 1 of 10 ( Start time: 08:17:23 AM ) Total M a r k s: 1
The number of nodes in a complete binary tree of height h is
Select correct option:
2^(h+1) – 1
2 * (h+1) – 1
2 * (h+1)
((h+1) ^ 2) – 1

Question # 2 of 10 ( Start time: 08:18:46 AM ) Total M a r k s: 1
A (an) _________ is a left-complete binary tree that conforms to the heap order
Select correct option:
heap
binary tree
binary search tree
array

Question # 3 of 10 ( Start time: 08:19:38 AM ) Total M a r k s: 1
In Sieve Technique we do not know which item is of interest
Select correct option:
True
False

Question # 4 of 10 ( Start time: 08:20:33 AM ) Total M a r k s: 1
Heaps can be stored in arrays without using any pointers; this is due to the
____________ nature of the binary tree,
Select correct option:
left-complete
right-complete
tree nodes
tree leaves

Question # 5 of 10 ( Start time: 08:21:59 AM ) Total M a r k s: 1
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as
many as,
Select correct option:
T(n)
T(n / 2)
log n
n / 2 + n / 4

Question # 6 of 10 ( Start time: 08:23:01 AM ) Total M a r k s: 1
For the sieve technique we solve the problem,
Select correct option:
recursively
mathematically
precisely
accurately
Theta asymptotic notation for T (n) :
Select correct option:
Set of functions described by: c1g(n)Set of functions described by c1g(n)>=f(n) for c1 s
Theta for T(n)is actually upper and worst case comp
Set of functions described by:
c1g(n)


Question # 8 of 10 ( Start time: 08:24:39 AM ) Total M a r k s: 1
The sieve technique is a special case, where the number of sub problems is just
Select correct option:
5
many
1
few

Question # 9 of 10 ( Start time: 08:25:54 AM ) Total M a r k s: 1
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
Select correct option:
n items
phases
pointers
constant

Question # 10 of 10 ( Start time: 08:26:44 AM ) Total M a r k s: 1
The sieve technique works in ___________ as follows
Select correct option:
phases
numbers
integers
routines

 

Memorization is?

To store previous results for future use

To avoid this unnecessary repetitions by writing down the results of recursive calls and looking them up again if we need them later

To make the process accurate

None of the above

 

Question # 2 of 10 Total M a r k s: 1

Which sorting algorithm is faster

O (n log n)

O n^2

O (n+k)

O n^3

 

Quick sort is

Stable & in place

Not stable but in place

Stable but not in place

Some time stable & some times in place

 

One example of in place but not stable algorithm is

Merger Sort

Quick Sort

Continuation Sort

Bubble Sort

 

In Quick Sort Constants hidden in T(n log n) are

Large

Medium

Small

Not Known

 

Continuation sort is suitable to sort the elements in range 1 to k

K is Large

K is not known

K may be small or large

K is small

 

In stable sorting algorithm.

One array is used

More than one arrays are required

Duplicating elements not handled

duplicate elements remain in the same relative position after sorting

 

 

Which may be a stable sort?

Merger

Insertion

 Both above

None of the above

 

An in place sorting algorithm is one that uses ___ arrays for storage

Two dimensional arrays

More than one array

No Additional Array

None of the above

 

Continuing sort has time complexity of ?

O(n)

O(n+k)

O(nlogn)

O(k)

 

We do sorting to,

keep elements in random positions

keep the algorithm run in linear order

keep the algorithm run in (log n) order

keep elements in increasing or decreasing order

 

 

In Sieve Technique we donot know which item is of interest

 

True

False

A (an) _________ is a left-complete binary tree that conforms to the

heap order

heap

binary tree

binary search tree

array

27. The sieve technique works in ___________ as follows

phases

numbers

integers

routines

 

For the sieve technique we solve the problem,

recursively

mathematically

precisely

accurately

29. For the heap sort, access to nodes involves simple _______________

operations.

arithmetic

binary

algebraic

logarithmic

 

 

 

The analysis of Selection algorithm shows the total running time is

indeed ________in n,\

arithmetic

geometric

linear

orthogonal

 

For the heap sort, access to nodes involves simple _______________

operations.

Select correct option:

arithmetic

binary

algebraic

logarithmic

 

Sieve Technique applies to problems where we are interested in finding a

single item from a larger set of _____________

Select correct option:

n items

phases

pointers

constant

 

Question # 9 of 10 ( Start time: 07:45:36 AM ) Total Marks: 1

In Sieve Technique we do not know which item is of interest

Select correct option:

True

False

 

How much time merge sort takes for an array of numbers?

Select correct option:

T(n^2)

T(n)

T( log n)

T(n log n)

 

For the heap sort we store the tree nodes in

Select correct option:

level-order traversal

in-order traversal

pre-order traversal

post-order traversal

 

 

Sorting is one of the few problems where provable ________ bonds exits on

how fast we can sort,

Select correct option:

upper

lower

average

log n

 

single item from a larger set of _____________

Select correct option:

n items

phases

pointers

constant

 

A heap is a left-complete binary tree that conforms to the ___________

Select correct option:

increasing order only

decreasing order only

heap order

(log n) order

 

In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,

Select correct option:

T(n)

T(n / 2)

log n

n / 2 + n / 4

 

The reason for introducing Sieve Technique algorithm is that it illustrates a

very important special case of,

Select correct option:

divide-and-conquer

decrease and conquer

greedy nature

2-dimension Maxima

 

The sieve technique works in ___________ as follows

Select correct option:

phases

numbers

integers

routines

For the Sieve Technique we take time

Select correct option:

T(nk)

T(n / 3)

n^2

n/3

 

In the analysis of Selection algorithm, we eliminate a constant fraction of the

array with each phase; we get the convergent _______________ series in the

analysis,

linear

arithmetic

geometric

exponent

 

Analysis of Selection algorithm ends up with,

Select correct option:

T(n)

T(1 / 1 + n)

T(n / 2)

T((n / 2) + n)

 

Quiz Start Time: 07:23 PM 
Time Left 90
sec(s) 
Question # 1 of 10 ( Start time: 07:24:03 PM ) Total M a r k s: 1
In in-place sorting algorithm is one that uses arrays for storage :
Select correct option:
An additional array
No additional array
Both of above may be true according to algorithm
More than 3 arrays of one dimension.

 

Time Left 89
sec(s) 
Question # 2 of 10 ( Start time: 07:25:20 PM ) Total M a r k s: 1
Which sorting algorithn is faster :
Select correct option:
O(n^2)
O(nlogn)
O(n+k)
O(n^3)

In stable sorting algorithm:
Select correct option:
One array is used
In which duplicating elements are not handled.
More then one arrays are required.
Duplicating elements remain in same relative posistion after sorting.

 
Counting sort has time complexity:
Select correct option:
O(n)
O(n+k)
O(k)
O(nlogn)

 


Counting sort is suitable to sort the elements in range 1 to k:
Select correct option:
K is large
K is small
K may be large or small
None

 


Memorization is :
Select correct option:
To store previous results for further use.
To avoid unnecessary repetitions by writing down the results of recursive calls and looking them again if needed later
To make the process accurate.
None of the above

 

The running time of quick sort depends heavily on the selection of
Select correct option:
No of inputs
Arrangement of elements in array
Size o elements
Pivot elements

Which may be stable sort:
Select correct option:
Bubble sort
Insertion sort
Both of above


In Quick sort algorithm, constants hidden in T(n lg n) are
Select correct option:
Large
Medium
Not known
small

 

Quick sort is
Select correct option:
Stable and In place
Not stable but in place
Stable and not in place
Some time in place and send some time stable

 

 

For the Sieve Technique we take time

T(nk)

T(n / 3)

n^2

n/3

 

The sieve technique is a special case, where the number of sub problems is just

Select correct option:

5

Many

1

Few

 

The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,

Select correct option:

divide-and-conquer

decrease and conquer

greedy nature

2-dimension Maxima

 

 

 

 

 

Quick sort is

Select correct option:

Stable and In place

Not stable but in place

Stable and not in place

Some time in place and send some time stable

 

Memoization is :

Select correct option:

To store previous results for further use.

To avoid unnecessary repetitions by writing down the results of

recursive calls and looking them again if needed later

To make the process accurate.

None of the above

 

One Example of in place but not stable sort is

Quick

Heap

Merge

Bubble

 

The running time of quick sort depends heavily on the selection of

Select correct option:

No of inputs

Arrangement of elements in array

Size o elements

Pivot elements

 

Question # 9 of 10 ( Start time: 07:39:07 PM ) Total M a r k s: 1

In Quick sort algorithm,constants hidden in T(n lg n) are

Select correct option:

Large

Medium

Not known

Small

 

Theta asymptotic notation for T (n) :

Select correct option:

Set of functions described by: c1g(n)<=f(n) for c1 some constant and n=n0

Set of functions described by c1g(n)>=f(n) for c1 some constant and n=n0

Theta for T(n)is actually upper and worst case complexity of the code

Set of functions described by: c1g(n)<=f(n)<=c2g(n) for c1 and c2 some constants and n=n0


--
Zindagi mein 2 Logo ka buhat khayal rahkoooo
Ist woh jiss ney tumhari jeet ke Liye buhat kuch hara hoo
(Father)
2nd woh jiss ko tum ney har dukh me pukaara hoo (Mother)
Regards,
Umair Saulat Mc100403250

--
--
Virtual University of Pakistan*** IT n CS Blog
================================
http://www.eNoxel.com
http://www.enoxelit.tk
http://www.geniusweb.tk
 
and Please do Share this group with your Friends and Class Fellows so that our Circle would expand and can be more useful for other Students.
 
Thanks, n Best of Luck......
 
 
You received this message because you are subscribed to the Google
Groups "vulms" group.
To post to this group, send email to vulmsit@googlegroups.com
To unsubscribe from this group, send email to
vulmsit+unsubscribe@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/vulmsit?hl=en?hl=en
---
You received this message because you are subscribed to the Google Groups "vulms" group.
To unsubscribe from this group and stop receiving emails from it, send an email to vulmsit+unsubscribe@googlegroups.com.
Visit this group at http://groups.google.com/group/vulmsit?hl=en-GB.
For more options, visit https://groups.google.com/groups/opt_out.