GUJARAT TECHNOLOGICAL UNIVERSITY - GTUCAMPUS TECHNOLOGICAL UNIVERSITY ... Introduction to dynamic memory allocation, ... Write a program to add, multiply and divide two integers and

GUJARAT TECHNOLOGICAL UNIVERSITY

Master of Computer Application

Subject Name : Fundamentals of Programming (FOP)

Subject Code : 610001

_____________________________________________________________

Objectives: The aim of this course is to introduce to the students the rudiments of

structured programming using C language. Students will become familiar with problem

solving techniques and algorithm development.

Prerequisites: None

Contents:

1. Introduction to programming& Basics of C: Concepts of Algorithm and

Flowcharts, Process of compilation, Generation of languages, Basic features of C

Language like Identifier, Keywords, Variable, data types, Operators and Expression.

Basic screen and keyboard I/O

2. Control Statements: Test Conditions, Conditional execution and selection, Iteration

and Repetitive Executions, Nested loops.

3. Arrays: Introduction to contiguous data types. One dimensional arrays,

multidimensional arrays, Array as strings, multidimensional character arrays.

Operations on strings.

4. Functions: Concept of modular programming, Using functions, Scope of data,

Recursive functions. Command line arguments.

5. Pointers: Need of pointer, Types and uses of pointer, Array and Pointers, Pointers

and strings, Pointer to Pointer, Pointers and functions, other aspect of pointers.

6. User Defined Data Types: Introduction to structures, usage of structure, nested

structures, Union and its usage, Enumeration types, bit fields.

7. Files: Types of files, working with files, usage of file management functions.

8. Linked List: Introduction to dynamic memory allocation, singly link list, operations

on singly link list.

9. Other features of C: Bitwise operators and its usage, C Preprocessor statements.

www.gtucampus.com MCA(New Syllabus 2009) Sem-I 1 of 25

Main Reference Book(s):

1. Programming in C, by Pradip Dey & Manas Ghosh, Publisher – Oxford

Suggested Additional Reading :

1. Programming in ANSI C, by Balagurusamy, Publisher - Tata McGraw Hill.

2. Computer Science: A Structured Programming Approach Using C, by

Behrouz A. Forouzan & Richard F. Gilberg, Publisher – Thomson Education.

3. Programming with ANSI and Turbo C, by Ashok N Kamthane, Publisher –

Pearson Education.

4. Mastering C, by Venugopal & Prasad, Publisher – Tata McGraw Hill.

5. C: The Complete Reference, by Herbert Schildt, Publisher – Tata McGraw Hill.

6. Let us C, by Yashwant Kanitkar, Publisher – BPB Publication

7. Schaum's Outline of Programming with C, By: Byron Gottfried, Publisher

Shaum Series.

Chapter wise coverage from main reference Book(s) :

Chapter 1 to 11 except 10.4-10.6, 11.5-11.7

Accomplishments of the student after completing the course :

After completion of the course students should become reasonably good at problem

solving and algorithm development. They would become capable of solving problems

using computers through C programming language.




Subject Name : Programming Skills-I (FOP)


_____________________________________________________________

Program Implementation using C language

Programs based on following topic should be carried out during practical hours.

Basic C Programs

Programs based on constants, variable and diff data types.

Programs based on Operator and Expression

Programs based on Decision Making and Branching

Use of Do While loop ,For loop, while loop, if loop, if else if ladder, switch, go to

Programs based on One dimensional and two dimensional array

Programs based on character array and String manipulation functions.

Programs based on user-defined functions, Recursion

Programs based on Structures and pointers

Programs based on file management in C.

Programs based on Dynamic memory allocation and linked list

Following list is just a sample guide line:

1. Write a program to print “Hello World” message.

2. Write a program to print Name , Address and Birth Date.

3. Write a program to add, multiply and divide two integers and float numbers.

4. Write a program to convert Rupees(float) to paisa(int).

5. Write a program to accept number of days and print year, month and remaining

days.

6. Write a program to check whether the entered number is prime or not.

7. Write a program to check whether the entered number is even or odd.

8. Using While loop print 1 2 3 4 5 …..10.

9. Print series 2, 4, 6, 8,…….n.

10. Print series 2, 4, 16,……n*n using shorthand operator and while loop

11. Write a program to generate fibonnacci series.

12. Write a program to print the multiplication table.

13. Write a program to find a factorial of the entered number.

