Scribd Logo
Upload

Welcome to Scribd!

  • 49 views

    O 8 Oppop

    Uploaded by

    Asheesh Kumar
    The document contains 4 sets of questions for an examination on C and data structures. Each set contains 8 questions covering topics such as expressions, operators, functions, pointers, queues, lists, binary trees, and sorting algorithms. Students must answer any 5 questions out of the 8 in each set, with each question carrying equal marks.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    O 8 Oppop

    Uploaded by

    Asheesh Kumar
    49 views4 pages
    The document contains 4 sets of questions for an examination on C and data structures. Each set contains 8 questions covering topics such as expressions, operators, functions, pointers, queues, lists, binary trees, and sorting algorithms. Students must answer any 5 questions out of the 8 in each set, with each question carrying equal marks.

    Original Description:

    ;oi;ip;'i

    Original Title

    o8oppop

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains 4 sets of questions for an examination on C and data structures. Each set contains 8 questions covering topics such as expressions, operators, functions, pointers, queues, lists, binary trees, and sorting algorithms. Students must answer any 5 questions out of the 8 in each set, with each question carrying equal marks.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    49 views4 pages

    O 8 Oppop

    Uploaded by

    Asheesh Kumar
    The document contains 4 sets of questions for an examination on C and data structures. Each set contains 8 questions covering topics such as expressions, operators, functions, pointers, queues, lists, binary trees, and sorting algorithms. Students must answer any 5 questions out of the 8 in each set, with each question carrying equal marks.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 4

    Code.

    No: 11123
    NR SET-1
    JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
    I .B.TECH SUPPLEMENTARY EXAMINATIONS FEBRUARY - 2010
    C & DATA STRUCTURES
    (Common to EEE, ECE, CSE, CSIT, EIE, BME, E.CON.E, ETM, ECC, CSS)
    Time: 3hours Max.Marks:80
    Answer any FIVE questions
    All questions carry equal marks
    ---

    1.a) What is an expression? What kind of information is represented by an expression?


    b) What is an operator? Describe several different types of operators that are included
    with in the C language with an example each. [8+8]

    2.a) What do you mean by functions? Give the structure of the functions and explain
    about the arguments and their return values.
    b) Write a C program that uses a function to sort an array of integers. [8+8]

    3. Consider a structure master includes the information like name, code, pay, experience.
    Write a program to delete and display the information contained in master variables
    for a given code. [16]

    4.a) Explain the process of declaring and initializing pointers. Give an example.
    b) Write a C program that uses a pointer as a function argument. [8+8]

    5. Declare two queues of varying length in a single array. Write functions to insert and
    delete elements from these queues. [16]

    6. Write a function in ‘C’ to form a list containing the intersection of the elements of two
    lists. [16]

    7.a) What is a binary tree? Explain the properties of binary tree.


    b) Differentiate between terminal nodes and non-terminal nodes in a tree. [8+8]

    8. Explain the algorithm for selection sort and give a suitable example. [16]

    *****
    Code.No: 11123
    NR SET-2
    JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
    I .B.TECH SUPPLEMENTARY EXAMINATIONS FEBRUARY - 2010
    C & DATA STRUCTURES
    (Common to EEE, ECE, CSE, CSIT, EIE, BME, E.CON.E, ETM, ECC, CSS)
    Time: 3hours Max.Marks:80
    Answer any FIVE questions
    All questions carry equal marks
    ---

    1. Consider a structure master includes the information like name, code, pay, experience.
    Write a program to delete and display the information contained in master variables
    for a given code. [16]

    2.a) Explain the process of declaring and initializing pointers. Give an example.
    b) Write a C program that uses a pointer as a function argument. [8+8]

    3. Declare two queues of varying length in a single array. Write functions to insert and
    delete elements from these queues. [16]

    4. Write a function in ‘C’ to form a list containing the intersection of the elements of two
    lists. [16]

    5.a) What is a binary tree? Explain the properties of binary tree.


    b) Differentiate between terminal nodes and non-terminal nodes in a tree. [8+8]

    6. Explain the algorithm for selection sort and give a suitable example. [16]

    7.a) What is an expression? What kind of information is represented by an expression?


    b) What is an operator? Describe several different types of operators that are included
    with in the C language with an example each. [8+8]

    8.a) What do you mean by functions? Give the structure of the functions and explain
    about the arguments and their return values.
    b) Write a C program that uses a function to sort an array of integers. [8+8]

    *****
    Code.No: 11123
    NR SET-3
    JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
    I .B.TECH SUPPLEMENTARY EXAMINATIONS FEBRUARY - 2010
    C & DATA STRUCTURES
    (Common to EEE, ECE, CSE, CSIT, EIE, BME, E.CON.E, ETM, ECC, CSS)
    Time: 3hours Max.Marks:80
    Answer any FIVE questions
    All questions carry equal marks
    ---

    1. Declare two queues of varying length in a single array. Write functions to insert and
    delete elements from these queues. [16]

    2. Write a function in ‘C’ to form a list containing the intersection of the elements of two
    lists. [16]

    3.a) What is a binary tree? Explain the properties of binary tree.


    b) Differentiate between terminal nodes and non-terminal nodes in a tree. [8+8]

    4. Explain the algorithm for selection sort and give a suitable example. [16]

    5.a) What is an expression? What kind of information is represented by an expression?


    b) What is an operator? Describe several different types of operators that are included
    with in the C language with an example each. [8+8]

    6.a) What do you mean by functions? Give the structure of the functions and explain
    about the arguments and their return values.
    b) Write a C program that uses a function to sort an array of integers. [8+8]

    7. Consider a structure master includes the information like name, code, pay, experience.
    Write a program to delete and display the information contained in master variables
    for a given code. [16]

    8.a) Explain the process of declaring and initializing pointers. Give an example.
    b) Write a C program that uses a pointer as a function argument. [8+8]

    *****
    Code.No: 11123
    NR SET-4
    JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
    I .B.TECH SUPPLEMENTARY EXAMINATIONS FEBRUARY - 2010
    C & DATA STRUCTURES
    (Common to EEE, ECE, CSE, CSIT, EIE, BME, E.CON.E, ETM, ECC, CSS)
    Time: 3hours Max.Marks:80
    Answer any FIVE questions
    All questions carry equal marks
    ---

    1.a) What is a binary tree? Explain the properties of binary tree.


    b) Differentiate between terminal nodes and non-terminal nodes in a tree. [8+8]

    2. Explain the algorithm for selection sort and give a suitable example. [16]

    3.a) What is an expression? What kind of information is represented by an expression?


    b) What is an operator? Describe several different types of operators that are included
    with in the C language with an example each. [8+8]

    4.a) What do you mean by functions? Give the structure of the functions and explain
    about the arguments and their return values.
    b) Write a C program that uses a function to sort an array of integers. [8+8]

    5. Consider a structure master includes the information like name, code, pay, experience.
    Write a program to delete and display the information contained in master variables
    for a given code. [16]

    6.a) Explain the process of declaring and initializing pointers. Give an example.
    b) Write a C program that uses a pointer as a function argument. [8+8]

    7. Declare two queues of varying length in a single array. Write functions to insert and
    delete elements from these queues. [16]

    8. Write a function in ‘C’ to form a list containing the intersection of the elements of two
    lists. [16]

    *****

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy