6) What are the various types of enterprise application software?

Transcription

1 (DMCA 101) ASSIGNMENT - 1, MAY PAPER- I : INFORMATION TECHNOLOGY 1) Define information. Explain about their properties and types of information. 2) Explain about memory hierarchy. 3) Define OS? Describe various types of it. 4) What are the types of IT support systems? 5) Differences between primary and secondary storage. 6) What are the various types of enterprise application software? 7) Write a note on electronic data processing. 8) What is information system? 9) What is protocol?

2 (DMCA 101) ASSIGNMENT - 2, MAY PAPER- I : INFORMATION TECHNOLOGY 1) Differentiate among the three types of distributed processing. 2) Explain the advantages of networks. 3) Write a note on interpreters and compilers. 4) What are the applications of telecommunications. 5) What is meant by peer-to-peer network processing? 6) Distinguish between intranet and extranet. 7) What is software? 8) What is ISDN? 9) What is internet?

3 (DMCA 102) ASSIGNMENT - 1, MAY PAPER- II : PROGRAMMING WITH C++ 1) a) Explain the evolution of C++. b) Write a program to create manipulator with 2 arguments. 2) Explain different types of parameter passing mechanisms with example. 3) a) Explain about features & types of pointers. b) Explain about the access of private members with pointers. 4) Define pre-processor directive. 5) What are various types of operation in C++? 6) Define this pointer. Write a program to use this pointer and return pointer reference. 7) Discuss about I/O formats in C++. 8) Define Inline function. 9) What is data abstraction?

4 (DMCA 102) ASSIGNMENT - 2, MAY PAPER- II : PROGRAMMING WITH C++ 1) Distinguish between function overloading and operator overloading with suitable example. 2) a) What is a function template? Give an example. b) Give the generic classes and functions implemented in C++. 3) What is virtual base class? Explain. 4) What is operator overloading? Explain with example. 5) Give short notes on files. 6) Give the difference between class diagram & object diagram. 7) Define class & object. 8) What is dynamic binding? 9) Define template.

5 (DMCA 103) ASSIGNMENT - 1, MAY PAPER- III : COMPUTER ORGANIZATION 1) Describe in detail the history of computers. 2) Explain about the structure and functions of computers. 3) Explain about magnetic disk. 4) Discuss about power PC processor and explain its characteristics. 5) Write a note on Addressing modes. 6) Differentiate RISC and CISC. 7) Write a note on Cache memory. 8) What is fetch cycle? 9) What is arithmetic shift.

6 (DMCA 103) ASSIGNMENT - 2, MAY PAPER- III : COMPUTER ORGANIZATION 1) Explain about the Pentium processor. 2) Discuss about processor organization. 3) Write a note on interrupt driven I/O. 4) Write a note on instruction cycle. 5) Describe instruction pipelining. 6) Explain about user visible registers. 7) What is status register? 8) What is interconnection structure? 9) What is program counter?

7 (DMCA 104) ASSIGNMENT - 1, MAY PAPER- IV : DATA STRUCTURES 1) Explain three types of control structures with suitable examples. 2) Write bubble sort algorithm. Use it to find the number C of comparisons and the number D of interchanges which alphabetize the n = 6 letters in PEOPLE. 3) Write an algorithm to transform into infix expression into postfix expression. Apply this algorithm on the expression: 4) Explain the concept of complexity of an algorithm with an example. 5) Discuss about string-oriented operations. 6) Find the table and corresponding graph for the second pattern matching algorithm where the pattern is: ababab. 7) Explain insertion and deletion operations on two-way lists. 8) What are data structure operations? 9) What is a record?

8 (DMCA 104) ASSIGNMENT - 2, MAY PAPER- IV : DATA STRUCTURES 1) Insert 50, 33, 44, 22, 77, 35, 60, 40 into an empty binary search tree and perform the operations i) add 20 ii) add 88 iii) delete 22 iv) delete 77. 2) Write Radix sort procedure and use it to sort the elements: 348, 143, 423, 538, 128, 321, 543, ) Discuss about different types of Queues. 4) Define Ackermann function and find A(1,3). 5) Build heap tree for the numbers: 44, 30, 50, 22, 60, 55, 77, 55. 6) Explain selection sort algorithm and apply it on: 77, 33, 44, 11, 88, 22, 66, 55. 7) What is pointer array? 8) What is stack? 9) What is complete binary tree?

