Department of Basic Engineering Sciences-1 Programs List for I st Year B.Tech PROGRAM

A.Y.2019-20, Odd Semester

Course Name : Technical Skills-1(Coding) Course Code : 19SCXXXX L-T-P-S Structure : 0-0-0-6 Course Credits : 1.5 Course Coordinator : Dr. P. Siva Kumar

Team of Instructors

1. Dr. L. Sridhara Rao 2 .Dr. P. Siva Kumar

3. N. Sree Ram 4. Dr. S. Siva Kumar

5. Dr. Sk. Razia 6. E. Sridevi

7. T. Vamsidhar 8. N. V. S Pavan Kumar

9. Y. Ayyappa 10. C.M.A.K Zeelan Basha

11. A. Srinivasa Rao 12. V. Uday Kumar

13. D. Anand 14. S. Siva Kumar

15. T. Rajesh Kumar 16. G. Sai Sudha

17. V. Prema Latha 18. A. Krishna

: 19. S. Pradeep Raj 20. A S A L G Gopal Gupta

21. E. Rajesh Kumar 22. G. Rama Krishna Srinivas

23. Sd. Karimunnisa 24. V. L. Sarvani

25. K. Suma Anusha 26. T. Ganesan

27. D.R. Lavanya 28. U Haritha

29. B. Ashok 30. B. Sindhu

31. Naveen Kumar 32. Dorti Kumar

33. P. Gayatri 34. K. Chiranjeevi

35. M. Ram Kumar 36. S.Harika

37. Arshiya Julma

Teaching Associates : Sowmya Ranjan Nayak, Muthu Kumar

Course Objective: The objective of the course is to equip the student with problem solving skills using

C Language and associated Data Structures to provide the student details about algorithms used in

typically familiar problems, and a few details about the essential ingredients of the programming

language C and fundamental Data Structures.

Course Rationale: The course takes an imperative view of problem solving through programming using

C programming language. This necessitates data abstraction, basics of data structures, and an

introduction to the GNU/Linux operating system and programming the Medium (BTL-2) level language

C. Student is professionally trained in algorithms, flowcharts, analysis of a problem and translating the

same into a C program. The students are made to write C programs on their own for sets of both

mathematical and other engineering problems after exposing them to the different constructs of C

language namely Input/output, assignments, iteration and control structures. Finally the student is

acquainted with basic data structures like stacks, queues, lists etc.

COURSE OUTCOMES (COs):

CO# Course Outcome Description PO/PSO BTL

CO1 Develop Solutions to solve real world

Problems using Algorithms and flowcharts.

P01, PO2 4

CO2 Develop Solutions to solve real world

problems using Control Flow Statements by

Sorting algorithms.

P01, PO2 4

CO3 Develop Solutions and debug to solve real

world problems using user defined functions

by Searching Algorithms.

P01, PO2 4

CO4 Develop Solutions for real world problems

by using stacks, queues and linked Lists and

debug.

PO4 4

COURSE OUTCOME INDICATORS (COIs):

CO No. COI-1

(BTL-4) COI-2

(BTL-4) COI-3

(BTL-4) COI-4

(BTL-4)

1 Design and implement Algorithms for solving real world problems

using flowchart

Design and implement Algorithms for solving real world problems

using Pointers.

Design and implement Algorithms for solving real world problems

Operators in C.

Design and implement

Algorithms for solving real world problems

by following operator precedence rules

2 Design and implement Algorithms for solving real world problems

using Decision making concepts.

Design and implement Algorithms for solving

real world problems by Loops.

Design and Debug real world problems using Nested Loops.

Design a project for solving real world

problems by looping concept

3 Design and implement Algorithms for solving real world problems using user defined C

functions, and storage classes and scope of

variables

Design and implement Algorithms for solving real world problems

using different operations on list of data using Searching

techniques.

Design and Debug real world problems

using Sorting techniques

Design a project for solving real world

problems by modular programming.

4 Design and implement Algorithms for solving real world problems

using Stack Data Structure

Design and implement Algorithms for solving real world problems

using Queue Data Structure

Design and Debug real world problems

using Linked List Data structure

Design and implement

Algorithms for solving real world problems

using Tree Data Structure

TEXT BOOKS:-

1. Brian W. Kernighan, Dennis M. Ritchie, “The C Programming Language: ANSI C Version”, 2/e,

Prentice-Hall/Pearson Education-2005.

2. E. Balagurusamy, “Programming in ANSI C” 4th ed., Tata McGraw-Hill Education, 2008.

3. R. F. Gilberg, B. A. Forouzan, “Data Structures”, 2nd Edition, Thomson India Edition-2005.

REFERENCE BOOKS:-

1. Mark Allen weiss, Data Structures and Algorithm Analysis in C, 2008, Third Edition, Pearson Education.