14. Write a program to print all the numbers and sum of all the integers that are

greater than 100 and less than 200 and are divisible by 7.

15. Write a program to find the roots of an equation ax2 + bx + c = 0.

16. Write a program that accept basic, HRA, and convergence from the user and

calculate total salary.


17. Print the following triangle.

a b c d e

a b c d

a b c

a b

a

18. Write a program that prints the following Floyd’s triangle.

1

2 3

4 5 6

7 8 9 10

11 ……….15

.

.

79……………………….91

19. Write a program to find maximum element from 1-Dimensional array.

20. Write a program to sort given array in ascending order.

21. Given the two 1-D arrays A and B, which are sorted in ascending order. Write a

program to merge them into a single sorted array C that contains every item from

arrays A and B, in ascending order.

22. Write a program to add two matrices.

23. Write a program to find string length.

24. Write a program to print size of int, float, double variable.

25. Write a program that will read a text and count all occurrences of a particular

word.

26. Write a program that will read a string and rewrite it in the alphabetical order. i.e.

the word STRING should be written as GINRST.

27. Write a program that appends the one string to another string.

28. Write a program that finds a given word in a string.

29. Use recursive calls to evaluate

f(x) = x – x3/3! + x

5/5! – x

7/7! + ……

30. Write a function prime that returns 1 if its argument is a prime no. and returns 0

otherwise.

31. Write a program to add first n numbers.

32. Write a function which returns 1 if the given number is palindrome otherwise

returns 0.

33. Write a function that will scan a character string passed as an argument and

convert all lower-case character into their upper-case equivalent.

34. Write a function to reverse the string.

35. Write a program that search an item from array of string.

36. Define a structure called cricket that will describe the following information:

Player name

Team name

Batting average


Using cricket, declare an array player with 50 elements and wire a program to

read the information about all the 50 players and print a team-wise list containing

names of player with their batting average.

37. In a program declare following structure member: name, code, age, weight and

height. Read all members of the structure for 100 persons and find list of persons

with all related data whose weight > 50 and height > 40 and print the same with

suitable format and title.

38. Write a program using pointers to read an array of integers and print its elements

in reverse order.

39. Write a function to calculate the roots of the quadratic equation. The function

must use two pointer parameters, one to receive the coefficients a, b, and c, and

the other to send the roots to the calling function.

40. Write a function using pointers to add two matrices and to return the resultant

matrix to the calling function.

41. Write a program to read data from keyboard, write it to a file named STUDENT

again read the same data from STUDENT file and write it into DATA file. same

data should be displayed on the screen.

42. Write a program to create linear linked list interactively and print out the list and

total number of items in the list.




Subject Name : Discrete Mathematics for Computer Science


_____________________________________________________________

Objectives: The objective of this course is to present the foundations of many basic

computer related concepts and provide a coherent development to the students for the

courses like Fundamentals of Computer Organization, RDBMS, Data Structures,

Analysis of Algorithms, Theory of Computation ,Cryptography, Artificial Intelligence

and others. This course will enhance the student’s ability to think logically and

mathematically.

Prerequisites: Knowledge of basic concepts on Sets, different operations on sets,

binary operations, functions.

Contents: 1. Mathematical Logic : Introduction, Connectives, statement formulas, principle of

substitution, validity of arguments, Quantifiers, Proof techniques.

2. Lattices and Boolean Algebra : Relation and ordering, partially ordered sets,

Lattices as poset, properties of lattices, Lattices as algebraic systems, sublattices,

direct product and homomorphism, complete lattices, bounds of lattices, distributive

lattice, complemented lattices.

Introduction, definition and important properties of Boolean Algebra, Sub Boolean

algebra, direct product and homomorphism, join-irreducible, meet-irreducible,

atoms, anti atoms, Stone’s representation theorem. (Without Proof),

Note : No proof is required for Theorems or Results on lattices and Boolean

Algebra. Theorems should be justified and explained by suitable examples .

3. Applications of Boolean Algebra : Boolean expressions and their equivalence,

Minterms and Maxterms, Free Boolean algebra, Values of Boolean expression,

canonical forms, Boolean functions, representation of Boolean function, Karnaugh

maps, minimization of Boolean function, Quine_ Mccluskey algorithm, Application

to Relational Database.

4. Group Theory : Definition and examples of groups, abelian group, cyclic groups,

permutation groups, subgroups & Homomorphism, Cosets and Lagrange’s Theorem