9 (DMCA 105) ASSIGNMENT - 1, MAY PAPER - V : OPERATING SYSTEMS 1) What is process control block? What does it contains? Explain each of them. 2) Define mutual exclusion. Write the Dekker s algorithm for mutual exclusion. 3) Discuss about different page replacement algorithms. 4) Write about the tasks performed by an operating system. 5) Explain the multilevel feedback Queues scheduling algorithm. 6) What is semaphore? Show the definition of the primitives for semaphores. 7) What is the dining philosophers problem? Write a monitor for it. 8) What is operating system kernel? 9) Define mono-programming.

10 (DMCA 105) ASSIGNMENT - 2, MAY PAPER - V : OPERATING SYSTEMS 1) Explain the following: i) Hard disk scheduling ii) RAID 2) What are the major components of security? Briefly explain them. 3) Write about the partition selection algorithms. 4) Discuss about different structures of a directory. 5) Explain about port and memory-mapped I/O. 6) Write about threat categories. 7) What is a port? 8) What is swapping? 9) What is virus?

11 (DMCA 106) ASSIGNMENT - 1, MAY PAPER - VI : DATABASE MANAGEMENT SYSTEMS 1) Explain the working of the sequential file organization with an example and write the steps of creating an indexed sequential file. 2) How will you map a conceptual data model into a relational data model? Give suitable example. 3) Explain the following with an example: i) BCNF ii) LAM 4) What are the advantages of database system/approach? Explain them in brief. 5) Illustrate the construction and working of hashed file organization with an example. 6) Write an algorithm to construct a B-tree. 7) What is an E-R diagram? Explain it with an example. 8) What are the components of DSS? 9) What is inter-record data structure?

12 (DMCA 106) ASSIGNMENT - 2, MAY PAPER - VI : DATABASE MANAGEMENT SYSTEMS 1) Explain about various DML retrieval and modification commands. 2) Decrypt the following stream of data using the tree with a degree 2 and three levels: (a, b, d, h, i, e, j, k, c, f, l, m, g, n, o) 3) Explain about different basic actions performed over databases. 4) Explain the following PC-FOCUS commands: i) FILETALK ii) TABLETALK 5) What is DDL? Give a skeleton of the DDL program of IDMS. 6) What is deadlock/deadly embrace? Illustrate it with an example. 7) What is normalization? 8) What is the use of GET HOLD NEXT command? 9) What is timestamp?

13 (DMCA 107) ASSIGNMENT - 1, MAY PAPER - VII : ACCOUNTS AND FINANCE 1) Explain different kinds of subsidary books maintained by accounting dept. 2) State the rules that are to be followed while preparing profit and loss account. 3) What are the essentials of budgetary control system? 4) Rules of double entry system. 5) Bank reconciliation system. 6) Petty cash book. 7) Concept of cost accounting. 8) Marginal cost. 9) Ledger.

14 (DMCA 107) ASSIGNMENT - 2, MAY PAPER - VII : ACCOUNTS AND FINANCE 1) Enumerate the tools used in financial analysis. 2) Elucidate the managerial uses of funds flow analysis. 3) Finance function. 4) Cash flow statement. 5) Limitations of ratio analysis. 6) Working capital gap. 7) Adjustment entry. 8) Gross working capital. 9) Cost unit.

15 (DMCA 108) ASSIGNMENT - 1, MAY PAPER - VIII : DISCRETE MATHEMATICS 1) a) Prove that n is a tautology. b) State all rules for logical Inference. 2) a) Let f(x) = x+2, g(x) = x -2 and h(x) = 3 x for x R where R is the set of real numbers. Find fog, gof, gog, foh, hog, hof and fohog. b) Symbolize the following argument and check for its validity All men are falliable All kings are men Therefore, all kings are falliable. 3) a) Find Recurrence Relation satisfying Y n = A(3) n + B (-4) n b) Write a brief note on Recursive Algorithms. 4) Prove that the following IS in tautology p p r q r p q r 5) Show that ( x) P( x) Q( x) ( x) P( x) ( x) Q( x ). 6) Explain Recorrence Relation. 7) Define homogenous Recorrence relation. 8) Define Tautology. 9) Define Recursion.

16 (DMCA 108) ASSIGNMENT - 2, MAY PAPER - VIII : DISCRETE MATHEMATICS 1) Make logic circuits for the following Boolean Expressions a) A B+ABC +C +B b) wyz wz y z xyz 2) a) Explain the following. i) Planar Graph ii) Hamilton Graph b) Explain Travelling salesman problem. 3) What is Monoid of the Machine. 4) Define and explain Adjacency Matrix. 5) What is Recursive Sub routine. 6) Explain Isomorphic graph. 7) Define Hasse Diagram. 8) Define bipartite Graph. 9) Define Ackermon s function.