2. Horowitz, Sahni, Anderson Freed, “Fundamentals of Data structures in C”, 2nd Edition-2007.

3. Robert Kruse, C. L. Tondo, Bruce Leung, Shashi Mogalla, “Data structures and Program Design in C”,

4th Edition-2007.

4. C for Engineers and Scientists – An Interpretive Approach by Harry H. Cheng, Mc Graw Hill

International Edition-2010.

5. Jeri R. Hanly, Elliot B. Koffman, “Problem Solving and Program Design in C”, 7/e, Pearson Education-

2004.

6. Jean Paul Trembly Paul G.Sorenson, “An Introduction to Data Structures with applications”, 2nd

Edition.

OTHER BOOKS, REFERENCES: (As recommended for reference by the course team, if any): Nill

WEB REFERNCES/MOOCs:

1) www.hackerrank.com

2) www.spoj.com

3) www.geeksforgeeks.com

4) www.hackerearth.com

5) www.cprogramiz.com

6) www.codechef.com

Session

No. Topic

Design an algorithm and draw flowchart to print

Student ID and Name

Design an algorithm and draw flowchart to

compute area of circle considering radius as

input.

Design an algorithm and draw flowchart to

convert given Celsius temperature to

Fahrenheit.

Design an algorithm and draw flowchart to check

if a given number is even or odd.

Design an algorithm and draw flowchart to find

the smallest among 3 given numbers.

Given the marks obtained by the students,

maximum marks and pass marks in three

subject’s, design an algorithm and draw

flowchart to find whether the student passed or

not, if the student passes determine the

percentage marks and grade. The grade is

determined as follows:

a) percentage marks >=80 grade is A

b) percentage marks >=70 and <80 grade is

B

c) percentage marks >=60 and <70 grade is

C

d) percentage marks >=50 and <60 grade is

D

e) percentage marks <50 grade is F

Design and algorithm to calculate grade of the

student by reading three subject marks.

BTL

Level Reference

Teaching-

Learning

Methods

1

1

1

1

W REF[5]

W REF[5]

W REF[5]

Discussion/

Practice

2

1

1

1

W REF[5]

W REF[5]

W REF[5]

Discussion/

Practice

3

Design algorithm and flowchart to pint first n

natural numbers.

Design algorithm and flowchart to print

multiplication table for a given number.

Design algorithm and draw flowchart to check

whether a given number is a Perfect Number or

not.

Hello World

"Hello World!" in C

Day 1: Data Types

Playing with Characters

Operators

Sum and Difference of 2 numbers

Operators

Find Product

Let Us Understand Computer

1

1

1

W REF[5]

W REF[5]

W REF[5]

Discussion/

Practice

4

1

1

2

W REF[1]- Hello World

W REF[1]- "Hello World!" in C

W REF[1]-Data Types

Discussion/

Practice

5

1

1

2

2

2

2

W REF[1]- Playing with

Characters

W REF[1]- Operators

W REF[1]- Sum and Difference

of 2 numbers

W REF[4]-Operators

W REF[4]- Find Product

W REF[4]- Fin Let Us

Understand Computer

Discussion/

practice

6

Cutting paper squares

Maximum height Triangle

Birthday Party

Count Numbers

Count Divisors

Boxes through a Tunnel

Introduction to Conditional Statements

Conditional Statements in C

Library Fine

Nested Logic Conditional Statements

Conditional Statements-1

Conditional Statements-2

Loops

Binary Numbers

Maximum Draws

For loop in C

Handshake

Utopian Tree

1

2

1

1

1

2

W REF[1]- Cutting paper squares

W REF[1]- Maximum height

Triangle

W REF[4]- Birthday Party

W REF[4]- Count Numbers

W REF[4]- Count Divisors

W REF[1]- Boxes through a

Tunnel

Discussion/

Practice

7

1

1

2

2

1

2

W REF[1]- Introduction to

Conditional Statements

W REF[1]-

Conditional Statements in C

W REF[1]- Library Fine

W REF[1]- Nested Logic

Conditional Statements

W REF[1]- Conditional

Statements-1

W REF[1]- Conditional

Statements-2

Discussion/

Practice

8

2

1

1

1

1

2

W REF[1]- Loops

W REF[1]- Binary Numbers

W REF[1]- Maximum Draws

W REF[1]- For loop in C

W REF[1]- Handshake

W REF[1]- Utopian Tree

Discussion/

Practice

9

Sum of Digits of a Five Digit Number

Angry Professor

Bitwise AND

Bitwise Operators

Flipping Bits

Pikachu vs Team Meowstic and Helping Hand

Find Digits

Running time & Complexity

Staircase

Printing Pattern using Loops

Digital Sequence

Fascinating Number