(without proof), Normal subgroups, Quotient Groups.

5. Graph Theory : Basic concepts of Graph theory, paths, reachability and

connectedness, matrix representation of graph, trees.


Main Reference Books :

1. “Discrete Mathematical Structures with Applications to Computer Science”, J. P.

Tremblay and R.Manohar ,Tata McGraw-Hill

2. “Discrete Mathematical Structure”, D. S. Malik, M. K. Sen, Cengage Learning

Suggested Additional Reading :

1. Discrete Mathematics and its applications, Tata McGraw-Hill, 6th

edition, K. H.

Rosen.

2. Discrete Mathematical Structure, Pearson Education, Bernard Kolmann& others,

Sixth Edition

3. Discrete Mathematics with Graph Theory, PHI, Edgar G. Goodaire, Michael M.

Parmenter.

4. Logic and Discrete Mathematics, Pearson Education, J. P. Tremblay and W. K.

Grassman.

Chapter wise coverage from the main reference books:

1. From Book # 1

Chapter – 2, article 2-3 (2-3.1 to 2-3.9)

Chapter-3, article 3-5 (3-5.1 to 3-5.4) upto Theorem 3-5.8

Chapter – 4, articles 4-1 to 4-4

Chapter – 5, article 5-1 (5-1.1 to 5-1.4)

2. From Book # 2

Chapter – 1, articles 1.2 to 1.5

Chapter-3 article 3.3

Accomplishment of the student after completing the course :

The student will be able to apply concepts to RDBMS, perform minimization of Boolean

functions, shall learn the fundamentals representations methods of graphs and trees. They

shall be able to use different logical reasoning to prove theorems.




Subject Name : Fundamentals of Computer Organization


_____________________________________________________________

Objectives : Students will learn

• The elements of Computer Organization and Architecture.

• The basic knowledge necessary to understand the hardware operations

of digital computers.

Prerequisites : None

Contents:

1. Basic Components of a digital computer

2. Number Systems • Decimal System

• Bistable Devices

• Binary, Octal and Hexadecimal numbers.

• Number Base conversions

• Binary Addition, Subtraction, Multiplication, Division

• Complements o Use of complements to represent Negative Numbers

o Binary Number Complements

o Complements in other Number Systems.

• Binary codes

o Weighted and Non-weighted codes

� BCD Code

� Excess Three (XS-3) Code

� Gray Code

• Binary to Gray & Gray to Binary o Error detecting and correcting codes

� Parity and Hamming code

3. Boolean Algebra and Logic Gates • Fundamental Concepts of Boolean Algebra

• Logical Multiplication

• AND & OR gates


• Complementation & Inverters

• Evaluation of Logical Expressions

• Basic Laws of Boolean Algebra

• Proof by Perfect induction

• Simplification of Expressions

• De Morgan’s Theorems

• Basic duality of Boolean Algebra

• Derivation of a Boolean Expression

• Interconnecting gates

• Sum of Products and Product of Sums

• Derivation of Product-of-Sums expressions

• Derivation of Three input variable expressions

• NAND & NOR gates

• Map Method for Simplifying Expressions

o K-map ( Four Variables)

o Cubes & covering

o Don’t Cares

• Design Using NAND Gates

• Design Using NOR Gates

• NAND to AND & NOR to OR gate Networks

4. Logic Design • Flip-Flops

• Transfer Circuit

• Clocks

• Flip-Flop Designs

• Gated Flip-Flop

• Master Slave Flip-Flop

• Shift Register

• Binary Counter

• BCD Counter

• Counter Design

5. The Arithmetic-Logic Unit • Construction of the ALU

• Integer Representation

• Binary Half-Adder

• Full-Adder

• Parallel Binary Adder

• Positive & Negative Numbers

• Addition in the 1’S Complement System

• Addition in the 2’S Complement System


• Addition and subtraction in a parallel Arithmetic Element

• Binary Coded Decimal Adder

• Sift Operations

• Binary Multiplication

• Binary Division

6. Digital Components • Integrated Circuits

• Decoders

o NAND gate Decoder

o Decoder Expansion

• Encoders

• Multiplexers

• Memory Units

o Random-Access Memory

o Read-Only Memory

o Types of ROMs

7. Central Processing Units • Stack Organization (Intro.)

• Instruction Formats

• Addressing modes

8. Input-Output Organization • Peripheral Devices

• Asynchronous Data Transfer

