Wednesday 5 November 2014

Database Quiz


1. Set of permitted values of each attributes are called
A . Row
B. Column
C. Domain
D. Schema

2. Which of the following statements is not true
A. All primary keys are super keys
B. A candidate key can have a proper subset which is a super key
C. All super keys are not candidate keys
D. A candidate key may not be a super key

3. Entity integrity means that
A. A primary key cannot be null.
B. A foreign key cannot be null.
C. A primary key can be partially null.
D. A foreign key can be partially null.

4. The target of a foreign key should be
A. Foreign key in another table
B. Primary key in another table
C. Super key in another table
D. Primary key in the same table

5. Which of the following can not be the mapping cardinality of a foreign key
A. One- one
B. Many - many
C. Many- one

6. SQL is a
A. Host language
B. Application language
C. Data manipulation language

7. In the following ER diagram,


mapping cardinality of the relation is many one, which means
one manager can manage

A. zero or more departments
B. one or more departments
C. more than one department
D. exactly one department

8. Entity, that can not be uniquely identified by its own attributes , is called
A . Composite entity
B. Strong entity
C. Weak entity
D. Simple entity

In schema S = {A,B,C,D,E,F,G,H}, suppose the following hold for S.
AB --> CD
E --> F
F --> G

9. Which of the following holds true with respect to the above schema
A. CD --> AB
B. AB --> ACD
C. A --> CD
D. AB --> C

10. Which of the following does not hold true.
A. E --> G
B. ABE -->CDE
C. AB --> ABH
D. AB --> null set

Solutions
  1. A B A B B C A C D C

APTITUDE REASONING

TOPIC SYLLOGISM

In this topic of Syllogism Based on the given Statements, You are required to evaluate which conclusion follows.
Mark 1. If the 1st statement follows
Mark 2. If the 2nd statement follows
Mark 3. If both follows
Mark 4. I f none follows

Questions

  1. Statement.1 All Doctors are engineers Statement.2 All Engineers are Advocates
Conclusion 1. All Advocates are Doctors Conclusion 2. All Doctors are Advocates
  1. Statement.1. Some Chairs are Furniture Statement.2. Some Furniture is Tables
Conclusion 1.Some Tables are Chairs Conclusion 2. Some furniture is chairs
  1. Statement.1. All flowers are buds Statement.2. No bud is bush
Conclusion 1. No bush is flower Conclusion 2. All flowers is flower
  1. Statement.1. No cat is elephant Statement.2. No elephant is animal
Conclusion 1. No cat is animal Conclusion 2. Some elephant is cat
  1. Statement.1. All monkeys are animals Statement.2. Anil is an animal
Conclusion 1. Anil is a monkey Conclusion 2. All monkey are animals
  1. Statement.1. Some Apples are bricks Statement.2. All grapes are bricks
Conclusion 1. Some Apples are grapes Conclusion 2. Al bricks are grapes
  1. Statement.1. All plants are trees Statement.2. No tree is stone
Conclusion 1. No stone is plants Conclusion 2. Some stones are plants
  1. Statement.1.All players are tall Statement.2.Rahul is tall
Conclusion 1. Rahul is player Conclusion 2. No player is tall
  1. Statement.1.All students read news paper Statement.2. Rahul doesn’t read newspaper
Conclusion 1. Rahul is a student. Conclusion 2. Rahul is not a student
  1. Statement.1. All rivers are ponds Statement.2. Some ponds are lakes
Conclusion 1. Some lakes are not ponds Conclusion 2. All lakes are rivers
  1. Statement.1All windows are doors Statement.2 No door is a bat