Day 7: Arrays

Simple Array Sum

Very Big Sum Arrays

Professor and his operations

Chef and Glove

1

1

2

2

3

1

W REF[1]- Sum of Digits of a

Five Digit Number

W REF[1]- Angry Professor

W REF[1]- Bitwise AND

W REF[1]- Bitwise Operators

W REF[1]- Flipping Bits

W REF[4]- Pikachu vs Team

Meowstic and Helping Hand

Discussion/

Practice

10

2

2

2

3

2

2

W REF[1]- Find Digits

W REF[1]- Running time &

Complexity

W REF[1]- Staircase

W REF[1]- Printing Pattern using

Loops

W REF[4]- Digital Sequence

W REF[3]- Fascinating Number

Discussion/

Practice

11

1

1

1

2

2

2

W REF[1]- Arrays

W REF[1]- Simple Array Sum

W REF[1]- Very Big Sum

W REF[3]- Very Big Sum

W REF[4]- Professor and his

operations

W REF[6]- Chef and Glove

Discussion/

Practice

12

Grading Students

Birthday Cake Candles

Plus Minus

Missing Numbers

C Program to Generate Multiplication Table

Minimum Loss

1D Arrays in C

Mini-Max Sum

Day 20: Sorting

Student Arrangement

Find an element in hidden array

Between Two Sets

Day 6: Let’s Review

Time Conversion

Strong Password

Caesar Cipher

1

1

1

1

2

2

W REF[1]- Grading Students

W REF[1]- Birthday Cake

Candles

W REF[1]- Plus Minus

W REF[3]- Missing Numbers

W REF[5]- C Program to

Generate Multiplication Table

W REF[1]- Minimum Loss

Discussion/

Practice

13

1

1

2

2

1

2

W REF[1]- 1D Arrays in C

W REF[1]- Mini-Max Sum

W REF[1]- Day 20: Sorting

W REF[4]- Student Arrangement

W REF[3]- Find an element in

hidden array

W REF[1]-Between Two Sets

Discussion/

Practice

14

1

2

1

2

W REF[1] – Let’s Review

W REF[1] – Time Conversion

W REF[1] – Strong Password

W REF[1] – Caesar Cipher

Discussion/

Practice

VowelPhobia

Printalternate elements of an array

Printing Tokens

Digit Frequency

Diagonal Difference

Day 11: 2D Arrays

Batman and Tick-tack-toe

Counting Valleys

Lonely Integer

Maximizing XOR

Array Reversal

Year 3017

Hackers with Bits

Short Name

3

1

W REF[4] – VowelPhobia

W REF[3] - Print alternate

elements of an array

15

1

2

1

2

3

2

W REF[1] – Printing Tokens

W REF[1] – Digit Frequency

W REF[1] – Diagonal Difference

W REF[1] – Day 11: 2D Arrays

W REF[1] – Batman and Tick-

tack-toe

W REF[1] – Counting Valleys

Discussion/

Practice

16

1

2

1

3

2

2

W REF[1] – Lonely Integer

W REF[1] – Maximizing XOR

W REF[1] – Array Reversal

W REF[6] – Year 3017

W REF[4] – Hackers with Bits

W REF[4] – Short Name

Discussion/

Practice

17

Arrays-2

Arrays-3

Array-4

Array-5(Manchurian And Trivisible Arrays) Xsquare And Two Strings ARRAYSUB - subarrays

Compare the Triplets

Constructing a number

Palindrome

Toggle String

Recursive Function

Binary vs Linear Search

Find the point

Calculate the Nth Term

Strike or Spare

1

2

2

1

3

2

W REF[1] – Arrays - 2

W REF[1] – Arrays - 3

W REF[6] – Array - 4

W REF[4] – Array - 5

W REF[4] - Xsquare And Two Strings

W REF[2] - ARRAYSUB -

subarrays

18

1

2

2

1

3

1

W REF[1] - Compare the Triplets

W REF[2] - Constructing a

number

W REF[4] - Palindrome

W REF[4]- Toggle String

W REF[4] - Recursive Function

W REF[4] - Binary vs Linear

Search

Discussion/

Practice

19

1

2

2

W REF[1] - Find the point

W REF[1] - Calculate the Nth

Term

W REF[6] – Strike or Spare

Signal Range

MUL-Fast Multiplication

Monk and Order of Phoenix

Recursion

Simran and stairs

Policemen and thieves

Speed

Mark The Answer

Weighing the Stones

Small Triangles, Large Triangles

GCD Strings

2

3

3

W REF [4] – Signal Range

W REF[2] - MUL-Fast

Multiplication

W REF[4] - Monk and Order of

Phoenix

Discussion/

Practice

20

3

2

2

2

3

1

W Ref[1] - Recursion