o Handshaking

• Modes of Transfer

o Programmed I/O

o Interrupt-initiated I/O

o Direct Memory Access (DMA)

• Direct Memory Access (DMA)

9. Memory Organization • Memory Hierarchy

• Main Memory

o RAM, ROM, Bootstrap Loader

• Auxiliary Memory

o Magnetic Disk

o Magnetic Tape

• Cache Memory (Intro)

• Virtual Memory (Intro)


10. Peripheral Devices * ( Intro) • Key Board

• Mouse

• Display Unit

• Printer (Types)

• Scanner

• OCR-OMR-MICR

• Multimedia Projector

Main Reference Book(s): 1. Digital Computer Fundamentals , Tata McGraw Hill, 6

th Edition, Thomas C.

Bartee

2. Computer System Architecture, PHI/Pearson Education, 3rd

Edition, M. Morris

Mano

Suggested Additional Reading: 1. Fundamentals of Digital circuits,PHI/Pearson Education, A. Anand Kumar

Chapter wise Coverage from the main reference book(s): 1. Digital Computer Fundamentals – Thomas C. Bartee

Chapter – 1 : 1.7

Chapter – 2 : Whole

Chapter – 3 : 3.1 to 3.23

Chapter – 4 : 4.1 to 4.9, 4.12

Chapter – 5 : 5.1 to 5.9, 5.11, 5.14, 5.16 to 5.18

2. Computer System Architecture – M. Morris Mano

Chapter – 2 : 2.1 to 2.3, 2.7

Chapter – 8 : 8.3 to 8.5

Chapter – 11 : 11.1, 11.3, 11.4, 11.6

Chapter – 1 : 12.1 to 12.3, 12.5, 12.6

* Peripheral Devices may be covered from Internet or any latest books.

Accomplishments of the student after completing the course:

Students will get the knowledge of computer organization and architecture. They will

know the actual working and organization of digital computer system.




Subject Name : Database Management Systems-I


_____________________________________________________________

Objectives: This course is intended to introduce the fundamental concepts necessary

for designing , using and implementing Database systems and applications

Prerequisites: Basic Knowledge of working with Computer.

Contents:

1. Introduction : Basic Concepts: data, database, database systems, database

management system, Purpose and advantages of Database management system (over

file systems), data models: Introduction; Three level architecture, Overall architecture

of DBMS, Various components of a DBMS

2. Relation Data Model : Relational Structure – tables (relations), rows (tuples),

domains, columns (attributes), Entity sets, attributes, Types of entities, Relationships

(ER) and Types of relationships, Database modeling using entity and relationships,

Enhanced entity relationship diagrams , keys: super key, candidate keys, primary key,

entity integrity constraints, referential integrity constraints.

3. Database Design : Relational structure – tables (relations), rows (tuples), domains,

columns (attributes), Database design process, Anomalies in a database, Functional

Dependencies (Lossless decomposition, Dependency preservance, Closure set of FD,

Canonical Cover, Lossless Joins), Finding Candidate keys using Armstrong rules,

Stages of Normalization: 1NF, 2NF, 3NF, BCNF (with general definition also) and

Multivalued Dependency: 4NF & 5NF (Project Join NF) Translation of E-R schemes

(logical design) to relational schemes (Physical design): A case study.

4. Data Dictionary & Utilities

Introduction to data dictionary, Usage of data dictionary.

Main Reference books :

1. Database System Concepts- Silberschatz, Korth, Sudarshan, Fifth Edition,

McGraw Hill

2. Fundamentals of Database Systems, Elmsasri ,Navathe, Pearson Education, Fifth

Edition (2008)


3. An Introduction to Database Systems, C.J.Date, a Kannan, S Swaminathan,

Pearson Education, Eighth Edition (2006) (Equivalent Reading)

4. Oracle 9i, PL/SQL Programming by Scoot Urban, Oracle Press

Suggested Additional Reading:

1. Database Systems: Concepts, Design and Applications, S. K. Singh. Pearson

Education

2. Database Management Systems, Ramakrishnan, Gehrke, McGraw Hill,Third

edition

3. Database Systems: Design, Implementation and Management, Peter Rob, Carlos

Coronel, Cengage Learning, seventh edition (2007)

4. Practice book on SQL and PL/SQL by Anjali, Amisha, Roopal and Nirav

publications.

5. SQL, PL/SQL – The programming Language Oracle-by Ivan Bayross