Conclusion 1. No window is bat `Conclusion 2. No bat is door
  1. Statement 1.All glasses are liquids Statement 2.All liquids are fluids
Conclusion 1. All glasses are fluids Conclusion 2. All fluids are glasses
  1. Statement 1. Some gold are bright. Statement 2. Some bright are silver
Conclusion 1. Some gold are silver Conclusion 2. Some bright are gold.
  1. Statement 1.All flowers are garden Statement. 2. All gardens are fruits.
Conclusion 1. All fruits are flowers Conclusion 2. All flowers are fruits.
  1. Statement 1. All poets are singers Statement 2. No singer is composer.
Conclusion 1. No composer is poet Conclusion 2. All singers are poet.
  1. Statement 1. All Tables are cupboards Statement 2. Some cupboards are chairs
Conclusion 1. Some chairs are Tables Conclusion 2. No chair is Table
  1. Statement 1. No tigers are rabbits Statement 2. No rabbit is a jackal
Conclusion 1. All tigers are jackal Conclusion 2. Some tigers are jackal
  1. Statement 1. Some blues are oranges Statement 2. Some oranges are green
Conclusion 1. Some blues are green Conclusion 2. No blue is green.
  1. Statement 1. Some hotels are teashop. Statement 2.All restaurants are teashop
Conclusion 1. Some Hotels are restaurants. Conclusion 2. No Hotel is restaurant.
  1. Statement 1. Some shops are footages Statement 2. All footages are slippers.
Conclusion 1. Some slippers are shops Conclusion 2. No slipper is shop
  1. Statement 1.No book is eraser Statement 2. Some erasers are not pens
Conclusion 1. Some books are pens Conclusion 2. Some erasers are pens.
  1. Statement.1.All MLAs are Ministers. Statement 2. No Minister is MP.
Conclusion 1. All MLAs are MPs. Conclusion 2. No MP is MLA
  1. Statement 1. Some Kings are queens Statement 2. All queens are bishops.
Conclusion 1. Some Kings are bishops Statement 2. All Kings are Bishops
  1. Statement 1.No teacher is Engineer Statement 2. Some engineers are not Doctor
Conclusion 1. All teachers are Doctors Conclusion 2. Some teachers are Doctors.
  1. Statement 1.All Politicians are Sociologist. Statement 2. All sociologists are fighters.
Conclusion 1. All politicians are fighters. Conclusion 2. Some fighters are Politicians.

Key and explanation

  1. Answer is 2. Both are SAP type premises, hence, the conclusion may be SAP type. Incase of first conclusion the term ‘Advocate’ which is distributed is not distributed in question.
  2. Answer is 4. Both Statements are SIP type or particular. Hence, No conclusion is possible.
  3. Answer is 1. First statement is SAP and second statement is SEP, ie, Universal negative, from which we will get only SEP.
  4. Answer is 4. Combination Universal negative premises will produce no conclusion
  5. Answer is 4. The middle term ‘animal’ has not been distributed at least once in the premises.
  6. Answer is 4. The middle term ‘bricks’ has not been distributed at least once in the premises.
  7. Answer is 1. Combination of SAP (Universal positive) and SEP (universal negative) often produce SEP.
  8. Answer is 4. The middle term ‘tall’ is distributed at least once in the premises.
  9. Answer is 2. Combination of SAP (Universal positive) and SEP (universal negative) often produce SEP.
  10. Answer is 4. The middle term ‘ponds’ has not been distributed at least once in the premises
  11. Answer is 3. Combination of SAP and SEP produces SEP only.
  12. Answer is 1. In Second conclusion, the term ‘fluids’ is distributed which is not distributed in premises.
  13. Answer is 4. The middle term ‘ponds’ has not been distributed at least once in the premises. More over, the combination of SIP and SIP never produces any conclusion.
  14. Answer is 2. In first conclusion, the term ‘fruits’ is distributed which is not distributed in premises.
  15. Answer is 1. In Second conclusion, the term ‘singer’ is distributed which is not distributed in first premises.
  16. Answer is 4. The middle term ‘cupboard’ has not been distributed at least once in the premises.
  17. Answer is 4. More over, the combination of SEP and SEP produces nothing.
  18. Answer is 4. The middle term ‘oranges’ has not been distributed at least once in the premises. More over, the combination of SIP and SIP never produces any conclusion.
  19. Answer is 4. The middle term ‘teashop’ has not been distributed at least once in the premises.
  20. Answer is 1. In Second conclusion, the term ‘slipper’ is distributed which is not distributed in premises.
  21. Answer is 4. More over, the combination of two negative premises produces nothing.
  22. Answer is 2. Combination of SAP and SEP produces SEP only.
  23. Answer is 1. In Second conclusion, the term ‘kings’ is distributed which is not distributed in premises.
  24. Answer is 4. More over, the combination of two negative premises produces nothing.
  25. Answer is 3.

ebooks

Ebooks Links Click & Download
Software Engineering 
Unit I Unit II Unit III Unit IV Unit V
Pressman Download link
http://rapidshare.com/files/249795254/SoftwareEngineering-Pressman.pdf

Jalote Download link
http://199.91.154.98/tn01yv351d4g/gru947t4hvbudxw/An+Integrated+Approach+to+Software+Engineering+3rd+Edition+by+Pankaj+Jalote.pdf


DISCRETE MATHEMATICS valid arguments Proof methods proof methods methods of proofs MCQ's mathematical induction graph theory basics Functions distance_centre_diameter connectivity in graphs complexity of graph searching closure of relations
Discrete Mathematics e-boook by Kenneth H Rosen Part1 Part2 Part3 Part4 Part5
Download all parts and then extract part1.

PROGRAMMING LANGUAGES Introduction Unit II Unit III Unit IV Subprogram Control Efficiency and Regularity

Advance Operating System



quiz3.doc Download






quiz4.doc Download





unit3ans.doc Download





unit5ans.doc Download





UNIT5_MPS.ppt Download


Theory of Computation

closure properties.rtf Download

new mcqs.doc Download

purva.rar Download

TOC for STUDENTS.rar Download

toc mcq.doc Download    

 

Computer Networks

ch26.ppt View Download
Chap-23.ppt View Download
Chapter 22 Transport Layer.ppt View Download
chapter3a.ppt View Download
Chapter5 (Subnetting and Supernetting).ppt View Download
Chapter6TransportLayer-1.ppt View Download
Copy of tcp.ppt View Download
Lecture18.ppt View Download
      

 

Distributed Systems

Unit 1 Tutorial.doc View Download

Unit 2 Tutorial.doc View Download

Unit 3.doc View Download

Unit 4.doc View Download

Unit 5.doc View Download

MCQs.doc View Download    

 

Mobile Computing

APPLICATIONSOFMOBILECOMPUTING.doc View Download

ute 3,4 and 5 units.docx View Download 

tutesheet2mc.doc View Download

unit2 tute.docx View Download

mc-1stunit.rar View Download

 

DSGT

CG

TOC

TOC

Theory of Computation

Instructor :Emanuele Viola
Overview of class.
Slides .PDF, .ODP.

Math primer. Reading: Sipser Chapter 0. Think like the pros, sections 1,2, and 4.4.
Slides .PDF, .ODP.
Regular languages and finite automata. Reading: Sipser Chapter 1.
Slides .PDF, .ODP.

DFAs ,regular operations
closure properties ,non-determinism, equivalence of NFAs and DFAs
regular expressions,equivalence of RE and FA, the pumping lemma
Context-free languages and pushdown automata. Reading: Sipser Chapter 2.
Slides .PDF, .ODP.

-context-free grammars
-ambiguity
-pushdown automata
-equivalence of CFLs and PDAs
-pumping lemma for CFLs
-closure properties
Turing Machines and Computability. Reading: Sipser Chapter 3, 4, 5, and Problem 5.28.
Slides .PDF, .ODP.

-Turing Machine variants
-Church-Turing thesis
-cardinality of infinite sets
-diagonalization
-undecidability
-Halting Problem
-reducibility
-Rice’s theorem
Complexity. Reading: Sipser Chapter 7.
Slides .PDF, .ODP.

SE

Introduction to Software Engineering 

By Instructor: Steven A.Demurjian

Textbook: C++ programming with design patterns revealed. By Thomasz Müldner. Addison-Wesley
Textbook2:ANSI C Library Reference Guide
Download Slides from here

CSE230 Introductory Overheads (PPT)
FUNDAMENTALS OF SOFTWARE ENGINEERING OVERHEADS
SOFTWARE ARCHITECTURES 
UML: UNIFIED MODELING LANGUAGE 
SOFTWARE SPECIFICATION
  • Reading - The Specification Process: PDF

  • Overheads:  PDF
ASPECT-ORIENTD SOFTWARE DESIGN AND PROGRAMMING
 Overheads (PPT)

Course Description

An introduction and exploration of concepts and issues related to large-scale software systems development. Areas of exploration include technical complexities, organization issues, and communication techniques for large-scale development. Students participate through teams emulating industrial development. The projects cover the principal system development life-cycle phases from requirements analysis, to software design, and to final implementation. Issues relating to real-time control systems, human factors, reliability, performance, operating costs, maintainability and others are addressed and resolved in a reasonable manner, by Professor Christopher D

Resources

There will not be a specific text for this course, but several useful texts are worth considering if you are looking to expand your library:
  • Sommerville, Software Engineering, 8th EditionAddison-Wesley, 2007.
  • Hunt and Thomas, The Pragmatic ProgrammerAddison-Wesley, 2000.
  • Beck, Extreme Programming Explained: Embrace ChangeAddison-Wesley, 1999.
  • Gamma, Helm, Johnson, and Vlissides, Design PatternsAddison-Wesley, 1995.
    (Often referred to as the "Gang of Four" book)
  • Czarnecki and Eisenecker, Generative ProgrammingAddison-Wesley, 2001.
  • Meyer, Object-Oriented Software Construction, 2nd Ed., 1997.
  • Booch, Object-Oriented Analysis and Design, 2nd Ed., 1994.
Discussion Topics
Lecture Material
Course Overview
(slides: in ppt format)
Software Requirements: Overview and Motivation
(slides: in ppt format)
Project Descriptions from Traffic, Building, Island, and Infrastructure Teams
Software Requirements: Perspective and Definition
(slides: in ppt format)
Project Requirements Outlines from Traffic, Building, Island, and Infrastructure Teams
Software Requirements: Processes I
(slides: in ppt format)
Teams' Requirements Definition Documents
Software Requirements: Processes II
(slides: in ppt format)
Software Requirements: Products
(slides: in ppt format)
Software Architecture: Introduction
(slides: in ppt format)
Real World Requirements Example
(slides: in ppt format)
Software Requirements: Basic Methods I
(slides: in ppt format)

Software Requirements: Basic Methods II
(slides: in ppt format)

Software Requirements: Complex Models and Reviews
(slides: in ppt format)
Software Architecture: Specification I
(slides: in ppt format)
Software Architecture: Specification II
(slides: in ppt format)

Software Architecture: Design I
(slides: in ppt format)
Software Architecture: Specification III
(slides: in ppt format)

Software Architecture: Design II
(slides: in ppt format)
Software Architecture: Design III
(slides: in ppt format)


Course Summary: Review of Software Engineering Requirements and Architecture
(slides: in ppt format)




All Subjects Object Oriented Analysis, Design UML, DS, DLD, DAA

Really awesome for programming lovers, and i think if one is in computer science but says no to programming, den what d hell he is doing in computer science.

SLIDES:

Lecture Video Segment Link To Source Code

Orientation

-- General Orientation Orientation.ppt

Advanced Programming

1a Basics basics.ppt
1b Derived Data Types derived.ppt

Concepts in Object-Oriented Design

2a Introduction intro.ppt
2b UML - Based Notation UMLNotation.pdf

Classes

3a Introduction classIntro.ppt
3b Constructors and Destructors constAndDest.ppt
3c Access Specifiers specifiers.ppt
3d Copy Constructors copyConst.ppt
3e Static Members statMembers.ppt
3f Friends friends.ppt
3g Class Data Members and Initializers initial.ppt
3h This and Pointer to Members thisPointer.ppt
3i Member Qualifiers qualifiers.ppt

Stream Input/Output Basics

4a Basics streamBasics.ppt
4b Manipulators manipulators.ppt
4c File IO streamFiles.ppt

Abstract Data Type

5a Fraction Example fractionIE.ppt

Operator Overloading

6a Member Functions memberFunctions.ppt
6b Friend Functions & Special Forms
  • specialForms.ppt
  • formsExample.html
  • Inheritance

    7a Part I inheritanceI.ppt
    7b Part II inheritanceII.ppt

    Virtual Functions

    8a Introduction virtualFunctions.ppt
    8b Polymorphism polymorphism.ppt

    Exception Handling

    9a Introduction excepHandling.ppt

    Templates

    10a Introduction
  • templates.ppt
  • templateExamples.html
  • Standard Template Library

    11a Introduction stanTempLibrary.ppt

    History of Graphical User Interfaces

    12a Introduction historyOfGUIs.ppt

    Introduction To Visual Programming

    13a Introduction

    QT Designer

    14a demo  

    Boolean Algebra

    15a Introduction booleanAlg.ppt
    15b Standard Forms standardForms.ppt

    Digital Logic

    16a Introduction digitalLogic.ppt

    Analysis of Algorithms

    17a Introduction using Insertion Sort insertionSort.ppt
    17b Growth Rates growthRates.ppt
    17c Big-Oh bigOh.ppt
    17d Big-Omega and Big-Theta bigOhbigTheta.ppt
    17e Statement Analysis statementAnalysis.ppt

    Elementary Data Structures

    18a Array Lists arrayLists.ppt
    18b Linked Lists linkedLists.ppt

    Recursion

    19a Review of Recursion recursion.ppt

    Abstract Data Types

    20a Stacks stacks.ppt
    20b Queues queues.ppt
    20c Polynomials polynomials.ppt
    20d Sparse Matrices sparseMatrices.ppt
    20e Trees trees.ppt

    Elementary Sorting Algorithms

    21a Sorting sorting.ppt

    Quicksort

    22a Algorithm algorithm.ppt
    22b Analysis analysis.ppt

    Mergesort

    23a Introduction mergeSort.ppt

    Ethics

    24a Ethics ethics.ppt