Client-Server Computing for M.C.A.

IFTM UNIVERSITY
DEPARTMENT OF COMPUTER APPLICATIONS
Client-Server Computing 
MDSET 02(4)
Assignment:#1

Q1. Explain client-server computing with its characteristics. What is a single system image?

Q2. What are the services of the server? Explain the network operating system.

Q3. Define right-sizing, upsizing, and downsizing.

Q4. What is the system integration life cycle?

Q5. What do you mean by object linking and embedding?

Q6. What are bridges and routers?

IFTM UNIVERSITY
DEPARTMENT OF COMPUTER APPLICATIONS
Client-Server Computing 
MDSET 02(4)
Assignment:#2

Q1. What are system availability, serviceability, help desk, and remote management system ?

Q2. What do you mean by training advantages of GUI applications?

Q3. Explain the difference between end-user training and database administrator training.

Q4. What is preserving mainframe applications through porting?

Q5. What are the different client services? Explain

Q6. What do you mean by inter-process communication?

"TO GET THE ANSWERS OF ALL QUESTIONS USE THE FOLLOWING LINK"

https://www.scribd.com/document/37563703/Client-Server-Computing
(COMPLETE BOOK OF CLIENT-SERVER COMPUTING BY PATRICK SMITH)

Data Structure & Algorithms for M.C.A.

IFTM UNIVERSITY

DEPARTMENT OF COMPUTER APPLICATIONS

DATA STRUCTURE & ALGORITHM

MCA
Assignment: #1

Q1. Define Data Structure.

Q2. Explain the classification of Data Structure.

Q3. Explain various operations performed on Data Structures.

Q4. Explain complexity and its types considering any algorithm?

Q5. What is a 2-Dimensional Array? Explain in detail.

Q6. Write an algorithm for linear search. Discuss its cases.

Q7. Define Stack. Write an algorithm for pop operation.

Q8. What is a circular queue? Write an algorithm for deleting an element.

Assignment: #2

Q1. What is Binary Tree?

[HINT: https://www.youtube.com/watch?v=uWBqWvjreNo&t=725s]

Q2. Explain INORDER, PREORDER and POST ORDER traversal of binary tree.

[HINT: https://www.youtube.com/watch?v=cbaWHXSsSCY&t=232s ]

Q3. Explain linked representation of binary tree with example?

[HINT: https://www.youtube.com/watch?v=l7P4ESrSaqc ]

Q4. Explain Linear array representation of binary tree with example?

[HINT: https://www.youtube.com/watch?v=disnC1RFE4M&t=82s  ]

Q5. Create a binary tree using inorder and preorder traversal

Inorder = 3,6,7,11,13,15,16

Preorder = 11,6,3,7,15,13,16

[HINT: https://www.youtube.com/watch?v=LrmitUxgXbc&t=72s  ]

Q6. Create a binary tree using Inorder and Postorder Traversal

Inorder = 4, 2, 5, 1, 6, 3, 7

Post-order = 4, 5, 2, 6, 7, 3, 1

[HINT: https://www.youtube.com/watch?v=IVlCn-DNO5k ]

                                                                      Assignment: #3 (MCQ)

  NOTE: CHOOSE CORRECT OPTION AND EXPLAIN IN A SINGLE STATEMENT

1) What is Data Structure?
A.Way to organize data
B.Accessing of data elements in specified manner
C.Organization of mathematical and logical concepts
D.All of Above

2) The memory address of the first element is called ?
A.Floor Address
B.Foundation Address
C.First Address
D.Base Address

3) The operation of the processing element is called?
A.Traversing
B.Inserting
C.Deleting
D.Searching

4) The terms PUSH and POP are related to ?
A.Arrays
B.Stacks
C.Linked List
D.None

5) In order traversal of binary search tree will produce −
A.unsorted list
B.reverse of input
C.sorted list
D.none of the above

6) Queue data structure works on
A.LIFO
B.FIFO
C.FILO
D.none of the above

7) Which of the following data structure is non-linear type?
A. Strings
B. Lists
C. Stacks
D. None of above

8) An algorithm that calls itself directly or indirectly is known as
A. Sub algorithm
B. Recursion
C. Polish notation
D. Traversal algorithm

9) When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
A. underflow 
B. overflow
C. housefull
D. saturate

10) Two main measures for the efficiency of an algorithm are
A. Processor and memory
B. Complexity and capacity
C. Time and space
D. Data and space

IFTM UNIVERSITY

DEPARTMENT OF COMPUTER APPLICATIONS

DATA STRUCTURE & ALGORITHM

BCA 212
Assignment: #4

SUBMIT THIS ASSIGNMENT BEFORE 21/5/2020

Q1. What is a Linked list? Give a memory representation of the Linked list.

Q2. What is the Avail list? Explain underflow and overflow in a linked list.

Q3. Write an algorithm to insert an element into a Linked list.

Q4. Write an algorithm to delete an element from a Linked list.

Q5. How polynomial representation is possible in Linked list. Explain

Q6. Write short note on the following:
       a) Doubly Linked list
       b) Circular Linked list
   c) Header Linked list

HOW TO SUBMIT:

1. Write answers to the above assignments by hand on a copy.

2. Take a photo of each page on your mobile.

3. Install clearscanner app from play store

4. Convert assignment images into one pdf file 

5. Whatsapp this one pdf file that has two assignments on 9997213060 or mail me lalitjohari@gmail.com.
6. You can also find it all on lalitjohari.blogspot.com

ANY STUDENT CAN FIND COMPLETE STUDY MATERIAL OF DATA STRUCTURE USING THE FOLLOWING LINKS:

CHAPTER 1: https://edutechlearners.com/download/DS/01Introduction.pdf
CHAPTER 2: https://edutechlearners.com/download/DS/02Arrays.pdf
CHAPTER 3: https://edutechlearners.com/download/DS/04Stacks.pdf
CHAPTER 4: https://edutechlearners.com/download/DS/05Queues.pdf
CHAPTER 5: https://edutechlearners.com/download/DS/06Linked_List.pdf
CHAPTER 6: https://edutechlearners.com/download/DS/07Trees.pdf
CHAPTER 7: https://edutechlearners.com/download/DS/08Sorting.pdf