6. Database management Systems, Leon and Leon, Vikas Publication

Chapter wise Coverage from the Main book(s):

Book No. 1: Chapter 1, 6,7, 11( 11.8)

Book No. 2: Chapter 14,15


Effective user or a DBMS Professional. A student would be able to effectively squeeze

the “real world” data into the relational data model of the database system and would be

able to retrieve the data afterwards, Designing, Stored procedures, utilization of

triggers/cursors to control and retrieve data efficiently




Subject Name : Software Lab (SQL & PL/SQL)


_____________________________________________________________

SQL

Introduction to SQL, Advantages of using SQL

Database concepts

SQL concepts and tools

The generic SQL Sentence Construct

Create Table

The Create Table Command

Creating a table from a table

Insertion of Data into tables

Inserting of data into a table

Inserting of data into a table from another table

Viewing data in the tables

View all rows and columns

Selected columns and all rows

Select rows and all columns

Selected columns and selected rows

Elimination of duplicates from the select statement

Sorting of data in a table

Delete Operations

Remove of all rows

Removal of a specified row(s)

Update Operations

Updating of all rows

Updating records conditionally

Modifying the structure of tables

Adding new columns

Modifying existing columns

Renaming Tables

Destroying Tables

Examining Objects created by a User


Arithmetic Operators

Logical Operators

Range Searching

Pattern Matching

Column Alias

Aggregate Functions

Scalar Functions

Date Conversion Functions

Data Constraints

Defining integrity constraints in the alter table command

Dropping integrity constraints in the alter table command

Default Value Concept

Grouping Data from tables

Using the WHERE clause with grouped data

Using the HAVING clause with grouped data

Comparison of WHERE and HAVING

Manipulating dates in SQL

To_char, To_Date, Special Date Formats using to_char functions

Subqueries

Joins

Inner Join, Equi Joins, Self Join, Outer Joins

Union, Intersect and Minus Clause

Index

View

Sequence

PL/SQL

Understanding the main features of PL/SQL, PLSQL Architecture, advantages of using

procedures The Generic PL/SQL Block

PL/SQL

Character Set

Literals

Data Types

Constant

Branching and Loop statements

Operators

Comments

Displaying user messages on the screen


Cursor

Implicit Cursor

Explicit Cursor

Cursor For Loops

Parameterized Cursors

Select for Update Cursors

Cursor Variables

Error Handling

User-Named Exception Handlers

User –Defined Exception Handlers (for I/O validations)

User–Defined Exception Handlers (for Business Rule validations)

Procedures

Functions

Packages

Triggers

SQL QUERIES( Based on DDL statement, constraints, DML statement,

SELECT statement and Views.)

Note : In all schemas, Create the table with necessary constraints ( PK, FK,

Notnull, Unique and Check constraints) on SQL prompt and then solve the

given queries.

Question 1 Customer Item schema queries which fall in all the categories mentioned above.

CUST(Custno, cname, state, phone)

ITEM(itemno, Itemname, Itemprice, Qty_hand)

INVOICE(Invno, invDate, Custno)

INVITEM(Invno, Itemno, Qty)

1. Create four table along with necessary constraints( PK,FK,notnull, Unique and

Check constraints)

2. Write a Insert script for insertion of rows with substitution variables.

3. Add a column to the Item table, which will allow us to store Item color field.

4. Write SELECT statement for the given queries.

a. Display Item name, Price in sentence form using concatenation

b. Find total value of each item based on quantity on hand

c. Find customers who are from state of Gujarat.

d. Display items with unit price of at least Rs. 100


e. List items whose range lies between Rs. 200 and Rs. 500

f. Which customers are from lalbaug area of Ahmedabad, Baroda and Patan.

g. Find all customers whose name start with Letter ‘P’.

h. Find name of items with ‘W’ in their name.

i. Sort all customers alphabetically

j. Sort all items in descending order by their prices.

k. Display all customers from M.P alphabetically

l. Display invoices dates in ‘September 05, 2007’ format.

m. Find total, average, highest and lowest unit price

n. Count number of items ordered in each invoice

o. Find invoices in which three or more items are ordered.

p. Find all possible combination of customers and items ( use Cartesian

product)

q. Display all item quantity and item price for invoices ( natural join)

r. Find total price amount for each invoice.

s. Use outer join to display items ordered as well as not ordered so far.

t. Find invoices with ‘Gear’ in their item name.

