HNBGU BCA Fourth Semester Previous Year 2018-19 Question Papers

HNBGU BCA Fourth Semester Previous Year 2018-19 Question Papers

Multimedia system and application

NOTE: Attempt any five question. Each question carries 5 marks
  1. Explain various types of multimedia system.

  2. Discuss various components of the multimedia system.

  3. Explain briefly the concept of Cut-detection.

  4. Explain briefly about H.261 and H.263.

  5. Describe the architecture of a multimedia system briefly

  6. Discuss the JPEG and MPEG file format standards

  7. Explain zig-zag coding in brief.
NOTE: Attempt any three question. Each question carries 15 marks

  1. (a)What is compression? Differentiate between lossy and lossless compression

    (b)Discuss all the modes of JPEG.

  2. (a) What is video compression? Why is it useful?

    (b) Explain various multimedia software tools.

  3. (a) List and explain the image data types.

    (b) Describe MPEG standard briefly.

  4. (a) Explain different stages of building a multimedia project.

    (b) What is animation? List and explain various types of animation.

  5. (a) Define multimedia authoring tools.

    (b) Discuss presentation and object generation tools in detail.

  6. Write short notes on any three of the following:
    • Multimedia over ATM networks
    • Media on Demand (MOD)
    • MIDI interface cards
    • Making instant multimedia
    • Scanners and scanning techniques
    • MHEG standards


Operating system Organization and unix


NOTE: Attempt any five question. Each question carries 5 marks
  1. What is an operating system? What is the main purpose of an operating system>?

  2. Differentiate between pre-emptive and non-preemptive scheduling

  3. What are the different data structures users for the allocation of memory in Operating System?

  4. Explain the use of semaphore in concurrent systems.

  5. What do you mean by process? Explain

  6. What is critical section?

  7. Explain the necessary conditions for deadlock avoidance.
NOTE: Attempt any three question. Each question carries 15 marks
  1. What is banker algorithm? How is it used to avoid deadlock? Explain

  2. Explain the structure of UNIX file system.

  3. What is IPC? Explain the requirements and implementation of IPC

  4. What is round robin scheduling?

  5. Explain the steps in FIFO page replacement algorithm.

  6. Write short notes on the following.
    • Real time system
    • Linked and index allocation
    • System calls

Software Engineering


NOTE: Attempt any five question. Each question carries 5 marks

  1. What do you understand by software engineering? Discuss the characteristics of software

  2. Discuss the top down and bottom up design in detail.

  3. Explain the design steps in transaction mapping

  4. List out software quality assurance activities.

  5. Discuss waterfall model with suitable diagram. Give its merits and demerits.

  6. Distinguish between verification and validation.

  7. What do you understand by information hiding? Explain why a design approach based on the information hiding principle is likely to lead to a reusable and maintainable design
NOTE: Attempt any three question. Each question carries 15 marks
  1. Explain in detail about software development life cycle.

  2. Discuss the components of a software requirement specification document.

  3. What is meant by software maintenance? What are the various types of maintenance? Explain with a suitable example.

  4. What do you understand by the term testing? Differentiate between black box testing and white box testing. Explain in detail about any one testing tool.

  5. Explain in detail about SEI capability maturity model.

  6. Explain the following in short:
    • SCM
    • CASE Tools
    • ISO 9000 certification

Graph Theory


NOTE: Attempt any five question. Each question carries 5 marks
  1. Define bi-partite graphs with example.

  2. What are isomorphic graphs? Give examples

  3. Define graphs with example

  4. Discuss pseudo graph with example.

  5. What are the complete graph? Give example.

  6. Explain path with example.

  7. Discuss Hamiltonian cycles with example.
NOTE: Attempt any three question. Each question carries 15 marks
  1. Explain Dijkstra’s algorithm with suitable example.

  2. What do you mean by adjacency matrix of a graph?

  3. Discuss Travelling salesmen’s problem with suitable example.

  4. Define circuit. What are the different types of circuits? What do you mean by Eulerian circuit? Explain with example.

  5. Example Floyd – Warshall algorithm with suitable example.

  6. Discuss the different types of graphs with example. Discuss the basis properties of a graph.

Post a Comment

0 Comments