W Ref[4] - Simran and stairs

W Ref [4] - Policemen and

thieves

W Ref [4] - Speed

W Ref [4] - Mark The Answer

W Ref[4] - Weighing the Stones

Discussion/

Practice

21

2

3

W Ref[1] - Small Triangles, Large

Triangles

W Ref[4] - GCD Strings

Roy and Profile Picture

Two Strings

ArrayGame

Post Transition

Roy and Profile Picture

Minimize Cost

Round Table Killers

City group

Easy Multiple

Structuring the document

Recursive Sums

Counting Strings

1

2

3

W Ref[4] - Roy and Profile

Picture

W Ref[4] - Two Strings

W Ref[4] - ArrayGame

Discussion/

Practice

22

3

1

1

1

2

1

W Ref [1] - Post Transition

W Ref [4] - Roy and Profile Picture

W Ref [4] - Minimize Cost

W Ref [4] - Round Table Killers

W Ref [4] - City group

W Ref [4] - Easy Multiple

Discussion/

Practice

23

3

1

3

W Ref [1] - Structuring the

document

W Ref [4] - Recursive Sums

W Ref [4] - Counting Strings

Discussion/

Practice

Play with numbers

Life, the Universe, and Everything

Seating Arrangement

Maximum Element

Help your roommate

Subset AND

Lucky Numbers

Poisonous gas

Game of Deletion

Queue using two stacks

Download file

Small Factorials

Coins

Discover the Monk

Maximum Sum

1

2

3

W Ref [4] - Play with numbers

W Ref [4] - Life, the Universe,

and Everything

W Ref [4] - Seating Arrangement

Discussion/

Practice

24

3

2

2

2

2

2

W Ref [1] - Maximum Element

W Ref [4] - Help your roommate

W Ref [4] – Subset AND

W Ref [4] – Lucky Numbers

W Ref [4] – Poisonous gas

W Ref [4] – Game of Deletion

Discussion/

Practice

25

3

2

2

2

2

2

W Ref [1] - Queue using two

stacks

W Ref [4] - Download file

W Ref [4] – Small Factorials

W Ref [4] – Coins

W Ref [4] – Discover the Monk

W Ref [4] – Maximum Sum

Discussion/

Practice

26

Insert a node at a specific position in linked

list

Print in reverse

Get node value

Compare two linked lists

Merging Two Linked Lists

Queue using two stacks

Chocolate Distribution

Monk and Chamber of Secrets

Hacker and traffic lights

Frustrated coders

Stack operations

A Game of Numbers

Monk and Prisoner of Azkaban

Insert a node at a specific position in linked

list

Print in reverse

Delete a Node

3

W Ref [1] - Insert a node at a

specific position in linked list

Discussion/

Practice

27

28

29

30

31

32

33

3

3

3

3

3

3

3

3

2 2 2 2

W Ref [1] - Print in reverse

W Ref [1] - Get node value

W Ref [1] - Compare two

linked lists

W Ref [3] - Merging Two

Linked Lists

W Ref [1] - Queue using two

stacks

W Ref [4] - Chocolate

Distribution

W Ref [4] - Monk and

Chamber of Secrets

W Ref [4] - Hacker and traffic

lights

W Ref [4] - Frustrated coders

W Ref [4] - Stack operations

W Ref [4] – Game of Numbers

W Ref [4] – Monk and Prisoner

Discussion/

Practice

Discussion/

Practice

Discussion/

Practice

Discussion/

Practice

Discussion/

Practice

Discussion/

Practice

Discussion/

Practice

34

3

3

1

W Ref [1] – Insert a node

W Ref [1] – Print in reverse

W Ref [1] – Delete a Node

Discussion/

Practice

35

Get node value

Merge two sorted linked lists

Delete duplicate-value nodes from a sorted

linked list

Compare two linked lists

Rotate a Linked List

Delete N nodes after M nodes of a LL

3

2

1

W Ref [1] – Get node value

W Ref [1] – Merge two sorted

lists

W Ref [1] – Delete Duplicate

Discussion/

Practice

36

3

3

3

W Ref [1] – Compare two linked

lists

W Ref [3] – Rotate a Linked List

W Ref[3] – Delete N nodes of a

Linked List

Discussion/

Practice

GENERAL INSTRUCTIONS Students should come prepared for classes and carry the text book(s) or material(s) as prescribed by the Course

Faculty to the class.

NOTICES Most of the notices are available on the LMS platform.

All notices will be communicated through the institution email.

All notices concerning the course will be displayed on the respective Notice Boards.

Signature of COURSE COORDINATOR:

Signature of Department Prof. Incharge Academics & Vetting Team Member:

HEAD OF DEPARTMENT:

Approval from: DEAN-ACADEMICS

(Sign with Office Seal)