u. Display name of items ordered in invoice number 1001

v. Find the items that are cheaper than ‘Bullet’.

w. Create a table ( namely guj_cust) for all Gujarat customer based on existing

customer table

x. Copy all M.P customers to the table with Gujarat customers

y. Rename Guj_cust table to MP_cust table.

z. Find the customers who are not in Gujarat or M.P

aa. Delete rows from customer table that are also in MP_cust table

bb. Find the items with top three prices

cc. Find two items with lowest quantity on hand

dd. Create a simple view with item names and item price only

ee. Create a sequence that can be used to enter new items into item table

ff. Add a new item into item table with sequence just created.

gg. Create a index file to speed up a search based on customer name

hh. Lock customer Mr. Shah record to update the state and phone no.

ii. Give everybody select and insert rights on your item table

jj. Revoke the insert option on item table from user ‘Roshi’


Question 2 STUDENT(rollno,name,class,birthdate)

COURSE(courseno, coursename, max_marks, pass_marks)

SC(rollno,courseno,marks)

1. Add constraint that marks entered are between 0 to 100 only.

2. While creating COURSE table, primary key constraint was forgotten. Add the

primary key now.

3. Display details of student where course is ‘Data Base Management System’.

4. Select student names who have scored more than 70% in Computer Networks and

have not failed in any subject.

5. Select names and class of students whose names begin with ‘A’ or ‘B’.

6. Display average marks obtained by each student.

7. Select all course where passing marks are more than 30% of average maximum

marks.

8. Select the course where second and third characters are ‘AT’.

9. Display details of students born in 1975 or 1976.

