Computer Networks' Question Papers!!!

Computer Networks  -->>

These are the questions compiled together from all the previous years' question papers of COMPUTER NETWORKS. So first try to prepare these topics and then go for the whole book. :-)

NOTE: The number in bracket denotes the number of times the question has been asked in previous exams.

1. Explain any 2 IEEE 802 standards with the format of the frames. (4)
2. What is a window? Explain the concept of sliding window. Explain in short the two methods used in sliding window protocol along with the window sizes required at the sender and the receivers side and why? (4)
3. Unguided transmission medium (3)
4. Congestion. Various methods of preventing and reducing the in congestion in the network. (3)
5. Network security? Symmetric and Asymmetric methods to make the data secure and explain the RSA algorithm in detail.
6. Explain SMTP, FTP, E-mail.
7. Satellite. Various categories of Satellite. (2)
8. Services provided by the network layer?  Bellman Ford Routing Algorithm. 
9. Protocols that are used for resolving the addresses at the network layer.
10. Concept of layered communication model. Explain OSI reference model and compare it with the TCP/IP. (3)
11. Signaling? What layer does the job of signaling and how? Explain 4 methods to convert digital data to digital signal.
12. Multiplexing
13. Switching
14. Multicasting
15. IPv6
16. Four way handshake in TCP. (2)
17. Optimality principle. Link State Routing Algorithm. (3)
18. Difference between CSMA, CSMA/CD and collision free protocol. (2)
19. Three way handshake for TCP connection establishment. (2)
20. With respect to IP address, explain class of IP address, subnet masking in details.
21. HDLC frame format in details. 
22. Fragmentation. Why is it needed? How is it done? (2)
23. ARP
24. MIME (2)
25. Hamming code
26. Multiplexing
27. Tunneling (2)
28. Define orbit, period. (3)
29. IPv6 header in details
30. DHCP
31. FTP (2)
32. UDP header
33. Modulation (2)
34. PCM (2)
35. Subnetting/supernetting
36. Circuit switching/packet switching
37. Compare Symmetric Key Cryptography and Asymmetric Key Cryptography.
38. DES algorithm
39. TPC/IP connection termination process in detail.
40. Explain persistence, non persistence, persistence CSMA protocol in details. 

41. Piggy banking. Advantages/Disadvantages.

NOTE: If anyone feels that the notes he/she has is in a very easy language on any topic, you can send it to LastMinuteStudyARN@gmail.com. It will be published on the site with your name.

 Thanks.

ABHILASH RUHELA

Data Structure's Question Papers!!!

Data Structure  -->>

These are the questions compiled together from all the previous years' question papers of DATA STRUCTURE. So first try to prepare these topics and then go for the whole book. :-)

NOTE: The number in bracket denotes the number of times the question has been asked in previous exams.