Question 3 HOSTEL (H#, hname, haddr, total_capacity, warden)

ROOM (h#, r#, rtype, location, no_of_students, status)

CHARGES (h#, rtype, charges)

STUDENT (sid, sname, saddr, faculty, dept, class, h#, r#)

FEES (sid, fdate, famount)

The STATUS field tells us whether the room is occupied or vacant. The charges

represent the term fees to be paid half yearly. A student can pay either the annual fees at

one time or the half yearly fees twice a year.

1. Add a check constraint to the room table so that the room type allows the following

values only – ‘s’ for single, ‘d’ for double, ‘t’ for triple and ‘f’ for four-seater.

2. Display the total number of rooms that are presently vacant.

3. Display number of students of each faculty and department wise staying in each

hostel.

4. Display hostels, which have at least one single-seated room.

5. Display the warden name and hostel address of students of Computer Science

department.

6. Display those hostel details where single seated or double-seated rooms are vacant.

7. Display details of hostels occupied by medical students.

8. Display hostels, which are totally occupied to its fullest capacity.


9. List details about students who are staying in the double-seated rooms of Chanakya

Hostel.

10. Display the total number of students staying in each room type of each hostel.

11. Display details about students who have paid fees in the month of Nov. 2003.

12. For those hostels where total capacity is more than 300, display details of students

studying in Science faculty.

13. Display hostel details where there are at least 10 vacant rooms.

14. Display details of students who have still not paid fees.

15. Display those hostels where single-seated room is the costliest.

Question 4 Screen(screen_id,location ,seating_cap)

Movie(movie_id,movie_name,date_of_release)

Current(screen_id,movie_id,date_of_arrival,date_of_closure)

Value of screen_id must start with letters ‘S’.

Attribute location can be any one of ‘ FF’, ‘SF’, or ‘TF’.

Date_of_arrival must be less than date_of_closure.

Solve the following queries based on the above schema:

1. Get the name of movie which has run the longest in the multiplex so far.

2. Get the average duration of a movie on screen number ‘S4’.

3. Get the details of movie that closed on date 24-november-2004.

4. Movie ‘star wars III ‘ was released in the 7th

week of 2005. Find out the date of its

release considering that a movie releases only on Friday.

5. Get the full outer join of the relations screen and current.

Question 5 DISTRIBUTOR (DNO, DNAME, DADDRESS, DPHONE)

ITEM (ITEMNO, ITEMNAME, COLOUR, WEIGHT)

DIST_ITEM (DNO, ITEMNO, QTY)

1. Add a column CONTACT_PERSON to the DISTRIBUTOR table with the not

null constraint.

2. Create a view LONDON_DIST on DIST_ITEM which contains only those

records where distributors are from London. Make sure that this condition is

checked for every DML against this view.

3. Display details of all those items that have never been supplied.

4. Delete all those items that have been supplied only once.


5. List the names of distributors who have an ‘A’ and also a ‘B’ somewhere in their

names.

6. Count the number of items having the same colour but not having weight between

20 and 100.

7. Display all those distributors who have supplied more than 1000 parts of the same

type.

8. Display the average weight of items of same colour provided at least three items

have that colour.

9. Display the position where a distributor name has an ‘OH’ in its spelling

somewhere after the fourth character.

10. Count the number of distributors who have a phone connection and are supplying

item number ‘I100’.

11. Create a view on the tables in such a way that the view contains the distributor

name, item name and the quantity supplied.

12. List the name, address and phone number of distributors who have the same three

digits in their number as ‘Mr. Talkative’.

13. List all distributor names who supply either item I1 or I7 and the quantity

supplied is more than 100.

14. Display the data of the top three heaviest ITEMS.

Question 6 WORKER (worker_id, name, wage_per_hour, specialised_in, manager_id)

JOB (job_id, type_of_job, status)

JOB_ASSIGNED (worker_id, job_id, starting_date, number_of_days)

1. Display the date on which each worker is going to end his presently assigned job.

2. Display how many days remain for each worker to finish his job.

3. Display the STARTING_DATE in the following format – ‘The fifth day of the

month of October, 2004’.

4. Change the status to ‘Complete’ for all those jobs, which started in year 2000.

5. Display job details of all those jobs where at least 25 workers are working.

6. Display all those jobs that are already completed.

7. Find all the jobs, which will begin within the next two weeks.

8. List all workers who have their wage per hour ten times greater than the wage of their

managers.

9. List the names of workers who have been assigned the job of molding.

10. What is the total number of days allocated for packaging the goods for all the

workers together.

11. Which workers receive higher than average wage per hour.

12. Display details of workers who are working on more than one job.


13. Which workers having specialization in polishing start their job in December?

14. Display details of workers who are specialized in the same field as that of Mr.

Cacophonix or have a wage per hour more than any of the workers.

Question 7 PUBLISHER(publ_id, publ_name, contact_person, contact_addr, contact_phone)

CATEGORY(cat_id, cat_details, max_books, duration)

BOOK_MASTER(book_id, bname, isbn_no, total_copies, publ_id)

MEMBER(member_id, mname, cat_id, mem_ship_dt)

ISSUE(ISSUE_id, member_id, book_id, issu_ret, issue_ret_dt)

In the above tables duration is in years and it stores the membership duration for that

category.

Change the table design of ISSUE table to add a constraint, which will allow only ‘I’ or

‘R’ to be entered in the ISSUE_RET column, which stores the action whether the book is

being issued or returned.

2. Add a column to the MEMBER table, which will allow us to store the address of

the member.

3. Create a table LIBRARY_USERS which has a structure similar to that of the

MEMBER table but with no records.

4. Give details about members who have issued books, which contain ‘DATA’

somewhere in their titles.

5. Display the books that have been issued at the most three times in the year 2003.

6. Display which books of publisher PHI that are issued right now.

7. Display details about books whose all copies are issued.

8. Display the book details and members for books, which have been issued between

1st Oct 2005 and 15th Nov 2005.

9. Display all staff members who have issued at least two books.

10. Display details about those publishers whose more than 100 books are available in

the library.

11. Delete all those members whose membership has expired.

14How many members registered in the last three months ?

15Display since how many months has each staff member registered.


Question 8 APPLICANT (aid, aname, addr, abirth_dt)

ENTRANCE_TEST (etid, etname, max_score, cut_score)

ETEST_CENTRE (etcid, location, incharge, capacity)

ETEST_DETAILS (aid, etid, etcid, etest_dt, score)

(This database is for a common entrance test which is being conducted at a number of

centers and can be taken by an applicant on any day except holidays)

1. Modify the APPLICANT table so that every applicant id has an ‘A’ before its

value. E.g. if value is ‘1123’, it should become ‘A1123’.

2. Display test center details where no tests were conducted.

3. Display details about applicants who have the same score as that of Jaydev in

‘ORACLE FUNDAMENTALS’.

4. Display details of applicants who appeared for all tests.

5. Display those tests where no applicant has failed.

6. Display details of entrance test centers which had full attendance between 1st Oct

05 and 15th

Oct 05.

7. Display details of the applicants who scored more than the cut score in the tests

they appeared in.

8. Display average and maximum score test wise of tests conducted at Mumbai.

9. Display the number of applicants who have appeared for each test, test center

wise.

10. Display details about test centers where no tests have been conducted.

11. For tests, which have been conducted between 2-3-04 and 23-4-04, show details

of the tests as well as the test centres.

12. How many applicants appeared in the ‘ORACLE FUNDAMENTALS’ test at

Chennai in the month of February ?

13. Display details about applicants who appeared for tests in the same month as the

month in which they were born.

14. Display the details about APPLICANTS who have scored the highest in each test,

test centre wise.

15. Design a read only view, which has details about applicants and the tests that he

has appeared for.


LIST of queries that fall under different catageries

Topics Question

DDL( create, alter

and drop ) 5(1),7(1,2,3)

DML ( insert,

delete,update) 5(4),6(4,6),7(11),8(1),3(1),2(1),

FUNCTIONS 2(6),5(8),6(5), 7(9,10),8(6,8,9),3(3,10,13)

Simple SELECT 2(3,5,8), 5(5,9), 6(1,3)

Natural JOIN 2(4), 5(10,18), 6(8,9,10,13), 7(8,9), 8(4,7,11,12,13), 3(5)

Subquery 5(3,7,12),4(1), 6(6,9,11,12,14), 7(4,10,15), 8(3,5,6),

3(4,6,7,9,12,13)

Group by and Order 2(6), 3(3,10,13), 5(8), 6(5), 7(9,10), 8(6,8,9)

Join using SET

operators 8(2,10), 3(14)

Complex Joins 5(14), 4(5), 7(6,7), 8(14), 3(8,15)

Date Functions 2(9), 4(3,4), 6(1,2,6,7,13), 7(5,8,15), 8(6, 11 ,12,13), 3(2,11)

Views 5(2,11), 8(15)




Subject Name : Enterprise Resources & Financial Management


_____________________________________________________________

Objectives:

To provide awareness of the underlying financial structure and procedure of the

organization so that the interaction of financial systems with information systems can be

understood by the information system designers.

Contents:

1. ERP Introduction – Enterprise resource planning, Benefits of ERP, business process

reengineering, Data wherehousing, Data Mining, On line Analytical Processing

(OLAP), Supply Chain Management ERP Modules – Introduction, Business modules

in ERP , finance

2. Introduction to accounting, Accounting mechanics-I Basic records, Accounting

mechanics-II Final Accounts

3. Analysis and Interpretation of Financial Statements

4. Budgetary Control

5. Project Management

6. Fixed Assets and Depreciation Accounting, Standards for Control

Main Reference Book(s):

1. A textbook of Financial Cost and Management Accounting by Dr. P. Periasamy,

Himalaya Publishing House.

2. Accounting and Financial Management by D.R. Patel, Atul Prakashan.

3. ERP Demystified by Alexis Leon, Tata McGrawHill Publication.

Suggested Additional Reading:

1. Accounting for Management by N.P. Srinivasan, M. Sakthivel Murugan, S. Chand.

Chapter Wise Coverage from Main Reference Book(s):

1. ERP Introduction – Chapter 1-9 (From Alexis Leon)

2. ERP Modules – Chapter 20,21 (From Alexis Leon)

3. Accounting Principles and Concepts, Double Entry System of Accounting,

Accounting Books and Records, Final Accounts (Chapter 2 to 4 from Dr.

Periasamy).

4. Ratio Analysis (Chapter 9 from Dr. Periasamy).


5. Forecasting and Budgetary Control (Chapter 11 from D.R. Patel) excluding methods

of forecasting and proforma financial statements.

6. Project Management (Chapter 12 from D.R. Patel), only project appraisal

techniques.

7. Fixed Assets and depreciation Accounting (Chapter 5 from D.R. Patel) excluding

implication of the cost concepts and financial accounting treatment of depreciation,

cash flow implications of depreciation, taxation and depreciation accounting,

accounting standards for depreciation.

8. Standard Costing (Chapter 8 from D.R. Patel)

9. Break Even Analysis (Chapter 10 from D.R. Patel)


Students will have insight of Enterprise resource planning, Business modules and Financial

management


Documents

GUJARAT TECHNOLOGICAL UNIVERSITY - GTUCAMPUS TECHNOLOGICAL UNIVERSITY ... Introduction to dynamic memory allocation, ... Write a program to add, multiply and divide two integers and