1. Implement heap sort of given numbers. [Numbers will be given]
2. Explain binary tree as a Data Structure. 
3. Write algorithms for:- 
a. Inserting an element in the binary tree
b. Searching a given element in the binary search tree. (4)
4. Define a circular queue. Explain how a circular queue can be implemented using arrays. Write algorithms to enqueue and dequeue an element to and from a circular queue. (4)
5. Hashing? Use digit extraction method and linear probing store the given keys in an array with 19 elements. How many collisions occur? What is the density of the list after the keys are inserted? [Set of numbers would be given].
6. Write an algorithm to sort elements using Quick Sort. 
7. What is a graph? Explain various methods of storing a graph. Write algorithms to add a vertex and delete an edge.
8. What is a height balanced tree? Write an algorithm to Rotate AVL tree right and illustrate with a help of an example. 
9. Define a B-tree. Build a B-tree of order 3 created by inserting the data in sequence. [Numbers would be given]. (4)
10. What is analysis of algorithm? Discuss the concept of best, average and worst case of an algorithm? (2)
11. Define an expression tree. The following infix expression is given. Draw the expression tree and find the prefix and post fix expression. (A+B*(C/D)-E)*(F/(G+H-J)
12. Define a minimum spanning tree. Write an Kruskal’s algorithm to generate a minimum spanning tree of a given graph. Also write Prim’s algorithm. (4)
13. Explain the preorder, postorder and inorder traversal of a tree with their algorithms. (3) 
14. What is a double linked list? For a doubly linked list, write algorithms to: (2)
a. Append two lists together.
b. Delete an element from the list.
15. Explain the interpolation search algorithm.
16. Differentiate between:
a. Singly linked list and Doubly linked list (2)
b. Tree and Graph
17. Algorithm to sort elements using Bubble sort.
18. Reheapup operation for a heap. Create max heap for given numbers. 
19. Write algorithm for searching the element in doubly linked list and print the list elements in reverse order.
20. Define clustering in hash list. Using mid-square method and key offset, store the keys shown below in array of size 13. 55, 65, 20, 12, 66, 26, 90.
21. Define Binary tree traversal. Explain breadth-first traversal of a graph with example. (2) 
22. Define collision. Explain collision resolution methods with e.g. (2)
23. Define M-way tree. 
24. Define graph. Distinguish between undirected and directed graphs. How adjacency list stores graph information into it?
25. Write the algorithm to insertion sort.
26. Define and explain the Stack Data structure. Give algorithm for PUSH, POP, stack, StackFull and StackEmpty. (2)
27. For a singly linked list, write algorithms to:-
a. Delete an element
b. Append one list to the other
c. Count the number of nodes in the list
28. Give algorithm for depth-first traversal of the graph. (2)
29. AVL tree? Explain with e.g. to rotate an AVL tree left and write the algorithm. (2)
30. Find Huffman code from the “given data”. (2)
31. What is heap? Write algorithm for:- (2)
a. Building a heap.
b. Deleting a heap.
32. Big-O notation
33. Circular Linked List
34. Midsquare hashing method. Solve the given example. 
35. General tree? Write steps to convert general tree to a binary tree. 
36. Algorithm for Shell sort. 

37. Djikstra’s algorithm to determine the shortest path in a graph.

NOTE: If anyone feels that the notes he/she has is in a very easy language on any topic, you can send it to LastMinuteStudyARN@gmail.com. It will be published on the site with your name.

 Thanks.

ABHILASH RUHELA

E-Business All Important Topics Covered!!!

E-Business -->>

           I have tried to cover almost all the important and major topic of E-Business in this notes. 

            This Note comprises of three PDF files. Please download all of them. 

CLICK HERE TO DOWNLOAD

NOTE: File name "E-Business 2" has many topics that are not in syllabus. Please don't waste your time in reading that. I didn't have time so I submitted whatever I had. 

         Please remember that these are just points mentioned in the notes, with your writing skills, you will have to elaborate the answers as it's a theoretical subject.

BEST OF LUCK TO YOU!!!

 Thanks.

ABHILASH RUHELA!!!

Soft Skill Development All Important Topics Covered

SSD -->>

           I have tried to cover almost all the important and major topic of Soft Skills Development in this notes. If you find something missing, you can share your notes with us. We will upload it with your name.

             Notes comprises of two PDF files. Please download both of them. 

CLICK HERE TO DOWNLOAD

         Please remember that these are just points mentioned in the notes, with your writing skills, you will have to elaborate the answers as it's a theoretical subject.

BEST OF LUCK TO YOU!!!

 Thanks.

ABHILASH RUHELA!!!

Soft Skill Development's Question Papers!!!

SSD -->>

These are the questions compiled together from all the previous years' question papers of Soft-skill development. So first try to prepare these topics and then go for the whole book. :-)

NOTE: The number in bracket denotes the number of times the question has been asked in previous exams.

• 7 C’s of communication
• Assertiveness
• Grapevine communication
• Leadership
• Compare Oral and Written Communication
• Video conferencing
• Use of posters, signs and signals for Communication. (2)
• Email (2)
• Internet
• Tele conferencing (2)
• Voice system (2)
• Desk top publishing and Electronics Data Processing. (2)
• Testimonial and a Letter of Reference.
• Difference:-
• Verbal and Oral communication (2)
• Face to face and oral communication (2)
• Gestures and Facial expressions (2)
• Pause and Silence (2)
• Graph and Chart (2)
• How does context affect the meaning of the message? E.g.
• Any 3 psychological barriers to communication. How do they affect communication in a business context?
• Guidelines a candidate must keep in mind during a group discussion? (2)
• What kind of preparation will you need to do before appearing for an interview? (2)
• Time Management? Discuss its significance in a business set up? (2)
• What role does horizontal communication play in an organization? E.g.
• How can you make written communication effective? (2)
• Why it is important for a businessman to receive and give out information? (2) 
• Reprimand memo? How is it different from a proper memo?
• Report? Why is it essential to modern Business?
• Why is teamwork essential? Elements of it?
• Different styles of Resolving Conflicts?
• Emotional Intelligence? Importance of it in IT industry?
• Why is Leadership important in an Organization?
• Concept of vertically upward/downward communication with e.g.
• Importance of Listening? Guidelines to be a good listener?
• Email Etiquette 
• Importance of motivation in an organization.

NOTE: If anyone feels that the notes he/she has is in a very easy language on any topic, you can send it to LastMinuteStudyARN@gmail.com. It will be published on the site with your name.

 Thanks.

ABHILASH RUHELA

E-Business' Question Papers!!!

E-Business -->>

These are the questions compiled together from all the previous years' question papers of E-Business. So first try to prepare these topics and then go for the whole book. :-)

NOTE: The number in bracket denotes the number of times the question has been asked in previous exams.

• E-business? E.g. E-business models. (3)
• E-commerce?
• Viruses
• Insurance coverage options
• E-business Value chains (3)
• Payment Gateways
• The RSA algorithm
• ISP
• Log file analysis
• Electronic Industrial Espionage
• Secure Socket Layer (2)
• Copyright and Trade Marks
• Benchmarking the Web site
• Data mining
• Banner ads and Opt-in email advertising
• Intrusion Detection Systems
• Venture Capital Investors
• E-mail marketing
• Difference:
• Traditional and Electronic payment system
• E-business and E-commerce

• Importance of risk management and problems associated with it.
• E-advertising? Ways of E-business advertising? How to measure effectiveness of e-advertising?
• Contribution of search engine in E-business web-site designing.
• Elements of E-business plan? Various legal forms of the organization? (3)
• EDI? Need for EDI?
• Entrepreneurial process? Process diagram.
• Electronic Payment System? Various electronic payment methods? (2)
• Internet Security Holes? Security issues involved in E-business environment? How can cryptography and digital signature solve the issues? (2)
• Functionalities of Electronic checks?
• ERP and CRM systems?
• Computer ethics? Nature of Computer ethics? (2)
• Advantages and disadvantages associated with the log file analysis and page tagging.
• What is a Brand? How do you build a Brand?
• Cryptography? Symmetric and Asymmetric cryptosystems?
• Steps to create an E-business website?
• Testing? How do you test a Website? Load testing? Stress testing?

NOTE: If anyone feels that the notes he/she has is in a very easy language on any topic, you can send it to LastMinuteStudyARN@gmail.com. It will be published on the site with your name.

 Thanks.

ABHILASH RUHELA

Advanced Database Theory and Applications' Question Papers!!!

ADTA -->>

These are the questions compiled together from all the previous years' question papers of Advanced Database Theory and Applications. So first try to prepare these topics and then go for the whole book. :-)

NOTE: The number in bracket denotes the number of times the question has been asked in previous exams.

• Collaborating Servers
• Bayesian Networks
• Phantom Deadlock
• Temporal Databases
• OQL
• Roll up
• Drill down
• Slicing and Dicing (3)
• RSA algorithm (2)
• Star schema and Snowflake schema. (2)
• OODBMS
• Clustering (3)
• Data granularity in data warehouse.
• ORDBMS
• Fragmentation
• Replication
• Concurrency
• Pipelining
• Security
• Different types of transparencies in DDBMS.
• OLAP implementation techniques.
• 3-phase commit protocol? Give e.g. how it is different from 2PC protocol.
• ETL process in Datawarehousing.  (4)
• Describe association, classification and regression rules. What is difference between support and confidence of a rule?
• New kinds of data types supported in object database systems? Give e.g. of each.
• Deadlock detection in distributed database. Explain various deadlock detection approaches. (2)
• Explain centralized, hierarchical and time out approaches.
• ORDBMS database design issues? (2)
• Differentiate between pipelined parallelism and data partitioned parallelism.
• Authorization graph? Explain SQL’s Grant and Revoke commands in terms of their effect on this graph. Discuss what happens when users pass on privileges that they receive from someone else.  (2)
• Differentiate:

Distributed Databases and Centralized Databases (2)

Semi Joins and Bloom Joins (5)

OLTP and OLAP (2)

Log based and Procedural based implementation of Capture. (2)

Atomic data types, structured data types and referenced data types. 

URLs and OIDs

2-Phase and 3-Phase commit

Synchronous and asynchronous replication (3)

RDBMS and ORDBMS

OLTP vs OLAD

Supervised and Unsupervised learning

OODBMS and ORDBMS

MOLAP vs ROLAP

Data Warehouse vs Operational database

• Describe an algorithm for finding frequent itemsets
• Metadata? E.g. (3)
• Collection hierarchies? How do they differ from Inheritance?  Do they simplify querying procedures? E.g.
• Parallel databases? (2)  Various architectures for parallel databases? Which is preferred and why? (3)
• Characteristics and architecture of search engines? (2)
• Concept of pointer sizzling? How does it optimize dereferencing? 
• Explain how security mechanisms like discretionary access control and mandatory access control provides security?
• Functional components of data warehouse project development.
• Major steps of algorithm to construct decision tree? Components of decision tree? (3)
• K-means clustering algorithm? (2)
• “OLAP is FASMI” comment.
• Success factors for data warehouse project.
• Multidimensional cubes? (2) 
• Query optimization in parallel database system.
• Explain any option available for the intergration of KM with data warehousing. (1)
• Bell-Lapedula model. (3)
• Data storing techniques in DDBMS.
• Recovery process in DDBMS? How different from recovery in centralized system? (2)
• Top down and bottom up approach in Data warehouse? Which is better?
• Explain why shared memory and shared disk approaches suffer from interference? Discuss speed up and scale up of shared nothing architecture.
• Use of sorting vs hashing for data partitioning? 
• Snowflake schema? (2) Is it better than Fact constellation schema? 
• 2-phase commit? (2) Diagram?  Drawbacks? How can they be removed?
• Association Rule mining? Application? E.g.
• Pros and cons of various techniques for implementing asynchronous replication.
• Distributed catalog management. (2)
• How do warehousing, OLAP and Mining complement each other?
• Polyinstantiation ? Multilevel table? Their relationship?
• Discuss how scanning, sorting and join operations can be parallelized using data partitioned technique?
• Explain relationship of data warehouse with ERP and CRM.
• Neural Networks
• Pointer Swizzling
• Method Caching

NOTE: If anyone feels that the notes he/she has is in a very easy language on any topic, you can send it to LastMinuteStudyARN@gmail.com. It will be published on the site with your name.

 Thanks.

ABHILASH RUHELA